General Information
Dates:
Monday, August 22, 2005 - Wednesday, August 24, 2005
Days of Week:
Monday
Tuesday
Wednesday
Tuesday
Wednesday
Target Audience:
Academic and Practice
Location:
UC Berkeley
Event Details/Other Comments:
RANDOM'2005 focuses on applications of randomness to computational and combinatorial problems.
TOPICS
Papers are solicited in all research areas related to randomization and approximation, including, but not limited to:
RANDOM
* design and analysis of randomized algorithms
* randomized complexity theory
* pseudorandomness and derandomization
* random combinatorial structures
* random walks/Markov chains
* expander graphs and randomness extractors
* probabilistic proof systems
* random projections and embeddings
* error-correcting codes
* average-case analysis
* property testing
* computational learning theory