Richard M. Karp

Q: What Schools Are Affiliated With Richard M. Karp

Richard M. Karp is affiliated with the following schools: University of California, Berkeley, Boston University, University of California, San Diego, University of Washington, Harvard University

Richard M. Karp's AcademicInfluence.com Rankings

Richard M. Karp

Computer Science

#241

World Rank

#251

Historical Rank

#145

USA Rank

computer-science Degrees

Richard M. Karp

Mathematics

#590

World Rank

#1110

Historical Rank

#262

USA Rank

Complexity Theory

World Rank

Historical Rank

USA Rank

Graph Theory

#17

World Rank

#22

Historical Rank

USA Rank

Measure Theory

#59

World Rank

#98

Historical Rank

#32

USA Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Why Is Richard M. Karp Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Richard Manning Karp is an American computer scientist and computational theorist at the University of California, Berkeley. He is most notable for his research in the theory of algorithms, for which he received a Turing Award in 1985, The Benjamin Franklin Medal in Computer and Cognitive Science in 2004, and the Kyoto Prize in 2008.

(See a Problem?)

Richard M. Karp's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Reducibility Among Combinatorial Problems (1972) (12257)
A scalable content-addressable network (2001) (6017)
A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs (1971) (2845)
A scalable content-addressable network (2001) (2200)
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems (1972) (2161)
LogP: towards a realistic model of parallel computation (1993) (1832)
The Traveling-Salesman Problem and Minimum Spanning Trees (1970) (1416)
Efficient Randomized Pattern-Matching Algorithms (1987) (1326)
A dynamic programming approach to sequencing problems (1962) (1313)
Reducibility among combinatorial problems" in complexity of computer computations (1972) (1254)
The traveling-salesman problem and minimum spanning trees: Part II (1971) (1059)
Parallel Program Schemata (1969) (1000)
Topologically-aware overlay construction and server selection (2002) (926)
Parallel Algorithms for Shared-Memory Machines (1991) (857)
Conserved patterns of protein interaction in multiple species. (2005) (857)
A characterization of the minimum cycle mean in a digraph (1978) (805)
Randomized rumor spreading (2000) (748)
An optimal algorithm for on-line bipartite matching (1990) (746)
Application-Level Multicast Using Content-Addressable Networks (2001) (732)
Feature selection for high-dimensional genomic microarray data (2001) (724)
Random walks, universal traversal sequences, and the complexity of maze problems (1979) (688)
The Organization of Computations for Uniform Recurrence Equations (1967) (640)
Discovering local structure in gene expression data: the order-preserving submatrix problem (2002) (618)
Some connections between nonuniform and uniform complexity classes (1980) (603)
On the Computational Complexity of Combinatorial Problems (1975) (573)
Conserved pathways within bacteria and yeast as revealed by global protein network alignment (2003) (558)
A simple algorithm for finding frequent elements in streams and bags (2003) (555)
Load Balancing in Structured P2P Systems (2003) (517)
Algorithms for graph partitioning on the planted partition model (1999) (500)
An efficient approximation scheme for the one-dimensional bin-packing problem (1982) (496)
An XOR-based erasure-resilient coding scheme (1995) (472)
Properties of a model for parallel computations: determinacy (1966) (464)
Competitive Paging Algorithms (1991) (463)
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane (1977) (457)
Load balancing in dynamic structured P2P systems (2004) (426)
A Survey of Parallel Algorithms for Shared-Memory Machines (1988) (363)
Monte-Carlo Approximation Algorithms for Enumeration Problems (1989) (350)
LogP: a practical model of parallel computation (1996) (349)
Fast and Intuitive Clustering of Web Documents (1997) (345)
Monte-Carlo algorithms for enumeration and reliability problems (1983) (337)
Rapid identification of repeated patterns in strings, trees and arrays (1972) (320)
Constructing a perfect matching is in random NC (1985) (315)
Discovery of regulatory interactions through perturbation: inference and experimental design. (1999) (314)
Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks (2005) (296)
A Graph-Theoretic Game and Its Application to the k-Server Problem (1995) (290)
An optimal algorithm for Monte Carlo estimation (1995) (276)
Minimization Over Boolean Graphs (1962) (269)
Faster and More Accurate Sequence Alignment with SNAP (2011) (259)
On Nonterminating Stochastic Games (1966) (256)
CLIFF: clustering of high-dimensional microarray data via iterative feature filtering using normalized cuts (2001) (241)
The Differencing Method of Set Partitioning (1983) (239)
Efficient PRAM simulation on a distributed memory machine (1992) (226)
The Transitive Closure of a Random Digraph (1990) (226)
Maximum Matchings in Sparse Random Graphs (1981) (222)
Identification of protein complexes by comparative analysis of yeast and bacterial protein interaction data (2004) (217)
On the power of randomization in online algorithms (1990) (210)
Discovering local structure in gene expression data: the order-preserving submatrix problem. (2003) (209)
Optimal broadcast and summation in the LogP model (1993) (207)
A fast parallel algorithm for the maximal independent set problem (1984) (206)
On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future? (1992) (202)
On the power of randomization in on-line algorithms (2005) (196)
On linear characterizations of combinatorial optimization problems (1980) (189)
A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem (1979) (184)
Optimal Search and One-Way Trading Online Algorithms (2001) (182)
Randomized parallel algorithms for backtrack search and branch-and-bound computation (1993) (174)
A fast parallel algorithm for the maximal independent set problem (1985) (169)
Mapping the genome: some combinatorial problems arising in molecular biology (1993) (166)
Assembly-Line Balancing---Dynamic Programming with Precedence Constraints (1963) (165)
Maximum matching in sparse random graphs (1981) (158)
Finite-State Processes and Dynamic Programming (1967) (156)
Parametric shortest path algorithms with an application to cyclic staffing (1981) (139)
eQED: an efficient method for interpreting eQTL associations using protein networks (2008) (138)
Topology-Free Querying of Protein Interaction Networks (2009) (135)
Efficient reconstruction of haplotype structure via perfect phylogeny. (2002) (133)
Dynamic programming meets the principle of inclusion and exclusion (1982) (133)
On the Security of Ping-Pong Protocols (1982) (130)
Physical mapping of chromosomes: A combinatorial problem in molecular biology (1995) (130)
Balancing traffic load in wireless networks with curveball routing (2007) (130)
Minimum-redundancy coding for the discrete noiseless channel (1961) (129)
CREME: a framework for identifying cis-regulatory modules in human-mouse conserved segments (2003) (128)
Selfish behavior and stability of the internet:: a game-theoretic analysis of TCP (2002) (126)
Physical mapping of chromosomes using unique probes (1994) (125)
A Linear Algorithm for Testing Equivalence of Finite Automata. (1971) (124)
Noisy binary search and its applications (2007) (124)
DEGAS: De Novo Discovery of Dysregulated Pathways in Human Diseases (2010) (118)
An introduction to randomized algorithms (1991) (118)
Load balancing in dynamic structured peer-to-peer systems (2006) (118)
Finite length analysis of LT codes (2004) (114)
Combinatorics, complexity, and randomness (1986) (113)
The Efficiency of Resolution and Davis--Putnam Procedures (2002) (112)
Complexity of Computation (1974) (108)
On the complexity of unsatisfiability proofs for random k-CNF formulas (1998) (107)
A stochastic process on the hypercube with applications to peer-to-peer networks (2003) (106)
A randomized parallel branch-and-bound procedure (1988) (106)
Optimal and Global Time Synchronization in Sensornets (2003) (103)
Probabilistic recurrence relations (1994) (102)
The rank of sparse random matrices over finite fields (1997) (101)
Coding techniques for handling failures in large disk arrays (2005) (100)
A probabilistic analysis of multidimensional bin packing problems (1984) (99)
Selfish behavior and stability of the internet: a game-theoretic analysis of TCP (2002) (96)
A Monte-Carlo Algorithm for Estimating the Permanent (1993) (96)
Searching for an Optimal Path in a Tree with Random Costs (1983) (95)
The Complexity of Parallel Search (1988) (94)
Global wire routing in two-dimensional arrays (1987) (93)
Competitive analysis of financial games (1992) (92)
The Complexity of Testing Whether a Graph is a Superconcentrator (1981) (90)
A simple derivation of Edmonds' algorithm for optimum branchings (1971) (88)
Sorting and Selection in Posets (2007) (86)
Functional Decomposition and Switching Circuit Design (1963) (84)
Optimization problems in congestion control (2000) (83)
Monte-Carlo algorithms for the planar multiterminal network reliability problem (1985) (81)
Index Register Allocation (1966) (79)
Failure correction techniques for large disk arrays (1989) (76)
An algorithm to solve the m × n assignment problem in expected time O(mn log n) (1980) (76)
Large scale reconstruction of haplotypes from genotype data (2003) (75)
An Upper Bound on the Expected Cost of an Optimal Assignment (1987) (74)
Probabilistic analysis of optimum partitioning (1986) (74)
Detecting Disease-Specific Dysregulated Pathways Via Analysis of Clinical Expression Profiles (2008) (74)
Comparing Protein Interaction Networks via a Graph Match-and-Split Algorithm (2007) (71)
The complexity of parallel computation (1986) (69)
Genome-Wide Association Data Reveal a Global Map of Genetic Interactions among Protein Complexes (2009) (68)
Turing award lecture (1985) (67)
Efficient information gathering on the Internet (1996) (65)
Probabilistic Analysis of Linear Programming Decoding (2007) (64)
Logos: a Modular Bayesian Model for de Novo Motif Detection (2004) (63)
Global Synchronization in Sensornets (2004) (56)
Perfect phylogeny and haplotype assignment (2004) (56)
Algorithmic methodologies for ultra-efficient inexact architectures for sustaining technology scaling (2012) (55)
A randomization test for controlling population stratification in whole-genome association studies. (2007) (54)
Universal DNA tag systems: a combinatorial design scheme (2000) (53)
Two special cases of the assignment problem (1975) (53)
The minimum-entropy set cover problem (2005) (52)
Reconstructing Boolean Models of Signaling (2012) (51)
Error-resilient DNA computation (1996) (50)
A simplex variant solving an m times d linear program in O(min(m2, d2) expected number of pivot steps (1987) (47)
Are search and decision programs computationally equivalent? (1985) (46)
Algorithms for implicit hitting set problems (2011) (46)
Torque: topology-free querying of protein interaction networks (2009) (44)
Near-Optimal Solutions to a 2-Dimensional Placement Problem (1975) (43)
Parallel sorting with limited bandwidth (1995) (43)
From proprietary to collective governance: How do platform participation strategies evolve? (2020) (42)
Pedigree Reconstruction Using Identity by Descent (2011) (41)
A Hierarchical Bayesian Markovian Model for Motifs in Biopolymer Sequences (2002) (41)
MotifPrototyper: A Bayesian profile model for motif families (2004) (41)
Parallel Program Schemata: A Mathematical Model for Parallel Computation (1967) (41)
Global Wire Routing in Two-Dimensional Arrays (Extended Abstract) (1983) (40)
Massively Parallel Computation of Matching and MIS in Sparse Graphs (2019) (39)
Parallel minimax search for a maximum (1968) (39)
The Implicit Hitting Set Approach to Solve Combinatorial Optimization Problems with an Application to Multigenome Alignment (2013) (39)
Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines (1967) (38)
Linear Expected-Time Algorithms for Connectivity Problems (1980) (36)
Detecting protein sequence conservation via metric embeddings (2003) (36)
Scheduling Parallel Communication: The h-relation Problem (1995) (35)
On parallel evaluation of game trees (1989) (35)
Some Techniques of State Assignment for Synchronous Sequential Machines (1964) (35)
Parallel Algorithms for Combinatorial Search Problems (1989) (35)
On ~ competitive algorithms for paging problems (1991) (34)
Universal DNA tag systems: a combinatorial design scheme. (2000) (33)
Algorithms for choosing differential gene expression experiments (1999) (32)
On the Optimality of Huffman Trees (1976) (32)
A Note on the Applicaton of Graph Theory to Digital Computer Programming (1960) (32)
Average Case Analysis of a Heuristic for the Assignment Problem (1994) (31)
Understanding Science Through the Computational Lens (2011) (30)
Mathematical Challenges from Genomics and Molecular Biology (2002) (28)
The restriction scaffold problem (2002) (28)
A method for obtaining randomized algorithms with small tail probabilities (1996) (27)
On a search problem related to branch-and-bound procedures (1986) (27)
Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983) (27)
HAPLOPOOL: improving haplotype frequency estimation through DNA pools and phylogenetic modeling (2007) (25)
Nearly Optimal Competitive Online Replacement Policies (1997) (25)
Deferred Data Structuring (1988) (24)
Selection in the presence of noise: the design of playoff systems (1994) (24)
A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only (1986) (24)
A computer program for the synthesis of combinational switching circuits (1961) (23)
Heuristic algorithms in computational molecular biology (2011) (22)
Subtree isomorphism is in random NC (1988) (21)
LOGOS: a modular Bayesian model for de novo motif detection (2003) (21)
Finding a most biased coin with fewest flips (2012) (21)
A criterion for planarity of the square of a graph (1967) (20)
When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem? (1995) (19)
The Construction of Discrete Dynamic Programming Algorithms (1965) (19)
An algorithmic approach to multiple complete digest mapping (1997) (18)
The bit vector intersection problem (1995) (18)
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching (2018) (17)
Comparing Pedigree Graphs (2010) (17)
A Phenomenon in the Theory of Sorting (1970) (17)
Algorithms for optical mapping (1998) (17)
Implicit Hitting Set Problems and Multi-genome Alignment (2010) (17)
Mapping Clones with a Given Ordering or Interleaving (1997) (17)
Transitive Compaction in Parallel via Branchings (1991) (16)
Algorithms to Detect Multiprotein Modularity Conserved during Evolution (2011) (16)
Random Knockout Tournaments (2016) (16)
Probabilistic recurrence relations (1991) (15)
Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem (1998) (15)
Computational Complexity of Combinatorial and Graph-Theoretic Problems (2011) (15)
Bounded Branching Process AND/OR Tree Evaluation (1995) (14)
Emerging opportunities for theoretical computer science (1997) (13)
Gapped Local Similarity Search with Provable Guarantees (2004) (13)
Large scale optimization and the relaxation method (1972) (13)
Probabilistic analysis of combinatorial algorithms: an annotated bibliography (1984) (13)
Haplotype Inference in Complex Pedigrees (2009) (13)
The complexity of parallel computation on matroids (1985) (12)
Association mapping and significance estimation via the coalescent. (2008) (12)
George Dantzig's impact on the theory of computation (2008) (12)
An Optimal Algorithm for Monte Carlo Estimation (Extended Abstract). (1995) (12)
Probabilistic Analysis of Network Flow Algorithms (1993) (11)
Linear expected-time algorithms for connectivity problems (Extended Abstract) (1980) (10)
An algorithm for analysing probed partial digestion experiments (1995) (10)
Prediction of Phenotype Information from Genotype Data (2010) (9)
The mortgage problem (1993) (9)
Computer Science as a Lens on the Sciences: The Example of Computational Molecular Biology (2007) (8)
Towards Optimally Multiplexed Applications of Universal Arrays (2004) (8)
On the Price of Heterogeneity in Parallel Systems (2006) (8)
FFD bin packing for item sizes with distributions on [0,1/2] (1986) (8)
ISIT’98 Plenary Lecture Report: Variations on the Theme of ‘Twenty Questions’ (1999) (8)
Keynote address: the role of algorithmic research in computational genomics (2003) (7)
Probabilistic graphical models and algorithms for genomic analysis (2004) (7)
Verification decoding of raptor codes (2005) (7)
Error checking and graphical representation of multiple-complete-digest (MCD) restriction-fragment maps. (1999) (7)
Thirteenth annual IEEE Symposium on switching and automata theory (1974) (7)
Reconstructing Chain Functions in Genetic Networks (2006) (7)
A New Monte-Carlo Method for Estimating the Failure Probability of an (1983) (6)
Coalescing times for IID random variables with applications to population biology (2003) (6)
Three-Stage Generalized Connectors (1992) (6)
A Generalization of Binary Search (1993) (6)
Poverty and malnutrition in two countries. (1995) (5)
Linked decompositions of networks and the power of choice in Polya urns (2008) (5)
FFD bin packing for item sizes with uniform distributions on [0, 1/2] (1991) (5)
Algorithms for dna restriction mapping (2000) (5)
A PROBABILISTIC MODEL FOR THE SURVIVABILITY OF CELLS (2005) (5)
The Genomics Revolution and its Challenges for Algorithmic Research (2000) (5)
Optimization Problems Related to Internet Congestion Control (2005) (5)
On characterizing and learning some classes of read-once functions (1989) (4)
Random Graphs, Random Walks, Differential Equations and the Probabilistic Analysis of Algorithms (1998) (4)
Optimization criteria and biological process enrichment in homologous multiprotein modules (2013) (4)
Probabilistic analysis of matching and network flow algorithms (1988) (4)
Recent Advances in the Probabilistic Analysis of Graph-Theoretic Algorithms (Abstract) (1979) (4)
Constructing maps using the span and inclusion relations (1998) (4)
Edgar Cayce encyclopedia of healing (1986) (3)
Transitive reduction in parallel via branchings (1988) (3)
Reconstructing chain functions in genetic networks. (2003) (3)
Optimal flow distribution among multiple channels with unknown capacities (2005) (3)
THE TRAVELING-SALESMAN PROBLEM AND MINIMUM SPANNING TREES : PART 1 I * (3)
The Bit Vector Intersection Problem (Preliminary Version). (1995) (3)
Malnutrition in chronic illness of childhood with special reference to pulmonary disease. (1980) (2)
Computer Science as a Lens on the Sciences: (2007) (2)
Finite Branching Processes and AND/OR Tree Evaluation (1994) (2)
Efficient Information Gathering on the Internet* (extended abstract) (1996) (2)
The Non-Messing-Up Theorem, (1971) (2)
A Family of Simplex Variants Solving for An mxd Linear Program in (1983) (2)
A Simplex Variant Solving An mxd Linear Program in O(min(m squared, d (1983) (2)
Special issue on computational molecular biology (2007) (2)
The Role of Experimental Algorithms in Genomics (2004) (2)
Algorithms for Comparing Pedigree Graphs (2010) (2)
Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem (1996) (2)
On parallel evaluation of game trees (1998) (2)
A maximum likelihood polynomial time syndrome decoder to correct linearly independent errors (2001) (2)
Mapping clones with a given ordering or interleaving (abstract) (1997) (1)
Streaming Algorithms for Selection and Approximate Sorting (2007) (1)
Search Strategies in Inter-Domain Traffic Engineering (2002) (1)
Proceedings of the second annual ACM symposium on Theory of computing (1970) (1)
Reducibility among Combinatorial Problems (1972) (2021) (1)
An Algorithm Combining Discrete and Continuous Methods for Optical Mapping (1999) (1)
Implementation of Load Balancing Algorithm for Grid by Heuristic Approach (2014) (1)
Fair Bandwidth Allocation Without Per-Flow State (2006) (1)
Efficient pattern-matching (1987) (1)
An algorithm combining discrete and continuous methods for optical mapping. (2000) (1)
The Restriction Scaffold Problem (Extended Abstract) (2002) (1)
R63-32 Computational Chains and the Simplification of Computer Programs (1963) (1)
Algorithms for inferring cis-regulatory structures and protein interaction networks (2004) (1)
Handbook of Automation, Computation, and Control, Volume 2, Computers and Data Processing (E. M. Grabbe, S. Ramo, and D. E, Wooldridge, eds.) (1960) (1)
Optimization and reconstruction over graphs (2007) (1)
Dominant Deceptions: Explaining the Tenacity of Deceit in Entrepreneurial Ventures (2022) (1)
A Position Paper on Parallel Computation (1989) (1)
A Graph-Theoretic Game and its Application to the k-Server Problem (Extended Abstract) (1991) (1)
Functional significance of mild-to-moderate malnutrition. (1991) (0)
A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding (2003) (0)
Parallel and Distributed Computing. (1986) (0)
Graph Algorithms: Foreword (2011) (0)
Lecture 5 Probabilistic Models and Motif Discovery (1998) (0)
Parallel and distributed computing. Final report, 15 August 1985-14 August 1986 (1986) (0)
Understanding Digital Computers (P. Siegel) (1963) (0)
Restriction Mapping 14.1. Multiple Complete Digest Mapping (1998) (0)
Transitive reduction in parallel via branchings. Technical report (1988) (0)
Code decoding chain reaction inactivation (2003) (0)
Physical Mapping of Chromosomes Using Unique Probes ( Draft ) (1994) (0)
COMBINATORICS , COMPLEXITY , AND RANDOMNESS The 1985 Turing (1999) (0)
4 Open Problems (1996) (0)
Constructing Stakeholder Commitment through Strategic Ambiguity: Explaining How Entrepreneurs Develop their Ventures (2019) (0)
Optimizing the Bac-end Strategy for Sequencing the Human Genome (1999) (0)
Gaining Organizational Adoption: Discovering New Uses for Existing Innovations (2020) (0)
Sorting and Selection in Posets | SIAM Journal on Computing | Vol. 40, No. 3 | Society for Industrial and Applied Mathematics (2011) (0)
Variations on the theme of "twenty questions" (1998) (0)
Inferring reticulate evolution networks from consensus gene trees (2005) (0)
Fairness in Scheduling On-line Load Balancing with Applications to Machine Scheduling and Virtual Circuit Routing. In (1995) (0)
Discrete Algorithms for Mobile and Wireless Networks Lecture 8 Part B : Thursday , 8 th February 2007 Instructor : Soma Chaudhuri Scribe : Puviyarasan Pandian 1 Lecture topic (2007) (0)
lJ.AXIMUMMATCHINGS IN SPARSE RANDOM GRAPHS (1981) (0)
Selected topics in automata theory (1966) (0)
Guest Editors' foreword (2001) (0)
A P E R F E C T M A T C H I N G IS R A N D O M N C (1986) (0)
Notes for Lecture 23 (0)
SHORTEST PATH ALGORITHMS WITH AN APPLICATION TO CYCLIC STAFFING by (0)
Statistical Machine Learning and Computational Biology (2007) (0)
Combinatorial Problems in Physical Mapping (1995) (0)
Special RECOMB 2002 Issue (2004) (0)
OPTIMAL SEARCH FOR POLLUTION SOURCES (1972) (0)
Approximation Algorithms for Tsp and Triangulation 8 (1991) (0)
Theory of Computation as an Enabling Tool for the Sciences (2012) (0)
Global Wire Routing in Two-Dimensional Arrays 1 (1987) (0)
My memories of David Gale (2009) (0)
Code decoding chain reaction by inactivating recovered symbols (2003) (0)
Table 5: Predicted Performance of a Production-quality Sort Tool (10 Mbyte Le) Processors Merge Local Sort Total 4 Empirical Results (2007) (0)
An Algorithmic View of the Universe (2012) (0)
Thanks to Wheeler Ruml for Introducing Me to Number Partitioning, and the 9 0/1 Knapsack Problem 7.4 Complete Karmarkar-karp Algorithm 7 Multi-way Partitioning 7.1 Greedy Algorithm 7.2 Standard Complete Algorithm 4 Experimental Results: Optimal Solutions 2.4 Dynamic Programming Algorithm (1995) (0)
Global Wiire Routing in Two-Dimensional Arrayst (Extended Abstract) (1983) (0)
Emerging Opportunities for Theoretical Computer Science 1 History and Scope of This Report (1996) (0)
COItMUNICA~ON O- MASS PRODUCTION Amon msEmHAL (1980) (0)
Special SIGACT issue (1971) (0)
Governing for Growth in Scope (2020) (0)
Gaining Organizational Adoption: Strategically Pacing the Deployment of Digital Innovations (2022) (0)
From Proprietary to Collective Control: Explaining How Firm Platform Strategies Transition (2017) (0)
Head Start, nutrition, and problems of poverty in childhood. (1999) (0)
Algorithms for Choosing Informative Differential Gene Expression Experiments (1999) (0)
What Kind of Village Fosters Entrepreneurial New Venture Development? (2019) (0)
The EM Algorithm , Mixture Models , and Motif Discovery January 22 , 1998 Lecturer : (1998) (0)
Evolution, Modularity, and Dynamics of Gene Regulatory Networks (2008) (0)
Jv J Jej) Algorithm for Finding Maxi- Perfect Matching under Translation 7 Perfect Matching under Translation (0)
Construct Smack-Down: The Dynamics of Ecosystems and Communities (2018) (0)
Turing Award Lecture on Complexity and NP-Completeness (2015) (0)
Parallel and distributed computing. Final report, 1 June 1985-30 November 1986 (1986) (0)
Modeling parallel communication (1995) (0)
Sek and S. Suri. Farthest Neighbors, Maximum Spanning Trees and Related Problems In (0)

This paper list is powered by the following services:

Other Resources About Richard M. Karp

What Schools Are Affiliated With Richard M. Karp?

Richard M. Karp is affiliated with the following schools:

Richard M. Karp's Academic­Influence.com Rankings

Why Is Richard M. Karp Influential?

Richard M. Karp's Published Works

Published Works

Other Resources About Richard M. Karp

What Schools Are Affiliated With Richard M. Karp?

Image Attributions

Richard M. Karp's AcademicInfluence.com Rankings