Atlas home || Conferences | Abstracts | about Atlas


DIMACS Workshop on Pseudorandomness and Explicit Combinatorial Constructions

in Special Year on Computational Intractability

October 12-15, 1999

Piscataway, NJ, USA

Mathematics

Host: DIMACS Center, Rutgers University
Homepage: http://dimacs.rutgers.edu/Workshops/Pseudorandom/

Organizers: David Zuckerman (University of Texas at Austin, University of California at Berkeley), Russell Impagliazzo (University of California at San Diego), Amnon Ta-Shma (International Computer Science Institute)

Description:
The two topics appearing in the title of this workshop represent important and closely linked research directions within, respectively, computer science and combinatorics.

This workshop will focus on this common area of interest, focusing on problems and techniques for construction of combinatorial objects arising in computer science, graph theory, and coding theory. In recent years, these techniques have included methods from such diverse areas as representation theory and algebraic geometry, and one aim of the workshop is to expose a broader range of researchers to these techniques.

Speakers: Noga Alon (Tel Aviv University): Ramsey Type Graphs, Amin Shokrollahi (Bell Labs): Codes Over Algebraic Curves, Luca Trevisan (Columbia University): Extractors and Pseudorandom Generators, Avi Widgerson (IAS and Hebrew University): Open Problems

Date received: October 07, 1999


© 2008 Atlas Conferences Inc.