Publications

Found 101 results
Author [ Title(Asc)] Type Year
Filters: First Letter Of Title is B  [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 
B
Pal, J., & Fonseca R. (2003).  Bringing Devices to the Masses: A Comparative Study of the Brazilian Computador Popular and the Indian Simputer.
Blum, L. (1991).  A Brief History of the Association for Women in Mathematics: The Presidents' Perspectives.
Allman, M., Paxson V., & Terrell J.. (2007).  A Brief History of Scanning. 77-82.
Whitlock, S., Scott C., & Shenker S. (2013).  Brief Announcement: Techniques for Programmatically Troubleshooting Distributed Systems. 1-3.
Ramabhadran, S., Ratnasamy S., Hellerstein J. M., & Shenker S. (2004).  Brief Announcement: Prefix Hash Tree. Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC 2004). 367.
Feigenbaum, J., P. Godfrey B., Panda A., Schapira M., Shenker S., & Singla A. (2012).  Brief Announcement: On the Resilience of Routing Tables. 237-238.
Iyer, A. Padmanabha, Panda A., Venkataraman S., Chowdhury M., Akella A., Shenker S., 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).
Bockmayr, A.., & Kasper T.. (1998).  Branch and Infer: A Unifying Framework for Integer and Nite Domain Constraint Programming.
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.
Feldman, J. (1984).  Brains and Robots, Two Weak Attempts at the Grand Synthesis.
Ferber, M., Hunold S., & Rauber T. (2010).  BPEL Remote Objects: Integrating BPEL Processes into Object-Oriented Applications.
Fornasa, M., Stecca M., Maresca M., & Baglietto P. (2015).  Bounded Latency Spanning Tree Reconfiguration. Computer Networks. 76, 259-274.
Karp, R. M., & Zhang Y. (1995).  Bounded branching process and AND/OR tree evaluation. Random Structures and Algorithms. 7(2), 97-116.
Pitsillidis, A., Levchenko K., Kreibich C., Kanich C., Voelker G. M., Paxson V., et al. (2010).  Botnet Judo: Fighting Spam with Itself.
Schuett, D.., Eckhardt U.., & Suda P.. (1992).  Boot Algebras.
Karpinski, M. (1989).  Boolean Circuit Complexity of Algebraic Interpolation Problems.
Feldman, J. (1996).  Book Review, Crangle and Suppes, “Language Learning".
Fifield, D., Lan C., Hynes R., Wegmann P., & Paxson V. (2015).  Blocking-resistant communication through domain fronting. Proceedings of the Privacy Enhancing Technologies Symposium (PETS).
Schnorr, C. P. (1992).  Block Korkin-Zolotarev Bases and Successive Minima.
Karbasi, M., Abdelaziz A. Hussen, Meutzner H., & Kolossa D. (2016).  Blind Non-Intrusive Speech Intelligibility Prediction Using Twin-HMMs. Proceedings of Interspeech 2016.
Huijbregts, M., & Wooters C. (2007).  The Blame Game: Performance Analysis of Speaker Diarization System Components. 1857-1860.
Parthasarathi, S. Hari Krish, Chang S-Y., Cohen J., Morgan N., & Wegmann S. (2013).  The Blame Game in Meeting Room ASR: An Analysis of Feature versus Model Errors in Noisy and Mismatched Conditions.
Schnorr, C. P., & Vaudenay S. (1994).  Black Box Cryptanalysis of Hash Networks Based on Multipermutations.
Halvorson, T., Szurdi J., Maier G., Felegyhazi M., Kreibich C., Weaver N., et al. (2012).  The BIZ Top-Level Domain: Ten Years Later.
Karp, R. M., Waarts O., & Zweig G. (1995).  The bit vector intersection problem. Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95). 621-630.

Pages