Publications

Found 4139 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
Althaus, E., & Mehlhorn K. (2001).  TSP-Based Curve Reconstruction in Polynomial Time. 31(1), 
Althaus, E., Mehlhorn K., Naher S.., & Schirra S. (2000).  Experiments on Curve Reconstruction.
Althaus, E., Caprara A.., Lenhof H-P., & Reinert K.. (2002).  Multiple Sequence Alighment with Arbitrary Gap Costs: Computing an Optimal Solution Using Polydhedral Combinatorics.
Althaus, E. (2001).  Curve Reconstruction and the Traveling Salsman Problem..
Althaus, E., & Mehlhorn K. (2000).  TSP-Based Curve Reconstruction in Polynomial Time. Proceedings of the Eleventh Symposium on Discrete Algorithms. 686-695.
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., Blum M. E., Fiat A., Kannan S., Naor M., & Ostrovsky R. (1993).  Matching Nuts and Bolts.
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.
Almeida, M., Finamore A., Perino D., Vallina-Rodriguez N., & Varvello M. (2017).  Dissecting DNS Stakeholders in Mobile Networks. Proceedings of CoNEXT.
Allman, M. (2003).  TCP Congestion Control with Appropriate Byte Counting (ABC).
Allman, M., Hayes C., & Ostermann S. (1998).  An Evaluation of TCP with Larger Initial Windows. ACM Computer Communication Review. 28,
Allman, M. (2013).  Comments on Bufferbloat. ACM SIGCOMM Computer Communication Review. 3(1), 30-37.
Allman, M. (1997).  Fixing Two BSD TCP Bugs.
Allman, M., & Ostermann S. (1999).  FTP Security Considerations.
Allman, M., & Paxson V. (2008).  A Reactive Measurement Framework. 92-101.
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., 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., & Paxson V. (2007).  Issues and Etiquette Concerning Use of Shared Measurement Data. 135-140.

Pages