The Space Complexity of Recognizing Well-Parenthesized Expressions in the Streaming Model: The Index Function Revisited

@article{Jain2014TheSC,
  title={The Space Complexity of Recognizing Well-Parenthesized Expressions in the Streaming Model: The Index Function Revisited},
  author={R. Jain and Ashwin Nayak},
  journal={IEEE Transactions on Information Theory},
  year={2014},
  volume={60},
  pages={6646-6668}
}
  • R. Jain, Ashwin Nayak
  • Published 2014
  • Mathematics, Computer Science, Physics
  • IEEE Transactions on Information Theory
  • We show an Ω(√n/T) lower bound for the space required by any unidirectional constant-error randomized T-pass streaming algorithm that recognizes whether an expression over two types of parenthesis is well parenthesized. This proves a conjecture due to Magniez, Mathieu, and Nayak (2009) and rigorously establishes that bidirectional streams are exponentially more efficient in space usage as compared with unidirectional ones. We obtain the lower bound by analyzing the information that is… CONTINUE READING
    25 Citations
    Streaming algorithms for language recognition problems
    • 17
    • PDF
    Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications
    • 13
    • PDF
    Quantum Chebyshev's Inequality and Applications
    • 9
    • PDF
    Quantum Log-Approximate-Rank Conjecture is Also False
    • 8
    • PDF
    Input/Output Streaming Complexity of Reversal and Sorting
    • 1
    • PDF
    Augmented Index and Quantum Streaming Algorithms for DYCK(2)
    • 7
    • PDF

    References

    SHOWING 1-10 OF 75 REFERENCES
    Recognizing well-parenthesized expressions in the streaming model
    • 49
    • PDF
    Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition
    • 29
    • Highly Influential
    • PDF
    Two applications of information complexity
    • 86
    Everywhere-Tight Information Cost Tradeoffs for Augmented Index
    • 4
    • PDF
    One-way communication complexity and the Neciporuk lower bound on formula size
    • H. Klauck
    • Computer Science, Physics
    • SIAM J. Comput.
    • 2007
    • 16
    • PDF
    How to compress interactive communication
    • 115
    • PDF
    Towards a Reverse Newman’s Theorem in Interactive Information Complexity
    • 27
    • PDF
    Informational complexity and the direct sum problem for simultaneous message complexity
    • 261
    • PDF
    Efficient Communication Using Partial Information
    • 6
    • PDF
    Lower bounds for predecessor searching in the cell probe model
    • 63
    • PDF