Publications

Found 4258 results
Author Title [ Type(Asc)] Year
Technical Report
Byers, J. W. (1998).  Maximizing Throughput of Reliable Bulk Network Transmissions.
Rubinfeld, R. (1990).  A Mathematical Theory of Self-Checking, Self-Testing and Self-Correcting Programs (Thesis).
Tschantz, M. Carl (2023).  A Mathematical Model of Contextual Integrity. ICSI Technical Report.
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.
Mani, D.. R., & Shastri L. (1994).  Massively Parallel Real-Time Reasoning with Very Large Knowledge Bases: An Interim Report.
Fosler-Lussier, E. (1998).  Markov Models and Hidden Markov Models: A Brief Tutorial.
Moretto, P. (1995).  Mapping of Speech Front-End Signal Processing to High Performance Vector Architectures.
Voisard, A., & David B. (1997).  Mapping Conceptual Geographic Models Onto DBMS Data Models.
Ulrich, R., & Kritzinger P. (1996).  Managing ABR Capacity in Reservation-based Slotted Networks.
Ulrich, R. (1996).  A Management Platform for Global Area ATM Networks.
Raghavan, B., Koponen T., Ghodsi A., Brajkovic V., & Shenker S. J. (2012).  Making the Internet More Evolvable.
Mirghafori, N., Fosler-Lussier E., & Morgan N. (1995).  Making Automatic Speech Recognition More Robust to Fast Speech.
Dagum, P. (1990).  On the Magnification of Exchange Graphs with Applications to Enumeration Problems (Thesis).
Raghavan, B., & Hasan S. (2012).  Macroscopically Sustainable Networking: An Internet Quine.
Voisard, A., & Ziekow H. (2010).  Mātārere: A Layered Framework for Specifying Event-Based Systems.
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.
Nanni, U., Salza S., & Terranova M. (1992).  The LOGIDATA+ Prototype System.
Nanni, U., Salza S., & Terranova M. (1992).  The LOGIDATA+ Object Algebra.
Ladkin, P., & Crow J. S. (1990).  On Location: Points About Regions.

Pages