Randomization and Approximation Techniques in Computer Science Second International Workshop, RANDOM’98, Barcelona, Spain, October 8–10, 1998 Proceedings / edited by Michael Luby, Jose Rolim, Maria Serna.

Saved in:

Bibliographic Details
Corporate Author:	SpringerLink (Online service)
Other Authors:	Luby, Michael (Editor), Rolim, Jose (Editor), Serna, Maria (Editor)
Format:	eBook
Language:	English
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
Edition:	1st ed. 1998.
Series:	Lecture Notes in Computer Science, 1518 Springer eBook Collection.
Subjects:	Algorithms. Computer science—Mathematics. Data structures (Computer science). Calculus of variations. Combinatorics. Mathematical statistics. Electronic resources (E-books)
Online Access:	Click to view e-book
Holy Cross Note:	Loaded electronically. Electronic access restricted to members of the Holy Cross Community.

Table of Contents:

Invited Paper
Disjoint Paths in Expander Graphs via Random Walks: a Short Survey
Regular Papers
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
Invited Paper
Tornado Codes: Practical Erasure Codes Based on Random Irregular Graphs
Regular Papers
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
On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem
A High Performance Approximate Algorithm for the Steiner Problem in Graphs
Invited Paper
Random Geometric Problems on [0, 1]2
Regular Papers
A Role of Constraint in Self-Organization
Constructive Bounds and Exact Expectations for the Random Assignment Problem
The “Burnside Process” Converges Slowly
Quicksort Again Revisited
Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems
Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow.

Randomization and Approximation Techniques in Computer Science Second International Workshop, RANDOM’98, Barcelona, Spain, October 8–10, 1998 Proceedings / edited by Michael Luby, Jose Rolim, Maria Serna.

Similar Items