2019 - Fellow of the American Academy of Arts and Sciences
2009 - ACM Fellow For efficient algorithms for combinatorial optimization problems based on randomization.
1997 - Fellow of Alfred P. Sloan Foundation
David R. Karger mainly investigates Distributed computing, Computer network, Combinatorics, Information retrieval and Distributed hash table. His Distributed computing research is multidisciplinary, incorporating perspectives in Network packet, Linear network coding, Dynamic Source Routing, Node and Robustness. His research investigates the link between Computer network and topics such as Overlay network that cross with problems in Resource.
His work deals with themes such as Discrete mathematics and Algorithm, which intersect with Combinatorics. His Information retrieval research incorporates themes from Information needs, Data mining, Cluster analysis and Web 2.0. His studies deal with areas such as Koorde, Key-based routing and Chord as well as Distributed hash table.
World Wide Web, Combinatorics, Discrete mathematics, Algorithm and Semantic Web are his primary areas of study. His research investigates the connection between World Wide Web and topics such as User interface that intersect with issues in Human–computer interaction, Data model and Data modeling. His Discrete mathematics study incorporates themes from Sampling and Maximum flow problem.
While the research belongs to areas of Algorithm, David R. Karger spends his time largely on the problem of Mathematical optimization, intersecting his research to questions surrounding Multiprocessor scheduling. David R. Karger works mostly in the field of Social Semantic Web, limiting it down to topics relating to Data Web and, in certain cases, Web standards, as a part of the same area of interest. David R. Karger interconnects Metadata and The Internet in the investigation of issues within RDF.
His primary areas of study are World Wide Web, Human–computer interaction, Internet privacy, Combinatorics and Online discussion. His research in World Wide Web intersects with topics in Automatic summarization and Scripting language. His Human–computer interaction research integrates issues from User interface, End user, Documentation and Mechanism.
His study in Discrete mathematics extends to Combinatorics with its themes. The Online discussion study which covers Set that intersects with Test set, Belief propagation, Oracle, Majority rule and Task. He has included themes like Web standards and Semantic Web Stack in his Web modeling study.
His primary areas of investigation include World Wide Web, Internet privacy, Web standards, Crowdsourcing and Web design. He specializes in World Wide Web, namely Collaborative filtering. His research integrates issues of Web modeling, Social Semantic Web, Variety, Disinformation and Data Web in his study of Web standards.
His studies in Social Semantic Web integrate themes in fields like Web API, Web Accessibility Initiative and Semantic Web Stack. His Crowdsourcing study integrates concerns from other disciplines, such as Majority rule, Task, Oracle, Belief propagation and Workflow. David R. Karger combines subjects such as Information management, Web development and Web 2.0 with his study of Web design.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Chord: a scalable peer-to-peer lookup protocol for Internet applications
Ion Stoica;Robert Morris;David Liben-Nowell;David R. Karger.
IEEE ACM Transactions on Networking (2003)
Chord: A scalable peer-to-peer lookup service for internet applications
Ion Stoica;Robert Morris;David Karger;M. Frans Kaashoek.
acm special interest group on data communication (2001)
Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web
David Karger;Eric Lehman;Tom Leighton;Rina Panigrahy.
symposium on the theory of computing (1997)
A Random Linear Network Coding Approach to Multicast
T. Ho;M. Medard;R. Koetter;D.R. Karger.
IEEE Transactions on Information Theory (2006)
Scatter/Gather: a cluster-based approach to browsing large document collections
Douglass R. Cutting;David R. Karger;Jan O. Pedersen;John W. Tukey.
international acm sigir conference on research and development in information retrieval (1992)
Wide-area cooperative storage with CFS
Frank Dabek;M. Frans Kaashoek;David Karger;Robert Morris.
symposium on operating systems principles (2001)
A scalable location service for geographic ad hoc routing
Jinyang Li;John Jannotti;Douglas S. J. De Couto;David R. Karger.
acm/ieee international conference on mobile computing and networking (2000)
The benefits of coding over routing in a randomized setting
T. Ho;R. Koetter;M. Medard;D.R. Karger.
international symposium on information theory (2003)
Tackling the poor assumptions of naive bayes text classifiers
Jason D. M. Rennie;Lawrence Shih;Jaime Teevan;David R. Karger.
international conference on machine learning (2003)
Looking up data in P2P systems
Hari Balakrishnan;M. Frans Kaashoek;David Karger;Robert Morris.
Communications of The ACM (2003)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: