1 option
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.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1518.
- Lecture Notes in Computer Science, 0302-9743 ; 1518
- Language:
- English
- Subjects (All):
- Algorithms.
- Computer science--Mathematics.
- Computer science.
- Data structures (Computer science).
- Calculus of variations.
- Combinatorial analysis.
- Mathematical statistics.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Data Structures.
- Calculus of Variations and Optimal Control; Optimization.
- Combinatorics.
- Probability and Statistics in Computer Science.
- Local Subjects:
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Data Structures.
- Calculus of Variations and Optimal Control; Optimization.
- Combinatorics.
- Probability and Statistics in Computer Science.
- Physical Description:
- 1 online resource (IX, 385 pages).
- Edition:
- First edition 1998.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
- System Details:
- text file PDF
- 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
- 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
- Random Geometric Problems on [0, 1]2
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-49543-7
- 9783540495437
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.