Sublinear Algorithms in the External Memory Model
暂无分享,去创建一个
Alexandr Andoni | Krzysztof Onak | Ronitt Rubinfeld | Piotr Indyk | P. Indyk | Alexandr Andoni | R. Rubinfeld | Krzysztof Onak
[1] Frank Olken,et al. Random Sampling from Databases , 1993 .
[2] VitterJeffrey Scott. External memory algorithms and data structures , 2001 .
[3] Oded Goldreich,et al. Combinatorial property testing (a survey) , 1997, Randomization Methods in Algorithm Design.
[4] Jeffrey Scott Vitter,et al. External memory algorithms and data structures: dealing with massive data , 2001, CSUR.
[5] Dana Ron,et al. On Testing Expansion in Bounded-Degree Graphs , 2000, Studies in Complexity and Cryptography.
[6] Doron Rotem,et al. Simple Random Sampling from Relational Databases , 1986, VLDB.
[7] Jeffrey Scott Vitter,et al. External memory algorithms and data structures , 1999, External Memory Algorithms.
[8] Eldar Fischer,et al. A Review of Graph Grammars and Preview of ICGT 2002: The First International Conference on Graph Transformation. , 2001 .
[9] Ronitt Rubinfeld,et al. Testing that distributions are close , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[10] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[11] Ravi Kumar,et al. Sampling algorithms: lower bounds and applications , 2001, STOC '01.
[12] Ronitt Rubinfeld,et al. Testing random variables for independence and identity , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[13] E. Fischer. THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING , 2004 .
[14] Krzysztof Onak,et al. Testing Properties of Sets of Points in Metric Spaces , 2008, ICALP.
[15] Eldar Fischer,et al. Testing graph isomorphism , 2006, SODA '06.
[16] Tugkan Batu. Testing Properties of Distributions , 2001 .