Finding a duplicate and a missing item in a stream

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4484 LNCS, Issue , 2007, Pages 128-135

  Tarui, Jun ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

Communication complexity; Data stream algorithm; Finding duplicate; Finding missing item; Pigeonhole principle; Proof complexity

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; MATHEMATICAL MODELS; PARAMETER ESTIMATION;

COMMUNICATION COMPLEXITY; DATA STREAM ALGORITHM; FINDING DUPLICATE; FINDING MISSING ITEM; PIGEONHOLE PRINCIPLE; PROOF COMPLEXITY;

PROBLEM SOLVING;

EID: 35448943219     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-72504-6_11     Document Type: Conference Paper

References (12)

1. M. Ajtai and M. Ben-Or. A Theorem on Probabilistic Constant Depth Circuits, Proc. of STOC84, pp. 471-474, 1984.
2. N. Alon, Y. Matias, and M. Szegedy. The Space Complexity of Approximating the Frequency Moments, Proc. of STOC97, pp. 20-29, 1996.
3. R. Boppana. Threshold Functions and Bounded Depth Monotone Circuits. Journal of Computer and System Sciences, vol. 32, pp. 222-229, 1986.
4. R. Boppana and M. Sipser. The Complexity of Finite Functions, in: J. van Leeuwen, ed. Handbook of Theoretical Computer Science vol. A, MIT Press, 1990.
5. A. Borodin and S. Cook. A Time-Space Trade-Off for Sorting on a General Sequential Model of Computation. SIAM Journal on Computing, vol. 11, pp. 287-297, 1982.
6. J. Håstad. Computational Limits for Small-Depth Circuits, MIT Press, 1987.
7. E. Kushilevitz and N. Nisan. Communication Complexity, Cambridge University Press, 1997.
8. M. Karchmer and A. Wigderson. Monotone Circuits for Connectivity Requires Super-Logarithmic Depth, SIAM Journal on Discrete Mathematics, vol. 5, no. 4, pp. 545-557, 1992.
9. S. Muthukrishnan. talk given at the Kyoto Workshop on New Horizons in Computing, March, 2005.
10. S. Muthukrishnan. Data Streams: Algorithms and Applications, Foundations and Trends in Theoretical Computer Science, volume 1, issue 2, 2005; a preliminary version available at http://www.cs.rutgers.edu/~muthu.
11. A. Razborov, A. Wigderson, and A. Yao. Read-Once Branching Programs, Rectangular Proofs of the Pigeon-Hole Principle and the Transversal Calculus, Combinatorica, vol. 22, no. 4, pp. 555-574, 2002;
12. also in Proc. of STOC97, pp. 739-748, 1997.