Vai al contenuto principale della pagina
Titolo: | Randomization and approximation techniques in computer science : second international workshop RANDOM '98, Barcelona, Spain, October 8-10, 1998 : proceedings / / Michael Luby, JoseÌ Rolim, Maria Serna (editors) |
Pubblicazione: | Berlin ; ; Heidelberg : , : Springer, , [1998] |
©1998 | |
Edizione: | 1st ed. 1998. |
Descrizione fisica: | 1 online resource (IX, 385 p.) |
Disciplina: | 004.015114 |
Soggetto topico: | Computer science - Statistical methods |
Persona (resp. second.): | LubyMichael George |
RolimJoseÌ D. P. | |
SernaMaria <1959-> | |
Note generali: | Bibliographic Level Mode of Issuance: Monograph |
Nota di bibliografia: | Includes bibliographical references and index. |
Nota di contenuto: | 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. |
Titolo autorizzato: | Randomization and Approximation Techniques in Computer Science |
ISBN: | 3-540-49543-6 |
Formato: | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 9910143468603321 |
Lo trovi qui: | Univ. Federico II |
Opac: | Controlla la disponibilità qui |