Information Complexity and Data Stream Algorithms for Basic Problems
作者： André Gronemeier
关键词:
摘要:
tu-dortmund.de 
sci-hub.st 参考文章(69)
S. M. Ali, S. D. Silvey, A General Class of Coefficients of Divergence of One Distribution from Another Journal of the Royal Statistical Society: Series B (Methodological). ,vol. 28, pp. 131- 142 ,(1966) , 10.1111/J.2517-6161.1966.TB00626.X
Ingo Wegener, Effiziente Algorithmen für grundlegende Funktionen Vieweg+Teubner Verlag. ,(1989) , 10.1007/978-3-322-94711-6
S. W. Golomb, Run-length encodings. ,(1966)
Avi Wigderson, Emanuele Viola, One-way multi-party communication lower bound for pointer jumping with applications. Electronic Colloquium on Computational Complexity. ,vol. 14, ,(2007)
Ingo Wegener, Branching Programs and Binary Decision Diagrams: Theory and Applications ,(1987)
Philippe Flajolet, Robert Sedgewick, An Introduction to the Analysis of Algorithms ,(1995)
T. S. Jayram, Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. ,vol. 5687, pp. 562- 573 ,(2009) , 10.1007/978-3-642-03685-9_42
Ingo Wegener, The Complexity of Boolean Functions ,(1991)
Sanjeev Arora, Boaz Barak, Computational Complexity: A Modern Approach Cambridge University Press. ,(2009) , 10.1017/CBO9780511804090
Piotr Indyk, David Woodruff, Optimal Approximations of the Frequency Moments ,(2004)