Publications

Found 4228 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
Allman, M., & Blanton E. (2005).  Notes on Burst Mitigation for Transport Protocols. ACM SIGCOMM Computer Communication Review. 35(2), 53-60.
Allman, M., Paxson V., & Terrell J.. (2007).  A Brief History of Scanning. 77-82.
Allman, M. (2019).  On Eliminating Root Nameservers from the DNS. Proceedings of ACM SIGCOMM Workshop on Hot Topics in Networks (HotNets).
Alizadeh, M., Yang S., Sharif M., Katti S., McKeown N., Prabhakar B., et al. (2013).  pFabric: Minimal Near-Optimal Datacenter Transport. 435-446.
Alizadeh, F., Karp R. M., Newberg L. A., & Weisser D. K. (1993).  Physical Mapping of Chromosomes: A Combinatorial Problem in Molecular Biology.
Alizadeh, M., Yang S., Katti S., McKeown N., Prabhakar B., & Shenker S. J. (2012).  Deconstructing Datacenter Packet Transport. 133-138.
Alizadeh, F. (1993).  Interior Point Methods in Semidefinite Progrmming with Applications to Combinatorial Optimization.
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, F., Karp R. M., Weisser D. K., & Zweig G. (1995).  Physical Mapping of Chromosomes Using Unique Probes.
Alimonti, P., Feuerstain E., & Nanni U. (1992).  Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets.
Alfano, M., & Radouniklis N. (1996).  A Cooperative Multimedia Environment with QOS Control: Architectural and Implementation Issues.
Alfano, M. (1995).  A Quality of Service Management Architecture (QoSMA): A Preliminary Study.
Aleliunas, R., Karp R. M., Lipton R. J., & Lovász L. (1979).  Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface. 174-176.
Aleliunas, R., Karp R. M., Lipton R. J., Lovász L., & Rackoff C. (1979).  Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. Proceedings of the 20th Annual IEEE Symposium of Foundations of Computer Science. 218-223.
Alberts, D., & Henzinger M. Rauch (1995).  Average Case Analysis of Dynamic Graph Algorithms.
Albers, S. (1994).  Improved Randomized On-Line Algorithms for the List Update Problem.
Albers, S., & Mitzenmacher M. (1995).  Average Case Analyses of List Update Algorithms, with Applications to Data Compression.
Albers, S., von Stengel B., & Werchner R. (1995).  A Combined BIT and TIMESTAMP Algorithm for the List Update Problem.
Alber, J., Gramm J., Guo J., & Niedermeier R. (2004).  Computing the Similarity of Two Sequences with Nested Arc Annotations. Theoretical Computer Science. 312(2-3), 337-358.
Albanese, A., Blömer J., Edmonds J., & Luby M. (1994).  Priority Encoding Transmission.
Albanese, A., Luby M., Blömer J., & Edmonds J. (2007).  System for packetizing data encoded corresponding to priority levels where reconstructed data corresponds to fractionalized priority level and received franctionalized packets.
Albanese, A., & Fortino G. (1999).  Robust Transmission of MPEG Video Streams over Lossy Packet-Switching Networks by using PET.
Albanese, A., & Oppliger R. (1999).  Distributed registration and key distribution system and method.
Alaou, A. El, & Mahoney M. (2014).  Fast Randomized Kernel Methods With Statistical Guarantees.
Al-Qudah, Z., Rabinovich M., & Allman M. (2010).  Web Timeouts and Their Implications.

Pages