On data structures and asymmetric communication complexity
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Approximate medians and other quantiles in one pass and with limited memory
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Space-efficient online computation of quantile summaries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Medians and beyond: new aggregation techniques for sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
An improved data stream summary: the count-min sketch and its applications
Journal of Algorithms
Lower bounds for asymmetric communication channels and distributed source coding
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Time-space trade-offs for predecessor search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximate quantiles and the order of the stream
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Lower Bounds for Multi-Player Pointer Jumping
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Randomization does not help searching predecessors
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
How to summarize the universe: dynamic maintenance of quantiles
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Lower bounds for quantile estimation in random-order and multi-pass streaming
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Robust lower bounds for communication and stream computation
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Sliding-window top-k queries on uncertain streams
Proceedings of the VLDB Endowment
Comparison-based time-space lower bounds for selection
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The average-case complexity of counting distinct elements
Proceedings of the 12th International Conference on Database Theory
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Comparison-based time-space lower bounds for selection
ACM Transactions on Algorithms (TALG)
Sliding-window top-k queries on uncertain streams
The VLDB Journal — The International Journal on Very Large Data Bases
Theoretical Computer Science
A truly dynamic data structure for top-k queries on uncertain data
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Tight bounds for distributed functional monitoring
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Optimal Collapsing Protocol for Multiparty Pointer Jumping
Theory of Computing Systems
| Hi-index | 0.00 |
We show that any algorithm computing the median of a stream presented in random order, using polylog(n) space, requires an optimal Ω (log log n) passes, resolving an open question from the seminal paper on streaming by Munro and Paterson, from FOCS 1978.