03994oam 2200577 450 99646610820331620210715002928.03-540-49543-610.1007/3-540-49543-6(CKB)1000000000211017(SSID)ssj0000326087(PQKBManifestationID)11255374(PQKBTitleCode)TC0000326087(PQKBWorkID)10265221(PQKB)10101487(DE-He213)978-3-540-49543-7(MiAaPQ)EBC3071987(MiAaPQ)EBC6485687(PPN)15522770X(EXLCZ)99100000000021101720210715d1998 uy 0engurnn|008mamaatxtccrRandomization and approximation techniques in computer science second international workshop RANDOM '98, Barcelona, Spain, October 8-10, 1998 : proceedings /Michael Luby, José Rolim, Maria Serna (editors)1st ed. 1998.Berlin ;Heidelberg :Springer,[1998]©19981 online resource (IX, 385 p.) Lecture Notes in Computer Science,0302-9743 ;1518Bibliographic Level Mode of Issuance: Monograph3-540-65142-X Includes bibliographical references and index.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.Lecture Notes in Computer Science,0302-9743 ;1518Computer scienceStatistical methodsCongressesComputer scienceStatistical methods004.015114Luby Michael GeorgeRolim José D. P.Serna Maria1959-International Workshop on Randomization and Approximation Techniques in Computer ScienceMiAaPQMiAaPQUtOrBLWBOOK996466108203316Randomization and Approximation Techniques in Computer Science2072177UNISA