Randomization and Approximation Techniques in Computer Science 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings

Bibliographic Details
Other Authors: Rolim, Jose D.P. (Editor), Vadhan, Salil (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2002, 2002
Edition:1st ed. 2002
Series:Lecture Notes in Computer Science
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 02570nmm a2200361 u 4500
001 EB001884437
003 EBX01000000000000001047804
005 00000000000000.0
007 cr|||||||||||||||||||||
008 191115 ||| eng
020 |a 9783540457268 
100 1 |a Rolim, Jose D.P.  |e [editor] 
245 0 0 |a Randomization and Approximation Techniques in Computer Science  |h Elektronische Ressource  |b 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings  |c edited by Jose D.P. Rolim, Salil Vadhan 
250 |a 1st ed. 2002 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2002, 2002 
300 |a VIII, 284 p  |b online resource 
505 0 |a Counting Distinct Elements in a Data Stream -- On Testing Convexity and Submodularity -- ?-Regular Languages Are Testable with a Constant Number of Queries -- Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes -- Counting and Sampling H-Colourings -- Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs -- On the 2-Colorability of Random Hypergraphs -- Percolation on Finite Cayley Graphs -- Computing Graph Properties by Randomized Subcube Partitions -- Bisection of Random Cubic Graphs -- Small k-Dominating Sets of Regular Graphs -- Finding Sparse Induced Subgraphs of Semirandom Graphs -- Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View -- Quantum Walks on the Hypercube -- Randomness-Optimal Characterization of Two NP Proof Systems -- A Probabilistic-Time Hierarchy Theorem for “Slightly Non-uniform” Algorithms -- Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good -- Is Constraint Satisfaction Over Two Variables Always Easy? -- Dimensionality Reductions That Preserve Volumes and Distance to Affine Spaces, and Their Algorithmic Applications -- On the Eigenvalue Power Law -- Classifying Special Interest Groups in Web Graphs 
653 |a Programming Techniques 
653 |a Mathematics of Computing 
653 |a Computer science / Mathematics 
653 |a Numerical Analysis 
653 |a Computer programming 
653 |a Discrete Mathematics in Computer Science 
653 |a Algorithms 
653 |a Numerical analysis 
653 |a Discrete mathematics 
700 1 |a Vadhan, Salil  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Lecture Notes in Computer Science 
028 5 0 |a 10.1007/3-540-45726-7 
856 4 0 |u https://doi.org/10.1007/3-540-45726-7?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 005.11