Cantitate/Preț
Produs

Foundations of Software Technology and Theoretical Computer Science: Ninth Conference, Bangalore, India, December 19-21, 1989. Proceedings: Lecture Notes in Computer Science, cartea 405

Editat de Conjeevaram E. Veni Madhavan
en Limba Engleză Paperback – 6 dec 1989
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32565 lei

Preț vechi: 40705 lei
-20% Nou

Puncte Express: 488

Preț estimativ în valută:
6233 6496$ 5189£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540520481
ISBN-10: 3540520481
Pagini: 352
Ilustrații: VIII, 341 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.49 kg
Ediția:1989
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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