Skip to search formSkip to main contentSkip to account menu

Deterministic algorithm

In computer science, a deterministic algorithm is an algorithm which, given a particular input, will always produce the same output, with the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
AKS primality testAanderaa–Karp–Rosenberg conjectureAbstract machineAdleman–Pomerance–Rumely primality test

Broader (1)

Analysis of algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Markov analysis of selective repeat type II hybrid ARQ using block codes
This paper presents an analytical model for the study of hybrid ARQ techniques on discrete time Markov channels by means of an… 
2008
2008
The Speed of Epidemic Waves in a One-Dimensional Lattice of SIR Models
A one-dimensional lattice of SIR (susceptible/infected/removed) epidemic centres is considered numerically and analytically. The… 
2004
2004
Validated Computing Approach for High-Pressure Chemical and Multiphase Equilibrium
Highly Cited
2003
Highly Cited
2003
A protocol for detecting malicious hosts based on limiting the execution time of mobile agents
Mobile agents are software entities consisting of code and data that can migrate autonomously from host to host executing their… 
Highly Cited
2003
Highly Cited
2003
Asset Allocation and the Liquidity Premium for Illiquid Annuities
Academics and practitioners alike have developed numerous techniques for benchmarking investment returns to properly adjust… 
Highly Cited
2000
Highly Cited
2000
Optimal sequential forestry decisions under risk
This paper is a summary of central and typical concepts, ideas and results in the field of sequential optimization and stochastic… 
Highly Cited
1999
Highly Cited
1999
PRODUCTIVE GOVERNMENT EXPENDITURE IN A STOCHASTICALLY GROWING ECONOMY
This paper analyzes productive government expenditure in a stochastic AK growth model. First, a centrally planned economy is… 
1990
1990
Red-Blue intersection detection algorithms, with applications to motion planning and collision detection
Let Γ be a collection of <italic>n</italic> (possibly intersecting) “red” Jordan arcs of some simple shape in the plane and let… 
Highly Cited
1987
Highly Cited
1987
Non-deterministic approach to anisotropic growth patterns with continuously tunable morphology: the fractal properties of some real snowflakes
The authors demonstrate that a tunable family of patterns resembling a range of experimentally observed snowflakes is obtained… 
1976
1976
A Note on the Succinctness of Descriptions of Deterministic Languages
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)