Publications

Found 1116 results
Author Title [ Type(Asc)] Year
Filters: First Letter Of Last Name is K  [Clear All Filters]
Technical Report
Karp, R. M. (1993).  Finite Branching Processes and AND/OR Tree Evaluation.
Krell, M. Michael, Bernd J., Li Y., Ma D., Choi J., Ellsworth M., et al. (2017).  Field Studies with Multimedia Big Data: Opportunities and Challenges.
Dahlhaus, E., Karpinski M., & Novick M. B. (1989).  Fast Parallel Algorithms for the Clique Separator Decomposition.
Grigoriev, D. Yu., Karpinski M., & Yao A. C. (1995).  An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX.
Krishnan, R., Allman M., Partridge C., & Sterbenz J. P. G. (2002).  Explicit Transport Error Notification (ETEN) for Error-Prone Wireless and Satellite Networks.
Banerjea, A., Knightly E. W., Templin F. L., & Zhang H. (1994).  Experiments with the Tenet Real-Time Protocol Suite on the Sequoia 2000 Wide Area Network.
Kay, R. (1989).  The Establishment of the International Computer Science Institute in Berkeley, California: Venturing with Norbert.
Karpinski, M., & Lhotzky B. (1991).  An (epsilon, delta)--Approximation Algorithm of the Number of Zeros for a Multilinear Polynomial over GF[q].
Ananthanarayanan, G., Heimerl K., Zaharia M., Demmer M., Koponen T., Tavakoli A., et al. (2009).  Enabling Innovation Below the Communication API.
Bregler, C., & Konig Y. (1994).  "Eigenlips" for Robust Speech Recognition.
Karp, R. M., Luby M., & der Heide F. Meyer auf (1993).  Efficient PRAM Simulation on a Distributed Memory Machine.
Dahlhaus, E., & Karpinski M. (1989).  An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO).
Dahlhaus, E., & Karpinski M. (1989).  An Efficient Parallel Algorithm for the 3MIS Problem.
Dahlhaus, E., Karpinski M., & Kelsen P. (1992).  An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3.
Dahlhaus, E., Karpinski M., & Kelsen P. (1992).  An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3.
Karpinski, M., & Shparlinski I. (1994).  Efficient Approximation Algorithms for Sparse Polynomials over Finite Fields.
Ghodsi, A., Zaharia M., Hindman B., Konwinski A., Shenker S., & Stoica I. (2011).  Dominant Resource Fairness: Fair Allocation of Multiple Resources in Datacenters.
Morgan, N., Asanović K., Kingsbury B., & Wawrzynek J. (1990).  Developments in Digital VLSI Design for Artificial Neural Networks.
Knightly, E. W. (1996).  Determining Priority Queue Performance from Second Moment Traffic Characterizations.
Kannan, J., Jung J., Paxson V., & Koksal C. Emre (2005).  Detecting Hidden Causality in Network Connections.
Kannan, J., Jung J., Paxson V., & Koksal C. Emre (2005).  Detecting Hidden Causality in Network Connections.
Chun, B-G., Chen K., Lee G., Katz R. H., & Shenker S. (2008).  D3: Declarative Distributed Debugging.
Gathen, J. von zur, Karpinski M., & Shparlinski I. (1994).  Counting Curves and Their Projections.
Karpinski, M., Larmore L. L., & Rytter W. (1996).  Correctness of Constructing Optimal Alphabetic Trees Revisited.
Keshav, S. (1991).  A Control-Theoretic Approach to Flow Control.

Pages