Foundations of Software Technology and Theoretical Computer Science
Editat de Conjeevaram E. Veni Madhavanen Limba Engleză Paperback – 6 dec 1989
Preț: 324.82 lei
Preț vechi: 406.03 lei
-20%
Puncte Express: 487
Carte tipărită la comandă
Livrare economică 17-31 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540520481
ISBN-10: 3540520481
Pagini: 352
Ilustrații: VIII, 341 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.53 kg
Ediția:1989
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540520481
Pagini: 352
Ilustrații: VIII, 341 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.53 kg
Ediția:1989
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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).