Abstract
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a stream). Moreover, the proof itself is nothing but a reordering of the input data. This model has a close relationship to many models of computation in other areas such as data streams, communication complexity, and proof checking and could be used in applications such as cloud computing.
In this paper we focus on graph problems where the input is a sequence of edges. We show that checking if a graph has a perfect matching is impossible to do deterministically using small space. To contrast this, we show that randomized verifiers are powerful enough to check whether a graph has a perfect matching or is connected.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Amazon elastic compute cloud (amazon ec2)
Aggarwal, G., Datar, M., Rajagopalan, S., Ruhl, M.: On the streaming model augmented with a sorting primitive. In: Annual IEEE Symposium on Foundations of Computer Science, pp. 540–549 (2004)
Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58(1), 137–147 (1999)
Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM 45(3), 501–555 (1998)
Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of np. J. ACM 45(1), 70–122 (1998)
Chakrabarti, A., Cormode, G., McGregor, A.: Robust lower bounds for communication and stream computation. In: STOC, pp. 641–650 (2008)
Chakrabarti, A., Jayram, T.S., Pǎtraşcu, M.: Tight lower bounds for selection in randomly ordered streams. In: Proc. 19th ACM/SIAM Symposium on Discrete Algorithms (SODA), pp. 720–729 (2008)
Demetrescu, C., Finocchi, I., Ribichini, A.: Trading off space for passes in graph streaming problems. In: SODA 2006: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, pp. 714–723. ACM, New York (2006)
Dinur, I.: The pcp theorem by gap amplification. J. ACM 54(3), 12 (2007)
Feigenbaum, J., Kannan, S., Strauss, M., Viswanathan, M.: Testing and spot-checking of data streams (extended abstract). In: SODA 2000: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 165–174. Society for Industrial and Applied Mathematics (2000)
Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: Graph distances in the streaming model: the value of space. In: SODA 2005: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 745–754. Society for Industrial and Applied Mathematics (2005)
Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. Theor. Comput. Sci. 348(2), 207–216 (2005)
Goldreich, O.: Property testing in massive graphs, pp. 123–147 (2002)
Gopalan, P., Radhakrishnan, J.: Finding duplicates in a data stream. In: SODA 2009: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics (to appear, 2009)
Guha, S., McGregor, A.: Approximate quantiles and the order of the stream. In: PODS 2006: Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp. 273–279. ACM, New York (2006)
Guha, S., Mcgregor, A.: Lower bounds for quantile estimation in random-order and multi-pass streaming. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 704–715. Springer, Heidelberg (2007)
Hajnal, A., Maass, W., Turán, G.: On the communication complexity of graph properties. In: STOC, pp. 186–191 (1988)
Håstad, J., Wigderson, A.: The randomized communication complexity of set disjointness. Theory of Computing 3(1), 211–219 (2007)
Henzinger, M.R., Raghavan, P., Rajagopalan, S.: Computing on data streams, pp. 107–118 (1999)
Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press, New York (1997)
Lam, T.W., Ruzzo, W.L.: Results on communication complexity classes. J. Comput. Syst. Sci. 44(2), 324–342 (1992)
Lipton, R.J.: Fingerprinting sets. Cs-tr-212-89. Princeton University (1989)
Lipton, R.J.: Efficient checking of computations. In: STACS, pp. 207–215 (1990)
Munro, J.I., Paterson, M.: Selection and sorting with limited storage. In: FOCS, pp. 253–258 (1978)
Papadimitriou, C.H., Sipser, M.: Communication complexity. J. Comput. Syst. Sci. 28(2), 260–269 (1984)
Ruhl, J.M.: Efficient algorithms for new computational models. Ph.D thesis, Supervisor-David R. Karger (2003)
Yao, A.C.-C.: Some complexity questions related to distributive computing (preliminary report). In: STOC, pp. 209–213 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Das Sarma, A., Lipton, R.J., Nanongkai, D. (2009). Best-Order Streaming Model. In: Chen, J., Cooper, S.B. (eds) Theory and Applications of Models of Computation. TAMC 2009. Lecture Notes in Computer Science, vol 5532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02017-9_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-02017-9_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02016-2
Online ISBN: 978-3-642-02017-9
eBook Packages: Computer ScienceComputer Science (R0)