Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
algorithm correctness
Description:
The property of an algorithm producing results that satisfy its specification for all inputs within its stated assumptions.
Related topics:
Logic, programming, and type systems (16%),
Complexity and Algorithms in Graphs (10%)
OpenAlex ID:
keywords/algorithm-correctness
Ward’s Hierarchical Agglomerative Clustering Method: Which Algorithms Implement Ward’s Criterion?
2014
·
Fionn Murtagh
, Pierre Legendre
·
Journal of Classification
·
4,369
PDF
Algorithms for the Assignment and Transportation Problems
1957
·
James Munkres
·
Journal of the Society for Industrial and Applied Mathematics
·
4,113
A Majority consensus approach to concurrency control for multiple copy databases
1979
·
Robert H. Thomas
·
ACM Transactions on Database Systems
·
1,000
PDF
A unification algorithm for typed λ-calculus
1975
·
G.P. Huet
·
Theoretical Computer Science
·
521
A correction to the algorithm in reiter's theory of diagnosis
1989
·
Russell Greiner
, Barbara A. Smith
, et al.
·
Artificial Intelligence
·
318
Constructing the Call Graph of a Program
1979
·
B.G. Ryder
·
IEEE Transactions on Software Engineering
·
315
A Linear Time Implementation of SPQR-Trees
2001
·
Carsten Gutwenger
, Petra Mutzel
·
Lecture notes in computer science
·
272
Deadlock detection in distributed systems
1989
·
M. Singhal
·
Computer
·
269
Comment on “A fuzzy soft set theoretic approach to decision making problems”
2008
·
Zhi Kong
, Liqun Gao
, et al.
·
Journal of Computational and Applied Mathematics
·
249
PDF
Algorithmic Thinking: The Key for Understanding Computer Science
2006
·
Gerald Futschek
·
Lecture notes in computer science
·
246
DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation
2015
·
Junhao Gan
, Yufei Tao
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
234
The Floyd–Warshall algorithm on graphs with negative cycles
2010
·
Stefan Hougardy
·
Information Processing Letters
·
233
Certifying algorithms
2010
·
R.M. McConnell
, K. Mehlhorn
, et al.
·
Computer Science Review
·
229
Composing cardinal direction relations
2003
·
Spiros Skiadopoulos
, Manolis Koubarakis
·
Artificial Intelligence
·
196
PDF
A theoretical evaluation of selected backtracking algorithms
1997
·
Grzegorz Kondrak
, Peter van Beek
·
Artificial Intelligence
·
178
PDF
SAT-based MaxSAT algorithms
2013
·
Carlos Ansótegui
, Maria Luisa Bonet
, et al.
·
Artificial Intelligence
·
169
PDF
Proof of a Program: FIND
1978
·
C. A. R. Hoare
·
Springer eBooks
·
156
Geometry of digital spaces
1998
·
Gabor T. Herman
·
Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE
·
149
PDF
A theory of alternating paths and blossoms for proving correctness of the $$O(\sqrt V E)$$ general graph maximum matching algorithm
1994
·
Vijay V. Vazirani
·
COMBINATORICA
·
143
Improved Matchmaking Algorithm for Semantic Web Services Based on Bipartite Graph Matching
2007
·
Umesh Bellur
, Roshan Kulkarni
·
IEEE International Conference on Web Services (ICWS)
·
138
Detecting Violations of Differential Privacy
2018
·
Zeyu Ding
, Yuxin Wang
, et al.
·
ACM SIGSAC Conference on Computer and Communications Security (CCS)
·
134
PDF
Dynamical Properties of Timed Automata
2000
·
Anuj Puri
·
Discrete Event Dynamic Systems
·
111
A generalized implicit enumeration algorithm for graph coloring
1985
·
Marek Kubale
, Boguslaw Jackowski
·
Communications of the ACM
·
110
PDF
A simple derivation of edmonds' algorithm for optimum branchings
1971
·
R. M. Karp
·
Networks
·
96
A note on finding optimum branchings
1979
·
P. M. Camerini
, L. Fratta
, et al.
·
Networks
·
94
Show more works
View as search
Works count:
1,261
Citation count:
21,730
Year
Topic
Type