Publications

Found 4083 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., & Paxson V. (2008).  A Reactive Measurement Framework. 92-101.
Allman, M. (1997).  Fixing Two BSD TCP Bugs.
Allman, M., & Ostermann S. (1999).  FTP Security Considerations.
Allman, M., Paxson V., & Blanton E. (2009).  RFC 5681: TCP Congestion Control.
Allman, M., Kruse H., & Ostermann S. (2000).  A History of the Improvement of Internet Protocols Over Satellites Using ACTS.
Allman, M., Blanton E., Paxson V., & Shenker S. (2006).  Fighting Coordinated Attackers with Cross-Organizational Information on Sharing. Proceedings of the Fifth Workshop on Hot Topics in Networks (Hotnets-V). 121-126.
Allman, M., & Paxson V. (2007).  Issues and Etiquette Concerning Use of Shared Measurement Data. 135-140.
Allman, M., Blanton E., & Paxson V. (2005).  An Architecture for Developing Behavioral History. Proceedings of the First Conference on Steps to Reduce Unwanted Traffic in the Internet (SRUTI '05). 45-51.
Allman, M. (2003).  An Evaluation of XML-RPC. ACM Performance Evaluation Review.
Allman, M., & Ostermann S. (1997).  Multiple Data Connection FTP Extensions.
Allman, M., Barford P., Krishnamurty B., & Wang J. (2006).  Tracking the Role of Adversaries in Measuring Unwanted Traffic. Proceedings of the Second Conference on Steps to Reduce Unwanted Traffic in the Internet (SRUTI). 6.
Alizadeh, M., Yang S., Katti S., McKeown N., Prabhakar B., & Shenker S. (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.
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.
Alimonti, P., Feuerstain E., & Nanni U. (1992).  Linear Time Algorithms for Liveness and Boundedness in Conflict-free Petri Nets.
Alfano, M. (1995).  A Quality of Service Management Architecture (QoSMA): A Preliminary Study.
Alfano, M., & Radouniklis N. (1996).  A Cooperative Multimedia Environment with QOS Control: Architectural and Implementation Issues.
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.
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.
Alberts, D., & Henzinger M. Rauch (1995).  Average Case Analysis of Dynamic Graph Algorithms.
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.

Pages