Recognizing well-parenthesized expressions in the streaming model

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 261-270

  Magniez, Frédéric ^a   Mathieu, Claire ^b   Nayak, Ashwin ^c  

^a Laboratoire Interdisciplinaire des Sciences du Numérique   (France)

^b Brown University   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

communication complexity; information cost; linear hashing; parenthesis expression; streaming algorithm

Indexed keywords

COMMUNICATION COMPLEXITY; COMMUNICATION PROBLEMS; DIRECT SUM; HARD INSTANCES; INFORMATION COSTS; INPUT STREAMS; LOWER BOUNDS; ONE-PASS; RESOURCE REQUIREMENTS; SPACE REQUIREMENTS; STREAMING ALGORITHM; STREAMING MODEL;

COMMUNICATION; COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; LANDFORMS;

ALGORITHMS;

EID: 77954753210     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806727     Document Type: Conference Paper

References (21)

1. N. Alon, M. Krivelich, I. Newman, and M. Szegedy. Regular languages are testable with a constant number of queries. SIAM J. Comput., 30(6), 2000.
2. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci, 58(1):137-147, 1999.
3. A. Ambainis, A. Nayak, A. Ta-Shma, and U. Vazirani. Dense quantum coding and quantum finite automata. J. ACM, 49(4):1-16, July 2002.
4. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci, 68(4):702-732, 2004.
5. M. Blum and S. Kannan. Designing programs that check their work. J. ACM, 42(1):269-291, 1995.
6. M. Blum, M. Luby, and R. Rubinfeld. Self-testing/correcting with applications to numerical problems. J. Comput. Syst. Sci, 47(3):549-595, 1993.
7. A. Chakrabarti, Y. Shi, A. Wirth, and A. C.-C. Yao. Informational complexity and the direct sum problem for simultaneous message complexity. In IEEE FOCS, pages 270-278, 2001.
8. N. Chomsky and M. Schotzenberger. Computer programming and formal languages. In P. Braffort and D. Hirschberg, editors, The algebraic theory of context-free languages, pages 118-161, 1963.
9. M. Chu, S. Kannan, and A. McGregor. Checking and spot-checking the correctness of priority queues. In ICALP, pages 728-739, 2007.
10. J. Feigenbaum, S. Kannan, M. Strauss, and M. Viswanathan. Testing and spot-checking of data streams. Algorithmica, 34(1):67-80, 2002.
11. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. J. ACM, 45(4):653-750, 1998.
12. J. Hopcroft and J. Ullman. Formal Languages and Their Relation to Automata. Addison-Wesley, 1969.
13. R. Jain, J. Radhakrishnan, and P. Sen. A lower bound for the bounded round quantum communication complexity of Set Disjointness. In IEEE FOCS, pages 220-229, 2003.
14. T. S. Jayram, R. Kumar, and D. Sivakumar. Two applications of information complexity. In ACM STOC, pages 673-682. ACM, 2003.
15. R. Lipton and Y. Zalcstein. Word problems solvable in logspace. J. ACM, 24(3):522-526, 1977.
16. S. Muthukrishnan. Data Streams: Algorithms and Applications. Now Publishers Inc., 2005.
17. A. Nayak. Optimal lower bounds for quantum automata and random access codes. In IEEE FOCS, pages 369-376, 1999.
18. M. Parnas, D. Ron, and R. Rubinfeld. Testing membership in parenthesis languages. Random Struct. Algor., 22(1):98-138, 2003.
19. M. Saks and X. Sun. Space lower bounds for distance approximation in the data stream model. In ACM STOC, pages 360-369, 2002.
20. L. Segoufin and C. Sirangelo. Constant-memory validation of streaming XML documents against DTDs. In ICDT, pages 299-313, 2007.
21. L. Segoufin and V. Vianu. Validating streaming XML documents. In ACM PODS, pages 53-64, 2002.