Author:
Aggarwal Gagan,Ailon Nir,Constantin Florin,Even-Dar Eyal,Feldman Jon,Frahling Gereon,Henzinger Monika R.,Muthukrishnan S.,Nisan Noam,Pál Martin,Sandler Mark,Sidiropoulos Anastasios
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Reference43 articles.
1. S. Dobzinski R. Lavi and N. Nisan. Multi-unit Auctions with Budget Limits. Working paper 2008. S. Dobzinski R. Lavi and N. Nisan. Multi-unit Auctions with Budget Limits. Working paper 2008.
2. The space complexity of approximating the frequency moments
3. A. Bialecki M. Cafarella D. Cutting and O. O'Malley. Hadoop: a framework for running applications on large clusters built of commodity hardware 2005. Wiki at http://lucene.apache.org/hadoop/. A. Bialecki M. Cafarella D. Cutting and O. O'Malley. Hadoop: a framework for running applications on large clusters built of commodity hardware 2005. Wiki at http://lucene.apache.org/hadoop/.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sorting and Selection with Imprecise Comparisons;ACM Transactions on Algorithms;2016-02-12
2. Node Classification in Social Networks;Social Network Data Analytics;2011
3. Budget Feasible Mechanisms;2010 IEEE 51st Annual Symposium on Foundations of Computer Science;2010-10
4. Sorting and Selection with Imprecise Comparisons;Automata, Languages and Programming;2009
5. Internet Ad Auctions: Insights and Directions;Automata, Languages and Programming;2008