Probabilistic analysis of algorithms

Known as: Average-case analysis, Average-case computational complexity, Probabilistic analysis 
In analysis of algorithms, probabilistic analysis of algorithms is an approach to estimate the computational complexity of an algorithm or a… (More)
Wikipedia

Related topics

Related topics

11 relations
AlgorithmAmortized analysisAnalysis of algorithmsAsymptotic computational complexity
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Probabilistic Analysis of Mean-Field Games
The purpose of this paper is to provide a complete probabilistic analysis of a large class of stochastic differential games with… (More)
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Probability and computing: randomized algorithms and probabilistic analysis
Randomized algorithms (making random choices during their execution) play an important role in modern computer science, with… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The Probabilistic Analysis of a Greedy Satisfiability Algorithm
On input a random 3-CNF formula of clauses-to-variables ratio r3 applies repeatedly the following simple heuristic: Set to True a… (More)
  • table 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
A general probabilistic framework for worst case timing analysis
The traditional approach to worst-case static-timing analysis is becoming unacceptably conservative due to an ever-increasing… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
A Probabilistic Analysis of the Rocchio Algorithm with TFIDF for Text Categorization
The Rocchio relevance feedback algorithm is one of the most popular and widely applied learning methods from information… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Automatic Average-Case Analysis of Algorithm
Flajolet, P., Salvy, B. and Zimmermann, P., Automatic average-case analysis of algorithms, Theoretical Computer Science 79 (1991… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Average-Case Analysis of Algorithms and Data Structures
This report is a contributed chapter to the Handbook of Theoretical Computer Science (North-Holland, 1990). Its aim is to… (More)
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem
Two algorithms for the k-Satissability problem are presented and a probabilistic analysis is performed. The analysis is based on… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem
An algorithm for the 3-Satissability problem is presented and a probabilistic analysis is performed. The analysis is based on an… (More)
Is this relevant?
Highly Cited
1977
Highly Cited
1977
Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings
The main purpose of this paper is to give techniques for analysing the probabilistic performance of certain kinds of algorithms… (More)
Is this relevant?