Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Parameter control is aimed at realizing performance gains through a dynamic choice of the parameters which determine the behavior… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
Is this relevant?
Review
2018
Review
2018
Across scientific disciplines, there is a rapidly growing recognition of the need for more statistically robust, transparent… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
This paper presents interactive image editing tools using a new randomized algorithm for quickly finding approximate nearest… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 7
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
This paper presents interactive image editing tools using a new randomized algorithm for quickly finding approximate nearest… Expand
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… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We have already seen some uses of randomization in the design of on line algorithms In these notes we shall describe other… Expand
  • figure 1.1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
I. BASICS. 1. Quick-sort and Search. Quick-sort. Another view of quick-sort. Randomized binary trees. Skip lists. 2. What Is… Expand
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… Expand
Is this relevant?