Recognizing Well-Parenthesized Expressions in the Streaming Model
From MaRDI portal
Publication:5112586
DOI10.1137/130926122zbMath1437.68067OpenAlexW2025665242MaRDI QIDQ5112586
Claire Mathieu, Frédéric Magniez, Ashwin Nayak
Publication date: 31 May 2020
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.192.5237
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items
Unnamed Item ⋮ Unnamed Item ⋮ Quantum Chebyshev's Inequality and Applications ⋮ Dynamic data structures for timed automata acceptance