Skip to main content
SpringerLink
Log in

Automata, Languages and Programming

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

  • Conference proceedings
  • © 1999

Overview

Editors:
  1. Jirí Wiedermann

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Peter Emde Boas

    1. ILLC-WINS-University of Amsterdam, Amsterdam, The Netherlands

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Mogens Nielsen

    1. BRICS, Department of Computer Science, University of Aarhus, Aarhus C, Denmark

    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 1644)

Included in the following conference series:

Conference proceedings info: ICALP 1999.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (68 papers)

  1. Contributed Papers

    1. Typed Exceptions and Continuations Cannot Macro-Express Each Other

      • Jon G. Riecke, Hayo Thielecke
      Pages 635-644

    2. Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously (Extended Abstract)

      • J.J.M.M. Rutten
      Pages 645-654

    3. Accessing Multiple Sequences Through Set Associative Caches

      • Peter Sanders
      Pages 655-664

    4. T(A) = T(B)?

      • Géraud Sénizergues
      Pages 665-675

    5. Many-Valued Logics and Holographic Proofs

      • Mario Szegedy
      Pages 676-686

    6. On the Complexity and Inapproximability of Shortest Implicant Problems

      • Christopher Umans
      Pages 687-696

    7. The Wave Propagator Is Turing Computable

      • Klaus Weihrauch, Ning Zhong
      Pages 697-706

    8. An FPTAS for Agreeably Weighted Variance on a Single Machine (Extended Abstract)

      • Gerhard J. Woeginger
      Pages 707-716

    9. Erratum: Bulk-Synchronous Parallel Multiplication of Boolean Matrices

      • A. Tiskin
      Pages 717-718

  2. Back Matter

    Pages 719-720
    Download chapter PDF
Back to top

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation