CALL FOR PAPERS RANDOM 2002 6th. International Workshop on Randomization and Approximation Techniques in Computer Science NEW DATES: 13 - 15 September 2002 Harvard University Cambridge, Massachusetts http://eecs.harvard.edu/~random02/ SCOPE The 6th. International Workshop on Randomization and Approximation Techniques in Computer Science -RANDOM 2002- will take place at Harvard University from September 13 to 15, 2002. RANDOM 2002 focuses on applications of randomness to computational and combinatorial problems and is the sixth workshop in the series after Bologna, Barcelona, Berkeley, Geneva and Berkeley again. IMPORTANT DATES Submission Deadline: May 6, 2002 Notification: June 17, 2002 Camera ready: July 8, 2002 TOPICS Papers are solicited in all research areas related to randomization and approximation, including, but not limited to: design and analysis of randomized algorithms randomized complexity theory design and analysis of approximation algorithms complexity of approximation problems random combinatorial structures error-correcting codes pseudorandomness and derandomization network models and algorithms average-case analysis property testing expander graphs and randomness extractors random walks/Markov chains probabilistic proof systems random projections and embeddings computational learning various applications PUBLICATION Proceedings will be published in the Springer-Verlag series Lecture Notes in Computer Science. Previous proceedings of RANDOM appeared as LNCS 1269, 1518, 1671, 2129 and as Proceedings in Informatics 8. GUIDELINE FOR SUBMISSION Electronic submissions are solicited. Information about electronic submissions will be available from the RANDOM website at: http://eecs.harvard.edu/~random02/ The postscript must be received by 11:59pm (PDT) of May 6th for your submission to be considered. In extreme cases, contributions may be submitted by sending 6 hard copies to: Salil Vadhan Harvard University DEAS Maxwell Dworkin 337 33 Oxford Street Cambridge, MA 02138 Hard copy submissions (if electronic submissions are not possible) must also be received by May 6th in order to be considered. It is expected that accepted papers will be presented at the conference. Simultaneous submission to other conferences with published proceedings is not allowed. Abstract format: Authors should submit an extended abstract (not a full paper). An abstract should start with the title of the paper, each author's name, affiliation, and e-mail address, followed by a one-paragraph summary of the results to be presented. This should then be followed by a technical exposition of the main ideas and techniques used to achieve these results, including motivation and a clear comparison with related work. The abstract should not exceed 10 single-spaced pages on letter-size paper, using reasonable margins and at least 11-point font. If the authors believe that more details are essential to substantiate the main claims of the paper, they may include a clearly marked appendix that will be read at the discretion of the program committee. PROGRAM COMMITTEE Dimitris Achlioptas, Microsoft Research Martin Dyer, U. of Leeds Uriel Feige, Weizmann Institute Russell Impagliazzo, UC San Diego Sampath Kannan, U. of Pennsylvania David Karger, MIT Nati Linial, Hebrew U. Rafail Ostrovsky, Telcordia Technologies Paul Spirakis, U. of Patras and CTI Angelika Steger, TU Muenchen Ruediger Urbanke, Swiss Federal Inst. of Tech. Salil Vadhan, Harvard U., chair STEERING COMMITTEE Josep Diaz, UPC Barcelona Oded Goldreich, Weizmann Klaus Jansen, U. of Kiel Michael Luby, Digital Fountain Christos Papadimitriou, UC Berkeley Jose Rolim, U. of Geneva, chair Paul Spirakis, U. of Patras and CTI CONFERENCE PAGE http://eecs.harvard.edu/~random02