Maximum Matching in Turnstile Streams
- Submitting institution
-
University of Bristol
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 159611242
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-662-48350-3_70
- Title of conference / published proceedings
- Algorithms - ESA 2015 : 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings
- First page
- 840
- Volume
- 9294
- Issue
- -
- ISSN
- 0302-9743
- Open access status
- Out of scope for open access requirements
- Month of publication
- November
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
0
- Research group(s)
-
D - Fundamentals of Computing
- Citation count
- 15
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper demonstrates for the first time that there is a graph problem (i.e., Maximum Matching) which is much harder to solve in the turnstile streaming model than in the traditional insertion-only streaming model. The result was concurrently and independently established by world-leading group at UPenn [Assadi et al. SODA 2016]. Enabled follow-up works by Konrad’s group, in particular, [Dark, Konrad CCC 2020] where the lower bound is now provably optimal. Foundational in securing Konrad’s employment at the University of Bristol.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -