Travelled to:1 × Austria
1 × Canada
1 × Finland
1 × Switzerland
14 × USA
Collaborated with:∅ A.Wigderson E.Halperin M.Luby E.Upfal V.V.Vazirani Y.Zhang R.J.Lipton R.E.Tarjan E.P.Xing M.I.Jordan F.M.a.d.Heide U.V.Vazirani A.Marchetti-Spaccamela R.E.Miller A.L.Rosenberg D.A.Patterson M.Adler P.Beame T.Pitassi M.E.Saks O.Zamir O.Etzioni O.Madani S.Ben-David A.Borodin G.Tardos G.A.Gibson L.Hellerstein R.H.Katz D.E.Culler A.Sahay K.E.Schauser E.E.Santos R.Subramonian T.v.Eicken
Talks about:algorithm (6) problem (6) random (4) probabilist (3) parallel (3) genom (3) connect (2) complex (2) analysi (2) comput (2)
Person: Richard M. Karp
DBLP: Karp:Richard_M=
Facilitated 3 volumes:
EdEdEdContributed to:
20042003
200120001998
1997
19931993199219911990
1989198819851984198019791972Wrote 22 papers:
- ICALP-2004-HalperinK #problem #set
- The Minimum-Entropy Set Cover Problem (EH, RMK), pp. 733–744.
- STOC-2003-AdlerHKV #network #peer-to-peer #probability #process
- A stochastic process on the hypercube with applications to peer-to-peer networks (MA, EH, RMK, VVV), pp. 575–584.
- ICML-2001-XingJK #array #feature model
- Feature selection for high-dimensional genomic microarray data (EPX, MIJ, RMK), pp. 601–608.
- ICALP-2000-Karp #algorithm #challenge #research
- The Genomics Revolution and Its Challenges for Algorithmic Research (RMK), p. 428.
- STOC-1998-BeameKPS #complexity #on the #proving #random #satisfiability
- On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas (PB, RMK, TP, MES), pp. 561–571.
- KDD-1997-ZamirEMK #clustering #documentation #performance #web
- Fast and Intuitive Clustering of Web Documents (OZ, OE, OM, RMK), pp. 287–290.
- PPoPP-1993-CullerKPSSSSE #named #parallel #towards
- LogP: Towards a Realistic Model of Parallel Computation (DEC, RMK, DAP, AS, KES, EES, RS, TvE), pp. 1–12.
- STOC-1993-Karp #biology #combinator #problem
- Mapping the genome: some combinatorial problems arising in molecular biology (RMK), pp. 278–285.
- STOC-1992-KarpLH #distributed #memory management #performance #simulation
- Efficient PRAM Simulation on a Distributed Memory Machine (RMK, ML, FMadH), pp. 318–326.
- STOC-1991-Karp #probability
- Probabilistic Recurrence Relations (RMK), pp. 190–197.
- STOC-1990-Ben-DavidBKTW #algorithm #on the #online #power of
- On the Power of Randomization in Online Algorithms (SBD, AB, RMK, GT, AW), pp. 379–386.
- STOC-1990-KarpVV #algorithm #online
- An Optimal Algorithm for On-line Bipartite Matching (RMK, UVV, VVV), pp. 352–358.
- ASPLOS-1989-GibsonHKKP #array #scalability
- Failure Correction Techniques for Large Disk Arrays (GAG, LH, RMK, RHK, DAP), pp. 123–132.
- STOC-1988-KarpZ #bound #parallel #random
- A Randomized Parallel Branch-and-Bound Procedure (RMK, YZ), pp. 290–300.
- STOC-1985-KarpUW #random
- Constructing a Perfect Matching is in Random NC (RMK, EU, AW), pp. 22–32.
- STOC-1985-KarpUW85a #problem #question
- Are Search and Decision Problems Computationally Equivalent? (RMK, EU, AW), pp. 464–475.
- STOC-1984-KarpLM #analysis #multi #probability #problem
- A Probabilistic Analysis of Multidimensional Bin Packing Problems (RMK, ML, AMS), pp. 289–298.
- STOC-1984-KarpW #algorithm #independence #parallel #performance #problem #set
- A Fast Parallel Algorithm for the Maximal Independent Set Problem (RMK, AW), pp. 266–272.
- STOC-1980-KarpL #complexity
- Some Connections between Nonuniform and Uniform Complexity Classes (RMK, RJL), pp. 302–309.
- STOC-1980-KarpT #algorithm #linear #problem
- Linear Expected-Time Algorithms for Connectivity Problems (RMK, RET), pp. 368–377.
- ICALP-1979-Karp #algorithm #analysis #graph #probability
- Recent Advances in the Probabilistic Analysis of Graph-Theoretic Algorithms (RMK), pp. 338–339.
- STOC-1972-KarpMR #agile #array #identification #string
- Rapid Identification of Repeated Patterns in Strings, Trees and Arrays (RMK, REM, ALR), pp. 125–136.