The 32nd
International Colloquium on
Automata, Languages and Programming

July 11-15, 2005, Lisboa, Portugal

ICALP'05 Home
Registration
Program
Getting Around
Call for Papers
Submission
Workshops
Invited Speakers
Venue
Pre-Call
Past ICALPs
Important Dates
Social Program
Organisation

Call for Papers

As a complement to the established Tracks on Algorithms, Automata, Complexity and Games (A), and on Logic, Semantics, and Theory of Programming(B), corresponding to the two main streams of the journal Theoretical Computer Science, ICALP'05 innovates on the structure of its traditional scientific program with the inauguration of a new special Track (C) Security and Cryptography Foundations.

In recent years, cryptography and security research has been gaining importance due to the development of the Internet and the distribution of computations among possibly mistrusting entities. The need to assure secure computing requires strong foundations and basic theoretical treatment of the underlying principles. ICALP'05 track C welcomes papers dealing with these subjects and relating security and cryptography to other fields of theoretical computer science.

Typical topics discussed during recent ICALP conferences are: computability, automata theory, formal language theory, analysis of algorithms, computational complexity, mathematical aspects of programming language definition, logic and semantics of programming languages, foundations of logic programming, theorem proving, software specification, computational geometry, data types and data structures, theory of data bases and knowledge based systems, cryptography, VLSI structures, parallel and distributed computing, models of concurrency and robotics.

Authors are invited to submit an extended abstract of no more than 12 pages in LNCS style presenting original research on the theory of Computer Science. If the authors believe that more details are essential to substantiate the main claims of the paper, they may add a clearly marked appendix that will be read at the discretion of the program committee.

No simultaneous submission to other conferences with published proceedings is allowed. Submissions deviating significantly from these guidelines risk rejection without consideration of their merits. The proceedings will be published in the Lecture Notes in Computer Science Series by Springer-Verlag.

The authors should follow the submission instructions and web links made available to register and to submit their paper.

Track A Algorithms, Automata, Complexity and Games

Giuseppe F. Italiano
Università di Roma "Tor Vergata", Italy (PC Chair)
  • Algorithmic Aspects of Networks
  • Algorithms and Data Structures
  • Automata Theory and Formal Languages
  • Combinatorics in Computer Science
  • Computational Biology
  • Computational Complexity
  • Computational Geometry
  • Internet Algorithmics
  • Machine Learning
  • Parallel and Distributed Computing
  • Quantum Computing

Program Committee

  • Lars Arge, Duke University, USA
  • Giorgio Ausiello, University of Rome "La Sapienza", Italy
  • Surender Baswana, Max-Planck-Institut fur Informatik, Saarbrucken, Germany
  • Hans Bodlaender, University of Utrecht, The Netherlands
  • Véronique Bruyère, University of Mons-Hainaut, Belgium
  • Adam Buchsbaum, AT&T Labs-Research, USA
  • Josep Diaz, Universitat Politecnica de Catalunya, Spain
  • David Eppstein, University of Irvine, USA
  • Andrew Goldberg, Microsoft, USA
  • Monika Henzinger, Google and ETH Lausanne, Switzerland
  • Giuseppe F. Italiano, University of Rome "Tor Vergata", Italy (Chair)
  • Marios Mavronicolas, University of Cyprus, Cyprus
  • Peter Bro Miltersen, University of Aarhus, Denmark
  • Mike Paterson, University of Warwick, United Kingdom
  • Dominique Perrin, Université de Marne la Vallée, France
  • Seth Pettie, Max-Planck-Institut fur Informatik, Saarbrucken, Germany
  • Yuval Rabani, Technion, Israel
  • Antonio Restivo, University of Palermo, Italy
  • José Rolim, University of Geneva, Switzerland
  • Dorothea Wagner, University Karlsruhe, Germany
  • Tandy Warnow, University of Texas at Austin, USA
  • Christos Zaroliagis, CTI and University of Patras, Greece

Track B Logic, Semantics, and Theory of Programming

Catuscia Palamidessi
INRIA Futurs and LIX, France (PC Chair)
  • Algebraic and Categorical Models
  • Databases, Semi-Structured Data and Finite Model Theory
  • Principles of Programming Languages
  • Logics, Formal Methods and Model Checking
  • Models of Concurrent, Distributed, and Mobile Systems
  • Models of Reactive, Hybrid and Stochastic Systems
  • Program Analysis and Transformation
  • Specification, Refinement and Verification
  • Type Systems and Typed Calculi

Program Committee

  • Kenichi Asai, Ochanomizu University, Japan
  • Jos Baeten, University of Eindhoven, NL
  • Peter Buneman, University of Edinburgh, UK
  • Zoltan Esik, University of Szeged, Hungary and Rovira i Virgili University, Spain
  • Javier Esparza, University of Stuttgart, Germany
  • Marcelo Fiore, Christ's College and University of Cambridge, UK
  • Manuel Hermenegildo, Universidade de Madrid, Spain
  • Delia Kesner, Universite Paris VII, France
  • Kim Guldstrand Larsen, University of Aalborg , Denmark
  • Gopalan Nadathur, University of Minnesota, USA
  • Uwe Nestmann, EPFL, Switzerland
  • Catuscia Palamidessi, INRIA, France (Chair)
  • Amr Sabry, University of Indiana, USA
  • Davide Sangiorgi, Universita di Bologna, Italy
  • Roberto Segala, Universita di Verona, Italy
  • Harald Sondergaard, University of Melbourne, Australia

Track C Security and Cryptography Foundations

Moti Yung
Columbia University and RSA Labs, USA (PC Chair)

  • Cryptographic Notions, Mechanisms, Systems and Protocols
  • Cryptographic Proof Techniques, Lower bounds, Impossibilities
  • Foundations of Secure Systems and Architectures
  • Logic and Semantics of Security Protocols
  • Number Theory and Algebraic Algorithms in Cryptography
  • Pseudorandomness, Randomness, and Complexity Issues
  • Secure Data Structures, Storage, Databases and Content
  • Security Modeling: Combinatorics, Graphs, Games, Economics
  • Specifications, Verifications and Secure Programming
  • Theory of Privacy and Anonymity
  • Theory of Security in Networks and Distributed Computing
  • Quantum Cryptography and Information Theory

Program Committee

  • David Basin, ETH Zurich, Switzerland
  • Christian Cachin, IBM Research, Switzerland
  • Alfredo De Santis, Universita di Salerno, Italy
  • Cynthia Dwork, Microsoft Research, USA
  • Matt Franklin, U.C. Davis, USA
  • Michael Goodrich, U.C. Irvine, USA
  • Andrew D. Gordon, Microsoft Research, UK
  • Roberto Gorrieri, Universita di Bologna, Italy
  • Yuval Ishai, Technion, Israel
  • Phil MacKenzie, DoCoMo Labs., USA
  • Tatsuaki Okamoto, NTT Labs., Japan
  • David Pointcheval, ENS Paris, France
  • Tal Rabin, IBM Research, USA
  • Omer Reingold, Weizmann Institute, Israel
  • Adi Rosen, Technion, Israel
  • Amit Sahai, UCLA, USA
  • Andre Scedrov, University of Pennsylvania, USA
  • Igor Shparlinski, Macquarie University, Australia
  • Nigel Smart, University of Bristol, UK
  • Moti Yung, Columbia University, USA (Chair)