Skip to main content
SpringerLink
Log in

Automata, Languages and Programming

23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings

  • Conference proceedings
  • © 1996

Overview

Editors:
  1. Friedhelm Meyer
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Burkhard Monien
    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 1099)

Included in the following conference series:

Conference proceedings info: ICALP 1996.

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

Access this book

Log in via an institution
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 (56 papers)

  1. Optimal gröbner base algorithms for binomial ideals

    • Ulla Koppenhagen, Ernst W. Mayr
    Pages 244-255

  2. Minimum fill-in on circle and circular-arc graphs

    • T. Kloks, D. Kratsch, C. K. Wong
    Pages 256-267

  3. Practical approximation schemes for maximum induced-subgraph problems on K 3,3-free or K 5-free graphs

    • Zhi-Zhong Chen
    Pages 268-279

  4. Searching a fixed graph

    • Elias Koutsoupias, Christos Papadimitriou, Mihalis Yannakakis
    Pages 280-289

  5. Improved sampling with applications to dynamic graph algorithms

    • Monika Rauch Henzinger, Mikkel Thorup
    Pages 290-299

  6. The expressive power of existential first order sentences of büchi's sequential calculus

    • Jean-Eric Pin
    Pages 300-311

  7. Fixpoints for rabin tree automata make complementation easy

    • Roope Kaivola
    Pages 312-323

  8. New upper bounds to the limitedness of distance automata

    • Kosaburo Hashiguchi
    Pages 324-335

  9. Recognizing regular expressions by means of dataflow networks

    • Pascal Raymond
    Pages 336-347

  10. On the power of randomized branching programs

    • Farid Ablayev, Marek Karpinski
    Pages 348-356

  11. Hitting sets derandomize BPP

    • Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Pages 357-368

  12. On type-2 probabilistic quantifiers

    • Ronald V. Book, Heribert Vollmer, Klaus W. Wagner
    Pages 369-380

  13. Speeding-up single-tape nondeterministic computations by single alternation, with separation results

    • Jiří Wiedermann
    Pages 381-392

  14. On ω-generators and codes

    • Sandrine Julia
    Pages 393-402

  15. On standard Sturmian morphisms

    • Aldo de Luca
    Pages 403-415

  16. Constructions and bounds for visual cryptography

    • Giuseppe Ateniese, Carlo Blundo, Alfrede De Santis, Douglas R. Stinson
    Pages 416-428

  17. On capital investment

    • Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén
    Pages 429-441

  18. Lower bounds for static dictionaries on RAMs with bit operations but no multiplication

    • Peter Bro Miltersen
    Pages 442-453

  19. Lower bounds for row minima searching

    • Phillip G. Bradford, Knut Reinert
    Pages 454-465

  20. On the complexity of relational problems for finite state processes

    • Sandeep K. Shukla, Harry B. Hunt III, Daniel J. Rosenkrantz, Richard E. Stearns
    Pages 466-477
Back to top

Other volumes

  1. Automata, Languages and Programming

Keywords

About this book

This volume constitutes the refereed proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP '96), held at Paderborn, Germany, in July 1996. ICALP is an annual conference sponsored by the European Association on Theoretical Computer Science (EATCS).
The proceedings contain 52 refereed papers selected from 172 submissions and 4 invited papers. The papers cover the whole range of theoretical computer science; they are organized in sections on: Process Theory; Fairness, Domination, and the u-Calculus; Logic and Algebra; Languages and Processes; Algebraic Complexity; Graph Algorithms; Automata; Complexity Theory; Combinatorics on Words; Algorithms; Lower Bounds; Data Structures...

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation