Publications

Found 4136 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
Althaus, E., & Mehlhorn K. (2000).  TSP-Based Curve Reconstruction in Polynomial Time. Proceedings of the Eleventh Symposium on Discrete Algorithms. 686-695.
Althaus, E., Kohlbacher O., Lenhof H-P., & Müller P. (2000).  A Combinatorial Approach to Protein Docking with Flexible Side-Chains. Proceedings of the Fourth Annual International conference on Computational Molecular Biology (RECOMB-00).
Alt, H., Guibas L. J., Mehlhorn K., & Karp R. M. (1996).  A Method for Obtaining Randomized Algorithms with Small Tail Probabilities. Algorithmica. 16(4-5), 543-547.
Alt, H., Guibas L. J., Mehlhorn K., Karp R. M., & Wigderson A. (1991).  A Method for Obtaining Randomized Algorithms with Small Tail Probabilities.
Alpernas, K., Manevich R., Panda A., Sagiv M., Shenker S., Shoham S., et al. (2018).  Abstract Interpretation of Stateful Networks. Proceedings of SAS 2018.
Alpaydin, E. (1997).  REx: Learning A Rule and Exceptions.
Alpaydin, E. (1991).  GAL: Networks That Grow When They Learn and Shrink When They Forget.
Alon, N., Karp R. M., Peleg D., & West D. (1995).  A graph-theoretic game and its application to the k-server problem. SIAM Journal on Computing. 24(1), 78-100.
Alon, N., Karp R. M., Peleg D., & West D. (1991).  A Graph-Theoretic Game and its Application to the k-Server Problem.
Alon, N., Blum M. E., Fiat A., Kannan S., Naor M., & Ostrovsky R. (1993).  Matching Nuts and Bolts.
Almeida, M., Finamore A., Perino D., Vallina-Rodriguez N., & Varvello M. (2017).  Dissecting DNS Stakeholders in Mobile Networks. Proceedings of CoNEXT.
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.
Allman, M. (2008).  Thoughts on Reviewing. ACM Computer Communication Review. 38(2), 47-50.
Allman, M., Floyd S., & Partridge C. (2002).  RFC 3390: Increasing TCP's Initial Window.
Allman, M., Glover D., & Sanchez L.. (1999).  Enhancing TCP Over Satellite Channels Using Standard Mechanisms..
Allman, M., Christensen K.., Nordman B., & Paxson V. (2007).  Enabling an Energy-Efficient Future Internet Through Selectively Connected End Systems.
Allman, M., & Paxson V. (2001).  On Estimating End-to-End Network Path Properties. ACM SIGCOMM Workshop on Data Communication in Latin American and the Caribbean.
Allman, M., Kreibich C., Paxson V., Sommer R., & Weaver N. (2008).  Principles for Developing Comprehensive Network Visibility.
Allman, M., Griner J., & Richard A.. (2000).  TCP Behavior in Networks with Dynamic Propagation Delay. Proceedings of Globecom 2000.
Allman, M. (2010).  On Building Special-Purpose Social Networks for Emergency Communication. ACM Computer Communication Review. 40,
Allman, M. (2018).  Comments on DNS Robustness. ACM Internet Measurement Conference.
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.

Pages