LEADER 03996oam 2200577 450 001 9910143468603321 005 20210715002928.0 010 $a3-540-49543-6 024 7 $a10.1007/3-540-49543-6 035 $a(CKB)1000000000211017 035 $a(SSID)ssj0000326087 035 $a(PQKBManifestationID)11255374 035 $a(PQKBTitleCode)TC0000326087 035 $a(PQKBWorkID)10265221 035 $a(PQKB)10101487 035 $a(DE-He213)978-3-540-49543-7 035 $a(MiAaPQ)EBC3071987 035 $a(MiAaPQ)EBC6485687 035 $a(PPN)15522770X 035 $a(EXLCZ)991000000000211017 100 $a20210715d1998 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aRandomization and approximation techniques in computer science $esecond international workshop RANDOM '98, Barcelona, Spain, October 8-10, 1998 : proceedings /$fMichael Luby, José Rolim, Maria Serna (editors) 205 $a1st ed. 1998. 210 1$aBerlin ;$aHeidelberg :$cSpringer,$d[1998] 210 4$d©1998 215 $a1 online resource (IX, 385 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1518 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-65142-X 320 $aIncludes bibliographical references and index. 327 $aInvited 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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1518 606 $aComputer science$xStatistical methods$vCongresses 615 0$aComputer science$xStatistical methods 676 $a004.015114 702 $aLuby$b Michael George 702 $aRolim$b José D. P. 702 $aSerna$b Maria$f1959- 712 12$aInternational Workshop on Randomization and Approximation Techniques in Computer Science 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a9910143468603321 996 $aRandomization and Approximation Techniques in Computer Science$92072177 997 $aUNINA