Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2004

Automata, Languages and Programming

31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004, Proceedings

Editors:

  1. Josep Díaz

    1. Departament de Llenguatges i Sistemes Informatics, Universitat Politecnica de Catalunya, Campus Nord - Ed. Omega, Barcelona

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Juhani Karhumäki

    1. Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, Turku, Finland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Arto Lepistö

    1. Department of Mathematics, University of Turku, Turku, Finland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Donald Sannella

    1. Laboratory for Foundations of Computer Science, University of Edinburgh,  

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3142)

Conference series link(s): ICALP: International Colloquium on Automata, Languages, and Programming

Conference proceedings info: ICALP 2004.

Sections

Buy it now

eBook USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 239.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (102 papers)

  1. Contributed Papers

    1. Competition-Induced Preferential Attachment

      • N. Berger, C. Borgs, J. T. Chayes, R. M. D’Souza, R. D. Kleinberg
      Pages 208-221

    2. Approximating Longest Directed Paths and Cycles

      • Andreas Björklund, Thore Husfeldt, Sanjeev Khanna
      Pages 222-233

    3. Definitions and Bounds for Self-Healing Key Distribution Schemes

      • Carlo Blundo, Paolo D’Arco, Alfredo De Santis
      Pages 234-245

    4. Tree-Walking Automata Cannot Be Determinized

      • Mikołaj Bojańczyk, Thomas Colcombet
      Pages 246-256

    5. Projecting Games on Hypercoherences

      • Pierre Boudes
      Pages 257-268

    7. Model Checking with Multi-valued Logics

      • Glenn Bruns, Patrice Godefroid
      Pages 281-293

    8. The Complexity of Partition Functions

      • Andrei Bulatov, Martin Grohe
      Pages 294-306

    9. Comparing Recursion, Replication, and Iteration in Process Calculi

      • Nadia Busi, Maurizio Gabbrielli, Gianluigi Zavattaro
      Pages 307-319

    10. Dynamic Price Sequence and Incentive Compatibility

      • Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao
      Pages 320-331

    11. The Complexity of Equivariant Unification

      • James Cheney
      Pages 332-344

    12. Coordination Mechanisms

      • George Christodoulou, Elias Koutsoupias, Akash Nanavati
      Pages 345-357

    13. Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help

      • Marek Chrobak, Wojciech Jawor, Jiří Sgall, Tomáš Tichý
      Pages 358-370

    14. Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities

      • Bruno Codenotti, Kasturi Varadarajan
      Pages 371-382

    15. Coloring Semirandom Graphs Optimally

      • Amin Coja-Oghlan
      Pages 383-395

    16. Sublinear-Time Approximation for Clustering Via Random Sampling

      • Artur Czumaj, Christian Sohler
      Pages 396-407

    17. Solving Two-Variable Word Equations

      • Robert Da̧browski, Wojtek Plandowski
      Pages 408-419

    18. Backtracking Games and Inflationary Fixed Points

      • Anuj Dawar, Erich Grädel, Stephan Kreutzer
      Pages 420-432

    19. A PTAS for Embedding Hypergraph in a Cycle

      • Xiaotie Deng, Guojun Li
      Pages 433-444

    20. Towards an Algebraic Theory of Typed Mobile Processes

      • Yuxin Deng, Davide Sangiorgi
      Pages 445-456
Back to top

Other Volumes

  1. Automata, Languages and Programming

Back to top

Keywords

Back to top

Editors and Affiliations

  • Departament de Llenguatges i Sistemes Informatics, Universitat Politecnica de Catalunya, Campus Nord - Ed. Omega, Barcelona

    Josep Díaz

  • Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, Turku, Finland

    Juhani Karhumäki

  • Department of Mathematics, University of Turku, Turku, Finland

    Arto Lepistö

  • Laboratory for Foundations of Computer Science, University of Edinburgh,  

    Donald Sannella

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

eBook USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 239.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Search

Navigation