Randomized algorithms
Explore this paper's citation graph
Summary
This book introduces the basic concepts in the design and analysis of randomized algorithms and presents basic tools such as probability theory and probabilistic analysis that are frequently used in algorithmic applications.
- Type
- book
- Published
- 1995-09-01
- Cited by
- 3,314
- References
- 215
- Access
- Open access
- OpenAlex
- https://openalex.org/W2295428206
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:6160675
Keywords
Randomized algorithm, Computer science, Probabilistic analysis of algorithms, Probabilistic logic, Algorithm
References
- Probabilistic Machines Can Use Less Running Time
- Should tables be sorted?
- Towards a Generic Model of Configuraton Tasks
- Multiplicative Number Theory
- Data structures and network algorithms
- Probability Approximations via the Poisson Clumping Heuristic
- Improved randomized on-line algorithms for the list update problem
- Constructions of telephone networks by group representations
- Algorithms for Random Generation and Counting: A Markov Chain Approach
- Introduction to parallel algorithms
- Computational geometry - an introduction through randomized algorithms
- The Design and Analysis of Computer Algorithms
- On selecting a satisfying truth assignment
- Some mathematical notes on three-mode factor analysis
- A Fast Monte-Carlo Test for Primality
- A Probabilistic Remark on Algebraic Program Testing
- The Complexity of Testing Whether a Graph is a Superconcentrator
- Global min-cuts in RNC, and other ramifications of a simple min-out algorithm
- Efficient Randomized Pattern-Matching Algorithms
- Clique partitions, graph compression and speeding-up algorithms
Cited by
- Motion Planning Algorithms for General Closed-Chain Mechanisms
- A Banach Space Based Semantics for Probabilistic Concurrent Constraint Programming
- Mechanisms for discrete optimization with rational agents
- Revisiting Aggregation for Data Intensive Applications: A Performance Study
- Quantum complexity of graph and algebraic problems
- Random Embedding Machines for Pattern Recognition
- Agents mobiles coopérants pour les environnements dynamiques. (Cooperative mobile agents for dynamic environments)
- Optimization in the private value model: competitive analysis applied to auction design
- Don't Lose Sleep Over Availability: The GreenUp Decentralized Wakeup Service
- Space-efficient scheduling for parallel, multithreaded computations
- Space Hierarchy Results for Randomized and other Semantic Models
- Linear upper bounds for random walk on small density random 3-CNFs
- Random Walks, Conditional Hitting Sets and Partial Derandomization
- Book List for Algorithms and Data Structures Summer 2008
- Algorithm Design Using Spectral Graph Theory
- Work Stealing with Parallelism Feedback
- On Ranking RDF Schema Elements (and its Application in Visualization)
- A Distributed Placement Algorithm Based on Process Initiative and on a Limited Travel
- Deterministic Compressed Sensing
- A lower bound for approximating the grundy number
Related papers
- Introduction to Algorithms
- Random Graphs
- The Art of Computer Programming
- An introduction to probability theory and its applications
- On the analysis of the (1+1) evolutionary algorithm
- A scalable content-addressable network
- Chord: A scalable peer-to-peer lookup service for internet applications
- The capacity of wireless networks
- Network information flow