Sampling algorithms: lower bounds and applications
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Approximate counting of inversions in a data stream
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Handbook of massive data sets
An improved data stream algorithm for frequency moments
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Buffering in query evaluation over XML streams
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Lower bounds for sorting with few random accesses to external memory
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Discovering large dense subgraphs in massive graphs
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Trading off space for passes in graph streaming problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The space complexity of pass-efficient algorithms for clustering
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
To randomize or not to randomize: space optimal summaries for hyperlink analysis
Proceedings of the 15th international conference on World Wide Web
Randomized computations on large data sets: tight lower bounds
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Adaptive Clustering for Multiple Evolving Streams
IEEE Transactions on Knowledge and Data Engineering
Tight lower bounds for query processing on streaming and external memory data
Theoretical Computer Science
Practical Algorithms and Lower Bounds for Similarity Search in Massive Graphs
IEEE Transactions on Knowledge and Data Engineering
Machine models and lower bounds for query processing
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Link analysis for Web spam detection
ACM Transactions on the Web (TWEB)
Streaming algorithm for graph spanners---single pass and constant processing time per edge
Information Processing Letters
Robust lower bounds for communication and stream computation
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Sketching in adversarial environments
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Estimating PageRank on graph streams
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Sketching information divergences
Machine Learning
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Efficient semi-streaming algorithms for local triangle counting in massive graphs
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
A Black Box for Online Approximate Pattern Matching
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Lower bounds for processing data with few random accesses to external memory
Journal of the ACM (JACM)
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Sublinear estimation of entropy and information distances
ACM Transactions on Algorithms (TALG)
Trading off space for passes in graph streaming problems
ACM Transactions on Algorithms (TALG)
Sketching information divergences
COLT'07 Proceedings of the 20th annual conference on Learning theory
Efficient algorithms for large-scale local triangle counting
ACM Transactions on Knowledge Discovery from Data (TKDD)
Adapting parallel algorithms to the W-Stream model, with applications to graph problems
Theoretical Computer Science
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Intractability of min- and max-cut in streaming graphs
Information Processing Letters
A black box for online approximate pattern matching
Information and Computation
Theoretical Computer Science
Estimating PageRank on graph streams
Journal of the ACM (JACM)
Computing strongly connected components in the streaming model
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Distributed verification and hardness of distributed approximation
Proceedings of the forty-third annual ACM symposium on Theory of computing
gSketch: on query estimation in graph streams
Proceedings of the VLDB Endowment
Database query processing using finite cursor machines
ICDT'07 Proceedings of the 11th international conference on Database Theory
Tight lower bounds for query processing on streaming and external memory data
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The complexity of querying external memory and streaming data
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Survey: Streaming techniques and data aggregation in networks of tiny artefacts
Computer Science Review
Statistical estimation with bounded memory
Statistics and Computing
Sketching in Adversarial Environments
SIAM Journal on Computing
Adapting parallel algorithms to the W-stream model, with applications to graph problems
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Graph drawing in the cloud: privately visualizing relational data using small working storage
GD'12 Proceedings of the 20th international conference on Graph Drawing
Maintaining connected components for infinite graph streams
Proceedings of the 2nd International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications
| Hi-index | 0.00 |