Randomization and Approximation Techniques in Computer Science [electronic resource] : 6th International Workshop, RANDOM 2002 Cambridge, MA, USA, September 13–15, 2002 Proceedings /
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.
Main Authors: | , , |
---|---|
Format: | Texto biblioteca |
Language: | eng |
Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg,
2002
|
Subjects: | Computer science., Computer programming., Algorithms., Computer science, Numerical analysis., Computer Science., Programming Techniques., Mathematics of Computing., Algorithm Analysis and Problem Complexity., Numeric Computing., Discrete Mathematics in Computer Science., |
Online Access: | http://dx.doi.org/10.1007/3-540-45726-7 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
KOHA-OAI-TEST:184258 |
---|---|
record_format |
koha |
spelling |
KOHA-OAI-TEST:1842582018-07-30T23:06:06ZRandomization and Approximation Techniques in Computer Science [electronic resource] : 6th International Workshop, RANDOM 2002 Cambridge, MA, USA, September 13–15, 2002 Proceedings / Rolim, José D. P. editor. Vadhan, Salil. editor. SpringerLink (Online service) textBerlin, Heidelberg : Springer Berlin Heidelberg,2002.engCounting 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.Computer science.Computer programming.Algorithms.Computer scienceNumerical analysis.Computer Science.Programming Techniques.Mathematics of Computing.Algorithm Analysis and Problem Complexity.Numeric Computing.Discrete Mathematics in Computer Science.Springer eBookshttp://dx.doi.org/10.1007/3-540-45726-7URN:ISBN:9783540457268 |
institution |
COLPOS |
collection |
Koha |
country |
México |
countrycode |
MX |
component |
Bibliográfico |
access |
En linea En linea |
databasecode |
cat-colpos |
tag |
biblioteca |
region |
America del Norte |
libraryname |
Departamento de documentación y biblioteca de COLPOS |
language |
eng |
topic |
Computer science. Computer programming. Algorithms. Computer science Numerical analysis. Computer Science. Programming Techniques. Mathematics of Computing. Algorithm Analysis and Problem Complexity. Numeric Computing. Discrete Mathematics in Computer Science. Computer science. Computer programming. Algorithms. Computer science Numerical analysis. Computer Science. Programming Techniques. Mathematics of Computing. Algorithm Analysis and Problem Complexity. Numeric Computing. Discrete Mathematics in Computer Science. |
spellingShingle |
Computer science. Computer programming. Algorithms. Computer science Numerical analysis. Computer Science. Programming Techniques. Mathematics of Computing. Algorithm Analysis and Problem Complexity. Numeric Computing. Discrete Mathematics in Computer Science. Computer science. Computer programming. Algorithms. Computer science Numerical analysis. Computer Science. Programming Techniques. Mathematics of Computing. Algorithm Analysis and Problem Complexity. Numeric Computing. Discrete Mathematics in Computer Science. Rolim, José D. P. editor. Vadhan, Salil. editor. SpringerLink (Online service) Randomization and Approximation Techniques in Computer Science [electronic resource] : 6th International Workshop, RANDOM 2002 Cambridge, MA, USA, September 13–15, 2002 Proceedings / |
description |
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. |
format |
Texto |
topic_facet |
Computer science. Computer programming. Algorithms. Computer science Numerical analysis. Computer Science. Programming Techniques. Mathematics of Computing. Algorithm Analysis and Problem Complexity. Numeric Computing. Discrete Mathematics in Computer Science. |
author |
Rolim, José D. P. editor. Vadhan, Salil. editor. SpringerLink (Online service) |
author_facet |
Rolim, José D. P. editor. Vadhan, Salil. editor. SpringerLink (Online service) |
author_sort |
Rolim, José D. P. editor. |
title |
Randomization and Approximation Techniques in Computer Science [electronic resource] : 6th International Workshop, RANDOM 2002 Cambridge, MA, USA, September 13–15, 2002 Proceedings / |
title_short |
Randomization and Approximation Techniques in Computer Science [electronic resource] : 6th International Workshop, RANDOM 2002 Cambridge, MA, USA, September 13–15, 2002 Proceedings / |
title_full |
Randomization and Approximation Techniques in Computer Science [electronic resource] : 6th International Workshop, RANDOM 2002 Cambridge, MA, USA, September 13–15, 2002 Proceedings / |
title_fullStr |
Randomization and Approximation Techniques in Computer Science [electronic resource] : 6th International Workshop, RANDOM 2002 Cambridge, MA, USA, September 13–15, 2002 Proceedings / |
title_full_unstemmed |
Randomization and Approximation Techniques in Computer Science [electronic resource] : 6th International Workshop, RANDOM 2002 Cambridge, MA, USA, September 13–15, 2002 Proceedings / |
title_sort |
randomization and approximation techniques in computer science [electronic resource] : 6th international workshop, random 2002 cambridge, ma, usa, september 13–15, 2002 proceedings / |
publisher |
Berlin, Heidelberg : Springer Berlin Heidelberg, |
publishDate |
2002 |
url |
http://dx.doi.org/10.1007/3-540-45726-7 |
work_keys_str_mv |
AT rolimjosedpeditor randomizationandapproximationtechniquesincomputerscienceelectronicresource6thinternationalworkshoprandom2002cambridgemausaseptember13152002proceedings AT vadhansalileditor randomizationandapproximationtechniquesincomputerscienceelectronicresource6thinternationalworkshoprandom2002cambridgemausaseptember13152002proceedings AT springerlinkonlineservice randomizationandapproximationtechniquesincomputerscienceelectronicresource6thinternationalworkshoprandom2002cambridgemausaseptember13152002proceedings |
_version_ |
1756265209963479040 |