Graph distances in the streaming model: the value of space
暂无分享,去创建一个
Joan Feigenbaum | Sampath Kannan | Andrew McGregor | Siddharth Suri | Jian Zhang | J. Feigenbaum | Sampath Kannan | Siddharth Suri | A. Mcgregor | Jian Zhang
[1] Sudipto Guha,et al. Clustering Data Streams , 2000, FOCS.
[2] Mahesh Viswanathan,et al. An Approximate L1-Difference Algorithm for Massive Data Streams , 2002, SIAM J. Comput..
[3] Sudipto Guha,et al. Data-streams and histograms , 2001, STOC '01.
[4] Michael Elkin,et al. Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models , 2004, PODC '04.
[5] Michael Elkin,et al. Computing almost shortest paths , 2001, TALG.
[6] David Eppstein,et al. Sparsification—a technique for speeding up dynamic graph algorithms , 1997, JACM.
[7] Prabhakar Raghavan,et al. Computing on data streams , 1999, External Memory Algorithms.
[8] J. Ian Munro,et al. Selection and sorting with limited storage , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[9] Noam Nisan,et al. Rounds in communication complexity revisited , 1991, STOC '91.
[10] Piotr Indyk,et al. Fast estimation of diameter and shortest paths (without matrix multiplication) , 1996, SODA '96.
[11] S. Muthukrishnan,et al. Data streams: algorithms and applications , 2005, SODA '03.
[12] David Eppstein,et al. Sparsification-a technique for speeding up dynamic graph algorithms , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[13] Lenore Cowen,et al. Near-Linear Time Construction of Sparse Neighborhood Covers , 1999, SIAM J. Comput..
[14] Sandeep Sen,et al. A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k) Size in Weighted Graphs , 2003, ICALP.
[15] Piotr Indyk,et al. Stable distributions, pseudorandom generators, embeddings, and data stream computation , 2006, JACM.
[16] Noga Alon,et al. The space complexity of approximating the frequency moments , 1996, STOC '96.
[17] S. Muthukrishnan,et al. Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries , 2001, VLDB.
[18] Jaikumar Radhakrishnan,et al. The Communication Complexity of Pointer Chasing , 2001, J. Comput. Syst. Sci..
[19] Petros Drineas,et al. Pass efficient algorithms for approximating large matrices , 2003, SODA '03.
[20] Jirí Sgall,et al. Some bounds on multiparty communication complexity of pointer jumping , 1998, computational complexity.
[21] Mikkel Thorup,et al. Approximate distance oracles , 2001, JACM.
[22] Sudipto Guha,et al. Fast, small-space algorithms for approximate histogram maintenance , 2002, STOC '02.
[23] F. Lazebnik,et al. A new series of dense graphs of high girth , 1995, math/9501231.
[24] Ziv Bar-Yossef,et al. Reductions in streaming algorithms, with an application to counting triangles in graphs , 2002, SODA '02.