Real-number complexity@ FoCM'11

The workshop is part of the triennial FoCM conference series, organized by the Society for Foundations of Computational Mathematics
hosted by the Budapest University of Technology and Economics, July 4-14, 2011.

Part of the workshop is devoted to complexity issues for numerical equation solving and optimization (in particular, condition numbers and probabilistic analysis of real number algorithms). Another focus of the workshop is on various aspects of algebraic complexity (e.g., Valiant's model). As in the previous FoCM conferences, Computational Algebraic Geometry will be covered by another workshop.

Confirmed Speakers:

Dennis Amelunxen, University of Paderborn, Germany

Diego Armentano, Universidad de la Republica, Uruguay

Saugata Basu, Purdue University, USA,

Irénée Briquel, Ecole Normale Supérieure Lyon, France

Felipe Cucker, City University Hong Kong, China

Alan Edelman, MIT, USA (semiplenary)

Marc Giusti, Laboratoire LIX, Ecole Polytechnique, France

Jonathan D. Hauenstein, Texas A & M University, USA

Anton Leykin, Georgia Tech, USA

Gregorio Malajovich, Universidade Federal do Rio de Janeiro, Brazil

Janos A. Makowsky, Technion Haifa, Israel (semiplenary)

Luis Miguel Pardo, Universidad de Cantabria, Spain

Sylvain Perifel, Université Paris Diderot, France

Peter Scheiblechner, Purdue University, USA

Mike Shub, University of Toronto, Canada

Jan Verschelde, University of Illinois at Chicago

Jean-Claude Yakoubsohn, Université de Toulouse

Martin Ziegler, Darmstadt University of Technology, Germany

Schedule and talk abstracts : Schedule, Abstracts

Previous workshops: FoCM'08.