Streaming Algorithms Via Reductions

作者: Michael S Crouch

DOI: 10.7275/.0

关键词:

摘要:

参考文章(70)
Michael S. Crouch, Andrew McGregor, Daniel Stubbs, Dynamic Graphs in the Sliding-Window Model european symposium on algorithms. pp. 337- 348 ,(2013) , 10.1007/978-3-642-40450-4_29
Moses Charikar, Kevin Chen, Martin Farach-Colton, Finding Frequent Items in Data Streams international colloquium on automata languages and programming. ,vol. 312, pp. 693- 703 ,(2002) , 10.1016/S0304-3975(03)00400-6
S. Muthukrishnan, Stochastic Data Streams mathematical foundations of computer science. pp. 55- 55 ,(2009) , 10.1007/978-3-642-03816-7_5
Mariano Zelke, Weighted Matching in the Semi-Streaming Model Algorithmica. ,vol. 62, pp. 1- 20 ,(2012) , 10.1007/S00453-010-9438-5
Béla Bollobás, Extremal Graph Theory ,(1978)
Robert Endre Tarjan, Data Structures and Network Algorithms ,(1983)
Andrew McGregor, Finding Graph Matchings in Data Streams Lecture Notes in Computer Science. pp. 170- 181 ,(2005) , 10.1007/11538462_15
Piotr Indyk, Nick Koudas, S. Muthukrishnan, Identifying Representative Trends in Massive Time Series Data Sets Using Sketches very large data bases. pp. 363- 372 ,(2000)
Jelani Nelson, Sketching and streaming high-dimensional vectors Massachusetts Institute of Technology. ,(2011)