# Deterministic algorithm

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2007

Highly Cited

2007

- STOC
- 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

- SODA
- 2006

The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest knownâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- ICALP
- 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

- SODA
- 2005

We present a new deterministic algorithm to construct network codes for multicast problems, a particular class of networkâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- IASTED Conf. on Software Engineering
- 2004

Pairwise coverage of factors affecting software has been proposed to screen for potential errors. Techniques to generate testâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Theor. Comput. Sci.
- 2002

Local search is widely used for solving the propositional satis9ability problem. Papadimitriou (1991) showed that randomizedâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- J. Algorithms
- 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

- STOC
- 1988

An efficient deterministic polynomial time algorithm is developed for the sparse polynomial interpolation problem. The number ofâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- J. Algorithms
- 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

- STOC
- 1985

Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carloâ€¦Â (More)

Is this relevant?