000 | 04462nam a22006495i 4500 | ||
---|---|---|---|
001 | 978-3-540-49543-7 | ||
003 | DE-He213 | ||
005 | 20240423132515.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1998 gw | s |||| 0|eng d | ||
020 |
_a9783540495437 _9978-3-540-49543-7 |
||
024 | 7 |
_a10.1007/3-540-49543-6 _2doi |
|
050 | 4 | _aQA76.9.A43 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aCOM051300 _2bisacsh |
|
072 | 7 |
_aUMB _2thema |
|
082 | 0 | 4 |
_a518.1 _223 |
245 | 1 | 0 |
_aRandomization and Approximation Techniques in Computer Science _h[electronic resource] : _bSecond International Workshop, RANDOM’98, Barcelona, Spain, October 8–10, 1998 Proceedings / _cedited by Michael Luby, Jose Rolim, Maria Serna. |
250 | _a1st ed. 1998. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1998. |
|
300 |
_aIX, 385 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1518 |
|
505 | 0 | _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 DenseInstances of Non-Boolean Optimization Problems -- Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow. | |
650 | 0 | _aAlgorithms. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 |
_aArtificial intelligence _xData processing. |
|
650 | 0 | _aMathematical optimization. | |
650 | 0 | _aCalculus of variations. | |
650 | 0 | _aMathematical statistics. | |
650 | 1 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aData Science. |
650 | 2 | 4 | _aCalculus of Variations and Optimization. |
650 | 2 | 4 | _aDiscrete Mathematics. |
650 | 2 | 4 | _aProbability and Statistics in Computer Science. |
700 | 1 |
_aLuby, Michael. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aRolim, Jose. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aSerna, Maria. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540651420 |
776 | 0 | 8 |
_iPrinted edition: _z9783662181157 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1518 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-49543-6 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c188505 _d188505 |