Deterministic algorithm

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
We construct a deterministic fully polynomial time approximationscheme (FPTAS) for computing the total number of matchings in… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Thorup and Zwick showed that for any integer k ≥ 1, it is possible to preprocess any positively weighted undirected graph G = (V… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We present a new deterministic algorithm to construct network codes for multicast problems, a particular class of network… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Pairwise coverage of factors affecting software has been proposed to screen for potential errors. Techniques to generate test… (More)
  • table 1
  • table 2
  • figure 1
  • table 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Local search is widely used for solving the propositional satis9ability problem. Papadimitriou (1991) showed that randomized… (More)
  • figure 1
Is this relevant?
Highly Cited
1992
Highly Cited
1992
We describe a deterministic version of a 1990 Cheriyan, Hagerup, and Mehlhorn randomized algorithm for computing the maximum flow… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
An efficient deterministic polynomial time algorithm is developed for the sparse polynomial interpolation problem. The number of… (More)
  • figure I
Is this relevant?
Highly Cited
1986
Highly Cited
1986
A simple parallel randomized algorithm to find a maximal independent set in a graph G = (V, E) on n vertices is presented. Its… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo… (More)
Is this relevant?