The streaming complexity of cycle counting, sorting by reversals, and other problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2011, Pages 11-25

  Verbin, Elad ^a   Yu, Wei ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; QUANTUM COMMUNICATION;

COMMUNICATION COMPLEXITY; COMMUNICATION PROBLEMS; MATCHING PROBLEMS; PERFECT MATCHINGS; QUANTUM COMMUNICATION COMPLEXITY; RANDOMIZED PROTOCOLS; SORTING BY REVERSALS; TWO WAY COMMUNICATIONS;

HARDNESS;

EID: 79955719028     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973082.2     Document Type: Conference Paper

References (27)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Journal of Computer and system sciences, 58(1) : 137- 147, 1999.
2. A. Andoni, K. Do Ba, P. Indyk, and D. Woodruff. Efficient sketches for earth-mover distance, with applications. In 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pages 324-330. IEEE, 2009.
3. A. Andoni, T.S. Jayram, and M. Patrascu. Lower bounds for edit distance and product metrics via Poincaré-type inequalities. In ACM-SIAM Symposium on Discrete Algorithms (SODA 10), 2010.
4. A. Andoni and R. Krauthgamer. The Computational Hardness of Estimating Edit Distance [Extended Abstract]. In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, pages 724-734. IEEE Computer Society, 2007.
5. A. Andoni, R. Krauthgamer, and K. Onak. Poly-logarithniic Approximation for Edit Distance and the Asymmetric Query Complexity. Arxiv preprint arXiv:1005.4033, 2010.
6. D.A. Bader, B.M.E. Moret, and M. Yan. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. Journal of Computational Biology, 8(5):483-491, 2001. (Pubitemid 33044073)
7. V. Bafna and P.A. Pevzner. Sorting by Transpositions. SIAM Journal on Discrete Mathematics, 11 (2) :240, 1998.
8. Z. Bar-Yossef, T.S. Jayram, and I. Kerenidis. Exponential Separation of Quantum and Classical One-Way Communication Complexity. SIAM Journal on Computing, 38:366, 2008.
9. Z. Bar-Yossef, T.S. Jayram, R. Kumar, and D. Sivaku-mar. An information statistics approach to data stream and communication complexity. Journal of Computer and System Sciences, 68(4):702-732, 2004.
10. J. Brody, A. Chakrabarti, O. Regev, T. Vidick, and R. de Wolf. Better Gap-Hamming Lower Bounds via Better Round Elimination. Arxiv preprint arXiv:0912.5216, 2009.
11. A. Chakrabarti and O. Regev. An optimal lower bound on the communication complexity of gap-hamming- distance. ECCC Report TR10-140, 2010.
12. D.A. Christie. Sorting permutations by block- interchanges. Information Processing Letters, 60(4):165-169, 1996.
13. G. Cormode and S. Muthukrishnan. The string edit distance matching problem with moves. ACM Transactions on Algorithms (TALG), 3(1):1-19, 2007.
14. G. Cormode, S. Muthukrishnan, and C. Sahinalp. Permutation editing and matching via embeddings. In Automata, languages and programming: 28th international colloquium, ICALP 2001, Crete, Greece, July 8- 12, 2001: proceedings, page 481. Springer Verlag, 2001.
15. R. De Wolf. A brief introduction to Fourier analysis on the Boolean cube. Theory of Computing Library-Graduate Surveys, 1:1-20, 2008.
16. I. Elias and T. Hartman. A 1.375-approximation algorithm for sorting by transpositions. IEEE/ACM Transactions on Computational Biology and Bioinformatics, pages 369-379, 2006. (Pubitemid 44950086)
17. J. Feng and D. Zhu. Faster algorithms for sorting by transpositions and sorting by block interchanges. ACM Transactions on Algorithms (TALG), 3(3):25, 2007.
18. D. Gavinsky, J. Kempe, and R. de Wolf. Exponential separation of quantum and classical one-way communication complexity for a boolean function. Electronic Colloquium on Computational Complexity, TR06-086, July 2006.
19. D. Gavinsky, J. Kempe. I. Kerenidis, R. Raz, and R. de Wolf. Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography. SIAM Journal on Computing, 38:1695, 2008.
20. S. Hannenhalli and P.A. Pevzner. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. Journal of the ACM (JACM), 46(1):1-27, 1999.
21. T. Hartman. A simpler 1.5-approximation algorithm for sorting by transpositions. In Combinatorial pattern matching, pages 156-169. Springer, 2003.
22. N.J.A. Harvey. Matroid intersection, pointer chasing, and Young's seminormal representation of S n. In Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, pages 542-549. Society for Industrial and Applied Mathematics, 2008.
23. T.S. Jayram, R. Kumar, and D. Sivakumar. The One-Way Communication Complexity of Hamming Distance. Theory Of Computing, 4:129-135, 2008.
24. J. Kahn, G. Kalai, and N. Linial. The influence of variables on Boolean functions. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 68-80. IEEE Computer Society, 1988.
25. H. Kaplan, R. Shamir, and R.E. Tarjan. A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals. SIAM Journal on Computing, 29:880, 2000.
26. S. Muthukrishnan. Data streams: Algorithms and applications. Now Publishers Inc, 2005.
27. R. Raz and B. Spieker. On the log rank-conjecture in communication complexity. Combinatorica, 15(4):567- 588, 1995.