Automata, Languages and Programming : 12th Colloquium, Nafplion, Greece, July 15-19, 1985. Proceedings

Wilfried Brauer

ISBN 10: 354015650X / ISBN 13: 9783540156505

Published by Springer, Springer, 1985

About this Item

Druck auf Anfrage Neuware - Printed after ordering - Vertex packing algorithms.- Linear and branching structures in the semantics and logics of reactive systems.- About rational sets of factors of a bi-infinite word.- A fair protocol for signing contracts.- The influence of key length on the area-time complexity of sorting.- Repeated synchronous snapshots and their implementation in CSP.- On total regulators generated by derivation relations.- Optimal solutions for a class of point retrieval problems.- Fractional cascading: A data structuring technique with geometric applications.- Hierarchies of one-way multihead automata languages.- Partitioning point sets in 4 dimensions.- A completeness theorem for recursively defined types.- Categorical combinatory logic.- Towards a uniform topological treatment of streams and functions on streams.- Infinite streams and finite observations in the semantics of uniform concurrency.- Imposed-functional dependencies inducing horizontal decompositions.- Characterization of high level tree transducers.- Ambiguity and transcendence.- A fast algorithm for polygon containment by translation.- Deterministic and Las Vegas primality testing algorithms.- Efficient algorithms for graphic matroid intersection and parity.- Operational semantics for order-sorted algebra.- A universal domain technique for profinite posets.- A simple proof of the Skolem-Mahler-Lech theorem.- On complete problems for NP CoNP.- An algebraic theory of fair asynchronous communicating processes.- Hoare's logic for nondeterministic regular programs: A nonstandard completeness theorem.- Powerdomains as algebraic lattices preliminary report.- Random generation of combinatiorial structures from a uniform distribution.- Do rational equivalence relations have regular cross-sections .- On probabilistic time and space.- Thenearest neighbor problem on bounded domains.- Routing through a generalized switchbox.- On k-repetition free words generated by length uniform morphisms over a binary alphabet.- Every commutative quasirational language is regular.- A probabilistic distributed algorithm for set intersection and its analysis.- Distributed algorithms in synchronous broadcasting networks.- A context dependent equivalence between processes.- Lower bounds by kolmogorov-complexity.- A bidirectional shortest-path algorithm with good average-case behavior (preliminary version).- Applications of an infinite squarefree CO-CFL.- Special relations in automated deduction.- Dynamic interpolation search.- Polynomial levelability and maximal complexity cores.- Finite group topology and p-adic topology for free monoids.- On the use of relational expressions in the design of efficient algorithms.- The complementation problem for Büchi automata with applications to temporal logic.- A complete compositional modal proof system for a subset of CCS.- On matrix multiplication using array processors.- Optimal parallel pattern matching in strings.- Compositionality and concurrent networks: Soundness and completeness of a proofsystem.

Seller Inventory # 9783540156505

Bibliographic Details

• Title: Automata, Languages and Programming : 12th Colloquium, Nafplion, Greece, July 15-19, 1985. Proceedings
• Publisher: Springer, Springer
• Publication Date: 1985
• Language: English
• ISBN 10: 354015650X
• ISBN 13: 9783540156505
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 29D millimeters 235 millimeters width by 155 millimeters height by 29 millimeters depth
• Weight: 803 grams

About this title

Synopsis

This book constitutes the refereed proceedings of the 28th International Colloquium on Automata, Languages and Programming, ICALP 2001, held in Crete, Greece in July 2001. four invited papers were carefully reviewed and selected from a total of 208 submissions. complexity, algorithm analysis, approximation and optimization, complexity, concurrency, efficient data structures, graph algorithms, language theory, codes and automata, model checking and protocol analysis, networks and routing, reasoning and verification, scheduling, secure computation, specification and deduction, and structural complexity.