Checking and Certifying Computational Results (1994)

Cached

Download Links

by Jonathan D. Bright
Citations:2 - 0 self

Documents Related by Co-Citation

308 Designing Programs That Check Their Work – Manuel Blum, Sampath Kannan - 1989
641 LEDA: A Platform for Combinatorial and Geometric Computing – Kurt Mehlhorn, Stefan Näher, Christian Uhrig - 1999
557 Practical Byzantine Fault Tolerance – Miguel Castro, Barbara Loskov
726 Proof verification and hardness of approximation problems – Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy - 1992
811 Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial – Fred B. Schneider, Fred B. Schneider - 1990
27 Checking Linked Data Structures – Nancy M. Amato , Michael C. Loui - 1994
325 Skip Lists: A Probabilistic Alternative to Balanced Trees – William Pugh - 1990
309 Maximum matching and a polyhedron with 0, 1 vertices – J Edmonds - 1965
295 Protocols for Public Key Cryptosystems – R Merkle - 1980