Randomized algorithm

Known as: Derandomization, Probabilistic computational complexity, Probabilistic-Complexity Theory 
A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic. The algorithm typically uses uniformly random bits… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
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
To accelerate the training of kernel machines, we propose to map the input data to a randomized low-dimensional feature space and… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
Is this relevant?
Highly Cited
2006
Highly Cited
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
Motivated by applications to sensor, peer-to-peer, and ad hoc networks, we study distributed algorithms, also known as gossip… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1996
Highly Cited
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
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
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
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
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
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?