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 
B
Blum, M. E., & Kannan S. (1988).  Program Correctness Checking and the Design of Programs That Check Their Work.
Blum, L., Cucker F., Shub M., & Smale S. (1996).  Algebraic Settings for the Problem.
Blum, L. (1990).  A Theory of Computation and Complexity Over the Real Numbers.
Blum, L., Shub M., & Smale S. (1988).  On a Theory of Computation and Complexity Over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines.
Blum, L. (1991).  A Brief History of the Association for Women in Mathematics: The Presidents' Perspectives.
Blum, M. E., Luby M., & Rubinfeld R. (1991).  Self-Testing/Correcting with Applications to Numerical Problems (Revised Version).
Blum, L., Cucker F., Shub M., & Smale S. (1995).  Complexity and Real Computation: A Manifesto.
Blum, L. (1989).  Lectures on a Theory of Computation and Complexity over the Reals.
Blum, M. E., & Wasserman H. (1994).  Software Reliability via Run-Time Result-Checking.
Blum, M. E. (1988).  Designing Programs to Check Their Work.
Blum, M. E., Luby M., & Rubinfeld R. (1990).  Self-Testing/Correcting with Applications to Numerical Problems.
Blömer, J., Kalfane M., Karpinski M., Karp R. M., Luby M., & Zuckerman D. (1995).  An XOR-Based Erasure-Resilient Coding Scheme.
Blömer, J., Karp R. M., & Welzl E. (1997).  The Rank of Sparse Random Matrices Over Finite Fields. Random Structures and Algorithms. 10,
Blömer, J., Karp R. M., & Welzl E. (1996).  The Rank of Sparse Random Matrices Over Finite Fields.
Blelloch, G. E., Dhamdhere K., Halperin E., Ravi RR., Schwartz R., & Sridhar S. (2006).  Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction. Proceedings of the 33rd International Colloquium on Automata, Languages, and Programming (ICALP 2006). 667-678.
Blasig, R., & Fahner G. (1996).  On the Representative Power of Commented Markov Models.
Blanton, E., & Allman M. (2004).  RFC 3708: Using TCP DSACKs and SCTP Duplicate TSNs to Detect Spurious Retransmissions.
Blanton, E., Allman M., Fall K., & Wang L. (2003).  A Conservative Selective Acknowledgment (SACK)-Based Loss Recovery Algorithm for TCP.
Blanton, E., & Allman M. (2002).  On Making TCP More Robust to Packet Reordering.
Blanton, J., Blanton E., & Allman M. (2008).  Using Spurious Retransmissions to Adapt the Retransmission Timeout.
Blanton, E., & Allman M. (2005).  On the Impact of Bursting on TCP Performance. Proceedings of the Sixth Passive and Active Measurement Workshop (PAM 2005).
Black, A. W., H. Bunnell T., Dou Y., Kumar P., Metze F., Perry D., et al. (2012).  Articulatory Features for Expressive Speech Synthesis.
Bird, S. (2018).  Designing Mobile Applications for Endangered Languages. The Oxford Handbook of Endangered Languages.
Bini, D., & Pan V. (1992).  Improved Parallel Computations with Toeplitz-like and Hankel-like Matrices.
Bini, D., & Pan V. (1992).  Improved Parallel Polynomial Division and Its Extensions.

Pages