Share on TelegramRandomization and approximation techniques in computer science : second international workshop, RANDOM '98, Ba
Author: International Workshop on Randomization and Approximation Techniques in Computer Science (2nd : 1998 : Barcelona, Spain), Luby, Michael George, Rolim, José D. P, Serna, Maria, 1959-
Added by: sketch
Added Date: 2015-12-30
Language: eng
Subjects: Computer science, système aléatoire, approximation, optimisation combinatoire, théorie complexité, algorithmique, Informatique, Willekeurige variabelen, Benaderingen (wiskunde), Algoritmen, Numerieke methoden, Computabilidade e modelos de computacao, Randomisierung, Komplexitätstheorie, Approximationsalgorithmus, Komplexitätstheorie, Approximationsalgorithmus
Publishers: Berlin ; New York : Springer
Collections: journals contributions, journals
ISBN Number: 354065142X, 9783540651420
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 245.52 MB
PDF Size: 40.17 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 344
Views: 394
Total Files: 18
Media Type: texts
Total Files: 5
Last Modified: 2023-05-26 03:13:38
Size: 13.71 KB
Description
Author: Michael Luby, José D. P. Rolim, Maria Serna
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-65142-0
DOI: 10.1007/3-540-49543-6
Table of Contents:
- Disjoint Paths in Expander Graphs via Random Walks: a Short Survey
- A Derandomization Using Min-Wise Independent Permutations
- An Algorithmic Embedding of Graphs via Perfect Matchings
- Deterministic Hypergraph Coloring and Its Applications
- On the Derandomization of Space-Bounded Computations
- Talagrand’s Inequality and Locality in Distributed Computing
- On-line Bin-Stretching
- Combinatorial Linear Programming: Geometry Can Help
- A Note on Bounding the Mixing Time by Linear Programming
- Robotic Exploration, Brownian Motion and Electrical Resistance
- Fringe analysis of synchronized parallel algorithms on 2–3 trees
- On Balls and Bins with Deletions
- “Balls into Bins” — A Simple and Tight Analysis
- Tornado Codes: Practical Erasure Codes Based on Random Irregular Graphs
- Using Approximation Hardness to Achieve Dependable Computation
- Complexity of Sequential Pattern Matching Algorithms
- A Random Server Model for Private Information Retrieval
- Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract)
- Randomized Lower Bounds for Online Path Coloring
- Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem
Includes bibliographical references and index
