Foundations of Software Technology and Theoretical Computer Science: Ninth Conference, Bangalore, India, December 19-21, 1989. Proceedings by Conjeevaram E. Veni MadhavanFoundations of Software Technology and Theoretical Computer Science: Ninth Conference, Bangalore, India, December 19-21, 1989. Proceedings by Conjeevaram E. Veni Madhavan

Foundations of Software Technology and Theoretical Computer Science: Ninth Conference, Bangalore…

EditorConjeevaram E. Veni Madhavan

Paperback | December 6, 1989

Pricing and Purchase Info

$128.05 online 
$141.95 list price save 9%
Earn 640 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

The papers in this volume accepted for the conference on foundations of software technology and theoretical computer science project research results in - Algorithmics: design and analysis of graph, geometric, algebraic and VLSI algorithms; data structures; average analysis; complexity theory; parallel parsing. - Concurrency: algebraic semantics, event structures. - Logic programming: algebraic properties, semantics. - Software technology: program transformations, algebraic methods. These results together with the formal techniques employed to present them reflect current trends pursued by leading research groups around the world. The papers treat their topics in depth by carefully reviewing existing results, developing and demonstrating new techniques and suggesting further directions for research.
Title:Foundations of Software Technology and Theoretical Computer Science: Ninth Conference, Bangalore…Format:PaperbackDimensions:347 pagesPublished:December 6, 1989Publisher:Springer Berlin HeidelbergLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540520481

ISBN - 13:9783540520481

Look for similar items by category:

Reviews

Table of Contents

A linear-time recognition algorithm for P 4-reducible graphs.- Fast parallel approximations of the maximum weighted cut problem through derandomization.- A new class of separators and planarity of chordal graphs.- Optimal parallel algorithms on circular-arc graphs.- Algebraic properties of the space of multivalued and paraconsistent logic programs.- An autoepistemic logical view of knowledge base.- A natural semantics for logic programs with negation.- A transformation system for deductive database modules with perfect model semantics.- An efficient distributed algorithm for finding articulation points, Bridges, and biconnected components in asynchronous networks.- Impossibility results in the presence of multiple faulty processes.- An adaptive regulator approach for the design of load sharing algorithms.- An algebraic compositional semantics of an object oriented notation with concurrency.- An axiomatization of event structures.- Deducing causal relationships in CCS.- Annotated program transformations.- Algebraic software development concepts for module and configuration families.- On the limitations of locally robust positive reductions.- Query evaluation with null values: How complex is completeness?.- Average case complexity analysis of RETE pattern-match algorithm and average size of join in Databases.- The frobenius problem.- An efficient implicit data structure for path testing and searching in rooted trees and forests.- Robust decompositions of polyhedra.- Gate matrix layout revisited: Algorithmic performance and probabilistic analysis.- Parallel parsing on a one-way linear array of finite-state machines.- Energy-time trade-offs in VLSI computations.- Time and real-time in programs.- A proof system for communicating processes with value-passing (extended abstract).