04305nam 22007335 450 99646557010331620200704003639.03-540-45726-710.1007/3-540-45726-7(CKB)1000000000211794(SSID)ssj0000326085(PQKBManifestationID)11230933(PQKBTitleCode)TC0000326085(PQKBWorkID)10265897(PQKB)11626665(DE-He213)978-3-540-45726-8(MiAaPQ)EBC3072369(PPN)155232878(EXLCZ)99100000000021179420121227d2002 u| 0engurnn|008mamaatxtccrRandomization and Approximation Techniques in Computer Science[electronic resource] 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings /edited by Jose D.P. Rolim, Salil Vadhan1st ed. 2002.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2002.1 online resource (VIII, 284 p.) Lecture Notes in Computer Science,0302-9743 ;2483Bibliographic Level Mode of Issuance: Monograph3-540-44147-6 Includes bibliographical references and index.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.Lecture Notes in Computer Science,0302-9743 ;2483Computer programmingComputer science—MathematicsAlgorithmsNumerical analysisProgramming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Mathematics of Computinghttps://scigraph.springernature.com/ontologies/product-market-codes/I17001Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Numeric Computinghttps://scigraph.springernature.com/ontologies/product-market-codes/I1701XDiscrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Computer programming.Computer science—Mathematics.Algorithms.Numerical analysis.Programming Techniques.Mathematics of Computing.Algorithm Analysis and Problem Complexity.Numeric Computing.Discrete Mathematics in Computer Science.004/.07/27Rolim Jose D.Pedthttp://id.loc.gov/vocabulary/relators/edtVadhan Saliledthttp://id.loc.gov/vocabulary/relators/edtInternational Workshop on Randomization and Approximation Techniques in Computer ScienceMiAaPQMiAaPQMiAaPQBOOK996465570103316Randomization and Approximation Techniques in Computer Science2072177UNISA