Publications

Found 283 results
[ Author(Desc)] Title Type Year
Filters: First Letter Of Title is P  [Clear All Filters]
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
Aberer, K., & Codenotti B. (1992).  On the Power of Discontinous Approximate Computations.
Ablayev, F., & Karpinski M. (1995).  On the Power of Randomized Branching Programs.
Adler, M., Byers J. W., & Karp R. M. (2000).  Parallel Sorting with Limited Bandwidth. 29(6), 1997-2015.
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, M., Byers J. W., & Karp R. M. (1995).  Parallel Sorting With Limited Bandwidth.
Albanese, A., Blömer J., Edmonds J., & Luby M. (1994).  Priority Encoding Transmission.
Alizadeh, F., Karp R. M., Weisser D. K., & Zweig G. (1995).  Physical Mapping of Chromosomes Using Unique Probes.
Alizadeh, F., Karp R. M., Newberg L. A., & Weisser D. K. (1993).  Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology.
Alizadeh, F., Karp R. M., Weisser D. K., & Zweig G. (1994).  Physical mapping of chromosomes using unique probes. Proceedings of Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 489-500.
Alizadeh, M., Yang S., Sharif M., Katti S., McKeown N., Prabhakar B., et al. (2013).  pFabric: Minimal Near-Optimal Datacenter Transport. 435-446.
Allman, M. (2007).  Personal Namespaces. Proceedings of ACM Special Interest Group on Data Communications Workshop on Hot Topics in Networks (HotNets-VI).
Allman, M. (2003).  On the Performance of Middleboxes. ACM SIGCOMM/Usenix Internet Measurement Conference.
Allman, M., Kreibich C., Paxson V., Sommer R., & Weaver N. (2008).  Principles for Developing Comprehensive Network Visibility.
Althaus, E., & Fink C.. (2002).  A Polyhedral Approach to Surface Reconstruction from Planar Contours. Proceedings of the Ninth Conference on Integer Programming and Combinatorial Optimization.
Amann, J., & Sommer R. (2015).  Providing Dynamic Control to Passive Network Security Monitoring. Proceedings of 18th International Symposium on Research in Attacks, Intrusions and Defenses (RAID).
Ameloot, T. J., Van Den Bussche J., Marczak B., Alvaro P., & Hellerstein J. M. (2016).  Putting logic-based distributed systems on stable grounds. Theory and Practice of Logic Programming. 16(4), 378-417.
Anand, A.., Gupta A., Akella A., Seshan S., & Shenker S. (2008).  Packet Caches on Routers: The Implications of Universal Redundant Traffic Elimination. 219-230.
Ananthanarayanan, G., Ghodsi A., Wang A., Borthakur D., Kandula S., Shenker S., et al. (2012).  PACMan: Coordinated Memory Caching for Parallel Jobs. 1-14.
Ang, J., Dhillon R., Krupski A., Shriberg E., & Stolcke A. (2002).  Prosody-Based Automatic Detection of Annoyance and Frustration in Human-Computer Dialog. Proceedings of the 7th International Conference on Spoken Language Processing (ICSLP 2002).
Ang, J. (2002).  Prosodic Cues For Emotion Recognition In Communicator Dialogs.
Anguera, X., Wooters C., & Hernando J. (2006).  Purity Algorithms for Speaker Diarization of Meetings Data. Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2006).
Argyraki, K., Maniatis P., Cheriton D., & Shenker S. (2004).  Providing Packet Obituaries. Proceedings of the Third Workshop on Hot Topics in Networks (HotNets-III).
Arianfar, S., Koponen T., Raghavan B., & Shenker S. (2011).  On Preserving Privacy in Information-Centric Networks. 19-24.
Arora, S., Karger D. R., & Karpinski M. (1995).  Polynomial Time Approximation Schemes for Dense Instances of $NP$-HardProblems.

Pages