Foundations of Software Technology and Theoretical Computer Science de Somenath Biswas

Foundations of Software Technology and Theoretical Computer Science: 11th Conference, New Delhi, India, December 17-19, 1991. Proceedings: Lecture Notes in Computer Science, cartea 560

Somenath Biswas

Kesav V. Nori

en Limba Engleză Paperback – 27 noi 1991

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.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

20%

Preț: 1020^.28 lei
Preț: 395^.25 lei
20%

Preț: 327^.36 lei
20%

Preț: 556^.96 lei
20%

Preț: 400^.77 lei
15%

Preț: 558^.12 lei
20%

Preț: 328^.94 lei
20%

Preț: 340^.04 lei
20%

Preț: 487^.46 lei
20%

Preț: 629^.71 lei
20%

Preț: 386^.08 lei
20%

Preț: 489^.11 lei
20%

Preț: 620^.33 lei
20%

Preț: 733^.68 lei
20%

Preț: 1033^.45 lei
20%

Preț: 782^.57 lei
20%

Preț: 679^.09 lei
20%

Preț: 330^.54 lei
20%

Preț: 1137^.10 lei
20%

Preț: 435^.28 lei
20%

Preț: 375^.72 lei
20%

Preț: 342^.61 lei
20%

Preț: 432^.78 lei
20%

Preț: 904^.16 lei
20%

Preț: 1391^.87 lei
20%

Preț: 373^.80 lei
20%

Preț: 400^.17 lei
20%

Preț: 1359^.66 lei
20%

Preț: 984^.64 lei
20%

Preț: 560^.93 lei
20%

Preț: 731^.97 lei
20%

Preț: 563^.29 lei
20%

Preț: 403^.00 lei
20%

Preț: 793^.92 lei
20%

Preț: 324^.19 lei
20%

Preț: 733^.68 lei
20%

Preț: 336^.86 lei
20%

Preț: 327^.36 lei
20%

Preț: 573^.45 lei
20%

Preț: 558^.53 lei
20%

Preț: 850^.42 lei
20%

Preț: 560^.93 lei
20%

Preț: 560^.93 lei
20%

Preț: 631^.96 lei
20%

Preț: 568^.70 lei
20%

Preț: 488^.90 lei
20%

Preț: 293^.24 lei

Cuprins

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