BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Denmark
1 × Greece
1 × South Korea
1 × United Kingdom
17 × USA
2 × Austria
6 × Canada
Collaborated with:
A.Marcus M.S.Levine J.Teevan R.C.Miller S.Madden R.Miller M.S.Ackerman M.S.Bernstein C.Stein D.R.Cutting J.O.Pedersen E.Wu Q.Liu E.Benson K.Panovich A.Bernstein H.Chen V.Sinha J.D.Rennie L.Shih M.Ruhl A.A.Benczúr S.A.Plotkin M.V.Kleek M.M.C.Schraefel A.X.Zhang E.Bakke O.Badar E.Adar L.A.Stein S.Arora M.Karpinski S.Zyto S.Mahajan W.Styke C.Alvarado Y.Chang C.Young D.S.Johnson M.D.Smith J.W.Tukey S.Oh F.Dabek M.F.Kaashoek R.Morris I.Stoica P.N.Klein M.Thorup N.E.Young G.G.Vargas E.Lehman F.T.Leighton R.Panigrahy D.Lewin A.P.Bhardwaj A.Deshpande A.J.Elmore S.Madden A.G.Parameswaran H.Subramanyam R.Zhang
Talks about:
data (6) random (5) inform (5) time (5) cut (5) document (4) problem (4) minimum (4) user (4) flow (4)

Person: David R. Karger

DBLP DBLP: Karger:David_R=

Contributed to:

CHI 20152015
RecSys 20152015
VLDB 20152015
CHI 20142014
VLDB 20132012
CHI 20122012
CSCW 20122012
VLDB 20122011
CHI 20112011
CIKM 20112011
SIGMOD 20112011
CHI 20102010
CHI 20092009
STOC 20092009
SIGIR 20062006
SIGMOD 20052005
CHI 20042004
ICML 20032003
SIGIR 20032003
STOC 20022002
SOSP 20012001
CIKM 19991999
STOC 19991999
STOC 19981998
PLDI 19971997
STOC 19971997
STOC 19961996
STOC 19951995
STOC 19941994
SIGIR 19931993
STOC 19931993
SIGIR 19921992

Wrote 41 papers:

CHI-2015-ZhangAK #how #question #what #why
Mailing Lists: Why Are They Still Here, What’s Wrong With Them, and How Can We Fix Them? (AXZ, MSA, DRK), pp. 4009–4018.
RecSys-2015-LiuK #named #recommendation
Kibitz: End-to-End Recommendation System Builder (QL, DRK), pp. 335–336.
VLDB-2015-BhardwajDEKMPS0 #collaboration #data analysis
Collaborative Data Analytics with DataHub (APB, AD, AJE, DRK, SM, AGP, HS, EW, RZ), pp. 1916–1927.
CHI-2014-BensonK #how #web #what #why
End-users publishing structured information on the web: an observational study of what, why, and how (EB, DRK), pp. 1265–1274.
Counting with the Crowd (AM, DRK, SM, RM, SO), pp. 109–120.
CHI-2012-ZytoKAM #deployment #documentation #social
Successful classroom deployment of a social document annotation system (SZ, DRK, MSA, SM), pp. 1883–1892.
CSCW-2012-PanovichMK #network #social
Tie strength in question & answer on social network sites (KP, RM, DRK), pp. 1057–1066.
Human-powered Sorts and Joins (AM, EW, DRK, SM, RCM), pp. 13–24.
CHI-2011-BakkeKM #user interface
A spreadsheet-based user interface for managing plural relationships in structured data (EB, DRK, RM), pp. 2541–2550.
CHI-2011-KleekSsK #named #people
Finders/keepers: a longitudinal study of people managing information scraps in a micro-note tool (MVK, WS, MMCS, DRK), pp. 2907–2916.
CHI-2011-MarcusBBKMM #microblog #named #visualisation
Twitinfo: aggregating and visualizing microblogs for event exploration (AM, MSB, OB, DRK, SM, RCM), pp. 227–236.
CIKM-2011-Karger #people #user interface
Creating user interfaces that entice people to manage better information (DRK), pp. 1–2.
SIGMOD-2011-MarcusBBKMM #twitter
Tweets as data: demonstration of TweeQL and Twitinfo (AM, MSB, OB, DRK, SM, RCM), pp. 1259–1262.
SIGMOD-2011-MarcusWKMM #query
Demonstration of Qurk: a query processor for humanoperators (AM, EW, DRK, SM, RCM), pp. 1315–1318.
CHI-2010-BernsteinMKM #resource management #web
Enhancing directed content sharing on the web (MSB, AM, DRK, RCM), pp. 971–980.
CHI-2009-KleekBPVKS #lightweight
Note to self: examining personal information keeping in a lightweight note-taking tool (MVK, MSB, KP, GGV, DRK, MMCS), pp. 1477–1480.
A nearly optimal oracle for avoiding failed vertices and edges (AB, DRK), pp. 101–110.
SIGIR-2006-ChenK #documentation #less is more #modelling #probability
Less is more: probabilistic models for retrieving fewer relevant documents (HC, DRK), pp. 429–436.
SIGMOD-2005-SinhaK #named #navigation #semistructured data
Magnet: Supporting Navigation in Semistructured Data Environments (VS, DRK), pp. 97–106.
CHI-2004-TeevanAAK #behaviour #case study
The perfect search engine is not enough: a study of orienteering behavior in directed search (JT, CA, MSA, DRK), pp. 415–422.
ICML-2003-RennieSTK #classification #naive bayes
Tackling the Poor Assumptions of Naive Bayes Text Classifiers (JDR, LS, JT, DRK), pp. 616–623.
ICML-2003-ShihRCK #statistics
Text Bundling: Statistics Based Data-Reduction (LS, JDR, YHC, DRK), pp. 696–703.
SIGIR-2003-TeevanK #analysis #development #empirical #exponential #probability #retrieval #using
Empirical development of an exponential probabilistic model for text retrieval: using textual analysis to build a better model (JT, DRK), pp. 18–25.
STOC-2002-KargerL #graph #random
Random sampling in residual graphs (DRK, MSL), pp. 63–66.
STOC-2002-KargerR #metric #nearest neighbour #strict
Finding nearest neighbors in growth-restricted metrics (DRK, MR), pp. 741–750.
Wide-Area Cooperative Storage with CFS (FD, MFK, DRK, RM, IS), pp. 202–215.
CIKM-1999-AdarKS #named
Haystack: Per-User Information Environments (EA, DRK, LAS), pp. 413–422.
STOC-1999-KargerKSTY #algorithm #geometry #multi
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut (DRK, PNK, CS, MT, NEY), pp. 668–678.
STOC-1998-KargerL #graph
Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching (DRK, MSL), pp. 69–78.
PLDI-1997-YoungJKS #branch
Near-optimal Intraprocedural Branch Alignment (CY, DSJ, DRK, MDS), pp. 183–193.
STOC-1997-Karger #graph #random #using
Using Random Sampling to Find Maximum Flows in Uncapacitated Undirected Graphs (DRK), pp. 240–249.
STOC-1997-KargerLLPLL #consistency #distributed #protocol #random #web
Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web (DRK, EL, FTL, RP, MSL, DL), pp. 654–663.
STOC-1996-BenczurK #approximate
Approximating s-t Minimum Cuts in Õ(n2) Time (AAB, DRK), pp. 47–55.
Minimum Cuts in Near-Linear Time (DRK), pp. 56–63.
STOC-1995-AroraKK #approximate #np-hard #polynomial #problem
Polynomial time approximation schemes for dense instances of NP-hard problems (SA, DRK, MK), pp. 284–293.
STOC-1995-Karger #approximate #network #polynomial #problem #random #reliability
A randomized fully polynomial time approximation scheme for the all terminal network reliability problem (DRK), pp. 11–17.
STOC-1995-KargerP #combinator #constraints #multi #optimisation #problem
Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows (DRK, SAP), pp. 18–25.
STOC-1994-Karger #design #network #problem #random
Random sampling in cut, flow, and network design problems (DRK), pp. 648–657.
SIGIR-1993-CuttingKP #constant #documentation #scalability
Constant Interaction-Time Scatter/Gather Browsing of Very Large Document Collections (DRC, DRK, JOP), pp. 126–134.
STOC-1993-KargerS #algorithm
An O~(n2) algorithm for minimum cuts (DRK, CS), pp. 757–765.
SIGIR-1992-CuttingPKT #approach #clustering #documentation #named #scalability
Scatter/Gather: A Cluster-based Approach to Browsing Large Document Collections (DRC, JOP, DRK, JWT), pp. 318–329.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.