Skip to main content

archive

Advanced search

Computer Science > Data Structures and Algorithms

v1

Title:Semi-Streaming Matching in a Single Pass II: Greedy is Optimal

Sepehr Assadi

Max Jiang

Mars Xiang

View PDF

HTML (experimental)

arXiv:2607.14656

arXiv:2607.14656v2

https://doi.org/10.48550/arXiv.2607.14656

Submission history

view email

[[v1]](/abs/2607.14656v1)

Access Paper:

View PDF

View PDF

HTML (experimental)

HTML (experimental)

TeX Source

TeX Source

view license

Current browse context:

< prev

next >

new

recent

2026-07

cs

cs.CC

References & Citations

NASA ADS

NASA ADS

Google Scholar

Google Scholar

Semantic Scholar

Semantic Scholar

BibTeX formatted citation

Bookmark

BibSonomy

Reddit

Bibliographic and Citation Tools

What is the Explorer?

What is Connected Papers?

What is Litmaps?

What are Smart Citations?

Code, Data and Media Associated with this Article

What is alphaXiv?

What is CatalyzeX?

What is DagsHub?

What is GotitPub?

What is Huggingface?

What is ScienceCast?

Demos

What is Replicate?

What is Spaces?

What is TXYZ.AI?

Recommenders and Search Tools

What are Influence Flowers?

What is CORE?

Author

[Author]()

Venue

[Venue]()

Institution

[Institution]()

Topic

[Topic]()

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Learn more about arXivLabs

Which authors of this paper are endorsers?

Disable MathJax)

What is MathJax?