The following pages link to Richard M. Karp (Q619905):
Displaying 50 items.
- (Q203748) (redirect page) (← links)
- Coding techniques for handling failures in large disk arrays (Q297238) (← links)
- Heuristic algorithms in computational molecular biology (Q619906) (← links)
- On the price of heterogeneity in parallel systems (Q733722) (← links)
- Turing machines that take advice (Q787674) (← links)
- Subtree isomorphism is in random NC (Q922707) (← links)
- George Dantzig's impact on the theory of computation (Q951091) (← links)
- Prediction of phenotype information from genotype data (Q966184) (← links)
- Monte-Carlo algorithms for the planar multiterminal network reliability problem (Q1079111) (← links)
- Global wire routing in two-dimensional arrays (Q1097238) (← links)
- A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps (Q1100853) (← links)
- Constructing a perfect matching is in random NC (Q1103639) (← links)
- The complexity of parallel search (Q1106664) (← links)
- Parametric shortest path algorithms with an application to cyclic staffing (Q1149254) (← links)
- The complexity of testing whether a graph is a superconcentrator (Q1162529) (← links)
- Dynamic programming meets the principle of inclusion and exclusion (Q1165163) (← links)
- An introduction to randomized algorithms (Q1182319) (← links)
- Two special cases of the assignment problem (Q1219828) (← links)
- A characterization of the minimum cycle mean in a digraph (Q1249587) (← links)
- Graph traversals, genes and matroids: An efficient case of the travelling salesman problem (Q1281769) (← links)
- Mapping clones with a given ordering or interleaving (Q1393069) (← links)
- Searching for an optimal path in a tree with random costs (Q1837534) (← links)
- Physical mapping of chromosomes: A combinatorial problem in molecular biology (Q1902467) (← links)
- Efficient PRAM simulation on a distributed memory machine (Q1923863) (← links)
- A method for obtaining randomized algorithms with small tail probabilities (Q1923864) (← links)
- My memories of David Gale (Q2389285) (← links)
- Understanding science through the computational lens (Q2434533) (← links)
- Parallel program schemata (Q2540014) (← links)
- A phenomenon in the theory of sorting (Q2558829) (← links)
- The minimum-entropy set cover problem (Q2581268) (← links)
- FFD bin packing for item sizes with uniform distributions on \([0,\frac12]\). (Q2641215) (← links)
- (Q2712576) (← links)
- The Efficiency of Resolution and Davis--Putnam Procedures (Q2784492) (← links)
- Probabilistic Analysis of Linear Programming Decoding (Q2934618) (← links)
- (Q2934677) (← links)
- Sorting and Selection in Posets (Q3093615) (← links)
- (Q3128911) (← links)
- (Q3128919) (← links)
- Randomized parallel algorithms for backtrack search and branch-and-bound computation (Q3140025) (← links)
- (Q3140441) (← links)
- On parallel evaluation of game trees (Q3158529) (← links)
- The transitive closure of a random digraph (Q3197352) (← links)
- (Q3280457) (← links)
- A Dynamic Programming Approach to Sequencing Problems (Q3292045) (← links)
- (Q3318111) (← links)
- On the security of ping-pong protocols (Q3323837) (← links)
- Optimization Problems Related to Internet Congestion Control (Q3374242) (← links)
- (Q3439687) (← links)
- (Q3479517) (← links)
- Reducibility Among Combinatorial Problems (Q3565237) (← links)
