Coverart for item
The Resource Randomization and approximation techniques in computer science : 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002 : proceedings, José D.P. Rolim, Salil Vadhan (eds.)

Randomization and approximation techniques in computer science : 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002 : proceedings, José D.P. Rolim, Salil Vadhan (eds.)

Label
Randomization and approximation techniques in computer science : 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002 : proceedings
Title
Randomization and approximation techniques in computer science
Title remainder
6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002 : proceedings
Statement of responsibility
José D.P. Rolim, Salil Vadhan (eds.)
Title variation
RANDOM 2002
Creator
Contributor
Subject
Genre
Language
eng
Member of
Cataloging source
DLC
Dewey number
004/.07/27
Illustrations
illustrations
Index
index present
LC call number
QA75.5
LC item number
.I648 2002
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2002
http://bibfra.me/vocab/lite/meetingName
International Workshop on Randomization and Approximation Techniques in Computer Science
Nature of contents
bibliography
http://library.link/vocab/relatedWorkOrContributorName
  • Rolim, José D. P
  • Vadhan, Salil
Series statement
Lecture notes in computer science
Series volume
2483
http://library.link/vocab/subjectName
Computer science
Label
Randomization and approximation techniques in computer science : 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002 : proceedings, José D.P. Rolim, Salil Vadhan (eds.)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Counting distinct elements in a data stream / Ziv Bar-Yossef ... [et al.] -- On testing convexity and submodularity / Michal Parnas, Dana Ron, and Ronitt Rubinfeld -- w-regular languages are testable with a constant number of queries / Hana Chockler and Orna Kupferman -- Optimal lower bounds for 2-query locally decodable linear codes / Kenji Obata -- Counting and sampling H-colourings / Martin Dyer, Leslie A. Goldberg, and Mark Jerrum -- Rapidly mixing Markov chains for dismantleable constraint graphs / Martin Dyer, Mark Jerrum, and Eric Vigoda -- On the 2-colorability of random hypergraphs / Dimitris Achlioptas and Cristopher Moore -- Percolation on finite Cayley graphs / Christopher Malon and Igor Pak -- Computing graph properties by randomized subcube partitions / Ehud Friedgut, Jeff Kahn, and Avi Wigderson -- Bisection of random cubic graphs / J. Diaz ... [et al.] -- Small k-dominating sets of regular graphs / William Duckworth and Bernard Mans -- Finding sparse induced subgraphs of semirandom graphs / Amin Coja-Oghlan -- Mixing in time and space for lattice spin systemsw / Martin Dyer ... [et al.] -- Quantum walks on the hypercube / Cristopher Moore and Alexander Russell -- Randomness-optimal characterization of two NP proof systems / Alfredo De Santis, Giovanni Di Crescenzo, and Giuseppe Persiano -- A probabilistic-time hierarchy theorem for "slightly non-uniform" algorithms / Boaz Barak -- Derandomization that is rarely wrong from short advice that is typically good / Oded Goldreich and Avi Wigderson -- Is constraint satisfaction over two variables always easy? / Lars Engebretsen and Venkatesan Guruswami -- Dimensionality reductions that preserve volumes and distance to affine spaces, and their algorithmic applications / Avner Magen -- On the Eigenvalue power law / Milena Mihail and Christos Papadimitriou -- Classifying special interest groups in web graphs / Colin Cooper
Control code
50348205
Dimensions
24 cm
Dimensions
unknown
Extent
viii, 275 pages
Isbn
9783540441472
Isbn Type
(softcover : alk. paper)
Lccn
2002030386
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other physical details
illustrations
Specific material designation
remote
Label
Randomization and approximation techniques in computer science : 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002 : proceedings, José D.P. Rolim, Salil Vadhan (eds.)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Counting distinct elements in a data stream / Ziv Bar-Yossef ... [et al.] -- On testing convexity and submodularity / Michal Parnas, Dana Ron, and Ronitt Rubinfeld -- w-regular languages are testable with a constant number of queries / Hana Chockler and Orna Kupferman -- Optimal lower bounds for 2-query locally decodable linear codes / Kenji Obata -- Counting and sampling H-colourings / Martin Dyer, Leslie A. Goldberg, and Mark Jerrum -- Rapidly mixing Markov chains for dismantleable constraint graphs / Martin Dyer, Mark Jerrum, and Eric Vigoda -- On the 2-colorability of random hypergraphs / Dimitris Achlioptas and Cristopher Moore -- Percolation on finite Cayley graphs / Christopher Malon and Igor Pak -- Computing graph properties by randomized subcube partitions / Ehud Friedgut, Jeff Kahn, and Avi Wigderson -- Bisection of random cubic graphs / J. Diaz ... [et al.] -- Small k-dominating sets of regular graphs / William Duckworth and Bernard Mans -- Finding sparse induced subgraphs of semirandom graphs / Amin Coja-Oghlan -- Mixing in time and space for lattice spin systemsw / Martin Dyer ... [et al.] -- Quantum walks on the hypercube / Cristopher Moore and Alexander Russell -- Randomness-optimal characterization of two NP proof systems / Alfredo De Santis, Giovanni Di Crescenzo, and Giuseppe Persiano -- A probabilistic-time hierarchy theorem for "slightly non-uniform" algorithms / Boaz Barak -- Derandomization that is rarely wrong from short advice that is typically good / Oded Goldreich and Avi Wigderson -- Is constraint satisfaction over two variables always easy? / Lars Engebretsen and Venkatesan Guruswami -- Dimensionality reductions that preserve volumes and distance to affine spaces, and their algorithmic applications / Avner Magen -- On the Eigenvalue power law / Milena Mihail and Christos Papadimitriou -- Classifying special interest groups in web graphs / Colin Cooper
Control code
50348205
Dimensions
24 cm
Dimensions
unknown
Extent
viii, 275 pages
Isbn
9783540441472
Isbn Type
(softcover : alk. paper)
Lccn
2002030386
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other physical details
illustrations
Specific material designation
remote

Library Locations

    • Thomas Jefferson LibraryBorrow it
      1 University Blvd, St. Louis, MO, 63121, US
      38.710138 -90.311107
Processing Feedback ...