default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard M. Karp
Person information
- affiliation: University of California, Berkeley, USA
- award (2008): Kyoto Prize
- award (2004): Benjamin Franklin Medal
- award (1996): National Medal of Science
- award (1990): John von Neumann Theory Prize
- award (1985): Turing Award
- award (1979): Fulkerson Prize
- award (1977): Frederick W. Lanchester Prize
Other persons with a similar name
- Richard Alan Karp — Tri-Data, Mountain View, CA, USA (and 2 more)
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2019
[c124]Soheil Behnezhad, Sebastian Brandt
, Mahsa Derakhshan, Manuela Fischer, MohammadTaghi Hajiaghayi, Richard M. Karp, Jara Uitto:
Massively Parallel Computation of Matching and MIS in Sparse Graphs. PODC 2019: 481-490- 2018
- [i8]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Richard M. Karp:
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching. CoRR abs/1807.06701 (2018) - 2017
- [j113]Ilan Adler, Yang Cao, Richard M. Karp, Erol A. Peköz, Sheldon M. Ross:
Random Knockout Tournaments. Oper. Res. 65(6): 1589-1596 (2017) - 2014
- [c123]Karthekeyan Chandrasekaran, Richard M. Karp:
Finding a most biased coin with fewest flips. COLT 2014: 394-407 - 2013
- [j112]Erick Moreno-Centeno, Richard M. Karp:
The Implicit Hitting Set Approach to Solve Combinatorial Optimization Problems with an Application to Multigenome Alignment. Oper. Res. 61(2): 453-468 (2013) - [j111]Roded Sharan, Richard M. Karp:
Reconstructing Boolean Models of Signaling. J. Comput. Biol. 20(3): 249-257 (2013) - 2012
- [j110]Bonnie Kirkpatrick, Yakir Reshef, Hilary K. Finucane, Haitao Jiang, Binhai Zhu, Richard M. Karp:
Comparing Pedigree Graphs. J. Comput. Biol. 19(9): 998-1014 (2012) - [j109]Luqman Hodgkinson, Richard M. Karp:
Algorithms to Detect Multiprotein Modularity Conserved during Evolution. IEEE ACM Trans. Comput. Biol. Bioinform. 9(4): 1046-1058 (2012) - [c122]Christos H. Papadimitriou, Leonard M. Adleman, Richard M. Karp, Donald E. Knuth, Robert E. Tarjan, Leslie G. Valiant:
An Algorithmic View of the Universe. ACM-TURING 2012: 13:1 - [c121]Lingamneni Avinash, Kirthi Krishna Muntimadugu, Christian C. Enz, Richard M. Karp, Krishna V. Palem, Christian Piguet:
Algorithmic methodologies for ultra-efficient inexact architectures for sustaining technology scaling. Conf. Computing Frontiers 2012: 3-12 - [c120]Roded Sharan, Richard M. Karp:
Reconstructing Boolean Models of Signaling. RECOMB 2012: 261-271 - [c119]Richard M. Karp:
Theory of Computation as an Enabling Tool for the Sciences. TAMC 2012: 11 - [i7]Karthekeyan Chandrasekaran, Richard M. Karp:
Finding the most biased coin with fewest flips. CoRR abs/1202.3639 (2012) - 2011
- [j108]Bonnie Kirkpatrick, Shuai Cheng Li, Richard M. Karp, Eran Halperin:
Pedigree Reconstruction Using Identity by Descent. J. Comput. Biol. 18(11): 1481-1493 (2011) - [j107]Richard M. Karp:
Heuristic algorithms in computational molecular biology. J. Comput. Syst. Sci. 77(1): 122-128 (2011) - [j106]Richard M. Karp:
Understanding Science Through the Computational Lens. J. Comput. Sci. Technol. 26(4): 569-577 (2011) - [j105]Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, Elad Verbin:
Sorting and Selection in Posets. SIAM J. Comput. 40(3): 597-622 (2011) - [c118]Luqman Hodgkinson, Richard M. Karp:
Algorithms to Detect Multiprotein Modularity Conserved during Evolution. ISBRA 2011: 111-122 - [c117]Bonnie Kirkpatrick, Shuai Cheng Li, Richard M. Karp, Eran Halperin:
Pedigree Reconstruction Using Identity by Descent. RECOMB 2011: 136-152 - [c116]Karthekeyan Chandrasekaran, Richard M. Karp, Erick Moreno-Centeno, Santosh S. Vempala:
Algorithms for Implicit Hitting Set Problems. SODA 2011: 614-629 - [i6]Karthekeyan Chandrasekaran, Richard M. Karp, Erick Moreno-Centeno, Santosh S. Vempala:
Algorithms for Implicit Hitting Set Problems. CoRR abs/1102.1472 (2011) - [i5]Matei Zaharia, William J. Bolosky, Kristal Curtis, Armando Fox, David A. Patterson, Scott Shenker, Ion Stoica, Richard M. Karp, Taylor Sittler:
Faster and More Accurate Sequence Alignment with SNAP. CoRR abs/1111.5572 (2011) - 2010
- [j104]Jens Gramm, Richard M. Karp, William S. Noble, Roded Sharan, Qianfei Wang, Nir Yosef:
Prediction of Phenotype Information from Genotype Data. Commun. Inf. Syst. 10(2): 99-114 (2010) - [j103]Sharon Bruckner, Falk Hüffner, Richard M. Karp, Ron Shamir, Roded Sharan:
Topology-Free Querying of Protein Interaction Networks. J. Comput. Biol. 17(3): 237-252 (2010) - [j102]Bonnie Kirkpatrick, Eran Halperin, Richard M. Karp:
Haplotype Inference in Complex Pedigrees. J. Comput. Biol. 17(3): 269-280 (2010) - [c115]Richard M. Karp:
Implicit Hitting Set Problems and Multi-genome Alignment. CPM 2010: 151 - [p3]Richard M. Karp:
Reducibility Among Combinatorial Problems. 50 Years of Integer Programming 2010: 219-241 - [i4]Bonnie Kirkpatrick, Yakir Reshef, Hilary K. Finucane, Haitao Jiang, Binhai Zhu, Richard M. Karp:
Algorithms for Comparing Pedigree Graphs. CoRR abs/1009.0909 (2010)
2000 – 2009
- 2009
- [j101]Richard M. Karp:
My memories of David Gale. Games Econ. Behav. 66(2): 606 (2009) - [j100]Brighten Godfrey, Richard M. Karp:
On the Price of Heterogeneity in Parallel Systems. Theory Comput. Syst. 45(2): 280-301 (2009) - [j99]Sharon Bruckner, Falk Hüffner, Richard M. Karp, Ron Shamir, Roded Sharan:
Torque: topology-free querying of protein interaction networks. Nucleic Acids Res. 37(Web-Server-Issue): 106-108 (2009) - [c114]Sharon Bruckner, Falk Hüffner, Richard M. Karp, Ron Shamir, Roded Sharan:
Topology-Free Querying of Protein Interaction Networks. RECOMB 2009: 74-89 - [c113]Bonnie Kirkpatrick, Javier Rosa, Eran Halperin, Richard M. Karp:
Haplotype Inference in Complex Pedigrees. RECOMB 2009: 108-120 - [c112]Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, Elad Verbin:
Sorting and selection in posets. SODA 2009: 392-401 - 2008
- [j98]Richard M. Karp:
George Dantzig's impact on the theory of computation. Discret. Optim. 5(2): 174-185 (2008) - [j97]Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright:
Probabilistic Analysis of Linear Programming Decoding. IEEE Trans. Inf. Theory 54(8): 3565-3578 (2008) - [c111]Richard M. Karp:
Computer Science as a Lens on the Sciences. ICDCS 2008: 1-2 - [c110]Igor Ulitsky, Richard M. Karp, Ron Shamir:
Detecting Disease-Specific Dysregulated Pathways Via Analysis of Clinical Expression Profiles. RECOMB 2008: 347-359 - [c109]Henry C. Lin, Christos Amanatidis, Martha Sideri, Richard M. Karp, Christos H. Papadimitriou:
Linked decompositions of networks and the power of choice in Polya urns. SODA 2008: 993-1002 - 2007
- [j96]Bonnie Kirkpatrick, Carlos Santos Armendariz, Richard M. Karp, Eran Halperin:
HAPLOPOOL: improving haplotype frequency estimation through DNA pools and phylogenetic modeling. Bioinform. 23(22): 3048-3055 (2007) - [j95]Manikandan Narayanan, Richard M. Karp:
Comparing Protein Interaction Networks via a Graph Match-and-Split Algorithm. J. Comput. Biol. 14(7): 892-907 (2007) - [j94]Richard M. Karp, Ming Li, Pavel A. Pevzner, Ron Shamir:
Special issue on computational molecular biology. J. Comput. Syst. Sci. 73(7): 1023 (2007) - [c108]Richard M. Karp:
Computer Science as a Lens on the Sciences: The Example of Computational Molecular Biology. BIBM 2007: 5 - [c107]Richard M. Karp:
Streaming Algorithms for Selection and Approximate Sorting. FSTTCS 2007: 9-20 - [c106]Lucian Popa, Afshin Rostamizadeh, Richard M. Karp, Christos H. Papadimitriou, Ion Stoica:
Balancing traffic load in wireless networks with curveball routing. MobiHoc 2007: 170-179 - [c105]Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright:
Probabilistic analysis of linear programming decoding. SODA 2007: 385-394 - [c104]Richard M. Karp, Robert Kleinberg:
Noisy binary search and its applications. SODA 2007: 881-890 - [c103]Richard M. Karp:
Computer Science as a Lens on the Sciences: . Web Intelligence 2007 - [i3]Constantinos Daskalakis, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, Elad Verbin:
Sorting and Selection in Posets. CoRR abs/0707.1532 (2007) - [i2]Constantinos Daskalakis, Alexandros G. Dimakis, Richard M. Karp, Martin J. Wainwright:
Probabilistic Analysis of Linear Programming Decoding. CoRR abs/cs/0702014 (2007) - 2006
- [j93]Jacob Scott, Trey Ideker, Richard M. Karp, Roded Sharan:
Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks. J. Comput. Biol. 13(2): 133-144 (2006) - [j92]Sonesh Surana, Brighten Godfrey, Karthik Lakshminarayanan, Richard M. Karp, Ion Stoica:
Load balancing in dynamic structured peer-to-peer systems. Perform. Evaluation 63(3): 217-240 (2006) - [j91]Irit Gat-Viks, Richard M. Karp, Ron Shamir, Roded Sharan:
Reconstructing Chain Functions in Genetic Networks. SIAM J. Discret. Math. 20(3): 727-740 (2006) - [c102]Richard M. Karp:
Fair Bandwidth Allocation Without Per-Flow State. Essays in Memory of Shimon Even 2006: 88-110 - [c101]Richard M. Karp, Till Nierhoff, Till Tantau:
Optimal Flow Distribution Among Multiple Channels with Unknown Capacities . Essays in Memory of Shimon Even 2006: 111-128 - [c100]Brighten Godfrey, Richard M. Karp:
On the price of heterogeneity in parallel systems. SPAA 2006: 84-92 - 2005
- [j90]Richard M. Karp, Till Nierhoff, Till Tantau:
Optimal flow distribution among multiple channels with unknown capacities. Electron. Notes Discret. Math. 19: 225-231 (2005) - [j89]Roded Sharan, Trey Ideker, Brian P. Kelley, Ron Shamir, Richard M. Karp:
Identification of Protein Complexes by Comparative Analysis of Yeast and Bacterial Protein Interaction Data. J. Comput. Biol. 12(6): 835-846 (2005) - [j88]Richard M. Karp, Ming Li, Pavel A. Pevzner, Ron Shamir:
Guest Editors' foreword. J. Comput. Syst. Sci. 70(3): 283- (2005) - [j87]Eran Halperin, Richard M. Karp:
The minimum-entropy set cover problem. Theor. Comput. Sci. 348(2-3): 240-250 (2005) - [c99]Richard M. Karp, Michael Luby, Amin Shokrollahi:
Verification decoding of raptor codes. ISIT 2005: 1310-1314 - [c98]Jacob Scott, Trey Ideker, Richard M. Karp, Roded Sharan:
Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks. RECOMB 2005: 1-13 - 2004
- [j86]Eric P. Xing, Wei Wu, Michael I. Jordan, Richard M. Karp:
Logos: a Modular Bayesian Model for de Novo Motif Detection. J. Bioinform. Comput. Biol. 2(1): 127-154 (2004) - [j85]Amir Ben-Dor, Tzvika Hartman, Richard M. Karp, Benno Schwikowski, Roded Sharan, Zohar Yakhini:
Towards Optimally Multiplexed Applications of Universal Arrays. J. Comput. Biol. 11(2/3): 476-492 (2004) - [j84]Eric P. Xing, Richard M. Karp:
MotifPrototyper: A Bayesian profile model for motif families. Proc. Natl. Acad. Sci. USA 101(29): 10523-10528 (2004) - [c97]Eran Halperin, Richard M. Karp:
The Minimum-Entropy Set Cover Problem. ICALP 2004: 733-744 - [c96]Brighten Godfrey, Karthik Lakshminarayanan, Sonesh Surana, Richard M. Karp, Ion Stoica:
Load Balancing in Dynamic Structured P2P Systems. INFOCOM 2004: 2253-2262 - [c95]Richard M. Karp, Michael Luby, Amin Shokrollahi:
Finite length analysis of LT codes. ISIT 2004: 39 - [c94]Jeremy Elson, Richard M. Karp, Christos H. Papadimitriou, Scott Shenker:
Global Synchronization in Sensornets. LATIN 2004: 609-624 - [c93]Irit Gat-Viks, Ron Shamir, Richard M. Karp, Roded Sharan:
Reconstructing Chain Functions in Genetic Networks. Pacific Symposium on Biocomputing 2004: 498-509 - [c92]Eran Halperin, Richard M. Karp:
Perfect phylogeny and haplotype assignment. RECOMB 2004: 10-19 - [c91]Richard M. Karp:
Algorithms for inferring cis-regulatory structures and protein interaction networks. RECOMB 2004: 45 - [c90]Roded Sharan, Trey Ideker, Brian P. Kelley, Ron Shamir, Richard M. Karp:
Identification of protein complexes by comparative analysis of yeast and bacterial protein interaction data. RECOMB 2004: 282-289 - [c89]Manikandan Narayanan, Richard M. Karp:
Gapped Local Similarity Search with Provable Guarantees. WABI 2004: 74-86 - [c88]Richard M. Karp:
The Role of Experimental Algorithms in Genomics. WEA 2004: 299-300 - 2003
- [j83]Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Yakhini:
Discovering Local Structure in Gene Expression Data: The Order-Preserving Submatrix Problem. J. Comput. Biol. 10(3/4): 373-384 (2003) - [j82]Amir Ben-Dor, Richard M. Karp, Benno Schwikowski, Ron Shamir:
The Restriction Scaffold Problem. J. Comput. Biol. 10(3/4): 385-398 (2003) - [j81]Ilan Adler, Hyun-Soo Ahn, Richard M. Karp, Sheldon M. Ross:
Coalescing times for IID random variables with applications to population biology. Random Struct. Algorithms 23(2): 155-166 (2003) - [j80]Richard M. Karp, Scott Shenker, Christos H. Papadimitriou:
A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst. 28: 51-55 (2003) - [c87]Richard M. Karp:
The Role of Algorithmic Research in Computational Genomics. CSB 2003: 10-12 - [c86]Eric P. Xing, Wei Wu, Michael I. Jordan, Richard M. Karp:
LOGOS: a modular Bayesian model for de novo motif detection. CSB 2003: 266-276 - [c85]Ananth Rao, Karthik Lakshminarayanan, Sonesh Surana, Richard M. Karp, Ion Stoica:
Load Balancing in Structured P2P Systems. IPTPS 2003: 68-79 - [c84]Eran Halperin, Jeremy Buhler, Richard M. Karp, Robert Krauthgamer, Ben Westover:
Detecting protein sequence conservation via metric embeddings. ISMB (Supplement of Bioinformatics) 2003: 122-129 - [c83]Roded Sharan, Ivan Ovcharenko, Asa Ben-Hur, Richard M. Karp:
CREME: a framework for identifying cis-regulatory modules in human-mouse conserved segments. ISMB (Supplement of Bioinformatics) 2003: 283-291 - [c82]Richard M. Karp, Claire Kenyon:
A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding. RANDOM-APPROX 2003: 329-340 - [c81]Eleazar Eskin, Eran Halperin, Richard M. Karp:
Large scale reconstruction of haplotypes from genotype data. RECOMB 2003: 104-113 - [c80]Micah Adler, Eran Halperin, Richard M. Karp, Vijay V. Vazirani:
A stochastic process on the hypercube with applications to peer-to-peer networks. STOC 2003: 575-584 - 2002
- [j79]Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks:
The Efficiency of Resolution and Davis--Putnam Procedures. SIAM J. Comput. 31(4): 1048-1075 (2002) - [c79]Sylvia Ratnasamy, Mark Handley, Richard M. Karp, Scott Shenker:
Topologically-Aware Overlay Construction and Server Selection. INFOCOM 2002: 1190-1199 - [c78]Eric P. Xing, Michael I. Jordan, Richard M. Karp, Stuart Russell:
A Hierarchical Bayesian Markovian Model for Motifs in Biopolymer Sequences. NIPS 2002: 1489-1496 - [c77]Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Yakhini:
Discovering local structure in gene expression data: the order-preserving submatrix problem. RECOMB 2002: 49-57 - [c76]Amir Ben-Dor, Richard M. Karp, Benno Schwikowski, Ron Shamir:
The restriction scaffold problem. RECOMB 2002: 58-66 - [c75]Aditya Akella, Srinivasan Seshan, Richard M. Karp, Scott Shenker, Christos H. Papadimitriou:
Selfish behavior and stability of the internet: a game-theoretic analysis of TCP. SIGCOMM 2002: 117-130 - [i1]Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young:
Competitive Paging Algorithms. CoRR cs.DS/0205038 (2002) - 2001
- [j78]Ran El-Yaniv, Amos Fiat, Richard M. Karp, G. Turpin:
Optimal Search and One-Way Trading Online Algorithms. Algorithmica 30(1): 101-139 (2001) - [j77]Anne Condon, Richard M. Karp:
Algorithms for graph partitioning on the planted partition model. Random Struct. Algorithms 18(2): 116-140 (2001) - [c74]Jack Edmonds, Richard M. Karp:
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. Combinatorial Optimization 2001: 31-33 - [c73]Eric P. Xing, Michael I. Jordan, Richard M. Karp:
Feature selection for high-dimensional genomic microarray data. ICML 2001: 601-608 - [c72]Eric P. Xing, Richard M. Karp:
CLIFF: clustering of high-dimensional microarray data via iterative feature filtering using normalized cuts. ISMB (Supplement of Bioinformatics) 2001: 306-315 - [c71]Sylvia Ratnasamy, Mark Handley, Richard M. Karp, Scott Shenker:
Application-Level Multicast Using Content-Addressable Networks. Networked Group Communication 2001: 14-29 - [c70]Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard M. Karp, Scott Shenker:
A scalable content-addressable network. SIGCOMM 2001: 161-172 - [p2]Richard M. Karp:
The Genomics Revolution and its Challenges for Algorithmic Research. Current Trends in Theoretical Computer Science 2001: 631-642 - 2000
- [j76]Richard M. Karp, Ron Shamir:
Algorithms for Optical Mapping. J. Comput. Biol. 7(1-2): 303-316 (2000) - [j75]Amir Ben-Dor, Richard M. Karp, Benno Schwikowski, Zohar Yakhini:
Universal DNA Tag Systems: A Combinatorial Design Scheme. J. Comput. Biol. 7(3-4): 503-519 (2000) - [j74]Richard M. Karp, Itsik Pe'er, Ron Shamir:
An Algorithm Combining Discrete and Continuous Methods for Optical Mapping. J. Comput. Biol. 7(5): 745-760 (2000) - [j73]Paul Dagum, Richard M. Karp, Michael Luby, Sheldon M. Ross:
An Optimal Algorithm for Monte Carlo Estimation. SIAM J. Comput. 29(5): 1484-1496 (2000) - [j72]Micah Adler, John W. Byers, Richard M. Karp:
Parallel Sorting with Limited Bandwidth. SIAM J. Comput. 29(6): 1997-2015 (2000) - [c69]Richard M. Karp, Elias Koutsoupias, Christos H. Papadimitriou, Scott Shenker:
Optimization Problems in Congestion Control. FOCS 2000: 66-74 - [c68]Richard M. Karp, Christian Schindelhauer, Scott Shenker, Berthold Vöcking:
Randomized Rumor Spreading. FOCS 2000: 565-574 - [c67]Richard M. Karp:
The Genomics Revolution and Its Challenges for Algorithmic Research. ICALP 2000: 428 - [c66]Amir Ben-Dor, Richard M. Karp, Benno Schwikowski, Zohar Yakhini:
Universal DNA tag systems: a combinatorial design scheme. RECOMB 2000: 65-75
1990 – 1999
- 1999
- [j71]Daniel P. Fasulo, Tao Jiang, Richard M. Karp, Reuben J. Settergren, Edward C. Thayer:
An Algorithmic Approach to Multiple Complete Digest Mapping. J. Comput. Biol. 6(2): 187-207 (1999) - [j70]Richard M. Karp, Claire Kenyon, Orli Waarts:
Error-resilient DNA computation. Random Struct. Algorithms 15(3-4): 450-466 (1999) - [c65]Richard M. Karp, Itsik Pe'er, Ron Shamir:
An Algorithm Combining Discrete and Continuous Methods for Optical Mapping. ISMB 1999: 159-168 - [c64]Anne Condon, Richard M. Karp:
Algorithms for Graph Partitioning on the Planted Partition Model. RANDOM-APPROX 1999: 221-232 - [c63]Richard M. Karp, Roland Stoughton, Ka Yee Yeung:
Algorithms for choosing differential gene expression experiments. RECOMB 1999: 208-217 - 1998
- [j69]Tao Jiang, Richard M. Karp:
Mapping Clones with a Given Ordering or Interleaving. Algorithmica 21(3): 262-284 (1998) - [j68]Dan Gusfield, Richard M. Karp, Lusheng Wang, Paul Stelling:
Graph Traversals, Genes and Matroids: An Efficient Case of the Travelling Salesman Problem. Discret. Appl. Math. 88(1-3): 167-180 (1998) - [j67]Richard M. Karp, Yanjun Zhang:
On Parallel Evaluation of Game Trees. J. ACM 45(6): 1050-1075 (1998) - [c62]Daniel P. Fasulo, Tao Jiang, Richard M. Karp, Nitin Sharma:
Constructing maps using the span and inclusion relations. RECOMB 1998: 64-73 - [c61]Richard M. Karp, Ron Shamir:
Algorithms for optical mapping. RECOMB 1998: 117-124 - [c60]Richard M. Karp:
Random Graphs, Random Walks, Differential Equations and the Probabilistic Analysis of Algorithms. STACS 1998: 1-2 - [c59]Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks:
On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas. STOC 1998: 561-571 - 1997
- [j66]Ran El-Yaniv, Richard M. Karp:
Nearly Optimal Competitive Online Replacement Policies. Math. Oper. Res. 22(4): 814-839 (1997) - [j65]Johannes Blömer, Richard M. Karp, Emo Welzl:
The rank of sparse random matrices over finite fields. Random Struct. Algorithms 10(4): 407-419 (1997) - [j64]Alfred V. Aho, David S. Johnson, Richard M. Karp, S. Rao Kosaraju, Catherine C. McGeoch, Christos H. Papadimitriou, Pavel A. Pevzner:
Emerging opportunities for theoretical computer science. SIGACT News 28(3): 65-74 (1997) - [c58]Oren Zamir, Oren Etzioni, Omid Madani, Richard M. Karp:
Fast and Intuitive Clustering of Web Documents. KDD 1997: 287-290 - [c57]Daniel P. Fasulo, Tao Jiang, Richard M. Karp, Reuben J. Settergren, Edward C. Thayer:
An algorithmic approach to multiple complete digest mapping. RECOMB 1997: 118-127 - [c56]Tao Jiang, Richard M. Karp:
Mapping clones with a given ordering or interleaving (abstract). RECOMB 1997: 162 - [c55]Tao Jiang, Richard M. Karp:
Mapping Clones with a Given Ordering or Interleaving (Extended Abstract). SODA 1997: 400-409 - 1996
- [j63]Richard M. Karp, Michael Luby, Friedhelm Meyer auf der Heide:
Efficient PRAM Simulation on a Distributed Memory Machine. Algorithmica 16(4/5): 517-542 (1996) - [j62]Helmut Alt, Leonidas J. Guibas, Kurt Mehlhorn, Richard M. Karp, Avi Wigderson:
A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Algorithmica 16(4/5): 543-547 (1996) - [j61]David E. Culler, Richard M. Karp, David A. Patterson, Abhijit Sahay, Eunice E. Santos, Klaus E. Schauser, Ramesh Subramonian, Thorsten von Eicken:
LogP: A Practical Model of Parallel Computation. Commun. ACM 39(11): 78-85 (1996) - [c54]Dan Gusfield, Richard M. Karp, Lusheng Wang, Paul Stelling:
Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem. CPM 1996: 304-319 - [c53]Oren Etzioni, Steve Hanks, Tao Jiang, Richard M. Karp, Omid Madani, Orli Waarts:
Efficient Information Gathering on the Internet (extended abstract). FOCS 1996: 234-243 - [c52]Richard M. Karp, Claire Kenyon, Orli Waarts:
Error-Resilient DNA Computation. SODA 1996: 458-467 - 1995
- [j60]Farid Alizadeh, Richard M. Karp, Lee Aaron Newberg, Deborah K. Weisser:
Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology. Algorithmica 13(1/2): 52-76 (1995) - [j59]Richard M. Karp, Lee Aaron Newberg:
An algorithm for analysing probed partial digestion experiments. Comput. Appl. Biosci. 11(3): 229-235 (1995) - [j58]Farid Alizadeh, Richard M. Karp, Deborah K. Weisser, Geoffrey Zweig:
Physical Mapping of Chromosomes Using Unique Probes. J. Comput. Biol. 2(2): 159-184 (1995) - [j57]Richard M. Karp, Yanjun Zhang:
Bounded Branching Process AND/OR Tree Evaluation. Random Struct. Algorithms 7(2): 97-116 (1995) - [j56]Noga Alon, Richard M. Karp, David Peleg, Douglas B. West:
A Graph-Theoretic Game and Its Application to the k-Server Problem. SIAM J. Comput. 24(1): 78-100 (1995) - [j55]Alan M. Frieze, Richard M. Karp, Bruce A. Reed:
When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem? SIAM J. Comput. 24(3): 484-493 (1995) - [c51]Paul Dagum, Richard M. Karp, Michael Luby, Sheldon M. Ross:
An Optimal Algorithm for Monte Carlo Estimation (Extended Abstract). FOCS 1995: 142-149 - [c50]Richard M. Karp, Orli Waarts, Geoffrey Zweig:
The Bit Vector Intersection Problem (Preliminary Version). FOCS 1995: 621-630 - [c49]Richard M. Karp:
Modeling parallel communication. IPPS 1995: 2- - [c48]Micah Adler, John W. Byers, Richard M. Karp:
Scheduling Parallel Communication: The h-relation Problem. MFCS 1995: 1-20 - [c47]Micah Adler, John W. Byers, Richard M. Karp:
Parallel Sorting with Limited Bandwidth. SPAA 1995: 129-136 - 1994
- [j54]Shai Ben-David, Allan Borodin, Richard M. Karp, Gábor Tardos, Avi Wigderson:
On the Power of Randomization in On-Line Algorithms. Algorithmica 11(1): 2-14 (1994) - [j53]Lisa Hellerstein, Garth A. Gibson, Richard M. Karp, Randy H. Katz, David A. Patterson:
Coding Techniques for Handling Failures in Large Disk Arrays. Algorithmica 12(2/3): 182-208 (1994) - [j52]Richard M. Karp:
Probabilistic Recurrence Relations. J. ACM 41(6): 1136-1150 (1994) - [j51]Richard M. Karp, Alexander H. G. Rinnooy Kan, Rakesh V. Vohra:
Average Case Analysis of a Heuristic for the Assignment Problem. Math. Oper. Res. 19(3): 513-522 (1994) - [c46]Farid Alizadeh, Richard M. Karp, Deborah K. Weisser, Geoffrey Zweig:
Physical Mapping of Chromosomes Using Unique Probes. SODA 1994: 489-500 - [c45]Micah Adler, Peter Gemmell, Mor Harchol-Balter, Richard M. Karp, Claire Kenyon:
Selection in the Presence of Noise: The Design of Playoff Systems. SODA 1994: 564-572 - 1993
- [j50]Richard M. Karp, Yanjun Zhang:
Randomized Parallel Algorithms for Backtrack Search and Branch-and-Bound Computation. J. ACM 40(3): 765-789 (1993) - [j49]Richard M. Karp, Rajeev Motwani, Noam Nisan:
Probabilistic Analysis of Network Flow Algorithms. Math. Oper. Res. 18(1): 71-97 (1993) - [j48]Narendra Karmarkar, Richard M. Karp, Richard J. Lipton, László Lovász, Michael Luby:
A Monte-Carlo Algorithm for Estimating the Permanent. SIAM J. Comput. 22(2): 284-293 (1993) - [c44]Ran El-Yaniv, Richard M. Karp:
The Mortgage Problem. ISTCS 1993: 304-312 - [c43]David E. Culler, Richard M. Karp, David A. Patterson, Abhijit Sahay, Klaus E. Schauser, Eunice E. Santos, Ramesh Subramonian, Thorsten von Eicken:
LogP: Towards a Realistic Model of Parallel Computation. PPoPP 1993: 1-12 - [c42]Farid Alizadeh, Richard M. Karp, Lee Aaron Newberg, Deborah K. Weisser:
Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology. SODA 1993: 371-381 - [c41]Richard M. Karp, Abhijit Sahay, Eunice E. Santos, Klaus E. Schauser:
Optimal Broadcast and Summation in the LogP Model. SPAA 1993: 142-153 - [c40]Richard M. Karp:
Mapping the genome: some combinatorial problems arising in molecular biology. STOC 1993: 278-285 - [c39]Richard M. Karp:
A Generalization of Binary Search. WADS 1993: 27-34 - 1992
- [j47]Richard M. Karp:
Three-Stage Generalized Connectors. SIAM J. Discret. Math. 5(2): 259-272 (1992) - [c38]Ran El-Yaniv, Amos Fiat, Richard M. Karp, G. Turpin:
Competitive Analysis of Financial Games. FOCS 1992: 327-333 - [c37]Richard M. Karp:
On-Line Algorithms Versus Off-Line Algorithms: How Much is it Worth to Know the Future? IFIP Congress (1) 1992: 416-429 - [c36]Alan M. Frieze, Richard M. Karp, Bruce A. Reed:
When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem? IPCO 1992: 453-461 - [c35]Richard M. Karp, Michael Luby, Friedhelm Meyer auf der Heide:
Efficient PRAM Simulation on a Distributed Memory Machine. STOC 1992: 318-326 - 1991
- [j46]Sally Floyd, Richard M. Karp:
FFD Bin Packing for Item Sizes with Uniform Distributions on [0, 1/2]. Algorithmica 6(2): 222-240 (1991) - [j45]Richard M. Karp:
An introduction to randomized algorithms. Discret. Appl. Math. 34(1-3): 165-201 (1991) - [j44]Phillip B. Gibbons, Richard M. Karp, Vijaya Ramachandran, Danny Soroker, Robert Endre Tarjan:
Transitive Compaction in Parallel via Branchings. J. Algorithms 12(1): 110-125 (1991) - [j43]Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young:
Competitive Paging Algorithms. J. Algorithms 12(4): 685-699 (1991) - [c34]Noga Alon, Richard M. Karp, David Peleg, Douglas B. West:
A Graph-Theoretic Game and its Application to the k-Server Problem (Extended Abstract). On-Line Algorithms 1991: 1-10 - [c33]Richard M. Karp:
Probabilistic Recurrence Relations. STOC 1991: 190-197 - 1990
- [j42]Phillip B. Gibbons, Richard M. Karp, Gary L. Miller, Danny Soroker:
Subtree isomorphism is in random NC. Discret. Appl. Math. 29(1): 35-62 (1990) - [j41]Richard M. Karp:
The Transitive Closure of a Random Digraph. Random Struct. Algorithms 1(1): 73-94 (1990) - [c32]Richard M. Karp, Umesh V. Vazirani, Vijay V. Vazirani:
An Optimal Algorithm for On-line Bipartite Matching. STOC 1990: 352-358 - [c31]Shai Ben-David, Allan Borodin, Richard M. Karp, Gábor Tardos, Avi Wigderson:
On the Power of Randomization in Online Algorithms (Extended Abstract). STOC 1990: 379-386 - [p1]Richard M. Karp, Vijaya Ramachandran:
Parallel Algorithms for Shared-Memory Machines. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 869-942
1980 – 1989
- 1989
- [j40]Richard M. Karp, Michael Luby, Neal Madras:
Monte-Carlo Approximation Algorithms for Enumeration Problems. J. Algorithms 10(3): 429-448 (1989) - [c30]Garth A. Gibson, Lisa Hellerstein, Richard M. Karp, Randy H. Katz, David A. Patterson:
Failure Correction Techniques for Large Disk Arrays. ASPLOS 1989: 123-132 - [c29]Richard M. Karp, Yanjun Zhang:
On Parallel Evaluation of Game Trees. SPAA 1989: 409-420 - 1988
- [j39]Richard M. Karp, Eli Upfal, Avi Wigderson:
The Complexity of Parallel Search. J. Comput. Syst. Sci. 36(2): 225-253 (1988) - [j38]Richard M. Karp, Rajeev Motwani, Prabhakar Raghavan:
Deferred Data Structuring. SIAM J. Comput. 17(5): 883-902 (1988) - [c28]Phillip B. Gibbons, Richard M. Karp, Gary L. Miller, Danny Soroker:
Subtree Isomorphism is in Random NC. AWOC 1988: 43-52 - [c27]Richard M. Karp, Yanjun Zhang:
A Randomized Parallel Branch-and-Bound Procedure. STOC 1988: 290-300 - 1987
- [j37]Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani:
Global Wire Routing in Two-Dimensional Arrays. Algorithmica 2: 113-129 (1987) - [j36]Richard M. Karp, Michael O. Rabin:
Efficient Randomized Pattern-Matching Algorithms. IBM J. Res. Dev. 31(2): 249-260 (1987) - [j35]Ilan Adler, Richard M. Karp, Ron Shamir:
A simplex variant solving an m times d linear program in O(min(m2, d2) expected number of pivot steps. J. Complex. 3(4): 372-387 (1987) - 1986
- [j34]Richard M. Karp:
Combinatorics, Complexity, and Randomness. Commun. ACM 29(2): 97-109 (1986) - [j33]Richard M. Karp, Eli Upfal, Avi Wigderson:
Constructing a perfect matching is in random NC. Comb. 6(1): 35-48 (1986) - [j32]Ilan Adler, Richard M. Karp, Ron Shamir:
A Family of Simplex Variants Solving an m × d Linear Program in Expected Number of Pivot Steps Depending on d Only. Math. Oper. Res. 11(4): 570-590 (1986) - [c26]Richard M. Karp, Michael E. Saks, Avi Wigderson:
On a Search Problem Related to Branch-and-Bound Procedures. FOCS 1986: 19-28 - [c25]Sally Floyd, Richard M. Karp:
FFD Bin Packing for Item Sizes with Distributions on [0,1/2]. FOCS 1986: 322-330 - 1985
- [j31]Richard M. Karp, Avi Wigderson:
A Fast Parallel Algorithm for the Maximal Independent Set Problem. J. ACM 32(4): 762-773 (1985) - [j30]Richard M. Karp, Michael Luby:
Monte-Carlo algorithms for the planar multiterminal network reliability problem. J. Complex. 1(1): 45-64 (1985) - [c24]Richard M. Karp:
Turing award lecture. ACM Annual Conference 1985: 193 - [c23]Richard M. Karp, Eli Upfal, Avi Wigderson:
The Complexity of Parallel Computation on Matroids. FOCS 1985: 541-550 - [c22]Richard M. Karp, Eli Upfal, Avi Wigderson:
Constructing a Perfect Matching is in Random NC. STOC 1985: 22-32 - [c21]Richard M. Karp, Eli Upfal, Avi Wigderson:
Are Search and Decision Problems Computationally Equivalent? STOC 1985: 464-475 - 1984
- [c20]Richard M. Karp, Avi Wigderson:
A Fast Parallel Algorithm for the Maximal Independent Set Problem. STOC 1984: 266-272 - [c19]Richard M. Karp, Michael Luby, Alberto Marchetti-Spaccamela:
A Probabilistic Analysis of Multidimensional Bin Packing Problems. STOC 1984: 289-298 - 1983
- [j29]Richard M. Karp, Judea Pearl:
Searching for an Optimal Path in a Tree with Random Costs. Artif. Intell. 21(1-2): 99-116 (1983) - [c18]Richard M. Karp, Michael Luby:
Monte-Carlo Algorithms for Enumeration and Reliability Problems. FOCS 1983: 56-64 - [c17]Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani:
Global Wire Routing in Two-Dimensional Arrays (Extended Abstract). FOCS 1983: 453-459 - [e3]David S. Johnson, Ronald Fagin, Michael L. Fredman, David Harel, Richard M. Karp, Nancy A. Lynch, Christos H. Papadimitriou, Ronald L. Rivest, Walter L. Ruzzo, Joel I. Seiferas:
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25-27 April, 1983, Boston, Massachusetts, USA. ACM 1983 [contents] - 1982
- [j28]Danny Dolev, Shimon Even, Richard M. Karp:
On the Security of Ping-Pong Protocols. Inf. Control. 55(1-3): 57-68 (1982) - [j27]Richard M. Karp:
Dynamic programming meets the principle of inclusion and exclusion. Oper. Res. Lett. 1(2): 49-51 (1982) - [j26]Richard M. Karp, Christos H. Papadimitriou:
On Linear Characterizations of Combinatorial Optimization Problems. SIAM J. Comput. 11(4): 620-632 (1982) - [c16]Danny Dolev, Shimon Even, Richard M. Karp:
On the Security of Ping-Pong Protocols. CRYPTO 1982: 177-186 - [c15]Narendra Karmarkar, Richard M. Karp:
An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem. FOCS 1982: 312-320 - 1981
- [j25]Richard M. Karp, James B. Orlin:
Parametric shortest path algorithms with an application to cyclic staffing. Discret. Appl. Math. 3(1): 37-45 (1981) - [j24]Manuel Blum, Richard M. Karp, Oliver Vornberger, Christos H. Papadimitriou, Mihalis Yannakakis:
The Complexity of Testing Whether a Graph is a Superconcentrator. Inf. Process. Lett. 13(4/5): 164-167 (1981) - [c14]Richard M. Karp, Michael Sipser:
Maximum Matchings in Sparse Random Graphs. FOCS 1981: 364-375 - 1980
- [j23]Richard M. Karp, Robert Endre Tarjan:
Linear Expected-Time Algorithms for Connectivity Problems. J. Algorithms 1(4): 374-393 (1980) - [j22]Richard M. Karp:
An algorithm to solve the m × n assignment problem in expected time O(mn log n). Networks 10(2): 143-152 (1980) - [c13]Richard M. Karp, Christos H. Papadimitriou:
On Linear Characterizations of Combinatorial Optimization Problems. FOCS 1980: 1-9 - [c12]Richard M. Karp, Richard J. Lipton:
Some Connections between Nonuniform and Uniform Complexity Classes. STOC 1980: 302-309 - [c11]Richard M. Karp, Robert Endre Tarjan:
Linear Expected-Time Algorithms for Connectivity Problems (Extended Abstract). STOC 1980: 368-377
1970 – 1979
- 1979
- [j21]Richard M. Karp:
A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem. SIAM J. Comput. 8(4): 561-573 (1979) - [c10]Romas Aleliunas, Richard M. Karp, Richard J. Lipton, László Lovász, Charles Rackoff:
Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. FOCS 1979: 218-223 - [c9]Richard M. Karp:
Recent Advances in the Probabilistic Analysis of Graph-Theoretic Algorithms (Abstract). ICALP 1979: 338-339 - 1978
- [j20]Richard M. Karp:
A characterization of the minimum cycle mean in a digraph. Discret. Math. 23(3): 309-311 (1978) - 1977
- [j19]Richard M. Karp:
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane. Math. Oper. Res. 2(3): 209-224 (1977) - 1975
- [j18]Richard M. Karp, Shuo-Yen Robert Li:
Two special cases of the assignment problem. Discret. Math. 13(2): 129-142 (1975) - [j17]Richard M. Karp:
On the Computational Complexity of Combinatorial Problems. Networks 5(4): 45-68 (1975) - [j16]Richard M. Karp, A. C. McKellar, C. K. Wong:
Near-Optimal Solutions to a 2-Dimensional Placement Problem. SIAM J. Comput. 4(3): 271-286 (1975) - 1973
- [j15]John E. Hopcroft, Richard M. Karp:
An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM J. Comput. 2(4): 225-231 (1973) - [e2]Alfred V. Aho, Allan Borodin, Robert L. Constable, Robert W. Floyd, Michael A. Harrison, Richard M. Karp, H. Raymond Strong:
Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1973, Austin, Texas, USA. ACM 1973 [contents] - 1972
- [j14]Jack Edmonds, Richard M. Karp:
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. J. ACM 19(2): 248-264 (1972) - [j13]David Gale, Richard M. Karp:
A Phenomenon in the Theory of Sorting. J. Comput. Syst. Sci. 6(2): 103-115 (1972) - [c8]Michael Held, Richard M. Karp, Philip Wolfe:
Large scale optimization and the relaxation method. ACM Annual Conference (1) 1972: 507-509 - [c7]Richard M. Karp:
Reducibility Among Combinatorial Problems. Complexity of Computer Computations 1972: 85-103 - [c6]Richard M. Karp, Raymond E. Miller, Arnold L. Rosenberg:
Rapid Identification of Repeated Patterns in Strings, Trees and Arrays. STOC 1972: 125-136 - 1971
- [j12]Michael Held, Richard M. Karp:
The traveling-salesman problem and minimum spanning trees: Part II. Math. Program. 1(1): 6-25 (1971) - [j11]Richard M. Karp:
A simple derivation of Edmonds' algorithm for optimum branchings. Networks 1(3): 265-272 (1971) - [c5]John E. Hopcroft, Richard M. Karp:
A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SWAT 1971: 122-125 - 1970
- [j10]Michael Held, Richard M. Karp:
The Traveling-Salesman Problem and Minimum Spanning Trees. Oper. Res. 18(6): 1138-1162 (1970) - [c4]David Gale, Richard M. Karp:
A Phenomenon in the Theory of Sorting. SWAT 1970: 51-59 - [e1]Patrick C. Fischer, Robert Fabian, Jeffrey D. Ullman, Richard M. Karp:
Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, May 4-6, 1970, Northampton, Massachusetts, USA. ACM 1970 [contents]
1960 – 1969
- 1969
- [j9]Richard M. Karp, Raymond E. Miller:
Parallel Program Schemata. J. Comput. Syst. Sci. 3(2): 147-195 (1969) - 1967
- [j8]Richard M. Karp:
Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines. J. ACM 14(3): 478-489 (1967) - [j7]Richard M. Karp, Raymond E. Miller, Shmuel Winograd:
The Organization of Computations for Uniform Recurrence Equations. J. ACM 14(3): 563-590 (1967) - [c3]Richard M. Karp, Raymond E. Miller:
Parallel Program Schemata: A Mathematical Model for Parallel Computation. SWAT 1967: 55-61 - 1966
- [j6]Lawrence Paul Horwitz, Richard M. Karp, Raymond E. Miller, Shmuel Winograd:
Index Register Allocation. J. ACM 13(1): 43-61 (1966) - 1965
- [j5]Michael Held, Richard M. Karp:
The Construction of Discrete Dynamic Programming Algorithms. IBM Syst. J. 4(2): 136-147 (1965) - 1964
- [j4]Richard M. Karp:
Some Techniques of State Assignment for Synchronous Sequential Machines. IEEE Trans. Electron. Comput. 13(5): 507-518 (1964) - 1962
- [j3]J. Paul Roth, Richard M. Karp:
Minimization Over Boolean Graphs. IBM J. Res. Dev. 6(2): 227-238 (1962) - 1961
- [j2]Richard M. Karp:
Minimum-redundancy coding for the discrete noiseless channel. IRE Trans. Inf. Theory 7(1): 27-38 (1961) - [c2]Michael Held, Richard M. Karp:
A dynamic programming approach to sequencing problems. ACM National Meeting 1961: 71 - [c1]Richard M. Karp, F. E. McFarlin, J. Paul Roth, J. R. Wilts:
A computer program for the synthesis of combinational switching circuits. SWCT 1961: 182-194 - 1960
- [j1]Richard M. Karp:
A Note on the Applicaton of Graph Theory to Digital Computer Programming. Inf. Control. 3(2): 179-190 (1960)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
