Publications

Found 4228 results
[ Author(Asc)] Title Type Year
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 
K
Karpinski, M., & Werther T. (1989).  VC Dimension and Learnability of Sparse Polynomials and Rational Functions.
Karpinski, M., & der Heide F. Meyer auf (1990).  On the Complexity of Genuinely Polynomial Computation.
Karpinski, M., & Macintyre A. (1995).  VC Dimension of Sigmoidal and General Pfaffian Neural Networks.
Karpinski, M., & Macintyre A. (1995).  Polynomial Bounds for VC Dimension of Sigmoidal Neural Networks.
Karpinski, M. (1997).  Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems.
Karpinski, M., & Luby M. (1990).  Approximating the Number of Solutions of a GF[2] Polynomial.
Karpinski, M., & Zelikovsky A. (1995).  1.757 and 1.267-Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems.
Karpinski, M., Wirtgen J., & Zelikovsky A. (1997).  An Approximation Algorithm for the Bandwidth Problem on Dense Graphs.
Karpinski, M., & Verbeek R. (1992).  Computation of the Additive Complexity of Algebraic Circuits with Root Extracting.
Karpinski, M., & Zimmermann W. (1991).  Probabilistic Recurrence Relations for Parallel Divide-and-Conquer Algorithms.
Karpinski, M., & Zelikovsky A. (1996).  Approximating Dense Cases of Covering Problems.
Karpinski, M., & Lhotzky B. (1991).  An (epsilon, delta)--Approximation Algorithm of the Number of Zeros for a Multilinear Polynomial over GF[q].
Karp, R. M., & Zhang Y. (1995).  Bounded branching process and AND/OR tree evaluation. Random Structures and Algorithms. 7(2), 97-116.
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.
Karp, R. M., & Sipser M.. (1981).  Maximum Matchings in Sparse Random Graphs. Proceedings of the 22nd IEEE Annual Symposium on Foundations of Computer Science. 364-375.
Karp, R. M. (1986).  Combinatorics, Complexity, and Randomness. Communications of the ACM. 29(2), 98-109.
Karp, R. M., Luby M., & M. Shokrollahi A. (2004).  Finite-Length Analysis of LT-codes. Proceedings of International Symposium on Information Theory (ISIT).
Karp, R. M. (2006).  George Dantzig's Impact on the Theory of Computation. Discrete Optimization. 5(2), 174-185.
Karp, R. M., Koutsoupias E.., Papadimitriou C. H., & Shenker S. J. (2000).  Optimization Problems in Congestion Control. Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS 2000). 66-74.
Karp, R. M. (1978).  A Characterization of the Minimum Cycle Mean in a Digraph. Discrete Mathematics (Netherlands). 23(3), 309-311.
Karp, R. M., Rao A., Lakshminarayanan K., Surana S., & Stoica I. (2003).  Load Balancing in Structured P2P Systems. Proceedings of the Second International Workshop on Peer-to-Peer Systems.
Karp, R. M. (1989).  The Transitive Closure of a Random Digraph.
Karp, R. M., Motwani R., & Raghaven P.. (1988).  Deferred Data Structuring. SIAM Journal on Computing. 17(5), 883-902.
Karp, R. M., & Zhang Y. (1993).  Randomized parallel algorithms for backtrack search and branch-and-bound computation. Journal of the Association for Computing Machinery. 40(3), 765-789.
Karp, R. M. (1974).  On the Computational Complexity of Combinatorial Problems. 45-68.

Pages