Cantitate/Preț
Produs
Total produse
Vezi coșul
Foundations of Software Technology and Theoretical Computer Science: 15th Conference; Bangalore, India, December 1995. Proceedings de P.S. Thiagarajan

Foundations of Software Technology and Theoretical Computer Science: 15th Conference; Bangalore, India, December 1995. Proceedings: Lecture Notes in Computer Science, cartea 1026

Editat de P.S. Thiagarajan
en Limba Engleză Paperback – 4 dec 1995
This book constitutes the refereed proceedings of the 15th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS '95, held in Bangalore, India in December 1995.
The volume presents 31 full revised research papers selected from a total of 106 submissions together with full papers of four invited talks. Among the topics covered are algorithms, software technology, functional programming theory, distributed algorithms, term rewriting and constraint logic programming, complexity theory, process algebras, computational geometry, and temporal logics and verification theory.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 33410 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 23 noi 1994 33410 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 4 dec 1995 33735 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 33735 lei

Preț vechi: 42169 lei
-20% Nou

Puncte Express: 506
Preț estimativ în valută:
6456€ • 6792$ • 5345£

Carte tipărită la comandă

Livrare economică 14-28 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540606925
ISBN-10: 3540606920
Pagini: 536
Ilustrații: XIII, 523 p.
Dimensiuni: 155 x 233 x 28 mm
Greutate: 0.74 kg
Ediția:1995
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Looking for MUM and DAD: Text-text comparisons do help.- Branch and bound on the network model.- A near optimal algorithm for the extended cow-path problem in the presence of relative errors.- Efficient algorithms for vertex arboricity of planar graphs.- A condition for the three colourability of planar locally path graphs.- A framework for the specification of reactive and concurrent systems in Z.- Synthesizing different development paradigms: Combining top-down with bottom-up reasoning about distributed systems.- Verifying part of the ACCESS.bus protocol using PVS.- Reusing batch parsers as incremental parsers.- The expressive power of indeterminate primitives in asynchronous computation.- The transformation calculus.- Equational axiomatization of bicoercibility for polymorphic types.- From causal consistency to sequential consistency in shared memory systems.- Observation of software for distributed systems with RCL.- Partiality and approximation schemes for local consistency in networks of constraints.- Maximal extensions of simplification orderings.- Average polynomial time is hard for exponential time under sn-reductions.- On self-testing without the generator bottleneck.- Observing behaviour categorically.- An algorithm for reducing binary branchings.- On the complexity of bisimilarity for value-passing processes.- On the expressive power of CCS.- Polarized name passing.- Path balance heuristic for self-adjusting binary search trees.- Pattern matching in compressed texts.- All-pairs min-cut in sparse networks.- Minimizing space usage in evaluation of expression trees.- Smooth surfaces for multi-scale shape representation.- On parallel complexity of planar triangulations.- Computing a largest empty anchored cylinder, and related problems.- Computing hierarchies ofclusters from the euclidean minimum spanning tree in linear time.- Determinizing Büchi asynchronous automata.- Achilles and the tortoise climbing up the arithmetical hierarchy.- Generalized temporal verification diagrams.- Model checking of probabilistic and nondeterministic systems.