• Publications
  • Influence
A scalable content-addressable network
TLDR
The concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales is introduced and its scalability, robustness and low-latency properties are demonstrated through simulation. Expand
Reducibility Among Combinatorial Problems
  • R. Karp
  • Computer Science
  • Complexity of Computer Computations
  • 1972
Reducibility Among Combinatorial Problems
  • R. Karp
  • Computer Science
  • 50 Years of Integer Programming
  • 2010
TLDR
Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability. Expand
An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to $(m + n)\sqrt n $.
LogP: towards a realistic model of parallel computation
TLDR
A new parallel machine model, called LogP, is offered that reflects the critical technology trends underlying parallel computers and is intended to serve as a basis for developing fast, portable parallel algorithms and to offer guidelines to machine designers. Expand
A scalable content-addressable network
TLDR
The concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales is introduced and its scalability, robustness and low-latency properties are demonstrated through simulation. Expand
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
TLDR
New algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimum-cost flow problem are presented, and Dinic shows that, in a network with n nodes and p arcs, a maximum flow can be computed in 0 (n2p) primitive operations by an algorithm which augments along shortest augmenting paths. Expand
An optimal algorithm for on-line bipartite matching
TLDR
This work applies the general approach to data structures, bin packing, graph coloring, and graph coloring to bipartite matching and shows that a simple randomized on-line algorithm achieves the best possible performance. Expand
Discovering local structure in gene expression data: the order-preserving submatrix problem
TLDR
A probabilistic model in which an OPSM is hidden within an otherwise random matrix is defined and an efficient algorithm is developed for finding the hidden OPSM in the random matrix. Expand
The Traveling-Salesman Problem and Minimum Spanning Trees
  • M. Held, R. Karp
  • Mathematics, Computer Science
  • Oper. Res.
  • 1 December 1970
TLDR
It is shown that maxπwπ = C* precisely when a certain well-known linear program has an optimal solution in integers. Expand
...
1
2
3
4
5
...