Publications

Found 238 results
Author [ Title(Asc)] Type Year
Filters: Author is Richard M. Karp  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
V
Karp, R. M. (1998).  Variations on the Theme of "Twenty Questions". Proceedings of the 1998 IEEE International Symposium on Information Theory. 3.
T
Karp, R. M., & Li S-Y. R. (1975).  Two Special Cases of the Assignment Problem. Discrete Mathematics (Netherlands). 13(2), 129-142.
Gibbons, P. B., Karp R. M., Ramachandran V., Soroker D., & Tarjan R.. (1991).  Transitive Compaction in Parallel via Branchings. Journal of Algorithms. 12(1), 110-125.
Karp, R. M. (1989).  The Transitive Closure of a Random Digraph.
Ben-Dor, A., Hartman T., Karp R. M., Schwikowski B., Sharan R., & Yakhini Z. (2004).  Towards Optimally Multiplexed Applications of Universal Arrays. Journal of Computational Biology. 11, 477-493.
Bruckner, S., Hüffner F., Karp R. M., Shamir R., & Sharan R. (2010).  Torque: Topology-Free Querying of Protein Interaction Networks. Journal of Computational Biology. 17(3), 237-252.
Bruckner, S., Hüffner F., Karp R. M., Shamir R., & Sharan R. (2009).  Torque: Topology-Free Querying of Protein Interaction Networks. Nucleic Acids Research. 37, 106-108.
Bruckner, S., Hüffner F., Karp R. M., Shamir R., & Sharan R. (2009).  Torque: Topology-Free Querying of Protein Interaction Networks. 74-89.
Bruckner, S., Hüffner F., Karp R. M., Shamir R., & Sharan R. (2010).  Topology-Free Querying of Protein Interaction Networks. Journal of Computational Biology. 17(3), 237-252.
Ratnasamy, S., Handley M., Karp R. M., & Shenker S. (2002).  Topologically-Aware Overlay Construction and Server Selection. Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002). 3, 1190-1199.
Karp, R. M. (2009).  Three Combinatorial Problems in Computational and Genomic Biology.
Karp, R. M. (2012).  Theory of Computation as an Enabling Tool for the Sciences.
Karp, R. M. (2012).  Theory of Computation as an Enabling Tool for the Sciences.
Edmonds, J., & Karp R. M. (1972).  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. Journal of the Association for Computing Machinery. 19(2), 248-264.
S
Gibbons, P. B., Karp R. M., Miller G. L., & Soroker D. (1990).  Subtree isomorphism is in random NC. Discrete Applied Mathematics. 29(1), 35-62.
Gibbons, P. B., Karp R. M., Miller G. L., & Soroker D. (1989).  Subtree Isomorphism is in Random NC.
Gibbons, P. B., Karp R. M., Miller G. L., & Soroker D. (1988).  Subtree isomorphism is in random NC. Proceedings of the Third Aegean Workshop on Computing, VLSI Algorithms and Architectures (AWOC 88). 43-52.
Karp, R. M. (2007).  Streaming Algorithms for Selection and Approximate Sorting. Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. 9-20.

Pages