Publications

Found 289 results
[ Author(Desc)] Title Type Year
Filters: First Letter Of Title is P  [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 
H
Hu, X., Gupta A., Feamster N., Panda A., & Shenker S. (2018).  Preserving Privacy at IXPs. Proceedings of the 2nd Asia-Pacific Workshop on Networking APNet '18.
K
Kalfa, W. (1992).  Proposal of an External Processor Scheduling in Micro-Kernel Based Operating Systems.
Kannan, S. (1989).  Program Checkers for Algebraic Problems.
Kannan, S. (1989).  Program Checkers for Algebraic Problems (Thesis).
Karayev, S., Fritz M., Fidler S., & Darrell T. (2011).  A Probabilistic Model for Recursive Factorized Image Features. 401-408.
Karp, R. M. (1991).  Probabilistic Recurrence Relations.
Karp, R. M., & Zhang Y. (1998).  On Parallel Evaluation of Game Trees. 45,
Karp, R. M., & Zhang Y. (1989).  On Parallel Evaluation of Game Trees.
Karp, R. M. (1994).  Probabilistic recurrence relations. Journal of the Association for Computing Machinery. 41(6), 1136-1150.
Karp, R. M., & Matula D. W. (1975).  Probabilistic Behavior of a Naive Coloring Algorithm on Random Graphs. Bulletin of the Operations Research Society of America. 23,
Karp, R. M., Motwani R., & Nisan N. (1993).  Probabilistic analysis of network flow algorithms. Mathematics of Operations Research. 18(1), 71-97.
Karp, R. M. (1979).  A Patching Algorithm for the Nonsymmetric Traveling-salesman Problem. SIAM Journal on Computing. 8(4), 561-573.
Karp, R. M., & Zhang Y. (1989).  On parallel evaluation of game trees. Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures (SPAA '89). 409-420.
Karp, R. M. (1977).  Probabilistic Analysis of Partitioning Algorithms for the Traveling-salesman Problem in the Plane. Mathematics of Operations Research. 2(3), 209-224.
Karp, R. M. (1991).  Parallel Combinatorial Computing.
Karp, R. M., & Orlin J.. B. (1981).  Parametric Shortest Path Algorithms with an Application to Cyclic Staffing. Discrete Applied Mathematics (Netherlands). 3(1), 37-45.
Karp, R. M. (1979).  Probabilistic Analysis of Graph-theoretic Algorithms. Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface.
Karp, R. M., & Matula D. W. (1975).  Probabilistic Behavior of a Naive Coloring Algorithm on Random Graphs.
Karpinski, M., Dahlhaus E., & Lingas A. (1989).  A Parallel Algorithm for Maximum Matching in Planar Graphs.
Karpinski, M. (1997).  Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems.

Pages