The space complexity of approximating the frequency moments
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Efficient algorithms for inverting evolution
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Communications of the ACM
Nearly tight bounds on the learnability of evolution
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Nearly tight bounds on the learnability of evolution
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Spectral Partitioning of Random Graphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
An efficient boosting algorithm for combining preferences
The Journal of Machine Learning Research
Using mixture models for collaborative filtering
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Aggregating inconsistent information: ranking and clustering
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Multi-unit auctions with budget-constrained bidders
Proceedings of the 6th ACM conference on Electronic commerce
Fitting tree metrics: Hierarchical clustering and Phylogeny
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Correlation clustering with a fixed number of clusters
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SIAM Journal on Discrete Mathematics
Truthful auctions for pricing search keywords
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Magnitude-preserving ranking algorithms
Proceedings of the 24th international conference on Machine learning
Hierarchical mixture models: a probabilistic analysis
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Aggregation of partial rankings, p-ratings and top-m lists
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An experimental comparison of click position-bias models
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
On distributing symmetric streaming computations
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A Truthful Mechanism for Offline Ad Slot Scheduling
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Journal of Artificial Intelligence Research
Robust reductions from ranking to classification
COLT'07 Proceedings of the 20th annual conference on Learning theory
Deterministic algorithms for rank aggregation and other ranking and clustering problems
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Finding graph matchings in data streams
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Margin-Based ranking meets boosting in the middle
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Bidding to the top: VCG and equilibria of position-based auctions
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Sorting and Selection with Imprecise Comparisons
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
| Hi-index | 0.00 |
Through the history of Computer Science, new technologies have emerged and generated fundamental problems of interest to theoretical computer scientists. From the era of telecommunications to computing and now, the Internet and the web, there are many such examples. This article is derived from the emergence of web search and associated technologies, and focuses on the problems of research interest to theoretical computer scientists that arise, in particular at Google.