Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Automata, Languages and Programming

22nd International Colloquium, ICALP 95, Szeged, Hungary, July 10 - 14, 1995. Proceedings

  • Conference proceedings
  • © 1995

Overview

Editors:
  1. Zoltán Fülöp
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Ferenc Gécseg
    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 944)

Included in the following conference series:

Conference proceedings info: ICALP 1995.

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 (57 papers)

  1. Front Matter

    Download chapter PDF

  2. Theory of 2-structures

    • A. Ehrenfeucht, T. Harju, G. Rozenberg
    Pages 1-14

  3. A domain for concurrent termination a generalization of Mazurkiewicz traces

    • Volker Diekert, Paul Gastin
    Pages 15-26

  4. Nonfinite axiomatizability of the equational theory of shuffle

    • Zoltán ésik, Michael Bertol
    Pages 27-38

  5. The algebraic equivalent of AFL theory

    • Werner Kuich
    Pages 39-50

  6. Finite state transformations of images

    • Karel Culik, Jarkko Kari
    Pages 51-62

  7. Post correspondence problem: Words possible as primitive solutions

    • Marjo Lipponen
    Pages 63-74

  8. Computing the closure of sets of words under partial commutations

    • Yves Métivier, GwénaËl Richomme, Pierre-André Wacrenier
    Pages 75-86

  9. Intervalizing k-colored graphs

    • Hans L. Bodlaender, Babette de Fluiter
    Pages 87-98

  10. NC algorithms for finding a maximal set of paths with application to compressing strings

    • Zhi-Zhong Chen
    Pages 99-110

  11. On the construction of classes of suffix trees for square matrices: Algorithms and applications

    • Raffaele Giancarlo, Roberto Grossi
    Pages 111-122

  12. How to use the minimal separators of a graph for its chordal triangulation

    • Andreas Parra, Petra Scheffler
    Pages 123-134

  13. Fast gossiping by short messages

    • J. -C. Bermond, L. Gargano, A. A. Rescigno, U. Vaccaro
    Pages 135-146

  14. Break Finite Automata Public Key Cryptosystem

    • Feng Bao, Yoshihide Igarashi
    Pages 147-158

  15. Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time

    • S. Nikoletseas, J. Reif, P. Spirakis, M. Yung
    Pages 159-170

  16. On the number of random bits in totally private computation

    • Carlo Blundo, Alfredo De Santis, Giuseppe Persiano, Ugo Vaccaro
    Pages 171-182

  17. Lower time bounds for randomized computation

    • RŪsiņš Freivalds, Marek Karpinski
    Pages 183-195

  18. New collapse consequences of NP having small circuits

    • Johannes Köbler, Osamu Watanabe
    Pages 196-207

  19. The complexity of searching succinctly represented graphs

    • José L. Balcázar
    Pages 208-219

  20. Optimal shooting: Characterizations and applications

    • Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack et al.
    Pages 220-231
Back to top

Other volumes

  1. Automata, Languages and Programming

Keywords

About this book

This volume constitutes the proceedings of the 22nd Interna- tional Colloquium on Automata, Languages, and Programming, held under the sponsorship of EATCS in Szeged, Hungary in July 1995.
The volume presents four invited papers and 53 full revised research papers selected from a total of 111 submissions. ICALP traditionally covers the whole area of theoretical computer science; among the topics addressed in the volume are concurrency, automata, formal languages, algorithms, communication protocols, computational complexity, computability, foundations of programming, learning and coding, and semantics.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation