|
593
|
LEDA: A Platform for Combinatorial and Geometric Computing
– Kurt Mehlhorn, Stefan Näher, Christian Uhrig
- 1999
|
|
280
|
Designing Programs That Check Their Work
– Manuel Blum, Sampath Kannan, Comp Sci, Comp Sci
- 1989
|
|
24
|
Checking Linked Data Structures
– Nancy M. Amato , Michael C. Loui
- 1994
|
|
17
|
Checking Mergeable Priority Queues
– Jonathan Bright, Gregory Sullivan
- 1994
|
|
253
|
Maximum matching and a polyhedron with (0,1)-vertices
– J Edmonds
- 1965
|
|
13
|
Checking priority queues
– U Finkler, K Mehlhorn
- 1999
|
|
16
|
LEDA: A library of efficient data types and algorithms
– Stefan Näher, Kurt Mehlhorn
- 1990
|
|
52
|
A Platform for Combinatorial and Geometric Computing
– LEDA
- 1996
|
|
91
|
Software Reliability via Run-Time Result-Checking
– Manuel Blum, Hal Wasserman
- 1994
|
|
21
|
Reflections on the Pentium Division Bug
– Manuel Blum, Hal Wasserman
- 1997
|
|
5
|
A Formally Verified Sorting Certifier
– Jonathan D. Bright, Gregory F. Sullivan, Gerald M. Masson
- 1997
|
|
2
|
A Correctness Certificate for the Stoer-Wagner Mincut Algorithm
– S Arikati, K Mehlhorn
- 1999
|
|
37
|
a Library of Efficient Data Types and Algorithms
– Kurt Mehlhorn
- 1989
|
|
13
|
Certifying and Repairing Solutions to Large LPs -- How Good are LP-solvers?
– Marcel Dhiflaoui, Stefan Funke, Carsten Kwappik, Kurt Mehlhorn, Michael Seel, Elmar Schömer, Ralph Schulte, Dennis Weber
|
|
5
|
Classification and detection of obstructions to planarity
– A Karabeg
- 1990
|
|
9
|
Checking the Integrity of Trees
– Jonathan D. Bright, Gregory F. Sullivan, Gerald M. Masson
- 1995
|
|
8
|
On-line Error Monitoring for Several Data Structures
– Jonathan Bright, Gregory F. Sullivan
- 1995
|
|
27
|
Checking Geometric Programs or Verification of Geometric Structures
– Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, Christian Uhrig
- 1996
|
|
285
|
The Traveling Salesman Problem
– E L Lawler, J K Lenstra, A H
- 1985
|
