The following pages link to Richard M. Karp (Q619905):
Displaying 11 items.
- The complexity of testing whether a graph is a superconcentrator (Q1162529) (← links)
- Efficient PRAM simulation on a distributed memory machine (Q1923863) (← links)
- The Efficiency of Resolution and Davis--Putnam Procedures (Q2784492) (← links)
- The transitive closure of a random digraph (Q3197352) (← links)
- Combinatorics, complexity, and randomness (Q3783491) (← links)
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane (Q4173216) (← links)
- Nearly Optimal Competitive Online Replacement Policies (Q4385163) (← links)
- Index Register Allocation (Q5530094) (← links)
- The traveling-salesman problem and minimum spanning trees: Part II (Q5641007) (← links)
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs (Q5682014) (← links)
- Optimal search and one-way trading online algorithms (Q5943829) (← links)
