Skip to main content
  • Conference proceedings
  • © 1999

Automata, Languages and Programming

26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999 Proceedings

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

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

Conference proceedings info: ICALP 1999.

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
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 (68 papers)

  1. Front Matter

    Pages I-XIV
  2. Invited Talks

    1. Wide Area Computation

      • Luca Cardelli
      Pages 10-24
    2. Proof Techniques for Cryptographic Protocols

      • Kevin J. Compton, Scott Dexter
      Pages 25-39
    3. Type Structure for Low-Level Programming Languages

      • Karl Crary, Greg Morrisett
      Pages 40-54
    4. Real Computations with Fake Numbers

      • Felipe Cucker
      Pages 55-73
    5. Numerical Integration with Exact Real Arithmetic

      • Abbas Edalat, Marko Krznarić
      Pages 90-104
    6. DNA Computing: New Ideas and Paradigms

      • Grzegorz Rozenberg, Arto Salomaa
      Pages 106-118
    7. Online Data Structures in External Memory

      • Jeffrey Scott Vitter
      Pages 119-133
  3. Contributed Papers

    1. Bounded Depth Arithmetic Circuits: Counting and Closure

      • Eric Allender, Samir Datta, Andris Ambainis, David A. Mix Barrington, Huong LêThanh
      Pages 149-158
    2. Parametric Temporal Logic for “Model Measuring”

      • Rajeev Alur, Kousha Etessami, Salvatore La Torre, Doron Peled
      Pages 159-168
    3. Communicating Hierarchical State Machines

      • Rajeev Alur, Sampath Kannan, Mihalis Yannakakis
      Pages 169-178
    4. Small Pseudo-Random Sets Yield Hard Functions: New Tight Explicit Lower Bounds for Branching Programs

      • Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim
      Pages 179-189
    5. General Morphisms of Petri Nets (Extended Abstract)

      • Marek A. Bednarczyk, Andrzej M. Borzyszkowski
      Pages 190-199
    6. On Some Tighter Inapproximability Results (Extended Abstract)

      • Piotr Berman, Marek Karpinski
      Pages 200-209
    7. Decomposition and Composition of Timed Automata

      • Patricia Bouyer, Antoine Petit
      Pages 210-219
    8. New Applications of the Incompressibility Method (Extended Abstract)

      • Harry Buhrman, Paul Vitányi, Tao Jiang, Ming Li
      Pages 220-229

Editors and Affiliations

  • Institute for Computer Science, Academy of Sciences of the Czech Republic, Prague 8 - Liben, Czech Republic

    Jirí Wiedermann

  • ILLC-WINS-University of Amsterdam, Amsterdam, The Netherlands

    Peter Emde Boas

  • BRICS, Department of Computer Science, University of Aarhus, Aarhus C, Denmark

    Mogens Nielsen

Bibliographic Information

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
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