#### Filter Results:

- Full text PDF available (171)

#### Publication Year

1960

2016

- This year (0)
- Last 5 years (15)
- Last 10 years (50)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Cell Type

#### Key Phrases

#### Method

#### Organism

Learn More

- Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard M. Karp, Scott Shenker
- SIGCOMM
- 2001

Hash tables - which map "keys" onto "values" - are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large distributed systems. In this paper, we introduce the concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on… (More)

- Richard M. Karp
- Complexity of Computer Computations
- 1972

- David E. Culler, Richard M. Karp, +5 authors Thorsten von Eicken
- PPOPP
- 1993

A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding development of techniques that yield performance across a range of… (More)

- Jack Edmonds, Richard M. Karp
- Combinatorial Optimization
- 1972

This paper presents new algori thms for the maximum flow problem, the Hitchcock t r anspo r t a t i on problem, and the general min imum-cos t flow problem. Upper bounds on the numbers of steps in these algori thms are derived, and are shown to compale favorably with upper bounds on the numbers of steps required by earlier algori thms. Firs t , the paper s… (More)

- Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Yakhini
- RECOMB
- 2002

This paper concerns the discovery of patterns in gene expression matrices, in which each element gives the expression level of a given gene in a given experiment. Most existing methods for pattern discovery in such matrices are based on clustering genes by comparing their expression levels in all experiments, or clustering experiments by comparing their… (More)

- John E. Hopcroft, Richard M. Karp
- SIAM J. Comput.
- 1971

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)x/. Key words, algorithm, algorithmic analysis, bipartite graphs, computational complexity, graphs, matching

- Richard M. Karp
- Discrete Mathematics
- 1978

- Sylvia Ratnasamy, Mark Handley, Richard M. Karp, Scott Shenker
- Networked Group Communication
- 2001

Most currently proposed solutions to application-level multicast organize the group members into an application-level mesh over which a Distance-Vector routing protocol, or a similar algorithm, is used to construct source-rooted distribution trees. The use of a global routing protocol limits the scalability of these systems. Other proposed solutions that… (More)

- Richard M. Karp, Michael O. Rabin
- IBM Journal of Research and Development
- 1987

- Sylvia Ratnasamy, Mark Handley, Richard M. Karp, Scott Shenker
- INFOCOM
- 2002

A number of large-scale distributed Internet applications could potentially benefit from some level of knowledge about the relative proximity between its participating host nodes. For example, the performance of large overlay networks could be improved if the application-level connectivity between the nodes in these networks is congruent with the underlying… (More)