Publications

Found 4258 results
Author [ Title(Desc)] 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 
B
Karpinski, M. (1989).  Boolean Circuit Complexity of Algebraic Interpolation Problems.
Schuett, D.., Eckhardt U.., & Suda P.. (1992).  Boot Algebras.
Pitsillidis, A., Levchenko K., Kreibich C., Kanich C., Voelker G. M., Paxson V., et al. (2010).  Botnet Judo: Fighting Spam with Itself.
Karp, R. M., & Zhang Y. (1995).  Bounded branching process and AND/OR tree evaluation. Random Structures and Algorithms. 7(2), 97-116.
Fornasa, M., Stecca M., Maresca M., & Baglietto P. (2015).  Bounded Latency Spanning Tree Reconfiguration. Computer Networks. 76, 259-274.
Ferber, M., Hunold S., & Rauber T. (2010).  BPEL Remote Objects: Integrating BPEL Processes into Object-Oriented Applications.
Feldman, J. (1984).  Brains and Robots, Two Weak Attempts at the Grand Synthesis.
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.
Bockmayr, A.., & Kasper T.. (1998).  Branch and Infer: A Unifying Framework for Integer and Nite Domain Constraint Programming.
Iyer, A. Padmanabha, Panda A., Venkataraman S., Chowdhury M., Akella A., Shenker S. J., et al. (2018).  Bridging the GAP: towards approximate graph analytics. Proceedings of the 1st ACM SIGMOD Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA).
Feigenbaum, J., P. Godfrey B., Panda A., Schapira M., Shenker S. J., & Singla A. (2012).  Brief Announcement: On the Resilience of Routing Tables. 237-238.
Ramabhadran, S., Ratnasamy S., Hellerstein J. M., & Shenker S. J. (2004).  Brief Announcement: Prefix Hash Tree. Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC 2004). 367.
Whitlock, S., Scott C., & Shenker S. J. (2013).  Brief Announcement: Techniques for Programmatically Troubleshooting Distributed Systems. 1-3.
Allman, M., Paxson V., & Terrell J.. (2007).  A Brief History of Scanning. 77-82.
Blum, L. (1991).  A Brief History of the Association for Women in Mathematics: The Presidents' Perspectives.
Pal, J., & Fonseca R. (2003).  Bringing Devices to the Masses: A Comparative Study of the Brazilian Computador Popular and the Indian Simputer.
Medina, A., & Matta I. (2000).  BRITE: A Flexible Generator of Internet Topologies.
Medina, A., Lakhina A., Matta I., & Byers J. W. (2001).  BRITE: An Approach to Universal Topology Generation. Proceedings of MASCOTS 2001.
Medina, A., Lakhina A., Matta I., & Byers J. W. (2001).  BRITE: Universal Topology Generation From a User's Perspective.
Paxson, V. (1999).  Bro: A System for Detecting Network Intruders in Real-Time. 2435-2463.
Paxson, V. (1998).  Bro: A System for Detecting Network Intruders in Real-Time. Proceedings of the 7th USENIX Security Symposium.
Lei, H., & Mirghafori N. (2014).  Broad Phonetic Classes for Speaker Verification with Noisy, Large-Scale Data.
Schindelhauer, C. (2000).  Broadcasting Time Cannot be Approximated Within a Factor of 57/56-epsilon.
Kreibich, C. (2005).  Brooery: A Graphical Environment for Analysis of Security-Relevant Network Activity. Proceedings of the USENIX Annual Technical Conference, FREENIX Track (USENIX '05 FREENIX). 109-118.
Bell, O., Allman M., & Kuperman B. (2012).  On Browser-Level Event Logging.

Pages