Publications

Found 4131 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 
A
Adler, M., Halperin E., Karp R. M., & Vazirani V. V. (2003).  A Stochastic Process on the Hypercube with Applications to Peer to Peer Networks. Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC).
Adler, M., Byers J. W., & Karp R. M. (1995).  Parallel sorting with limited bandwidth. Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '95). 129-136.
Adler, I., Ahn H-S., Karp R. M., & Ross S. M. (2005).  A Probabilistic Model for the Survivability of Cells. Journal of Applied Probability. 42(4), 919-931.
Adler, I., Karp R. M., & Shamir R. (1986).  A family of simplex variants solving an m*d linear program in expected number of pivot steps depending on d only. Mathematics of Operations Research. 11(4), 570-590.
Adler, I., Ahn H.. S., Karp R. M., & Ross S. M. (2003).  Coalescing Times for IID Random Variables.
Adler, M., Halperin E., Karp R. M., & Vazirani V. V. (2003).  A Stochastic Process on the Hypercube with Applications to Peer-to-peer Networks. Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC 2003). 575-584.
Adler, M., Byers J. W., & Karp R. M. (1995).  Scheduling parallel communication: the h-relation problem. Proceedings of the 20th International Mathematical Foundations of Computer Science Symposium, (MFCS '95). 1-20.
Adler, I., Karp R. M., & Shamir R. (1987).  A Simplex variant solving an m*d linear program in O(min(m2, d2)) expected number of pivot steps. Journal of Complexity. 3(4), 372-387.
Adler, M., Bartal Y., Byers J. W., Luby M., & Raz D. (1997).  A Modular Analysis of Network Transmission Protocols.
Adler, M., Byers J. W., & Karp R. M. (2000).  Parallel Sorting with Limited Bandwidth. 29(6), 1997-2015.
Adler, M., Gemmell P., Harchol-Balter M., Karp R. M., & Kenyon C. (1994).  Selection in the presence of noise: the design of playoff systems. Proceedings of Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 564-572.
Adler, M., Byers J. W., & Karp R. M. (1995).  Scheduling Parallel Communication: The h-Relation Problem.
Adler, M., Byers J. W., & Karp R. M. (1995).  Parallel Sorting With Limited Bandwidth.
Adcock, A. B., Sullivan B. D., & Mahoney M. W. (2014).  Tree Decompositions and Social Graphs.
Adams, A. K., Mahdavi J., Mathis M., & Paxson V. (1998).  Creating a Scalable Architecture for Internet Measurement. Proceedings of the Internet Summit (INET '98).
Adams, A. K., Bu T., Cáceres R., Duffield N., Friedman T., Horowitz J., et al. (2000).  The Use of End-to-end Multicast Measurements for Characterizing Internal Network Behavior.
Adams, O., Cohn T., Neubig G., Cruz H., Bird S., & Michaud A. (2018).  Evaluating phonemic transcription of low-resource tonal languages for language documentation. Proceedings of the LREC 2018 Workshop.
Adamo, J-M., & Anguita D. (1994).  Object Oriented Design of a BP Neural Network Simulator and Implementation on the Connection Machine (CM-5).
Adamo, J-M. (1994).  Development of Parallel BLAS with ARCH Object-Oriented Parallel Library, Implementation on CM-5.
Adamo, J-M. (1994).  Object-Oriented Parallel Programming: Design and Development of an Object-Oriented Library for SPMD Programming.
Adami, A., Kajarekar S., & Hermansky H. (2002).  A New Speaker Change Detection Method for Two-Speaker Segmentation. Proceedings of the International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2002).
Adami, A., Burget L., Dupont S., Garudadri H., Grezl F., Hermansky H., et al. (2002).  Qualcomm-ICSI-OGI Features for ASR. Proceedings of the 7th International Conference on Spoken Language Processing (ICSLP 2002).
Academies, N. Research C. (2010).  A New Biology for the 21st Century.
Abrash, V., Cohen M., Franco H., Morgan N., & Konig Y. (1992).  Connectionist Gender Adaptation in a Hybrid Neural Network / Hidden Markov Model Speech Recognition System. Proceedings of the International Conference on Spoken Language Processing (ICSLP'92). 911-914.
Ablayev, F., & Karpinski M. (1997).  A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs.

Pages