Foundations of Software Technology and Theoretical Computer Science
Editat de Rudrapatna K. Shyamasundaren Limba Engleză Paperback – 23 noi 1993
Preț: 331.16 lei
Preț vechi: 413.95 lei
-20%
Puncte Express: 497
Preț estimativ în valută:
58.56€ • 67.15$ • 50.61£
58.56€ • 67.15$ • 50.61£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540575290
ISBN-10: 3540575294
Pagini: 476
Ilustrații: CDLXXVI, 462 p.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.72 kg
Ediția:1993
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540575294
Pagini: 476
Ilustrații: CDLXXVI, 462 p.
Dimensiuni: 155 x 235 x 26 mm
Greutate: 0.72 kg
Ediția:1993
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Some observations about the nature of computer science.- Essential intersection type assignment.- Label-selective ?-calculus syntax and confluence.- Conventional and uniqueness typing in graph rewrite systems.- A meta-language for typed object-oriented languages.- Preemption in concurrent systems.- Local versus non-local computation of length of digitized curves.- Data-independences of parallel random access machines.- Proving termination of logic programs by transforming them into equivalent term rewriting systems.- Completeness of hierarchical combinations of term rewriting systems.- Higher-order and semantic unification.- A conservative extension of first-order logic and its applications to theorem proving.- Well-founded Ordered Search (extended abstract).- A real-time interval logic and its decision procedure.- On the semantics of optimization predicates in CLP languages.- Incremental algorithms for constraint solving and entailment over rational trees.- Proximity problems and the Voronoi diagram on a rectilinear plane with rectangular obstacles.- Feasibility of design in stereolithography.- Compact location problems.- On some communication complexity problems related to threshold functions.- Recursiveness over the complex numbers is time-bounded.- A lower bound for solvability of polynomial equations.- Reuse of proofs in software verification.- Induce-statements and induce-expressions: Constructs for inductive programming.- A graphic language based on timing diagrams.- Software technology: Integrating theory and practice.- Generating degrees of belief from statistical information: An overview.- Complexity results for 1-safe nets.- Some results about logical descriptions of non deterministic behaviours.- Order structures and generalisations of Szpilrajn's theorem.-ICSP and its relationship with ACSP and CSP.- On reduction-based process semantics.- Keeping track of the latest gossip: Bounded time-stamps suffice.- Time optimal self-stabilizing spanning tree algorithms.- Efficient algorithm to sort linear combinations of arrays.- A simple file structure for the weighted dictionary problem.- Searching, sorting and randomised algorithms for Central Elements and ideal counting in posets.- Learning classes of Regular and Linear Languages in Valiant's learnability framework.