Shimon Even, Oded Kariv
Proceedings of the Eighth Colloquium on Automata, Languages and Programming
ICALP, 1981.

@proceedings{ICALP-1981,
	address       = "Akko), Israel",
	editor        = "Shimon Even and Oded Kariv",
	isbn          = "3-540-10843-2",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Eighth Colloquium on Automata, Languages and Programming}",
	volume        = 115,
	year          = 1981,
}

Contents (44 items)

6 ×#on the
5 ×#logic
4 ×#algorithm
4 ×#problem
3 ×#analysis
3 ×#bound
3 ×#complexity
3 ×#multi
3 ×#termination
2 ×#data type

ICALP-1981-Schnorr #algorithm #analysis

Refined Analysis and Improvements on Some Factoring Algorithms (CPS), pp. 1–15.

ICALP-1981-HeintzS #decidability #polynomial #random

Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables (JH, MS), pp. 16–28.

ICALP-1981-PreparataV #fourier #integer #multi #network

Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform (FPP, JV), pp. 29–40.

ICALP-1981-HongMR #graph #trade-off

Cost Tradeoffs in Graph Embeddings, with Applications (JWH, KM, ALR), pp. 41–55.

ICALP-1981-Reif #network

Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time (JHR), pp. 56–67.

ICALP-1981-Welzl #on the

On the Density of Color-Families (EW), pp. 68–72.

ICALP-1981-BeeriV #dependence #problem

The Implication Problem for Data Dependencies (CB, MYV), pp. 73–85.

ICALP-1981-Makowsky #database #dependence

Characterizing Data Base Dependencies (JAM), pp. 86–97.

ICALP-1981-Sharir #analysis #data flow #source code

Data Flow Analysis of Applicative Programs (MS), pp. 98–113.

ICALP-1981-Jones #analysis

Flow Analysis of λ Expressions (NDJ), pp. 114–128.

ICALP-1981-Loeckx #algorithm #data type #specification

Algorithmic Specifications of Abstract Data Types (JL), pp. 129–147.

ICALP-1981-Subrahmanyam #data type #nondeterminism

Nondeterminism in Abstract Data Types (PAS), pp. 148–164.

ICALP-1981-Ullman #database #relational

A View of Directions in Relational Database Theory (JDU), pp. 165–176.

ICALP-1981-Reutenauer #regular expression

A New Characterization of the Regular Languages (CR), pp. 177–183.

ICALP-1981-Pin #french

Languages reconnaissables et codage prefixe pur (JÉP), pp. 184–192.

ICALP-1981-EngelfrietF

Passes, Sweeps and Visits (JE, GF), pp. 193–207.

ICALP-1981-SippuS #lalr #on the #testing

On LALR(1) Testing (SS, ESS), pp. 208–217.

ICALP-1981-Ukkonen #bound #on the #parsing

On Size Bounds for Deterministic Parsers (EU), pp. 218–228.

ICALP-1981-ItzhaikY #equivalence #linear

A Decision Procedure for the Equivalence of Two DPDAs, One of Which is Linear (YI, AY), pp. 229–237.

ICALP-1981-MeyerSM #deduction #logic #problem

The Deducibility Problem in Propositional Dynamic Logic (ARM, RSS, GM), pp. 238–248.

ICALP-1981-Ben-AriHP #finite #logic #modelling

Finite Models for Deterministic Propositional Dynamic Logic (MBA, JYH, AP), pp. 249–263.

ICALP-1981-LehmannPS #concurrent #termination

Impartiality, Justice and Fairness: The Ethics of Concurrent Termination (DJL, AP, JS), pp. 264–277.

ICALP-1981-FraenkelL #exponential

Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N (ASF, DL), pp. 278–293.

ICALP-1981-IbarraLM #complexity #on the

On the Complexity of Simple Arithmetic Expressions (OHI, BSL, SM), pp. 294–304.

ICALP-1981-Snir #bound #proving

Proving Lower Bounds for Linar Decision Trees (MS), pp. 305–315.

ICALP-1981-BlattnerL #bound

Parikh-Bounded Languages (MB, ML), pp. 316–323.

ICALP-1981-Karhumaki #morphism

Generalized Parikh Mappings and Homomorphisms (JK), pp. 324–332.

ICALP-1981-Istrail #product line

Chomsky-Schützenberger Representations for Families of Languages and Grammatical Types (SI), pp. 333–347.

ICALP-1981-BergstraT #algebra #hoare #logic #programming

Algebraically Specified Programming Systems and Hoare’s Logic (JAB, JVT), pp. 348–362.

ICALP-1981-MoriconiS #automation #generative #hoare #logic #verification

Automatic Construction of Verification Condition Generators From Hoare Logics (MM, RLS), pp. 363–377.

ICALP-1981-Sethi

Circular Expressions: Elimination of Static Environments (RS), pp. 378–392.

ICALP-1981-Courcelle #algorithm #approach #axiom

An Axiomatic Approach to the Korenjak-Hopcroft Algorithms (BC), pp. 393–407.

ICALP-1981-EhrenfeuchtR #on the #problem

On the (Generalized) Post Correspondence Problem with Lists of Length 2 (AE, GR), pp. 408–416.

ICALP-1981-ItaiKR #implementation

A Sparse Table Implementation of Priority Queues (AI, AGK, MR), pp. 417–431.

ICALP-1981-Pettorossi #order #proving #recursion #term rewriting #termination

Comparing and Putting Together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems (AP), pp. 432–447.

ICALP-1981-Dershowitz #linear #term rewriting #termination

Termination of Linear Rewriting Systems (ND), pp. 448–458.

ICALP-1981-PnueliZ #equation #specification

Realizing an Equational Specification (AP, RZ), pp. 459–478.

ICALP-1981-AptP #nondeterminism

A Cook’s Tour of Countable Nondeterminism (KRA, GDP), pp. 479–494.

ICALP-1981-GurariI #complexity #multi #problem

The Complexity of Decision Problems for Finite-Turn Multicounter Machines (EMG, OHI), pp. 495–505.

ICALP-1981-King #automaton #finite #multi

Alternating Multihead Finite Automata (KNK), pp. 506–520.

ICALP-1981-Pearl #algorithm #branch

The Solution for the Branching Factor of the α-β Pruning Algorithm (JP), pp. 521–529.

ICALP-1981-Lieberherr #complexity

Uniform Complexity and Digital Signatures (KJL), pp. 530–543.

ICALP-1981-Shamir #encryption #generative #on the #pseudo #sequence

On the Generation of Cryptographically Strong Pseudo-Random Sequences (AS), pp. 544–550.

ICALP-1981-Makowsky81a #logic #named #power of

Errata: Measuring the Expressive Power of Dynamic Logics: An Application of Abstract Model Theory (JAM), p. 551.