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
Amann, J., & Sommer R. (2015).  Providing Dynamic Control to Passive Network Security Monitoring. Proceedings of 18th International Symposium on Research in Attacks, Intrusions and Defenses (RAID).
Amann, J., Vallentin M., Hall S., & Sommer R. (2012).  Revisiting SSL: A Large Scale Study of the Internet's Most Trusted Protocol.
Amann, J., Hall S., & Sommer R. (2014).  Count Me In: Viable Distributed Summary Statistics for Securing High-Speed Networks.
Amann, J., & Sommer R. (2016).  Exploring Tor's Activity Through Long-term Passive TLS Traffic Measurement. Proceedings of Passive and Active Measurement Conference (PAM).
Amann, J., Vallentin M., Hall S., & Sommer R. (2012).  Extracting Certificates from Live Traffic: A Near Real Time SSL Notary Service.
Amann, J., Sommer R., Vallentin M., & Hall S. (2013).  No Attack Necessary: The Surprising Dynamics of SSL Trust Relationships.
Amann, J., Gasser O., Scheitle Q., Brent L., Carle G., & Holz R. (2017).  Mission Accomplished? HTTPS Security after DigiNotar. Proceedings of the IMC 2017.
Althoff, K-D., Richter M. M., & Wilke W. (1997).  Cased-Based Reasoning: A New Technology for Experience Based Construction of Knowledge Systems.
Althoff, T., Song H. Oh, & Darrell T. (2012).  Detection Bank: An Object Detection Based Video Representation for Multimedia Event Recognition.
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.
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).
Althaus, E., Kohlbacher O., Lenhof H-P., & Müller P. (2000).  A Branch and Cut Algorithm for the Optimal Solution of the Side Chain Placement Problem.
Althaus, E., & Fink C.. (2002).  A Polyhedral Approach to Surface Reconstruction from Planar Contours. Proceedings of the Ninth Conference on Integer Programming and Combinatorial Optimization.
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.
Alt, H., Guibas L. J., Mehlhorn K., Karp R. M., & Wigderson A. (1991).  A Method for Obtaining Randomized Algorithms with Small Tail Probabilities.
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.
Alpernas, K., Manevich R., Panda A., Sagiv M., Shenker S. J., 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. (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.
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.

Pages