# Randomized algorithm

## Papers overview

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

Highly Cited

2009

Highly Cited

2009

- VISAPP
- 2009

For many computer vision problems, the most time consuming component consists of nearest neighbor matching in high-dimensionalâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- NIPS
- 2007

To accelerate the training of kernel machines, we propose to map the input data to a randomized low-dimensional feature space andâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Math. Comput.
- 2006

Randomized algorithms (making random choices during their execution) play an important role in modern computer science, withâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- IEEE Transactions on Information Theory
- 2006

Motivated by applications to sensor, peer-to-peer, and ad hoc networks, we study distributed algorithms, also known as gossipâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- ACM Trans. Math. Softw.
- 1996

The convex hull of a set of points is the smallest convex set that contains the points. This article presents a practical convexâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- FOCS
- 1996

The goal of approximating metric spaces by more simple metric spaces has led to the notion of graph spanners PU89, PS89] and toâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- J. Comput. Syst. Sci.
- 1996

We show that any randomized algorithm that runs in space S and time T and uses poly(S) random bits can be simulated using only Oâ€¦Â (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Algorithmica
- 1990

Competitive analysis is concerned with comparing the performance of on-line algorithms with that of optimal off-line algorithmsâ€¦Â (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- IBM Journal of Research and Development
- 1987

We present randomized algorithms to solve the following string-matching problem and some of its generalizations: Given a string Xâ€¦Â (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?