Foundations of Software Technology and Theoretical Computer Science

11th Conference, New Delhi, India, December 17-19, 1991. Proceedings

AvSomenath Biswas,Kesav V. Nori

Häftad, Engelska, 1991

Del i serien Lecture Notes in Computer Science

566 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This volume contains the proceedings of the EleventhConference on Foundations of Software Technology andTheoretical Computer Science held in New Dehli, IndiaDecember 17-19, 1991. Three invited papers and 25contributed papers selected from 78 submissions by authorsfrom many different countries reflect the current researchconcerns of the theoreticalcomputer science community. Thetopics covered include:-Algorithms (sequential, parallel and geometric)-Automata theory-Functional programming-Learning-Logic of programs-Semantics-Structural complexity theory-Type theory.

Produktinformation

Utgivningsdatum:1991-11-27
Mått:155 x 233 x 24 mm
Vikt:657 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:425
Upplaga:1991
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540549673

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programvaruutveckling inom Data och IT

Innehållsförteckning

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).