Publications

Found 1117 results
Author Title [ Type(Asc)] Year
Filters: First Letter Of Last Name is K  [Clear All Filters]
Technical Report
Konig, Y., & Morgan N. (1994).  Modeling Dynamics in Connectionist Speech Recognition - The Time Index Model.
Günther, O., Müller R., Schmidt P., Bhargava H., & Krishnan R. (1996).  MMM: A WWW-Based Method Management System for Using Software Modules Remotely.
Alt, H., Guibas L. J., Mehlhorn K., Karp R. M., & Wigderson A. (1991).  A Method for Obtaining Randomized Algorithms with Small Tail Probabilities.
Hindman, B., Konwinski A., Zaharia M., Ghodsi A., Joseph A. D., Katz R. H., et al. (2010).  Mesos: A Platform for Fine-Grained Resource Sharing in the Data Center.
Hindman, B., Konwinski A., Zaharia M., Ghodsi A., Joseph A. D., Katz R. H., et al. (2010).  Mesos: A Platform for Fine-Grained Resource Sharing in the Data Center.
Kenyon, C., Randall D., & Sinclair A. (1993).  Matchings in Lattice Graphs (Preliminary Version).
Alon, N., Blum M. E., Fiat A., Kannan S., Naor M., & Ostrovsky R. (1993).  Matching Nuts and Bolts.
Ulrich, R., & Kritzinger P. (1996).  Managing ABR Capacity in Reservation-based Slotted Networks.
Raghavan, B., Koponen T., Ghodsi A., Brajkovic V., & Shenker S. (2012).  Making the Internet More Evolvable.
Freivalds, R., & Karpinski M. (1994).  Lower Space Bounds for Randomized Computation.
Grigoriev, D. Yu., Karpinski M., & Vorobjov N. (1993).  Lower Bounds on Testing Membership to a Polyhedron by Algebraic Decision Trees.
Grigoriev, D. Yu., & Karpinski M. (1993).  Lower Bounds on Complexity of Testing Membership to a Polygon for Algebraic and Randomized Decision Trees.
Grigoriev, D. Yu., Karpinski M., der Heide F. Meyer auf, & Smolensky R. (1995).  A Lower Bound for Randomized Algebraic Decision Trees.
Ablayev, F., & Karpinski M. (1997).  A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs.
Kushilevitz, E., Ostrovsky R., & Rosén A. (1994).  LOG-Space Polynomial End-to-End Communication.
Kulis, B., & Darrell T. (2009).  Learning to Hash with Binary Reconstructive Embeddings.
Angluin, D., Hellerstein L., & Karpinski M. (1989).  Learning Read-Once Formulas with Queries.
Hellerstein, L., & Karpinski M. (1989).  Learning Read-Once Formulas Using Membership Queries.
Eskin, E., Halperin E., & Karp R. M. (2002).  Large-Scale Reconstruction of Haplotype Structure via Perfect Phylogeny.
Zhang, H., & Keshav S. (1991).  Large Comparison of Rate-Based Service Disciplines.
Karagiannis, D., Kurfess F., & Schmidt H. W. (1991).  Knowledge Selection with ANNs.
Karagiannis, D., Kurfess F., & Schmidt H. W. (1991).  Knowledge Selection with ANNs.
Fonseca, R., Porter G. Manning, Katz R. H., Shenker S., & Stoica I. (2005).  IP Options are not an Option.
Karp, R. M. (1990).  An Introduction to Randomized Algorithms.
Grigoriev, D. Yu., Karpinski M., & Singer M. F. (1990).  Interpolation of Sparse Rational Functions Without Knowing Bounds on Exponents.

Pages