DBLife: David R. Karger

2012
189	Successful classroom deployment of a social document annotation system. Sacha Zyto, David R. Karger, Mark S. Ackerman, Sanjoy Mahajan. CHI 2012, 1883-1892. Web SearchBibTeXDownload
188	Reject me: peer review and SIGCHI. Michael S. Bernstein, Dan Cosley, Carl DiSalvo, Sanjay Kairam, David R. Karger, Travis Kriplean, Cliff Lampe, Wendy E. Mackay, Loren G. Terveen, Jacob O. Wobbrock, Sarita Yardi. CHI Extended Abstracts 2012, 1197-1200. Web SearchBibTeXDownload
187	Analytic Methods for Optimizing Realtime Crowdsourcing. Michael S. Bernstein, David R. Karger, Robert C. Miller, Joel Brandt. CoRR (abs/1204.2995) (2012). Web SearchBibTeXDownload
186	Tie strength in question & answer on social network sites. Katrina Panovich, Rob Miller, David R. Karger. CSCW 2012, 1057-1066. Web SearchBibTeXDownload
185	Sorting it All Out with Humans in the Loop. Adam Marcus, Eugene Wu, David R. Karger, Samuel Madden, Rob Miller. TinyToCS (1) (2012). Web SearchBibTeXDownload
2011
184	Twitinfo: aggregating and visualizing microblogs for event exploration. Adam Marcus, Michael S. Bernstein, Osama Badar, David R. Karger, Samuel Madden, Robert C. Miller. CHI 2011, 227-236. Web SearchBibTeXDownload
183	A spreadsheet-based user interface for managing plural relationships in structured data. Eirik Bakke, David R. Karger, Rob Miller. CHI 2011, 2541-2550. Web SearchBibTeXDownload
182	Finders/keepers: a longitudinal study of people managing information scraps in a micro-note tool. Max Van Kleek, Wolfe Styke, m. c. schraefel, David R. Karger. CHI 2011, 2907-2916. Web SearchBibTeXDownload
181	Creating user interfaces that entice people to manage better information. David R. Karger. CIKM 2011, 1-2. Web SearchBibTeXDownload
180	Faster Information Dissemination in Dynamic Networks via Network Coding. Bernhard Haeupler, David R. Karger. CoRR (abs/1104.2527) (2011). Web SearchBibTeXDownload
179	Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems. David R. Karger, Sewoong Oh, Devavrat Shah. CoRR (abs/1110.3564) (2011). Web SearchBibTeXDownload
178	Linear-Time Poisson-Disk Patterns. Thouis R. Jones, David R. Karger. CoRR (abs/1107.3013) (2011). Web SearchBibTeXDownload
177	Iterative Learning for Reliable Crowdsourcing Systems. David R. Karger, Sewoong Oh, Devavrat Shah. NIPS 2011, 1953-1961. Web SearchBibTeXDownload
176	Faster information dissemination in dynamic networks via network coding. Bernhard Haeupler, David R. Karger. PODC 2011, 381-390. Web SearchBibTeXDownload
175	Human-powered Sorts and Joins. Adam Marcus, Eugene Wu, David R. Karger, Samuel Madden, Robert C. Miller. PVLDB (5): 13-24 (2011). Web SearchBibTeXDownload
174	Tweets as data: demonstration of TweeQL and Twitinfo. Adam Marcus, Michael S. Bernstein, Osama Badar, David R. Karger, Samuel Madden, Robert C. Miller. SIGMOD Conference 2011, 1259-1262. Web SearchBibTeXDownload
173	Demonstration of Qurk: a query processor for humanoperators. Adam Marcus, Eugene Wu, David R. Karger, Samuel Madden, Robert C. Miller. SIGMOD Conference 2011, 1315-1318. Web SearchBibTeXDownload
172	Processing and visualizing the data in tweets. Adam Marcus, Michael S. Bernstein, Osama Badar, David R. Karger, Samuel Madden, Robert C. Miller. SIGMOD Record (40): 21-27 (2011). Web SearchBibTeXDownload
171	Crowds in two seconds: enabling realtime crowd-powered interfaces. Michael S. Bernstein, Joel Brandt, Robert C. Miller, David R. Karger. UIST 2011, 33-42. Web SearchBibTeXDownload
2010
170	DDoS defense by offense. Michael Walfish, Mythili Vutukuru, Hari Balakrishnan, David R. Karger, Scott Shenker. ACM Trans. Comput. Syst. (28) (2010). Cited by 84Web SearchBibTeXDownload
169	Enhancing directed content sharing on the web. Michael S. Bernstein, Adam Marcus, David R. Karger, Robert C. Miller. CHI 2010, 971-980. Web SearchBibTeXDownload
168	Eyebrowse: real-time web activity sharing and visualization. Max Van Kleek, Brennan Moore, Christina Xu, David R. Karger. CHI Extended Abstracts 2010, 3643-3648. Web SearchBibTeXDownload
167	Breaking local symmetries can dramatically reduce the length of propositional refutations. Shir Ben-Israel, Eli Ben-Sasson, David R. Karger. Electronic Colloquium on Computational Complexity (ECCC) (17): 68 (2010). Web SearchBibTeXDownload
166	Talking about Data: Sharing Richly Structured Information through Blogs and Wikis. Edward Benson, Adam Marcus, Fabian Howahl, David R. Karger. International Semantic Web Conference (1) 2010, 48-63. Web SearchBibTeXDownload
165	Soylent: a word processor with a crowd inside. Michael S. Bernstein, Greg Little, Robert C. Miller, Björn Hartmann, Mark S. Ackerman, David R. Karger, David Crowell, Katrina Panovich. UIST 2010, 313-322. Web SearchBibTeXDownload
164	Atomate it! end-user context-sensitive automation using heterogeneous information sources on the web. Max Van Kleek, Brennan Moore, David R. Karger, Paul André, m. c. schraefel. WWW 2010, 951-960. Web SearchBibTeXDownload
163	Sync kit: a persistent client-side database caching toolkit for data intensive websites. Edward Benson, Adam Marcus, David R. Karger, Samuel Madden. WWW 2010, 121-130. Web SearchBibTeXDownload
162	Talking about data: sharing richly structured information through blogs and wikis. Edward Benson, Adam Marcus, Fabian Howahl, David R. Karger. WWW 2010, 1057-1058. Web SearchBibTeXDownload
2009
161	Note to self: examining personal information keeping in a lightweight note-taking tool. Max Van Kleek, Michael S. Bernstein, Katrina Panovich, Gregory G. Vargas, David R. Karger, Monica M. C. Schraefel. CHI 2009, 1477-1480. Web SearchBibTeXDownload
160	Scaling all-pairs overlay routing. David Sontag, Yang Zhang, Amar Phanishayee, David G. Andersen, David Karger. CoNEXT 2009, 145-156. Web SearchBibTeXDownload
159	Global Models of Document Structure using Latent Permutations. Harr Chen, S. R. K. Branavan, Regina Barzilay, David R. Karger. HLT-NAACL 2009, 371-379. Web SearchBibTeXDownload
158	Content Modeling Using Latent Permutations. Harr Chen, S. R. K. Branavan, Regina Barzilay, David R. Karger. J. Artif. Intell. Res. (JAIR) (36): 129-163 (2009). Web SearchBibTeXDownload
157	A near-linear time algorithm for constructing a cactus representation of minimum cuts. David R. Karger, Debmalya Panigrahi. SODA 2009, 246-255. Web SearchBibTeXDownload
156	A nearly optimal oracle for avoiding failed vertices and edges. Aaron Bernstein, David R. Karger. STOC 2009, 101-110. Web SearchBibTeXDownload
155	The web page as a WYSIWYG end-user customizable database-backed information management application. David R. Karger, Scott Ostler, Ryan Lee. UIST 2009, 257-260. Web SearchBibTeXDownload
2008
154	Route Planning under Uncertainty: The Canadian Traveller Problem. Evdokia Nikolova, David R. Karger. AAAI 2008, 969-974. Web SearchBibTeXDownload
153	Information scraps: How and why information eludes our personal information management tools. Michael S. Bernstein, Max Van Kleek, David R. Karger, m. c. schraefel. ACM Trans. Inf. Syst. (26) (2008). Web SearchBibTeXDownload
152	Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP. David R. Karger, Jacob Scott. APPROX-RANDOM 2008, 104-117. Web SearchBibTeXDownload
151	Improved Approximations for Multiprocessor Scheduling Under Uncertainty. Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T. Fineman, David R. Karger, Jacob Scott. CoRR (abs/0802.2418) (2008). Web SearchBibTeXDownload
150	Byzantine Modification Detection in Multicast Networks With Random Network Coding. Tracey Ho, Ben Leong, Ralf Koetter, Muriel Médard, Michelle Effros, David R. Karger. IEEE Transactions on Information Theory (54): 2798-2803 (2008). Web SearchBibTeXDownload
149	Potluck: Data mash-up tool for casual users. David F. Huynh, Robert C. Miller, David R. Karger. J. Web Sem. (6): 274-282 (2008). Web SearchBibTeXDownload
148	Understanding code architectures via interactive exploration and layout of layered diagrams. Vineet Sinha, Elizabeth L. Murnane, Scott W. Kurth, Edy S. Liongosari, Rob Miller, David R. Karger. OOPSLA Companion 2008, 775-776. Web SearchBibTeXDownload
147	Improved distance sensitivity oracles via random sampling. Aaron Bernstein, David R. Karger. SODA 2008, 34-43. Web SearchBibTeXDownload
146	Improved approximations for multiprocessor scheduling under uncertainty. Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T. Fineman, David R. Karger, Jacob Scott. SPAA 2008, 246-255. Web SearchBibTeXDownload
145	Inky: a sloppy command line for the web with rich visual feedback. Robert C. Miller, Victoria H. Chou, Michael S. Bernstein, Greg Little, Max Van Kleek, David R. Karger, m. c. schraefel. UIST 2008, 131-140. Web SearchBibTeXDownload
2007
144	Management of personal information scraps. Michael S. Bernstein, Max Van Kleek, m. c. schraefel, David R. Karger. CHI Extended Abstracts 2007, 2285-2290. Web SearchBibTeXDownload
143	Randomized Decoding for Selection-and-Ordering Problems. Pawan Deshpande, Regina Barzilay, David R. Karger. HLT-NAACL 2007, 444-451. Web SearchBibTeXDownload
142	Potluck: Data Mash-Up Tool for Casual Users. David F. Huynh, Robert C. Miller, David R. Karger. ISWC/ASWC 2007, 239-252. Web SearchBibTeXDownload
141	Potluck: Semi-ontology Alignment for Casual Users. David F. Huynh, Robert C. Miller, David R. Karger. ISWC/ASWC 2007, 903-910. Web SearchBibTeXDownload
140	Piggy Bank: Experience the Semantic Web inside your web browser. David Huynh, Stefano Mazzocchi, David R. Karger. J. Web Sem. (5): 16-27 (2007). Web SearchBibTeXDownload
139	Potluck: Semi-Ontology Alignment for Casual Users. David F. Huynh, Robert C. Miller, David R. Karger. Semantic Web Challenge 2007. Web SearchBibTeXDownload
138	Approximation Algorithms for Orienteering and Discounted-Reward TSP. Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff. SIAM J. Comput. (37): 653-670 (2007). Web SearchBibTeXDownload
137	Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems. David R. Karger, Krzysztof Onak. SODA 2007, 1207-1216. Web SearchBibTeXDownload
136	Subjective-cost policy routing. Joan Feigenbaum, David R. Karger, Vahab S. Mirrokni, Rahul Sami. Theor. Comput. Sci. (378): 175-189 (2007). Web SearchBibTeXDownload
135	Gui --- phooey!: the case for text input. Max Van Kleek, Michael S. Bernstein, David R. Karger, m. c. schraefel. UIST 2007, 193-202. Web SearchBibTeXDownload
134	Exhibit: lightweight structured data publishing. David F. Huynh, David R. Karger, Robert C. Miller. WWW 2007, 737-746. Web SearchBibTeXDownload
133	U-REST: an unsupervised record extraction system. Yuan Kui Shen, David R. Karger. WWW 2007, 1347-1348. Web SearchBibTeXDownload
2006
132	Data unification in personal information management. David R. Karger, William Jones. Commun. ACM (49): 77-82 (2006). Web SearchBibTeXDownload
131	On Separation, Randomness and Linearity for Network Codes over Finite Fields. Siddharth Ray, Michelle Effros, Muriel Médard, Ralf Koetter, Tracey Ho, David R. Karger, Jinane Abounadi. CoRR (abs/cs/0603022) (2006). Web SearchBibTeXDownload
130	Optimal Route Planning under Uncertainty. Evdokia Nikolova, Matthew Brand, David R. Karger. ICAPS 2006, 131-141. Web SearchBibTeXDownload
129	A Random Linear Network Coding Approach to Multicast. Tracey Ho, Muriel Médard, Ralf Koetter, David R. Karger, Michelle Effros, Jun Shi, Ben Leong. IEEE Transactions on Information Theory (52): 4413-4430 (2006). Web SearchBibTeXDownload
128	Minimum-cost multicast over coded packet networks. Desmond S. Lun, Niranjan Ratnakar, Muriel Médard, Ralf Koetter, David R. Karger, Tracey Ho, Ebad Ahmed, Fang Zhao. IEEE Transactions on Information Theory (52): 2608-2623 (2006). Web SearchBibTeXDownload
127	Fresnel: A Browser-Independent Presentation Vocabulary for RDF. Emmanuel Pietriga, Christian Bizer, David R. Karger, Ryan Lee. International Semantic Web Conference 2006, 158-171. Web SearchBibTeXDownload
126	Distributed Quota Enforcement for Spam Control. Michael Walfish, J. D. Zamfirescu, Hari Balakrishnan, David R. Karger, Scott Shenker. NSDI 2006. Cited by 22Web SearchBibTeXDownload
125	DDoS defense by offense. Michael Walfish, Mythili Vutukuru, Hari Balakrishnan, David R. Karger, Scott Shenker. SIGCOMM 2006, 303-314. Cited by 84Web SearchBibTeXDownload
124	Less is more: probabilistic models for retrieving fewer relevant documents. Harr Chen, David R. Karger. SIGIR 2006, 429-436. Web SearchBibTeXDownload
123	The complexity of matrix completion. Nicholas J. A. Harvey, David R. Karger, Sergey Yekhanin. SODA 2006, 1103-1111. Web SearchBibTeXDownload
122	Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems. David R. Karger, Matthias Ruhl. Theory Comput. Syst. (39): 787-804 (2006). Web SearchBibTeXDownload
121	Enabling web browsers to augment web sites' filtering and sorting functionalities. David F. Huynh, Robert C. Miller, David R. Karger. UIST 2006, 125-134. Web SearchBibTeXDownload
120	Relo: Helping Users Manage Context during Interactive Exploratory Visualization of Large Codebases. Vineet Sinha, David R. Karger, Rob Miller. VL/HCC 2006, 187-194. Web SearchBibTeXDownload
2005
119	First-price path auctions. Nicole Immorlica, David R. Karger, Evdokia Nikolova, Rahul Sami. ACM Conference on Electronic Commerce 2005, 203-212. Web SearchBibTeXDownload
118	Haystack: A General-Purpose Information Management Tool for End Users Based on Semistructured Data. David R. Karger, Karun Bakshi, David Huynh, Dennis Quan, Vineet Sinha. CIDR 2005, 13-26. Web SearchBibTeXDownload
117	Minimum-Cost Multicast over Coded Packet Networks. Desmond S. Lun, Niranjan Ratnakar, Muriel Médard, Ralf Koetter, David R. Karger, Tracey Ho, Ebad Ahmed, Fang Zhao. CoRR (abs/cs/0503064) (2005). Web SearchBibTeXDownload
116	Relo: helping users manage context during interactive exploratory visualization of large codebases. Vineet Sinha, David R. Karger, Rob Miller. ETX 2005, 21-25. Web SearchBibTeXDownload
115	Toward Using the Network as a Switch: On the Use of TDM in Linear Optical Networks. David R. Karger, Muriel Médard. IEEE Journal on Selected Areas in Communications (23): 1533-1541 (2005). Web SearchBibTeXDownload
114	Using linear programming to Decode Binary linear codes. Jon Feldman, Martin J. Wainwright, David R. Karger. IEEE Transactions on Information Theory (51): 954-972 (2005). Web SearchBibTeXDownload
113	Piggy Bank: Experience the Semantic Web Inside Your Web Browser. David Huynh, Stefano Mazzocchi, David R. Karger. International Semantic Web Conference 2005, 413-430. Web SearchBibTeXDownload
112	Arpeggio: Metadata Searching and Content Sharing with Chord. Austin T. Clements, Dan R. K. Ports, David R. Karger. IPTPS 2005, 58-68. Web SearchBibTeXDownload
111	OverCite: A Cooperative Digital Research Library. Jeremy Stribling, Isaac G. Councill, Jinyang Li, M. Frans Kaashoek, David R. Karger, Robert Morris, Scott Shenker. IPTPS 2005, 69-79. Web SearchBibTeXDownload
110	What would it mean to blog on the semantic web?. David R. Karger, Dennis Quan. J. Web Sem. (3): 147-157 (2005). Web SearchBibTeXDownload
109	Incremental exploratory visualization of relationships in large codebases for program comprehension. Vineet Sinha, Rob Miller, David R. Karger. OOPSLA Companion 2005, 116-117. Web SearchBibTeXDownload
108	Brief announcement: on the expected overpayment of VCG mechanisms in large networks. David R. Karger, Evdokia Nikolova. PODC 2005, 126. Web SearchBibTeXDownload
107	Personalized Semantic Web Application Development by End Users. Karun Bakshi, David R. Karger. Semantic Desktop Workshop 2005. Web SearchBibTeXDownload
106	Magnet: Supporting Navigation in Semistructured Data Environments. Vineet Sinha, David R. Karger. SIGMOD Conference 2005, 97-106. Web SearchBibTeXDownload
105	Deterministic network coding by matrix completion. Nicholas J. A. Harvey, David R. Karger, Kazuo Murota. SODA 2005, 489-498. Web SearchBibTeXDownload
104	Subjective-Cost Policy Routing. Joan Feigenbaum, David R. Karger, Vahab S. Mirrokni, Rahul Sami. WINE 2005, 174-183. Web SearchBibTeXDownload
103	Thresher: automating the unwrapping of semantic content from the World Wide Web. Andrew W. Hogue, David R. Karger. WWW 2005, 86-95. Web SearchBibTeXDownload
2004
102	The perfect search engine is not enough: a study of orienteering behavior in directed search. Jaime Teevan, Christine Alvarado, Mark S. Ackerman, David R. Karger. CHI 2004, 415-422. Web SearchBibTeXDownload
101	Haystack: a user interface for creating, browsing, and organizing arbitrary semistructured information. David R. Karger, Dennis Quan. CHI Extended Abstracts 2004, 777-778. Web SearchBibTeXDownload
100	Collections: flexible, essential tools for information management. David R. Karger, Dennis Quan. CHI Extended Abstracts 2004, 1159-1162. Web SearchBibTeXDownload
99	What Would It Mean to Blog on the Semantic Web?. David R. Karger, Dennis Quan. International Semantic Web Conference 2004, 214-228. Web SearchBibTeXDownload
98	Diminished Chord: A Protocol for Heterogeneous Subgroup Formation in Peer-to-Peer Networks. David R. Karger, Matthias Ruhl. IPTPS 2004, 288-297. Web SearchBibTeXDownload
97	Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems. David R. Karger, Matthias Ruhl. IPTPS 2004, 131-140. Web SearchBibTeXDownload
96	Decoding turbo-like codes via linear programming. Jon Feldman, David R. Karger. J. Comput. Syst. Sci. (68): 733-752 (2004). Web SearchBibTeXDownload
95	Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young. Math. Oper. Res. (29): 436-461 (2004). Web SearchBibTeXDownload
94	On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems. Nicole Immorlica, David R. Karger, Maria Minkoff, Vahab S. Mirrokni. SODA 2004, 691-700. Web SearchBibTeXDownload
93	Simple efficient load balancing algorithms for peer-to-peer systems. David R. Karger, Matthias Ruhl. SPAA 2004, 36-43. Web SearchBibTeXDownload
92	Using urls and table layout for web classification tasks. L. K. Shih, David R. Karger. WWW 2004, 193-202. Web SearchBibTeXDownload
2003
91	The role of context in question answering systems. Jimmy J. Lin, Dennis Quan, Vineet Sinha, Karun Bakshi, David Huynh, Boris Katz, David R. Karger. CHI Extended Abstracts 2003, 1006-1007. Web SearchBibTeXDownload
90	Looking up data in P2P systems. Hari Balakrishnan, M. Frans Kaashoek, David R. Karger, Robert Morris, Ion Stoica. Commun. ACM (46): 43-48 (2003). Cited by 1Web SearchBibTeXDownload
89	Approximation Algorithms for Orienteering and Discounted-Reward TSP. Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff. FOCS 2003, 46-55. Web SearchBibTeXDownload
88	Tackling the Poor Assumptions of Naive Bayes Text Classifiers. Jason D. Rennie, Lawrence Shih, Jaime Teevan, David R. Karger. ICML 2003, 616-623. Web SearchBibTeXDownload
87	Text Bundling: Statistics Based Data-Reduction. Lawrence Shih, Jason D. Rennie, Yu-Han Chang, David R. Karger. ICML 2003, 696-703. Web SearchBibTeXDownload
86	Chord: a scalable peer-to-peer lookup protocol for internet applications. Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M. Frans Kaashoek, Frank Dabek, Hari Balakrishnan. IEEE/ACM Trans. Netw. (11): 17-32 (2003). Cited by 1399Web SearchBibTeXDownload
85	What Makes a Good Answer? The Role of Context in Question Answering. Jimmy J. Lin, Dennis Quan, Vineet Sinha, Karun Bakshi, David Huynh, Boris Katz, David R. Karger. INTERACT 2003. Web SearchBibTeX
84	User Interfaces for Supporting Multiple Categorization. Dennis Quan, Karun Bakshi, David Huynh, David R. Karger. INTERACT 2003. Web SearchBibTeX
83	On the Feasibility of Peer-to-Peer Web Indexing and Search. Jinyang Li, Boon Thau Loo, Joseph M. Hellerstein, M. Frans Kaashoek, David R. Karger, Robert Morris. IPTPS 2003, 207-215. Cited by 257Web SearchBibTeXDownload
82	Koorde: A Simple Degree-Optimal Distributed Hash Table. M. Frans Kaashoek, David R. Karger. IPTPS 2003, 98-107. Web SearchBibTeXDownload
81	Sticky notes for the semantic web. David R. Karger, Boris Katz, Jimmy J. Lin, Dennis Quan. IUI 2003, 254-256. Web SearchBibTeXDownload
80	Haystack: a platform for creating, organizing and visualizing semistructured information. David Huynh, David R. Karger, Dennis Quan, Vineet Sinha. IUI 2003, 323. Web SearchBibTeXDownload
79	Techniques for scheduling with rejection. Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma, Joel Wein. J. Algorithms (49): 175-191 (2003). Web SearchBibTeXDownload
78	Thwarting Web Censorship with Untrusted Messenger Discovery. Nick Feamster, Magdalena Balazinska, Winston Wang, Hari Balakrishnan, David R. Karger. Privacy Enhancing Technologies 2003, 125-140. Cited by 13Web SearchBibTeXDownload
77	Empirical development of an exponential probabilistic model for text retrieval: using textual analysis to build a better model. Jaime Teevan, David R. Karger. SIGIR 2003, 18-25. Web SearchBibTeXDownload
76	User interface continuations. Dennis Quan, David Huynh, David R. Karger, Robert C. Miller. UIST 2003, 145-148. Web SearchBibTeXDownload
75	Assisted Browsing for Semistructured Data. Vineet Sinha, David R. Karger, David Huynh. WWW (Posters) 2003. Web SearchBibTeXDownload
74	Haystack: A Platform for Authoring End User Semantic Web Applications. Dennis Quan, David Huynh, David R. Karger. WWW (Posters) 2003. Web SearchBibTeXDownload
73	A Unified Abstraction for Messaging on the Semantic Web. Dennis Quan, Karun Bakshi, David R. Karger. WWW (Posters) 2003. Web SearchBibTeXDownload
72	User Interaction Experience for Semantic Web Information. David Huynh, Dennis Quan, David R. Karger. WWW (Posters) 2003. Web SearchBibTeXDownload
2002
71	Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs. András A. Benczúr, David R. Karger. CoRR (cs.DS/0207078) (2002). Web SearchBibTeXDownload
70	Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young. CoRR (cs.DS/0205051) (2002). Web SearchBibTeXDownload
69	Decoding Turbo-Like Codes via Linear Programming. Jon Feldman, David R. Karger. FOCS 2002, 251-260. Web SearchBibTeXDownload
68	Observations on the Dynamic Evolution of Peer-to-Peer Networks. David Liben-Nowell, Hari Balakrishnan, David R. Karger. IPTPS 2002, 22-33. Cited by 74Web SearchBibTeXDownload
67	INS/Twine: A Scalable Peer-to-Peer Architecture for Intentional Resource Discovery. Magdalena Balazinska, Hari Balakrishnan, David R. Karger. Pervasive 2002, 195-210. Cited by 268Web SearchBibTeXDownload
66	Analysis of the evolution of peer-to-peer systems. David Liben-Nowell, Hari Balakrishnan, David R. Karger. PODC 2002, 233-242. Cited by 346Web SearchBibTeXDownload
65	Haystack: A Platform for Creating, Organizing and Visualizing Information Using RDF. David Huynh, David R. Karger, Dennis Quan. Semantic Web Workshop 2002. Web SearchBibTeXDownload
64	Random sampling in residual graphs. David R. Karger, Matthew S. Levine. STOC 2002, 63-66. Web SearchBibTeXDownload
63	Finding nearest neighbors in growth-restricted metrics. David R. Karger, Matthias Ruhl. STOC 2002, 741-750. Web SearchBibTeXDownload
62	Infranet: Circumventing Web Censorship and Surveillance. Nick Feamster, Magdalena Balazinska, Greg Harfst, Hari Balakrishnan, David R. Karger. USENIX Security Symposium 2002, 247-262. Cited by 49Web SearchBibTeXDownload
2001
61	An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms. Raj Iyer, David R. Karger, Hariharan Rahul, Mikkel Thorup. ACM Journal of Experimental Algorithmics (6): 4 (2001). Web SearchBibTeXDownload
60	Building peer-to-peer systems with Chord, a distributed lookup service. Frank Dabek, Emma Brunskill, M. Frans Kaashoek, David R. Karger, Robert Morris, Ion Stoica, Hari Balakrishnan. HotOS 2001, 81-86. Cited by 185Web SearchBibTeXDownload
59	Chord: A scalable peer-to-peer lookup service for internet applications. Ion Stoica, Robert Morris, David R. Karger, M. Frans Kaashoek, Hari Balakrishnan. SIGCOMM 2001, 149-160. Cited by 7637Web SearchBibTeXDownload
58	Learning Markov networks: maximum bounded tree-width graphs. David R. Karger, Nathan Srebro. SODA 2001, 392-401. Web SearchBibTeXDownload
57	Parallel processor scheduling with delay constraints. Daniel W. Engels, Jon Feldman, David R. Karger, Matthias Ruhl. SODA 2001, 577-585. Web SearchBibTeXDownload
56	Wide-Area Cooperative Storage with CFS. Frank Dabek, M. Frans Kaashoek, David R. Karger, Robert Morris, Ion Stoica. SOSP 2001, 202-215. Web SearchBibTeXDownload
2000
55	Building Steiner Trees with Incomplete Global Knowledge. David R. Karger, Maria Minkoff. FOCS 2000, 613-623. Web SearchBibTeXDownload
54	Minimum cuts in near-linear time. David R. Karger. J. ACM (47): 46-76 (2000). Web SearchBibTeXDownload
53	Augmenting Undirected Edge Connectivity in Õ(n2) Time. András A. Benczúr, David R. Karger. J. Algorithms (37): 2-36 (2000). Web SearchBibTeXDownload
52	A scalable location service for geographic ad hoc routing. Jinyang Li, John Jannotti, Douglas S. J. De Couto, David R. Karger, Robert Morris. MOBICOM 2000, 120-130. Web SearchBibTeXDownload
1999
51	Haystack: Per-User Information Environments. Eytan Adar, David R. Karger, Lynn Andrea Stein. CIKM 1999, 413-422. Web SearchBibTeXDownload
50	Web Caching with Consistent Hashing. David R. Karger, Alex Sherman, Andy Berkheimer, Bill Bogstad, Rizwan Dhanidina, Ken Iwamoto, Brian Kim, Luke Matkins, Yoav Yerushalmi. Computer Networks (31): 1203-1213 (1999). Web SearchBibTeXDownload
49	Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko. FOCS 1999, 32-44. Cited by 123Web SearchBibTeXDownload
48	Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems. Sanjeev Arora, David R. Karger, Marek Karpinski. J. Comput. Syst. Sci. (58): 193-210 (1999). Web SearchBibTeXDownload
47	Fast Connected Components Algorithms for the EREW PRAM. David R. Karger, Noam Nisan, Michal Parnas. SIAM J. Comput. (28): 1021-1034 (1999). Web SearchBibTeXDownload
46	A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem. David R. Karger. SIAM J. Comput. (29): 492-514 (1999). Web SearchBibTeXDownload
45	Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young. STOC 1999, 668-678. Web SearchBibTeXDownload
1998
44	A Fully Polynomial Randomized Approximation Scheme for the All Terminal Network Reliability Problem. David R. Karger. CoRR (cs.DS/9809012) (1998). Web SearchBibTeXDownload
43	Minimum Cuts in Near-Linear Time. David R. Karger. CoRR (cs.DS/9812007) (1998). Web SearchBibTeXDownload
42	Techniques for Scheduling with Rejection. Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma, Joel Wein. ESA 1998, 490-501. Web SearchBibTeXDownload
41	Approximate Graph Coloring by Semidefinite Programming. David R. Karger, Rajeev Motwani, Madhu Sudan. J. ACM (45): 246-265 (1998). Cited by 338Web SearchBibTeXDownload
40	Random sampling and greedy sparsification for matroid optimization problems. David R. Karger. Math. Program. (82): 41-81 (1998). Web SearchBibTeXDownload
39	Augmenting Undirected Edge Connectivity in Õ(n²) Time. András A. Benczúr, David R. Karger. SODA 1998, 500-509. Web SearchBibTeX
38	Better Random Sampling Algorithms for Flows in Undirected Graphs. David R. Karger. SODA 1998, 490-499. Web SearchBibTeXDownload
37	Augmenting Undirected Edge Connectivity in Õ(n2) Time. András A. Benczúr, David R. Karger. SODA 1998, 500-509. Web SearchBibTeXDownload
36	A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP. Sanjeev Arora, Michelangelo Grigni, David R. Karger, Philip N. Klein, Andrzej Woloszyn. SODA 1998, 33-41. Web SearchBibTeXDownload
35	Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching. David R. Karger, Matthew S. Levine. STOC 1998, 69-78. Web SearchBibTeXDownload
1997
34	On Approximating the Longest Path in a Graph. David R. Karger, Rajeev Motwani, G. D. S. Ramkumar. Algorithmica (18): 82-98 (1997). Cited by 112Web SearchBibTeXDownload
33	An Õ(n^{3/14})-Coloring Algorithm for 3-Colorable Graphs. Avrim Blum, David R. Karger. Inf. Process. Lett. (61): 49-53 (1997). Web SearchBibTeXDownload
32	(De)randomized Construction of Small Sample Spaces in NC. David R. Karger, Daphne Koller. J. Comput. Syst. Sci. (55): 402-413 (1997). Web SearchBibTeXDownload
31	Distributed Job Scheduling in Rings. Perry Fizzano, David R. Karger, Clifford Stein, Joel Wein. J. Parallel Distrib. Comput. (45): 122-133 (1997). Web SearchBibTeXDownload
30	Near-optimal Intraprocedural Branch Alignment. Cliff Young, David S. Johnson, David R. Karger, Michael D. Smith. PLDI 1997, 183-193. Web SearchBibTeXDownload
29	An NC Algorithm for Minimum Cuts. David R. Karger, Rajeev Motwani. SIAM J. Comput. (26): 255-272 (1997). Cited by 21Web SearchBibTeXDownload
28	Implementing a Fully Polynomial Time Approximation Scheme for All Terminal Network Reliability. David R. Karger, Ray P. Tai. SODA 1997, 334-343. Web SearchBibTeXDownload
27	Experimental Study of Minimum Cut Algorithms. Chandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein. SODA 1997, 324-333. Web SearchBibTeXDownload
26	Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web. David R. Karger, Eric Lehman, Frank Thomson Leighton, Rina Panigrahy, Matthew S. Levine, Daniel Lewin. STOC 1997, 654-663. Web SearchBibTeXDownload
25	Using Random Sampling to Find Maximum Flows in Uncapacitated Undirected Graphs. David R. Karger. STOC 1997, 240-249. Web SearchBibTeXDownload
1996
24	A New Approach to the Minimum Cut Problem. David R. Karger, Clifford Stein. J. ACM (43): 601-640 (1996). Web SearchBibTeXDownload
23	A Better Algorithm for an Ancient Scheduling Problem. David R. Karger, Steven J. Phillips, Eric Torng. J. Algorithms (20): 400-430 (1996). Web SearchBibTeXDownload
22	Approximating s-t Minimum Cuts in Õ(n2) Time. András A. Benczúr, David R. Karger. STOC 1996, 47-55. Web SearchBibTeXDownload
21	Minimum Cuts in Near-Linear Time. David R. Karger. STOC 1996, 56-63. Web SearchBibTeXDownload
1995
20	Prim-Dijkstra tradeoffs for improved performance-driven routing tree design. Charles J. Alpert, T. C. Hu, Dennis J.-H. Huang, Andrew B. Kahng, David R. Karger. IEEE Trans. on CAD of Integrated Circuits and Systems (14): 890-896 (1995). Web SearchBibTeXDownload
19	A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees. David R. Karger, Philip N. Klein, Robert Endre Tarjan. J. ACM (42): 321-328 (1995). Web SearchBibTeXDownload
18	Polynomial time approximation schemes for dense instances of NP-hard problems. Sanjeev Arora, David R. Karger, Marek Karpinski. STOC 1995, 284-293. Web SearchBibTeXDownload
17	Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows. David R. Karger, Serge A. Plotkin. STOC 1995, 18-25. Web SearchBibTeXDownload
16	A randomized fully polynomial time approximation scheme for the all terminal network reliability problem. David R. Karger. STOC 1995, 11-17. Web SearchBibTeXDownload
1994
15	Approximate Graph Coloring by Semidefinite Programming. David R. Karger, Rajeev Motwani, Madhu Sudan. FOCS 1994, 2-13. Cited by 338Web SearchBibTeXDownload
14	(De)randomized Construction of Small Sample Spaces in \\calNC. David R. Karger, Daphne Koller. FOCS 1994, 252-263. Web SearchBibTeXDownload
13	Using Randomized Sparsification to Approximate Minimum Cuts. David R. Karger. SODA 1994, 424-432. Web SearchBibTeXDownload
12	A Better Algorithm for an Ancient Scheduling Problem. David R. Karger, Steven J. Phillips, Eric Torng. SODA 1994, 132-140. Web SearchBibTeXDownload
11	Job Scheduling in Rings. Perry Fizzano, David R. Karger, Clifford Stein, Joel Wein. SPAA 1994, 210-219. Web SearchBibTeXDownload
10	Random sampling in cut, flow, and network design problems. David R. Karger. STOC 1994, 648-657. Web SearchBibTeXDownload
1993
9	Random Sampling in Matroids, with Applications to Graph Connectivity and Minimum Spanning Trees. David R. Karger. FOCS 1993, 84-93. Web SearchBibTeXDownload
8	Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths. David R. Karger, Daphne Koller, Steven J. Phillips. SIAM J. Comput. (22): 1199-1217 (1993). Web SearchBibTeXDownload
7	Constant Interaction-Time Scatter/Gather Browsing of Very Large Document Collections. Douglas R. Cutting, David R. Karger, Jan O. Pedersen. SIGIR 1993, 126-134. Web SearchBibTeXDownload
6	Global Min-cuts in RNC, and Other Ramifications of a Simple Min-Cut Algorithm. David R. Karger. SODA 1993, 21-30. Web SearchBibTeXDownload
5	An O~(n2) algorithm for minimum cuts. David R. Karger, Clifford Stein. STOC 1993, 757-765. Web SearchBibTeXDownload
4	On Approximating the Longest Path in a Graph (Preliminary Version). David R. Karger, Rajeev Motwani, G. D. S. Ramkumar. WADS 1993, 421-432. Web SearchBibTeXDownload
1992
3	Scatter/Gather: A Cluster-based Approach to Browsing Large Document Collections. Douglas R. Cutting, Jan O. Pedersen, David R. Karger, John W. Tukey. SIGIR 1992, 318-329. Web SearchBibTeXDownload
2	Fast Connected Components Algorithms for the EREW PRAM. David R. Karger, Noam Nisan, Michal Parnas. SPAA 1992, 373-381. Web SearchBibTeXDownload
1991
1	Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths. David R. Karger, Daphne Koller, Steven J. Phillips. FOCS 1991, 560-568. Web SearchBibTeXDownload

2012

189

Successful classroom deployment of a social document annotation system. Sacha Zyto, David R. Karger, Mark S. Ackerman, Sanjoy Mahajan. CHI 2012, 1883-1892. Web SearchBibTeXDownload

188

Reject me: peer review and SIGCHI. Michael S. Bernstein, Dan Cosley, Carl DiSalvo, Sanjay Kairam, David R. Karger, Travis Kriplean, Cliff Lampe, Wendy E. Mackay, Loren G. Terveen, Jacob O. Wobbrock, Sarita Yardi. CHI Extended Abstracts 2012, 1197-1200. Web SearchBibTeXDownload

187

Analytic Methods for Optimizing Realtime Crowdsourcing. Michael S. Bernstein, David R. Karger, Robert C. Miller, Joel Brandt. CoRR (abs/1204.2995) (2012). Web SearchBibTeXDownload

186

Tie strength in question & answer on social network sites. Katrina Panovich, Rob Miller, David R. Karger. CSCW 2012, 1057-1066. Web SearchBibTeXDownload

185

Sorting it All Out with Humans in the Loop. Adam Marcus, Eugene Wu, David R. Karger, Samuel Madden, Rob Miller. TinyToCS (1) (2012). Web SearchBibTeXDownload

2011

184

Twitinfo: aggregating and visualizing microblogs for event exploration. Adam Marcus, Michael S. Bernstein, Osama Badar, David R. Karger, Samuel Madden, Robert C. Miller. CHI 2011, 227-236. Web SearchBibTeXDownload

183

A spreadsheet-based user interface for managing plural relationships in structured data. Eirik Bakke, David R. Karger, Rob Miller. CHI 2011, 2541-2550. Web SearchBibTeXDownload

182

Finders/keepers: a longitudinal study of people managing information scraps in a micro-note tool. Max Van Kleek, Wolfe Styke, m. c. schraefel, David R. Karger. CHI 2011, 2907-2916. Web SearchBibTeXDownload

181

Creating user interfaces that entice people to manage better information. David R. Karger. CIKM 2011, 1-2. Web SearchBibTeXDownload

180

Faster Information Dissemination in Dynamic Networks via Network Coding. Bernhard Haeupler, David R. Karger. CoRR (abs/1104.2527) (2011). Web SearchBibTeXDownload

179

Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems. David R. Karger, Sewoong Oh, Devavrat Shah. CoRR (abs/1110.3564) (2011). Web SearchBibTeXDownload

178

Linear-Time Poisson-Disk Patterns. Thouis R. Jones, David R. Karger. CoRR (abs/1107.3013) (2011). Web SearchBibTeXDownload

177

Iterative Learning for Reliable Crowdsourcing Systems. David R. Karger, Sewoong Oh, Devavrat Shah. NIPS 2011, 1953-1961. Web SearchBibTeXDownload

176

Faster information dissemination in dynamic networks via network coding. Bernhard Haeupler, David R. Karger. PODC 2011, 381-390. Web SearchBibTeXDownload

175

Human-powered Sorts and Joins. Adam Marcus, Eugene Wu, David R. Karger, Samuel Madden, Robert C. Miller. PVLDB (5): 13-24 (2011). Web SearchBibTeXDownload

174

Tweets as data: demonstration of TweeQL and Twitinfo. Adam Marcus, Michael S. Bernstein, Osama Badar, David R. Karger, Samuel Madden, Robert C. Miller. SIGMOD Conference 2011, 1259-1262. Web SearchBibTeXDownload

173

Demonstration of Qurk: a query processor for humanoperators. Adam Marcus, Eugene Wu, David R. Karger, Samuel Madden, Robert C. Miller. SIGMOD Conference 2011, 1315-1318. Web SearchBibTeXDownload

172

Processing and visualizing the data in tweets. Adam Marcus, Michael S. Bernstein, Osama Badar, David R. Karger, Samuel Madden, Robert C. Miller. SIGMOD Record (40): 21-27 (2011). Web SearchBibTeXDownload

171

Crowds in two seconds: enabling realtime crowd-powered interfaces. Michael S. Bernstein, Joel Brandt, Robert C. Miller, David R. Karger. UIST 2011, 33-42. Web SearchBibTeXDownload

2010

170

DDoS defense by offense. Michael Walfish, Mythili Vutukuru, Hari Balakrishnan, David R. Karger, Scott Shenker. ACM Trans. Comput. Syst. (28) (2010). Cited by 84Web SearchBibTeXDownload

169

Enhancing directed content sharing on the web. Michael S. Bernstein, Adam Marcus, David R. Karger, Robert C. Miller. CHI 2010, 971-980. Web SearchBibTeXDownload

168

Eyebrowse: real-time web activity sharing and visualization. Max Van Kleek, Brennan Moore, Christina Xu, David R. Karger. CHI Extended Abstracts 2010, 3643-3648. Web SearchBibTeXDownload

167

Breaking local symmetries can dramatically reduce the length of propositional refutations. Shir Ben-Israel, Eli Ben-Sasson, David R. Karger. Electronic Colloquium on Computational Complexity (ECCC) (17): 68 (2010). Web SearchBibTeXDownload

166

Talking about Data: Sharing Richly Structured Information through Blogs and Wikis. Edward Benson, Adam Marcus, Fabian Howahl, David R. Karger. International Semantic Web Conference (1) 2010, 48-63. Web SearchBibTeXDownload

165

Soylent: a word processor with a crowd inside. Michael S. Bernstein, Greg Little, Robert C. Miller, Björn Hartmann, Mark S. Ackerman, David R. Karger, David Crowell, Katrina Panovich. UIST 2010, 313-322. Web SearchBibTeXDownload

164

Atomate it! end-user context-sensitive automation using heterogeneous information sources on the web. Max Van Kleek, Brennan Moore, David R. Karger, Paul André, m. c. schraefel. WWW 2010, 951-960. Web SearchBibTeXDownload

163

Sync kit: a persistent client-side database caching toolkit for data intensive websites. Edward Benson, Adam Marcus, David R. Karger, Samuel Madden. WWW 2010, 121-130. Web SearchBibTeXDownload

162

Talking about data: sharing richly structured information through blogs and wikis. Edward Benson, Adam Marcus, Fabian Howahl, David R. Karger. WWW 2010, 1057-1058. Web SearchBibTeXDownload

2009

161

Note to self: examining personal information keeping in a lightweight note-taking tool. Max Van Kleek, Michael S. Bernstein, Katrina Panovich, Gregory G. Vargas, David R. Karger, Monica M. C. Schraefel. CHI 2009, 1477-1480. Web SearchBibTeXDownload

160

Scaling all-pairs overlay routing. David Sontag, Yang Zhang, Amar Phanishayee, David G. Andersen, David Karger. CoNEXT 2009, 145-156. Web SearchBibTeXDownload

159

Global Models of Document Structure using Latent Permutations. Harr Chen, S. R. K. Branavan, Regina Barzilay, David R. Karger. HLT-NAACL 2009, 371-379. Web SearchBibTeXDownload

158

Content Modeling Using Latent Permutations. Harr Chen, S. R. K. Branavan, Regina Barzilay, David R. Karger. J. Artif. Intell. Res. (JAIR) (36): 129-163 (2009). Web SearchBibTeXDownload

157

A near-linear time algorithm for constructing a cactus representation of minimum cuts. David R. Karger, Debmalya Panigrahi. SODA 2009, 246-255. Web SearchBibTeXDownload

156

A nearly optimal oracle for avoiding failed vertices and edges. Aaron Bernstein, David R. Karger. STOC 2009, 101-110. Web SearchBibTeXDownload

155

The web page as a WYSIWYG end-user customizable database-backed information management application. David R. Karger, Scott Ostler, Ryan Lee. UIST 2009, 257-260. Web SearchBibTeXDownload

2008

154

Route Planning under Uncertainty: The Canadian Traveller Problem. Evdokia Nikolova, David R. Karger. AAAI 2008, 969-974. Web SearchBibTeXDownload

153

Information scraps: How and why information eludes our personal information management tools. Michael S. Bernstein, Max Van Kleek, David R. Karger, m. c. schraefel. ACM Trans. Inf. Syst. (26) (2008). Web SearchBibTeXDownload

152

Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP. David R. Karger, Jacob Scott. APPROX-RANDOM 2008, 104-117. Web SearchBibTeXDownload

151

Improved Approximations for Multiprocessor Scheduling Under Uncertainty. Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T. Fineman, David R. Karger, Jacob Scott. CoRR (abs/0802.2418) (2008). Web SearchBibTeXDownload

150

Byzantine Modification Detection in Multicast Networks With Random Network Coding. Tracey Ho, Ben Leong, Ralf Koetter, Muriel Médard, Michelle Effros, David R. Karger. IEEE Transactions on Information Theory (54): 2798-2803 (2008). Web SearchBibTeXDownload

149

Potluck: Data mash-up tool for casual users. David F. Huynh, Robert C. Miller, David R. Karger. J. Web Sem. (6): 274-282 (2008). Web SearchBibTeXDownload

148

Understanding code architectures via interactive exploration and layout of layered diagrams. Vineet Sinha, Elizabeth L. Murnane, Scott W. Kurth, Edy S. Liongosari, Rob Miller, David R. Karger. OOPSLA Companion 2008, 775-776. Web SearchBibTeXDownload

147

Improved distance sensitivity oracles via random sampling. Aaron Bernstein, David R. Karger. SODA 2008, 34-43. Web SearchBibTeXDownload

146

Improved approximations for multiprocessor scheduling under uncertainty. Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T. Fineman, David R. Karger, Jacob Scott. SPAA 2008, 246-255. Web SearchBibTeXDownload

145

Inky: a sloppy command line for the web with rich visual feedback. Robert C. Miller, Victoria H. Chou, Michael S. Bernstein, Greg Little, Max Van Kleek, David R. Karger, m. c. schraefel. UIST 2008, 131-140. Web SearchBibTeXDownload

2007

144

Management of personal information scraps. Michael S. Bernstein, Max Van Kleek, m. c. schraefel, David R. Karger. CHI Extended Abstracts 2007, 2285-2290. Web SearchBibTeXDownload

143

Randomized Decoding for Selection-and-Ordering Problems. Pawan Deshpande, Regina Barzilay, David R. Karger. HLT-NAACL 2007, 444-451. Web SearchBibTeXDownload

142

Potluck: Data Mash-Up Tool for Casual Users. David F. Huynh, Robert C. Miller, David R. Karger. ISWC/ASWC 2007, 239-252. Web SearchBibTeXDownload

141

Potluck: Semi-ontology Alignment for Casual Users. David F. Huynh, Robert C. Miller, David R. Karger. ISWC/ASWC 2007, 903-910. Web SearchBibTeXDownload

140

Piggy Bank: Experience the Semantic Web inside your web browser. David Huynh, Stefano Mazzocchi, David R. Karger. J. Web Sem. (5): 16-27 (2007). Web SearchBibTeXDownload

139

Potluck: Semi-Ontology Alignment for Casual Users. David F. Huynh, Robert C. Miller, David R. Karger. Semantic Web Challenge 2007. Web SearchBibTeXDownload

138

Approximation Algorithms for Orienteering and Discounted-Reward TSP. Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff. SIAM J. Comput. (37): 653-670 (2007). Web SearchBibTeXDownload

137

Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems. David R. Karger, Krzysztof Onak. SODA 2007, 1207-1216. Web SearchBibTeXDownload

136

Subjective-cost policy routing. Joan Feigenbaum, David R. Karger, Vahab S. Mirrokni, Rahul Sami. Theor. Comput. Sci. (378): 175-189 (2007). Web SearchBibTeXDownload

135

Gui --- phooey!: the case for text input. Max Van Kleek, Michael S. Bernstein, David R. Karger, m. c. schraefel. UIST 2007, 193-202. Web SearchBibTeXDownload

134

Exhibit: lightweight structured data publishing. David F. Huynh, David R. Karger, Robert C. Miller. WWW 2007, 737-746. Web SearchBibTeXDownload

133

U-REST: an unsupervised record extraction system. Yuan Kui Shen, David R. Karger. WWW 2007, 1347-1348. Web SearchBibTeXDownload

2006

132

Data unification in personal information management. David R. Karger, William Jones. Commun. ACM (49): 77-82 (2006). Web SearchBibTeXDownload

131

On Separation, Randomness and Linearity for Network Codes over Finite Fields. Siddharth Ray, Michelle Effros, Muriel Médard, Ralf Koetter, Tracey Ho, David R. Karger, Jinane Abounadi. CoRR (abs/cs/0603022) (2006). Web SearchBibTeXDownload

130

Optimal Route Planning under Uncertainty. Evdokia Nikolova, Matthew Brand, David R. Karger. ICAPS 2006, 131-141. Web SearchBibTeXDownload

129

A Random Linear Network Coding Approach to Multicast. Tracey Ho, Muriel Médard, Ralf Koetter, David R. Karger, Michelle Effros, Jun Shi, Ben Leong. IEEE Transactions on Information Theory (52): 4413-4430 (2006). Web SearchBibTeXDownload

128

Minimum-cost multicast over coded packet networks. Desmond S. Lun, Niranjan Ratnakar, Muriel Médard, Ralf Koetter, David R. Karger, Tracey Ho, Ebad Ahmed, Fang Zhao. IEEE Transactions on Information Theory (52): 2608-2623 (2006). Web SearchBibTeXDownload

127

Fresnel: A Browser-Independent Presentation Vocabulary for RDF. Emmanuel Pietriga, Christian Bizer, David R. Karger, Ryan Lee. International Semantic Web Conference 2006, 158-171. Web SearchBibTeXDownload

126

Distributed Quota Enforcement for Spam Control. Michael Walfish, J. D. Zamfirescu, Hari Balakrishnan, David R. Karger, Scott Shenker. NSDI 2006. Cited by 22Web SearchBibTeXDownload

125

DDoS defense by offense. Michael Walfish, Mythili Vutukuru, Hari Balakrishnan, David R. Karger, Scott Shenker. SIGCOMM 2006, 303-314. Cited by 84Web SearchBibTeXDownload

124

Less is more: probabilistic models for retrieving fewer relevant documents. Harr Chen, David R. Karger. SIGIR 2006, 429-436. Web SearchBibTeXDownload

123

The complexity of matrix completion. Nicholas J. A. Harvey, David R. Karger, Sergey Yekhanin. SODA 2006, 1103-1111. Web SearchBibTeXDownload

122

Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems. David R. Karger, Matthias Ruhl. Theory Comput. Syst. (39): 787-804 (2006). Web SearchBibTeXDownload

121

Enabling web browsers to augment web sites' filtering and sorting functionalities. David F. Huynh, Robert C. Miller, David R. Karger. UIST 2006, 125-134. Web SearchBibTeXDownload

120

Relo: Helping Users Manage Context during Interactive Exploratory Visualization of Large Codebases. Vineet Sinha, David R. Karger, Rob Miller. VL/HCC 2006, 187-194. Web SearchBibTeXDownload

2005

119

First-price path auctions. Nicole Immorlica, David R. Karger, Evdokia Nikolova, Rahul Sami. ACM Conference on Electronic Commerce 2005, 203-212. Web SearchBibTeXDownload

118

Haystack: A General-Purpose Information Management Tool for End Users Based on Semistructured Data. David R. Karger, Karun Bakshi, David Huynh, Dennis Quan, Vineet Sinha. CIDR 2005, 13-26. Web SearchBibTeXDownload

117

Minimum-Cost Multicast over Coded Packet Networks. Desmond S. Lun, Niranjan Ratnakar, Muriel Médard, Ralf Koetter, David R. Karger, Tracey Ho, Ebad Ahmed, Fang Zhao. CoRR (abs/cs/0503064) (2005). Web SearchBibTeXDownload

116

Relo: helping users manage context during interactive exploratory visualization of large codebases. Vineet Sinha, David R. Karger, Rob Miller. ETX 2005, 21-25. Web SearchBibTeXDownload

115

Toward Using the Network as a Switch: On the Use of TDM in Linear Optical Networks. David R. Karger, Muriel Médard. IEEE Journal on Selected Areas in Communications (23): 1533-1541 (2005). Web SearchBibTeXDownload

114

Using linear programming to Decode Binary linear codes. Jon Feldman, Martin J. Wainwright, David R. Karger. IEEE Transactions on Information Theory (51): 954-972 (2005). Web SearchBibTeXDownload

113

Piggy Bank: Experience the Semantic Web Inside Your Web Browser. David Huynh, Stefano Mazzocchi, David R. Karger. International Semantic Web Conference 2005, 413-430. Web SearchBibTeXDownload

112

Arpeggio: Metadata Searching and Content Sharing with Chord. Austin T. Clements, Dan R. K. Ports, David R. Karger. IPTPS 2005, 58-68. Web SearchBibTeXDownload

111

OverCite: A Cooperative Digital Research Library. Jeremy Stribling, Isaac G. Councill, Jinyang Li, M. Frans Kaashoek, David R. Karger, Robert Morris, Scott Shenker. IPTPS 2005, 69-79. Web SearchBibTeXDownload

110

What would it mean to blog on the semantic web?. David R. Karger, Dennis Quan. J. Web Sem. (3): 147-157 (2005). Web SearchBibTeXDownload

109

Incremental exploratory visualization of relationships in large codebases for program comprehension. Vineet Sinha, Rob Miller, David R. Karger. OOPSLA Companion 2005, 116-117. Web SearchBibTeXDownload

108

Brief announcement: on the expected overpayment of VCG mechanisms in large networks. David R. Karger, Evdokia Nikolova. PODC 2005, 126. Web SearchBibTeXDownload

107

Personalized Semantic Web Application Development by End Users. Karun Bakshi, David R. Karger. Semantic Desktop Workshop 2005. Web SearchBibTeXDownload

106

Magnet: Supporting Navigation in Semistructured Data Environments. Vineet Sinha, David R. Karger. SIGMOD Conference 2005, 97-106. Web SearchBibTeXDownload

105

Deterministic network coding by matrix completion. Nicholas J. A. Harvey, David R. Karger, Kazuo Murota. SODA 2005, 489-498. Web SearchBibTeXDownload

104

Subjective-Cost Policy Routing. Joan Feigenbaum, David R. Karger, Vahab S. Mirrokni, Rahul Sami. WINE 2005, 174-183. Web SearchBibTeXDownload

103

Thresher: automating the unwrapping of semantic content from the World Wide Web. Andrew W. Hogue, David R. Karger. WWW 2005, 86-95. Web SearchBibTeXDownload

2004

102

The perfect search engine is not enough: a study of orienteering behavior in directed search. Jaime Teevan, Christine Alvarado, Mark S. Ackerman, David R. Karger. CHI 2004, 415-422. Web SearchBibTeXDownload

101

Haystack: a user interface for creating, browsing, and organizing arbitrary semistructured information. David R. Karger, Dennis Quan. CHI Extended Abstracts 2004, 777-778. Web SearchBibTeXDownload

100

Collections: flexible, essential tools for information management. David R. Karger, Dennis Quan. CHI Extended Abstracts 2004, 1159-1162. Web SearchBibTeXDownload

What Would It Mean to Blog on the Semantic Web?. David R. Karger, Dennis Quan. International Semantic Web Conference 2004, 214-228. Web SearchBibTeXDownload

Diminished Chord: A Protocol for Heterogeneous Subgroup Formation in Peer-to-Peer Networks. David R. Karger, Matthias Ruhl. IPTPS 2004, 288-297. Web SearchBibTeXDownload

Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems. David R. Karger, Matthias Ruhl. IPTPS 2004, 131-140. Web SearchBibTeXDownload

Decoding turbo-like codes via linear programming. Jon Feldman, David R. Karger. J. Comput. Syst. Sci. (68): 733-752 (2004). Web SearchBibTeXDownload

Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young. Math. Oper. Res. (29): 436-461 (2004). Web SearchBibTeXDownload

On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems. Nicole Immorlica, David R. Karger, Maria Minkoff, Vahab S. Mirrokni. SODA 2004, 691-700. Web SearchBibTeXDownload

Simple efficient load balancing algorithms for peer-to-peer systems. David R. Karger, Matthias Ruhl. SPAA 2004, 36-43. Web SearchBibTeXDownload

Using urls and table layout for web classification tasks. L. K. Shih, David R. Karger. WWW 2004, 193-202. Web SearchBibTeXDownload

2003

The role of context in question answering systems. Jimmy J. Lin, Dennis Quan, Vineet Sinha, Karun Bakshi, David Huynh, Boris Katz, David R. Karger. CHI Extended Abstracts 2003, 1006-1007. Web SearchBibTeXDownload

Looking up data in P2P systems. Hari Balakrishnan, M. Frans Kaashoek, David R. Karger, Robert Morris, Ion Stoica. Commun. ACM (46): 43-48 (2003). Cited by 1Web SearchBibTeXDownload

Approximation Algorithms for Orienteering and Discounted-Reward TSP. Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, Maria Minkoff. FOCS 2003, 46-55. Web SearchBibTeXDownload

Tackling the Poor Assumptions of Naive Bayes Text Classifiers. Jason D. Rennie, Lawrence Shih, Jaime Teevan, David R. Karger. ICML 2003, 616-623. Web SearchBibTeXDownload

Text Bundling: Statistics Based Data-Reduction. Lawrence Shih, Jason D. Rennie, Yu-Han Chang, David R. Karger. ICML 2003, 696-703. Web SearchBibTeXDownload

Chord: a scalable peer-to-peer lookup protocol for internet applications. Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M. Frans Kaashoek, Frank Dabek, Hari Balakrishnan. IEEE/ACM Trans. Netw. (11): 17-32 (2003). Cited by 1399Web SearchBibTeXDownload

What Makes a Good Answer? The Role of Context in Question Answering. Jimmy J. Lin, Dennis Quan, Vineet Sinha, Karun Bakshi, David Huynh, Boris Katz, David R. Karger. INTERACT 2003. Web SearchBibTeX

User Interfaces for Supporting Multiple Categorization. Dennis Quan, Karun Bakshi, David Huynh, David R. Karger. INTERACT 2003. Web SearchBibTeX

On the Feasibility of Peer-to-Peer Web Indexing and Search. Jinyang Li, Boon Thau Loo, Joseph M. Hellerstein, M. Frans Kaashoek, David R. Karger, Robert Morris. IPTPS 2003, 207-215. Cited by 257Web SearchBibTeXDownload

Koorde: A Simple Degree-Optimal Distributed Hash Table. M. Frans Kaashoek, David R. Karger. IPTPS 2003, 98-107. Web SearchBibTeXDownload

Sticky notes for the semantic web. David R. Karger, Boris Katz, Jimmy J. Lin, Dennis Quan. IUI 2003, 254-256. Web SearchBibTeXDownload

Haystack: a platform for creating, organizing and visualizing semistructured information. David Huynh, David R. Karger, Dennis Quan, Vineet Sinha. IUI 2003, 323. Web SearchBibTeXDownload

Techniques for scheduling with rejection. Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma, Joel Wein. J. Algorithms (49): 175-191 (2003). Web SearchBibTeXDownload

Thwarting Web Censorship with Untrusted Messenger Discovery. Nick Feamster, Magdalena Balazinska, Winston Wang, Hari Balakrishnan, David R. Karger. Privacy Enhancing Technologies 2003, 125-140. Cited by 13Web SearchBibTeXDownload

Empirical development of an exponential probabilistic model for text retrieval: using textual analysis to build a better model. Jaime Teevan, David R. Karger. SIGIR 2003, 18-25. Web SearchBibTeXDownload

User interface continuations. Dennis Quan, David Huynh, David R. Karger, Robert C. Miller. UIST 2003, 145-148. Web SearchBibTeXDownload

Assisted Browsing for Semistructured Data. Vineet Sinha, David R. Karger, David Huynh. WWW (Posters) 2003. Web SearchBibTeXDownload

Haystack: A Platform for Authoring End User Semantic Web Applications. Dennis Quan, David Huynh, David R. Karger. WWW (Posters) 2003. Web SearchBibTeXDownload

A Unified Abstraction for Messaging on the Semantic Web. Dennis Quan, Karun Bakshi, David R. Karger. WWW (Posters) 2003. Web SearchBibTeXDownload

User Interaction Experience for Semantic Web Information. David Huynh, Dennis Quan, David R. Karger. WWW (Posters) 2003. Web SearchBibTeXDownload

2002

Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs. András A. Benczúr, David R. Karger. CoRR (cs.DS/0207078) (2002). Web SearchBibTeXDownload

Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young. CoRR (cs.DS/0205051) (2002). Web SearchBibTeXDownload

Decoding Turbo-Like Codes via Linear Programming. Jon Feldman, David R. Karger. FOCS 2002, 251-260. Web SearchBibTeXDownload

Observations on the Dynamic Evolution of Peer-to-Peer Networks. David Liben-Nowell, Hari Balakrishnan, David R. Karger. IPTPS 2002, 22-33. Cited by 74Web SearchBibTeXDownload

INS/Twine: A Scalable Peer-to-Peer Architecture for Intentional Resource Discovery. Magdalena Balazinska, Hari Balakrishnan, David R. Karger. Pervasive 2002, 195-210. Cited by 268Web SearchBibTeXDownload

Analysis of the evolution of peer-to-peer systems. David Liben-Nowell, Hari Balakrishnan, David R. Karger. PODC 2002, 233-242. Cited by 346Web SearchBibTeXDownload

Haystack: A Platform for Creating, Organizing and Visualizing Information Using RDF. David Huynh, David R. Karger, Dennis Quan. Semantic Web Workshop 2002. Web SearchBibTeXDownload

Random sampling in residual graphs. David R. Karger, Matthew S. Levine. STOC 2002, 63-66. Web SearchBibTeXDownload

Finding nearest neighbors in growth-restricted metrics. David R. Karger, Matthias Ruhl. STOC 2002, 741-750. Web SearchBibTeXDownload

Infranet: Circumventing Web Censorship and Surveillance. Nick Feamster, Magdalena Balazinska, Greg Harfst, Hari Balakrishnan, David R. Karger. USENIX Security Symposium 2002, 247-262. Cited by 49Web SearchBibTeXDownload

2001

An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms. Raj Iyer, David R. Karger, Hariharan Rahul, Mikkel Thorup. ACM Journal of Experimental Algorithmics (6): 4 (2001). Web SearchBibTeXDownload

Building peer-to-peer systems with Chord, a distributed lookup service. Frank Dabek, Emma Brunskill, M. Frans Kaashoek, David R. Karger, Robert Morris, Ion Stoica, Hari Balakrishnan. HotOS 2001, 81-86. Cited by 185Web SearchBibTeXDownload

Chord: A scalable peer-to-peer lookup service for internet applications. Ion Stoica, Robert Morris, David R. Karger, M. Frans Kaashoek, Hari Balakrishnan. SIGCOMM 2001, 149-160. Cited by 7637Web SearchBibTeXDownload

Learning Markov networks: maximum bounded tree-width graphs. David R. Karger, Nathan Srebro. SODA 2001, 392-401. Web SearchBibTeXDownload

Parallel processor scheduling with delay constraints. Daniel W. Engels, Jon Feldman, David R. Karger, Matthias Ruhl. SODA 2001, 577-585. Web SearchBibTeXDownload

Wide-Area Cooperative Storage with CFS. Frank Dabek, M. Frans Kaashoek, David R. Karger, Robert Morris, Ion Stoica. SOSP 2001, 202-215. Web SearchBibTeXDownload

2000

Building Steiner Trees with Incomplete Global Knowledge. David R. Karger, Maria Minkoff. FOCS 2000, 613-623. Web SearchBibTeXDownload

Minimum cuts in near-linear time. David R. Karger. J. ACM (47): 46-76 (2000). Web SearchBibTeXDownload

Augmenting Undirected Edge Connectivity in Õ(n2) Time. András A. Benczúr, David R. Karger. J. Algorithms (37): 2-36 (2000). Web SearchBibTeXDownload

A scalable location service for geographic ad hoc routing. Jinyang Li, John Jannotti, Douglas S. J. De Couto, David R. Karger, Robert Morris. MOBICOM 2000, 120-130. Web SearchBibTeXDownload

1999

Haystack: Per-User Information Environments. Eytan Adar, David R. Karger, Lynn Andrea Stein. CIKM 1999, 413-422. Web SearchBibTeXDownload

Web Caching with Consistent Hashing. David R. Karger, Alex Sherman, Andy Berkheimer, Bill Bogstad, Rizwan Dhanidina, Ken Iwamoto, Brian Kim, Luke Matkins, Yoav Yerushalmi. Computer Networks (31): 1203-1213 (1999). Web SearchBibTeXDownload

Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko. FOCS 1999, 32-44. Cited by 123Web SearchBibTeXDownload

Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems. Sanjeev Arora, David R. Karger, Marek Karpinski. J. Comput. Syst. Sci. (58): 193-210 (1999). Web SearchBibTeXDownload

Fast Connected Components Algorithms for the EREW PRAM. David R. Karger, Noam Nisan, Michal Parnas. SIAM J. Comput. (28): 1021-1034 (1999). Web SearchBibTeXDownload

A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem. David R. Karger. SIAM J. Comput. (29): 492-514 (1999). Web SearchBibTeXDownload

Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut. David R. Karger, Philip N. Klein, Clifford Stein, Mikkel Thorup, Neal E. Young. STOC 1999, 668-678. Web SearchBibTeXDownload

1998

A Fully Polynomial Randomized Approximation Scheme for the All Terminal Network Reliability Problem. David R. Karger. CoRR (cs.DS/9809012) (1998). Web SearchBibTeXDownload

Minimum Cuts in Near-Linear Time. David R. Karger. CoRR (cs.DS/9812007) (1998). Web SearchBibTeXDownload

Techniques for Scheduling with Rejection. Daniel W. Engels, David R. Karger, Stavros G. Kolliopoulos, Sudipta Sengupta, R. N. Uma, Joel Wein. ESA 1998, 490-501. Web SearchBibTeXDownload

Approximate Graph Coloring by Semidefinite Programming. David R. Karger, Rajeev Motwani, Madhu Sudan. J. ACM (45): 246-265 (1998). Cited by 338Web SearchBibTeXDownload

Random sampling and greedy sparsification for matroid optimization problems. David R. Karger. Math. Program. (82): 41-81 (1998). Web SearchBibTeXDownload

Augmenting Undirected Edge Connectivity in Õ(n²) Time. András A. Benczúr, David R. Karger. SODA 1998, 500-509. Web SearchBibTeX

Better Random Sampling Algorithms for Flows in Undirected Graphs. David R. Karger. SODA 1998, 490-499. Web SearchBibTeXDownload

Augmenting Undirected Edge Connectivity in Õ(n2) Time. András A. Benczúr, David R. Karger. SODA 1998, 500-509. Web SearchBibTeXDownload

A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP. Sanjeev Arora, Michelangelo Grigni, David R. Karger, Philip N. Klein, Andrzej Woloszyn. SODA 1998, 33-41. Web SearchBibTeXDownload

Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching. David R. Karger, Matthew S. Levine. STOC 1998, 69-78. Web SearchBibTeXDownload

1997

On Approximating the Longest Path in a Graph. David R. Karger, Rajeev Motwani, G. D. S. Ramkumar. Algorithmica (18): 82-98 (1997). Cited by 112Web SearchBibTeXDownload

An Õ(n^{3/14})-Coloring Algorithm for 3-Colorable Graphs. Avrim Blum, David R. Karger. Inf. Process. Lett. (61): 49-53 (1997). Web SearchBibTeXDownload

(De)randomized Construction of Small Sample Spaces in NC. David R. Karger, Daphne Koller. J. Comput. Syst. Sci. (55): 402-413 (1997). Web SearchBibTeXDownload

Distributed Job Scheduling in Rings. Perry Fizzano, David R. Karger, Clifford Stein, Joel Wein. J. Parallel Distrib. Comput. (45): 122-133 (1997). Web SearchBibTeXDownload

Near-optimal Intraprocedural Branch Alignment. Cliff Young, David S. Johnson, David R. Karger, Michael D. Smith. PLDI 1997, 183-193. Web SearchBibTeXDownload

An NC Algorithm for Minimum Cuts. David R. Karger, Rajeev Motwani. SIAM J. Comput. (26): 255-272 (1997). Cited by 21Web SearchBibTeXDownload

Implementing a Fully Polynomial Time Approximation Scheme for All Terminal Network Reliability. David R. Karger, Ray P. Tai. SODA 1997, 334-343. Web SearchBibTeXDownload

Experimental Study of Minimum Cut Algorithms. Chandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein. SODA 1997, 324-333. Web SearchBibTeXDownload

Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web. David R. Karger, Eric Lehman, Frank Thomson Leighton, Rina Panigrahy, Matthew S. Levine, Daniel Lewin. STOC 1997, 654-663. Web SearchBibTeXDownload

Using Random Sampling to Find Maximum Flows in Uncapacitated Undirected Graphs. David R. Karger. STOC 1997, 240-249. Web SearchBibTeXDownload

1996

A New Approach to the Minimum Cut Problem. David R. Karger, Clifford Stein. J. ACM (43): 601-640 (1996). Web SearchBibTeXDownload

A Better Algorithm for an Ancient Scheduling Problem. David R. Karger, Steven J. Phillips, Eric Torng. J. Algorithms (20): 400-430 (1996). Web SearchBibTeXDownload

Approximating s-t Minimum Cuts in Õ(n2) Time. András A. Benczúr, David R. Karger. STOC 1996, 47-55. Web SearchBibTeXDownload

Minimum Cuts in Near-Linear Time. David R. Karger. STOC 1996, 56-63. Web SearchBibTeXDownload

1995

Prim-Dijkstra tradeoffs for improved performance-driven routing tree design. Charles J. Alpert, T. C. Hu, Dennis J.-H. Huang, Andrew B. Kahng, David R. Karger. IEEE Trans. on CAD of Integrated Circuits and Systems (14): 890-896 (1995). Web SearchBibTeXDownload

A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees. David R. Karger, Philip N. Klein, Robert Endre Tarjan. J. ACM (42): 321-328 (1995). Web SearchBibTeXDownload

Polynomial time approximation schemes for dense instances of NP-hard problems. Sanjeev Arora, David R. Karger, Marek Karpinski. STOC 1995, 284-293. Web SearchBibTeXDownload

Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows. David R. Karger, Serge A. Plotkin. STOC 1995, 18-25. Web SearchBibTeXDownload

A randomized fully polynomial time approximation scheme for the all terminal network reliability problem. David R. Karger. STOC 1995, 11-17. Web SearchBibTeXDownload

1994

Approximate Graph Coloring by Semidefinite Programming. David R. Karger, Rajeev Motwani, Madhu Sudan. FOCS 1994, 2-13. Cited by 338Web SearchBibTeXDownload

(De)randomized Construction of Small Sample Spaces in \\calNC. David R. Karger, Daphne Koller. FOCS 1994, 252-263. Web SearchBibTeXDownload

Using Randomized Sparsification to Approximate Minimum Cuts. David R. Karger. SODA 1994, 424-432. Web SearchBibTeXDownload

A Better Algorithm for an Ancient Scheduling Problem. David R. Karger, Steven J. Phillips, Eric Torng. SODA 1994, 132-140. Web SearchBibTeXDownload

Job Scheduling in Rings. Perry Fizzano, David R. Karger, Clifford Stein, Joel Wein. SPAA 1994, 210-219. Web SearchBibTeXDownload

Random sampling in cut, flow, and network design problems. David R. Karger. STOC 1994, 648-657. Web SearchBibTeXDownload

1993

Random Sampling in Matroids, with Applications to Graph Connectivity and Minimum Spanning Trees. David R. Karger. FOCS 1993, 84-93. Web SearchBibTeXDownload

Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths. David R. Karger, Daphne Koller, Steven J. Phillips. SIAM J. Comput. (22): 1199-1217 (1993). Web SearchBibTeXDownload

Constant Interaction-Time Scatter/Gather Browsing of Very Large Document Collections. Douglas R. Cutting, David R. Karger, Jan O. Pedersen. SIGIR 1993, 126-134. Web SearchBibTeXDownload

Global Min-cuts in RNC, and Other Ramifications of a Simple Min-Cut Algorithm. David R. Karger. SODA 1993, 21-30. Web SearchBibTeXDownload

An O~(n2) algorithm for minimum cuts. David R. Karger, Clifford Stein. STOC 1993, 757-765. Web SearchBibTeXDownload

On Approximating the Longest Path in a Graph (Preliminary Version). David R. Karger, Rajeev Motwani, G. D. S. Ramkumar. WADS 1993, 421-432. Web SearchBibTeXDownload

1992

Scatter/Gather: A Cluster-based Approach to Browsing Large Document Collections. Douglas R. Cutting, Jan O. Pedersen, David R. Karger, John W. Tukey. SIGIR 1992, 318-329. Web SearchBibTeXDownload

Fast Connected Components Algorithms for the EREW PRAM. David R. Karger, Noam Nisan, Michal Parnas. SPAA 1992, 373-381. Web SearchBibTeXDownload

1991

Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths. David R. Karger, Daphne Koller, Steven J. Phillips. FOCS 1991, 560-568. Web SearchBibTeXDownload

http://dl.acm.org/author_page.cfm?id=81100337812
Electrical Engineering and Computer Science
Massachusettes Institute of Technology
USA

David R. Karger

Related People

Related Topics

Services

Related Organizations

Talks

1.	^ CIDR2009 Organization - Retrieved 2011-03-19 - details Original context from http://www.cidrdb.org/cidr2009/organization.html ...evy, Google James Hamilton, Microsoft Joe Hellerstein, UC Berkeley Meichun Hsu, HP Ted Johnson, ATT David Karger , MIT Donald Kossmann, ETH Zurich Paul Larson, Microsoft Boon Thau Loo, U. Pennsylvania Sam Madden, ...
2.	^ www 2009 Madrid - Retrieved 2011-06-28 - details Original context from http://wwwconference.org/www2009/calls/semdataweb.html ... Huynh (IBM, USA) Eero HyvÃ¶nen (Helsinki University of Technolog, Finland) Lalana Kagal (MIT, USA) David Karger (MIT, USA) Jihie Kim (Univ Southern California, USA) Mathias Klusch (DFKI, Germany) Peter Mika (Yah...
3.	^ CIDR2007 Organization - Retrieved 2013-05-12 - details Original context from http://www-db.cs.wisc.edu/cidr/cidr2007/organization.html ...cs.washington.edu Joe Hellerstein hellerstein@cs.berkeley.edu Ted Johnson johnsont@research.att.com David Karger karger@mit.edu Martin Kersten Martin.Kersten@cwi.nl Donald Kossmann donald.kossmann@inf.ethz.ch Sam...
4.	^ Interaction Design Paradigm Shift: Will Data Deliver the AI Vision of a Digital Assistant? - Retrieved 2012-01-26 - details Original context from http://www.cs.rpi.edu/news/colloquia/November14_2_2008.html ...b Science Research Initiative Fellow working with Ben Shneiderman, Tim Berners-Lee, Danny Weitzner, David Karger and Jim Hendler to explore how/where user interaction research and semantic web technology research...
5.	^ Distinguished Lecture Series - Retrieved 2011-04-16 - details Original context from http://www.cs.sunysb.edu/about/DLS/abstract20081215.html ... David R. Karger ...