Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
algorithm correctness proof
Description:
A formal or mathematical argument demonstrating that an algorithm satisfies its specification for all inputs within stated assumptions.
Related topics:
Complexity and Algorithms in Graphs (13%),
Logic, programming, and type systems (11%),
Distributed systems and fault tolerance (10%)
OpenAlex ID:
keywords/algorithm-correctness-proof
Modern hierarchical, agglomerative clustering algorithms
2011
·
Müllner, Daniel
·
arXiv (Cornell University)
·
1,197
PDF
The theory and practice of distance geometry
1983
·
Timothy F. Havel
, Irwin D. Kuntz
, et al.
·
Bulletin of Mathematical Biology
·
459
The stable marriage problem
1971
·
D. G. McVitie
, L. B. Wilson
·
Communications of the ACM
·
455
PDF
Algorithms for mutual exclusion
1986
·
Raynal, Michel
·
CERN Document Server (European Organization for Nuclear Research)
·
380
Applied and algorithmic graph theory
1992
·
Gary Chartrand
·
376
MJRTY—A Fast Majority Vote Algorithm
1991
·
Robert S. Boyer
, J. Strother Moore
·
Automated reasoning series
·
301
Construction of three-dimensional Delaunay triangulations using local transformations
1991
·
Barry Joe
·
Computer Aided Geometric Design
·
265
The causal ordering abstraction and a simple way to implement it
1991
·
Michel Raynal
, André Schiper
, et al.
·
Information Processing Letters
·
241
A new connected components algorithm for virtual memory computers
1983
·
Ronald Lumia
, Linda Shapiro
, et al.
·
Computer Vision Graphics and Image Processing
·
232
Proof of algorithms by general snapshots
1966
·
Peter Naur
·
BIT Numerical Mathematics
·
217
Proof of a program
1971
·
C. A. R. Hoare
·
Communications of the ACM
·
213
PDF
Elements of Distributed Algorithms: Modeling and Analysis with Petri Nets
2010
·
Wolfgang Reisig
·
186
Another adaptive distributed shortest path algorithm
1991
·
P.A. Humblet
·
IEEE Transactions on Communications
·
125
Describing an algorithm by Hopcroft
1973
·
David Gries
·
Acta Informatica
·
112
A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph
1972
·
Herbert Weinblatt
·
Journal of the ACM
·
107
PDF
Efficient polygon-filling algorithms for raster displays
1983
·
Michael R. Dunlavey
·
ACM Transactions on Graphics
·
105
PDF
DualMiner: A Dual-Pruning Algorithm for Itemsets with Constraints
2003
·
Cristian Bucilă
, Johannes Gehrke
, et al.
·
Data Mining and Knowledge Discovery
·
85
Data Flow Analysis for Procedural Languages
1979
·
Barry K. Rosen
·
Journal of the ACM
·
76
PDF
An Admissibility-Based Operational Transformation Framework for Collaborative Editing Systems
2009
·
Du Li
, Rui Li
·
Computer Supported Cooperative Work (CSCW)
·
72
Collective Construction of Environmentally-Adaptive Structures
2007
·
Justin Werfel
, Donald Ingber
, et al.
·
IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
·
62
A simple hypergraph min cut algorithm
1996
·
Klimmek, Regina
, Wagner, Frank
·
Refubium (Universitätsbibliothek der Freien Universität Berlin)
·
60
Deriving a fixpoint computation algorithm for top-down abstract interpretation of logic programs
1990
·
Kalyan Muthukumar
, Manuel V. Hermenegildo
·
Hispana
·
60
Topological Structure of Quantum Algorithms
2013
·
Jamie Vicary
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
53
PDF
A study of the Bienstock–Zuckerberg algorithm: applications in mining and resource constrained project scheduling
2017
·
Gonzalo Muñoz
, Daniel Espinoza
, et al.
·
Computational Optimization and Applications
·
50
PDF
Dynamic programming solution for a class of pursuit evasion problems: the herding problem
2001
·
P. Kachroo
, S.A. Shedied
, et al.
·
IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)
·
50
Show more works
View as search
Works count:
394
Citation count:
7,449
Year
Topic
Type