Foundations of software technology and theoretical computer science : 11th conference, New Delhi, India, December 17-19, 1991 : proceedings
著者
書誌事項
Foundations of software technology and theoretical computer science : 11th conference, New Delhi, India, December 17-19, 1991 : proceedings
（Lecture notes in computer science, 560）
Springer-Verlag, c1991
- : gw
- : us
大学図書館所蔵 件 / 全54件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references
内容説明・目次
内容説明
This volume contains the proceedings of the Eleventh
Conference on Foundations of Software Technology and
Theoretical Computer Science held in New Dehli, India
December 17-19, 1991. Three invited papers and 25
contributed papers selected from 78 submissions by authors
from many different countries reflect the current research
concerns of the theoreticalcomputer science community. The
topics covered include:
-Algorithms (sequential, parallel and geometric)
-Automata theory
-Functional programming
-Learning
-Logic of programs
-Semantics
-Structural complexity theory
-Type theory.
目次
Program checking.- Randomizing reductions of search problems.- Time analysis, cost equivalence and program refinement.- AC-equation solving.- On the operational interpretation of complex types.- Tense logics for local reasoning in distributed systems.- Failures semantics for a simple process language with refinement.- Correctness of programs over poor signatures.- Complexity issues for vacillatory function identification.- A purely algebraic proof of McNaughton's theorem on infinite words.- The structure and complexity of minimal NFA's over a unary alphabet.- Relativised cellular automata and complexity classes.- Computing the order of a locally testable automaton.- On the structure and complexity of infinite sets with minimal perfect hash functions.- NP-hard sets and creativeness over constant time languages.- Complete problems involving boolean labelled structures and projection translations.- Is BP.? $$\mathcal{P}$$ a probabilistic class?.- Fast stable in-place sorting with O(n) data moves.- A theorem on the approximation of set cover and vertex cover.- A fast algorithm for the principal partition of a graph.- Uniform circuits and exclusive read PRAMs.- Contracting planar graphs efficiently in parallel.- Fast deterministic selection on mesh-connected processor arrays.- Improved selection in totally monotone arrays.- Designing secure communication protocols from trust specifications.- Computing the shortest path tree in a weak visibility polygon.- Usefulness of angle-sweep over line-sweep.- Petri nets and transition systems (Abstract for an invited talk).
「Nielsen BookData」 より