Skip to search form
Skip to main content
>
Semantic Scholar
Semantic Scholar's Logo
Search
Sign In
Create Free Account
You are currently offline. Some features of the site may not work correctly.
Deterministic algorithm
In computer science, a deterministic algorithm is an algorithm which, given a particular input, will always produce the same output, with the…
Expand
Wikipedia
Create Alert
Related topics
Related topics
50 relations
AKS primality test
Aanderaa–Karp–Rosenberg conjecture
Abstract machine
Adleman–Pomerance–Rumely primality test
Expand
Broader (1)
Analysis of algorithms
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Image compression techniques: A survey in lossless and lossy algorithms
A. Hussain
,
A. Al-Fayadh
,
N. Radi
Neurocomputing
2018
Corpus ID: 21689319
Abstract The bandwidth of the communication networks has been increased continuously as results of technological advances…
Expand
Review
2017
Review
2017
The use of an unmanned aerial vehicle for fracture mapping within a marble quarry (Carrara, Italy): photogrammetry and discrete fracture network modelling
R. Salvini
,
G. Mastrorocco
,
M. Seddaiu
,
D. Rossi
,
Claudio Vanneschi
2017
Corpus ID: 54891425
ABSTRACT This paper describes the use of a drone in collecting data for mapping discontinuities within a marble quarry. A…
Expand
Highly Cited
2011
Highly Cited
2011
A Tractable Approach to Coverage and Rate in Cellular Networks
J. Andrews
,
F. Baccelli
,
R. Ganti
IEEE Transactions on Communications
2011
Corpus ID: 1434542
Cellular networks are usually modeled by placing the base stations on a grid, with mobile users either randomly scattered or…
Expand
Highly Cited
2006
Highly Cited
2006
A deterministic subexponential algorithm for solving parity games
M. Jurdzinski
,
M. Paterson
,
U. Zwick
SODA '06
2006
Corpus ID: 2792643
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known…
Expand
Highly Cited
2005
Highly Cited
2005
Supply Chain Coordination with Revenue-Sharing Contracts: Strengths and Limitations
Gérard P. Cachon
,
M. Lariviere
Manag. Sci.
2005
Corpus ID: 7894330
Under a revenue-sharing contract, a retailer pays a supplier a wholesale price for each unit purchased, plus a percentage of the…
Expand
Highly Cited
1999
Highly Cited
1999
The swarm and the queen: towards a deterministic and adaptive particle swarm optimization
M. Clerc
Proceedings of the Congress on Evolutionary…
1999
Corpus ID: 119835760
A very simple particle swarm optimization iterative algorithm is presented, with just one equation and one social/confidence…
Expand
Highly Cited
1993
Highly Cited
1993
A deterministic algorithm for global optimization
L. Breiman
,
Adele Cutler
Math. Program.
1993
Corpus ID: 33118591
We present an algorithm for finding the global maximum of a multimodal, multivariate function for which derivatives are available…
Expand
Highly Cited
1992
Highly Cited
1992
A faster deterministic maximum flow algorithm
V. King
,
S. Rao
,
R. Tarjan
SODA '92
1992
Corpus ID: 15493
We describe a deterministic version of a 1990 Cheriyan, Hagerup, and Mehlhorn randomized algorithm for computing the maximum flow…
Expand
Highly Cited
1988
Highly Cited
1988
A deterministic algorithm for sparse multivariate polynomial interpolation
M. Ben-Or
,
P. Tiwari
STOC '88
1988
Corpus ID: 5671508
An efficient deterministic polynomial time algorithm is developed for the sparse polynomial interpolation problem. The number of…
Expand
Highly Cited
1971
Highly Cited
1971
The complexity of theorem-proving procedures
S. Cook
STOC '71
1971
Corpus ID: 7573663
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE