Streaming Matching
Streaming Matching is a computational framework within streaming algorithms that maintains a matching in a dynamically evolving graph under the constraint of limited memory and single-pass access to edges, distinguishing itself by addressing the challenge of maximizing matching size while processing edge insertions and deletions in real-time.
34
Publications
999
Citations
74
Authors
42
Institutions
Publications per year
2017–2026
14
Parents
34
Coresets in dynamic geometric data streams
Gereon Frahling, Christian Sohler · 2005 · 131 citations
Exact and Approximate Pattern Matching in the Streaming Model
Benny Porat, Ely Porat · 2009 · 83 citations
Approximating matching size from random streams
Michael Kapralov, Sanjeev Khanna, Madhu Sudan · 2014 · 83 citations
1–5 of 34
74
5
h-index
4
h-index
3
h-index
3
h-index
University of Maryland, College Park, United States
2 publications · 122 citations
2
h-index
1–5 of 74
42

Bar-Ilan University
Ramat Gan, Israel
5 h-index
7 publications
239 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
4 h-index
6 publications
102 citations

University of Bristol
Bristol, United Kingdom
4 h-index
7 publications
137 citations
Amazon (United States)
Seattle, United States
3 h-index
3 publications
50 citations
University of Maryland, College Park
College Park, United States
2 h-index
4 publications
328 citations

University of Warwick
Coventry, United Kingdom
2 h-index
3 publications
52 citations
Goethe University Frankfurt
Frankfurt am Main, Germany
2 h-index
2 publications
70 citations

Kangwon National University
Chuncheon, South Korea
2 h-index
2 publications
43 citations
1–8 of 42
Repository · 7 publications · 110 citations
7
h-index
2 publications · 43 citations
2
h-index
2 publications · 62 citations
2
h-index
TALG · 2 publications · 41 citations
2
h-index
Repository · 2 publications · 37 citations
2
h-index
1–5