Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition

@article{Chakrabarti2010InformationCT,
  title={Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition},
  author={Amit Chakrabarti and Graham Cormode and R. Kondapally and A. Mcgregor},
  journal={2010 IEEE 51st Annual Symposium on Foundations of Computer Science},
  year={2010},
  pages={387-396}
}
  • Amit Chakrabarti, Graham Cormode, +1 author A. Mcgregor
  • Published 2010
  • Computer Science, Mathematics
  • 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
  • This paper makes three main contributions to the theory of communication complexity and stream computation. First, we present new bounds on the information complexity of AUGMENTED-INDEX. In contrast to analogous results for INDEX by Jain, Radhakrishnan and Sen [J. ACM, 2009], we have to overcome the significant technical challenge that protocols for AUGMENTED-INDEX may violate the ``rectangle property'' due to the inherent input sharing. Second, we use these bounds to resolve an open problem of… CONTINUE READING
    29 Citations
    Recognizing well-parenthesized expressions in the streaming model
    • 49
    • PDF
    The Space Complexity of Recognizing Well-Parenthesized Expressions in the Streaming Model: The Index Function Revisited
    • 24
    • Highly Influenced
    • PDF
    Polynomial pass lower bounds for graph streaming algorithms
    • 9
    • PDF
    Everywhere-Tight Information Cost Tradeoffs for Augmented Index
    • 4
    • PDF
    Input/Output Streaming Complexity of Reversal and Sorting
    • 1
    • PDF
    Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover
    • 25
    • PDF
    Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions
    • 11
    • PDF
    The Dyck Language Edit Distance Problem in Near-Linear Time
    • B. Saha
    • Computer Science
    • 2014 IEEE 55th Annual Symposium on Foundations of Computer Science
    • 2014
    • 25
    • PDF
    Streaming Complexity of Checking Priority Queues
    • 4
    • PDF

    References

    SHOWING 1-10 OF 38 REFERENCES
    Recognizing well-parenthesized expressions in the streaming model
    • 49
    • Highly Influential
    • PDF
    Unifying the Landscape of Cell-Probe Lower Bounds
    • M. Patrascu
    • Computer Science, Mathematics
    • SIAM J. Comput.
    • 2011
    • 67
    • PDF
    On data structures and asymmetric communication complexity
    • 287
    • PDF
    Everywhere-Tight Information Cost Tradeoffs for Augmented Index
    • 4
    • PDF
    Informational complexity and the direct sum problem for simultaneous message complexity
    • 263
    • PDF
    Numerical linear algebra in the streaming model
    • 277
    • Highly Influential
    • PDF
    Checking the correctness of memories
    • 221
    • Highly Influential
    An information statistics approach to data stream and communication complexity
    • 408
    • PDF
    The complexity of online memory checking
    • M. Naor, G. N. Rothblum
    • Computer Science
    • 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
    • 2005
    • 110
    • PDF