Recognizing Well-Parenthesized Expressions in the Streaming Model
From MaRDI portal
Publication:5112586
DOI10.1137/130926122zbMath1437.68067MaRDI QIDQ5112586
Frédéric Magniez, Ashwin Nayak, Claire Mathieu
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
68Q25: Analysis of algorithms and problem complexity
68Q45: Formal languages and automata
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
68W20: Randomized algorithms
68W27: Online algorithms; streaming algorithms