sort by
approximate search
1shortlisttitle datasearch history  
results search [or] ISN:0000000116690593 | 1 hits
Person
ISNI: 
0000 0001 1669 0593
Name: 
Karp, R.
Karp, R. M.
Karp, Richard
Karp, Richard M.
Karp, Richard Manning
Ričard Karp
Richard Karp (Amerikaans wiskundige)
Richard Karp (informaticien américain)
Richard Karp (informatico statunitense)
Richard M. Karp (American theoretical computer scientist (b.1935))
Richard M. Karp (amerikanischer Informatiker)
Richard M. Karp (amerikansk datavetare och matematiker)
Richard M. Karp (amerikansk informatikar og matematikar)
Richard M. Karp (amerikansk informatiker og matematiker)
Карп, Ричард Мэннинг
Ричард Карп
Річард Карп
ריצ'רד קארפ
ريتشارد كارب
ریچارد کارپ (ریاضی‌دان و دانشمند علوم کامپیوتر آمریکایی)
রিচার্ড কার্প
ริชาร์ด คาร์ป
リチャード・カープ
理察·卡普
理查德·卡普
Dates: 
1935-
Creation class: 
article
Language material
Text
txt
Creation role: 
author
editor
redactor
Related names: 
American Mathematical Society
Blum, Lenore (1943-....))
Cucker, Felipe (1958-....))
FCRC '93 (1993 ; San Diego)
Reed, Bruce A.
Smale, Stephen (1930-....))
Society for Industrial and Applied Mathematics
Society for Industrial and Applied Mathematics. Symposium (1973 : New York, N.Y.)
Springer-Verlag (Berlin)
Vohra, Rakesh V.
Titles: 
21 NP-полная задача Карпа
۲۱ مسئله ان‌پی-کامل کارپ
algorithm combining discrete and continuous methods for optical mapping., An
algorithm for analysing probed partial digestion experiments., An
algorithmic approach to multiple complete digest mapping, An
Algorithms for choosing differential gene expression experiments
Algorithms for optical mapping.
Association Mapping and Significance Estimation via the Coalescent
Average case analysis of a heuristic for the assignment problem, 1991:
Balancing traffic load in wireless networks with curveball routing
Bit vector intersection problem
CLIFF: clustering of high-dimensional microarray data via iterative feature filtering using normalized cuts.
Combinatorics, complexity, and randomness
Complexity and real computation...
Complexity of Testing Whether a Graph Is a Superconcentrator, The
Conserved pathways within bacteria and yeast as revealed by global protein network alignment.
Conserved patterns of protein interaction in multiple species
Constructing a perfect matching is in random NC
Constructing maps using the span and inclusion relations
CREME: a framework for identifying cis-regulatory modules in human-mouse conserved segments.
Detecting protein sequence conservation via metric embeddings.
Discovering local structure in gene expression data: the order-preserving submatrix problem.
Discovery of regulatory interactions through perturbation: inference and experimental design.
dynamic programming approach to sequencing problems, A
efficiency of resolution and Davis-Putnam procedures, The
Efficient algorithms for detecting signaling pathways in protein interaction networks.
Efficient PRAM simulation on a distributed memory machine.
Efficient randomized pattern-matching algorithms.
Efficient reconstruction of haplotype structure via perfect phylogeny.
Emerging opportunities for theoretical computer science
eQED: an efficient method for interpreting eQTL associations using protein networks.
Error checking and graphical representation of multiple-complete-digest (MCD) restriction-fragment maps.
Error-resilient DNA computation
Failure correction techniques for large disk arrays.
fast parallel algorithm for the maximal independent set problem, A
Federated Computing Research Conference, May 14-22, 1993 San Diego, California
HAPLOPOOL: improving haplotype frequency estimation through DNA pools and phylogenetic modeling
Haplotype inference in complex pedigrees.
Heuristic algorithms in computational molecular biology
Identification of protein complexes by comparative analysis of yeast and bacterial protein interaction data.
Karps 21 NP-vollständige Probleme
Large scale optimization and the relaxation method
Large scale reconstruction of haplotypes from genotype data
Lista de 21 problemas NP-completos de Karp
Logos: a modular bayesian model for de novo motif detection.
LogP: A practical model of parallel computation
LogP: towards a realistic model of parallel computation
Mapping clones with a given ordering or interleaving
Mapping the genome: Some combinatorial problems arising in molecular biology.
minimum-entropy set cover problem, The
Monte-Carlo algorithm for estimating the permanent.
MotifPrototyper: A Bayesian profile model for motif families
Multiconnection switching networks
Nearly optimal competitive online replacement policies
On parallel evaluation of game trees
On the complexity of unsatisfiability proofs for random k-CNF formulas
Optimal algorithm for Monte Carlo estimation
optimal algorithm for on-line bipartite matching, An
Optimal broadcast and summation in the LogP model
Optimization problems in congestion control
Organization of Computations for Uniform Recurrence Equations, The
Parallel sorting with limited bandwidth
Parametric Shortest Path Algorithms with an Application to Cyclic Staffing
Perfect phylogeny and haplotype assignment
Physical mapping of chromosomes:a combinatorial problem in molecular biology
Physical mapping of chromosomes using unique probes.
practical model of parallel computation., A
Probabilistic analysis of combinatorial algorithms : an annotated bibliography
Probabilistic analysis of linear programming decoding
probabilistic analysis of multidimensional bin packing problems, A
Probabilistic analysis of network flow algorithms
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
Probabilistic recurrence relations
Randomization Test for Controlling Population Stratification in Whole-Genome Association Studies, A
Randomized parallel algorithms for backtrack search and branch-and-bound computation
randomized parallel branch-and-bound procedure, A
Rapid identification of repeated patterns in strings, trees and arrays
Reconstructing chain functions in genetic networks.
restriction scaffold problem., The
scalable content-addressable network, A
Searching for an optimal path in a tree with random costs.
Selection in the presence of noise:the design of playoff systems
Selfish behavior and stability of the internet::a game-theoretic analysis of TCP
simple algorithm for finding frequent elements in streams and bags, A
SOME APPLICATIONS OF LOGICAL SYNTAX TO DIGITAL COMPUTER PROGRAMMING
Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines
stochastic process on the hypercube with applications to peer-to-peer networks, A
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Topology-free querying of protein interaction networks.
Torque: topology-free querying of protein interaction networks.
Towards optimally multiplexed applications of universal arrays.
Universal DNA tag systems:a combinatorial design scheme
When is the assignment bound tight for the asymmetric traveling salesman problem?
卡普的二十一個NP-完全問題
Contributed to or performed: 
JOURNAL OF COMPUTER AND SYSTEM SCIENCES
JOURNAL- ASSOCIATION FOR COMPUTING MACHINERY
Notes: 
Sources: 
VIAF DNB LC NUKAT SUDOC WKD
BOWKER
NTA
ZETO