| Description |
1 online resource (x, 419 pages) : illustrations |
| Series |
Lecture notes in computer science ; 560 |
|
Lecture notes in computer science ; 560.
|
| Contents |
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 reasong in distributed systems -- Failures semantics for a simple process language with refinement -- Correctness of programs over poor signatures -- Complexity issues for vacillatory function identification -- Purely algebraic proof of McNaughton's Theorem on infinite words -- Structure and complexity of minimal NFAs 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 project translations |
|
Is BP.@P a probabililstic class? -- Fast stable in-place sorting with O(n) data moves -- Theorem on the approximation of set cover and vertex cover -- 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 |
| Summary |
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 |
| Bibliography |
Includes bibliographical references |
| Notes |
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. http://purl.oclc.org/DLF/benchrepro0212 MiAaHDL |
|
digitized 2011 HathiTrust Digital Library committed to preserve pda MiAaHDL |
|
Print version record |
| Subject |
Computer software -- Congresses
|
|
Computer science -- Congresses
|
|
Computer programming -- Congresses
|
|
Computer programming
|
|
Computer science
|
|
Computer software
|
|
Theoretische Informatik
|
|
Kongress
|
|
Informatik
|
|
Informatica.
|
|
Programmatuurtechniek.
|
|
Informatique -- Congrès.
|
| Genre/Form |
Conference papers and proceedings
|
| Form |
Electronic book
|
| Author |
Biswas, S. (Somenath), 1952-
|
|
Nori, Kesav V.
|
| ISBN |
9783540466123 |
|
3540466126 |
|
