Publications

Found 4184 results
[ Author(Asc)] Title Type Year
Filters: Filter is   [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
Allman, M. (2003).  On the Performance of Middleboxes. ACM SIGCOMM/Usenix Internet Measurement Conference.
Allman, M., Hayes C., Kruse H., & Ostermann S. (1997).  TCP Performance Over Satellite Links. Proceedings of the Fifth International Conference on Telecommunications Systems.
Allman, M. (2008).  What Ought a Program Committee to Do?.
Allman, M., Blanton E., & Eddy W. M. (2002).  A Scalable System for Sharing Internet Measurements. Proceedings of the Passive and Active Measurement Workshop.
Allman, M., & Falk A. (1999).  On the Effective Evaluation of TCP.
Allman, M., Balakrishnan H., & Floyd S. (2001).  RFC 3042: Enhancing TCP's Loss Recovery Using Limited Transmit.
Allman, M., Dawkins S., Glover D., Griner J., Tran D., Henderson T., et al. (2000).  Ongoing TCP Research Related to Satellites.
Allman, M., Kreibich C., Paxson V., Sommer R., & Weaver N. (2007).  The Strengths of Weaker Identities: Opportunistic Personas. Proceedings of USENIX Workshop on Hot Topics in Security (HotSec 07).
Allman, M., Caldwell A.., & Ostermann S. (1997).  ONE: The Ohio Network Emulator.
Allman, M., Paxson V., & Stevens W.. R. (1999).  TCP Congestion Control.
Alizadeh, F., Karp R. M., Weisser D. K., & Zweig G. (1995).  Physical Mapping of Chromosomes Using Unique Probes.
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.
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.
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. (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.

Pages