Skip to main content
SpringerLink
Log in

Automata, Languages and Programming

Eighth Colloquium, Acre (Akko), Israel, July 13-17, 1981

  • Conference proceedings
  • © 1981

Overview

Editors:
  1. Shimon Even
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Oded Kariv
    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 115)

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 54.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 (44 papers)

  1. Front Matter

    Download chapter PDF

  2. Refined analysis and improvements on some factoring algorithms

    • C. P. Schnorr
    Pages 1-15

  3. Absolute primality of polynomials is decidable in random polynomial time in the number of variables

    • Joos Heintz, Malte Sieveking
    Pages 16-28

  4. Area-time optimal VLSI networks for computing integer multiplication and Discrete Dourier Transform

    • F. P. Preparata, J. E. Vuillemin
    Pages 29-40

  5. Cost tradeoffs in graph embeddings, with applications

    • Hong Jia-Wei, Kurt Mehlhorn, Arnold L. Rosenberg
    Pages 41-55

  6. Minimum s-t cut of a planar undirected network in o(n log2(n)) time

    • John H. Reif
    Pages 56-67

  7. On the density of color-families

    • E. Welzl
    Pages 68-72

  8. The implication problem for data dependencies

    • C. Beeri, M. Y. Vardi
    Pages 73-85

  9. Characterizing data base Dependencies

    • J. A. Makowsky
    Pages 86-97

  10. Data flow analysis of applicative programs

    • Micha Sharir
    Pages 98-113

  11. Flow analysis of lambda expressions

    • Neil D. Jones
    Pages 114-128

  12. Algorithmic specifications of abstract data types

    • Jacques Loeckx
    Pages 129-147

  13. Nondeterminism in abstract data types

    • P. A. Subrahmanyam
    Pages 148-164

  14. A view of directions in relational database theory

    • Jeffrey D. Ullman
    Pages 165-176

  15. A new characterization of the regular languages

    • Christophe Reutenauer
    Pages 177-183

  16. Langages Reconnaissables et Codage Prefixe Pur

    • Jean-Eric Pin
    Pages 184-192

  17. Passes, sweeps and visits

    • Joost Engelfriet, Gilberto Filè
    Pages 193-207

  18. On LALR(k) testing

    • Seppo Sippu, Eljas Soisalon-Soininen
    Pages 208-217

  19. On size bounds for deterministic parsers

    • Esko Ukkonen
    Pages 218-228

  20. A decision procedure for the equivalence of two dpdas one of which is linear

    • Yair Itzhaik
    Pages 229-237
Back to top

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation