Articles liés à Foundations of Software Technology and Theoretical...
Foundations of Software Technology and Theoretical Computer Science: Fifth Conference, New Delhi, India, December 16-18, 1985. Proceedings - Couverture souple
Acheter neuf
Afficher cet article
EUR 48,37
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délais
Résultats de recherche pour Foundations of Software Technology and Theoretical...
Image fournie par le vendeur
Foundations of Software Technology and Theoretical Computer Science
Edité par
Springer Berlin Heidelberg, 1985
ISBN 10 : 3540160426
ISBN 13 : 9783540160427
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The mathematics of programming.- Concurrent programming using actors: Exploiting large-scale parallelism.- A new class of high level programs for distributed computing systems.- A class of termination detection algorithms for distributed computations.- New . N° de réf. du vendeur 4882890
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Foundations of Software Technology and Theoretical Computer Science : Fifth Conference, New Delhi, India, December 16-18, 1985. Proceedings
Edité par
Springer Berlin Heidelberg, 1985
ISBN 10 : 3540160426
ISBN 13 : 9783540160427
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - The mathematics of programming.- Concurrent programming using actors: Exploiting large-scale parallelism.- A new class of high level programs for distributed computing systems.- A class of termination detection algorithms for distributed computations.- New protocols for the election of a leader in a ring.- Program simplification via symbolic interpretation.- PROLOG-based inductive theorem proving.- On the calling behaviour of procedures.- Approximation algorithms for planar matching.- Geometric optimization and the polynomial hierarchy.- Deriving object octree from images.- Deduction with relation matching.- Recursively defined domains and their induction principles.- Large database specifications from small views.- A decision method for temporal logic based on resolution.- A generalization of the Parikh vector for finite and infinite words.- The implication problem for functional and multivalued dependencies : An algebraic approach.- A simple characterization of database serializability.- Who needs to verify programs if you can test them.- Partial correctness semantics for CP[ , ¿, &].- A proof technique for rely/guarantee properties.- A complete proof system for SCCS with modal assertions.- Demand-driven evaluation on dataflow machine.- Design and implementation of a procedural VLSI layout system.- VLSI systems for matrix multiplication.- Parallel algorithms for solving certain classes of linear recurrences.- O(1) parallel time incremental graph algorithms.- NC algorithms for comparability graphs, interval graphs, and testing for unique perfect matching.- Fast and efficient parallel algorithms for the exact inversion of integer matrices. N° de réf. du vendeur 9783540160427
Quantité disponible : 1 disponible(s)
Image d'archives
Foundations of Software Technology and Theoretical Computer Science: Fifth Conference, New Delhi, India, December 16-18, 1985. Proceedings (Lecture Notes in Computer Science, 206)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783540160427_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Foundations of Software Technology and Theoretical Computer Science
Edité par
Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 1985, 1985
ISBN 10 : 3540160426
ISBN 13 : 9783540160427
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -The mathematics of programming.- Concurrent programming using actors: Exploiting large-scale parallelism.- A new class of high level programs for distributed computing systems.- A class of termination detection algorithms for distributed computations.- New protocols for the election of a leader in a ring.- Program simplification via symbolic interpretation.- PROLOG-based inductive theorem proving.- On the calling behaviour of procedures.- Approximation algorithms for planar matching.- Geometric optimization and the polynomial hierarchy.- Deriving object octree from images.- Deduction with relation matching.- Recursively defined domains and their induction principles.- Large database specifications from small views.- A decision method for temporal logic based on resolution.- A generalization of the Parikh vector for finite and infinite words.- The implication problem for functional and multivalued dependencies : An algebraic approach.- A simple characterization of database serializability.- Who needs to verify programs if you can test them.- Partial correctness semantics for CP[ , ¿, &].- A proof technique for rely/guarantee properties.- A complete proof system for SCCS with modal assertions.- Demand-driven evaluation on dataflow machine.- Design and implementation of a procedural VLSI layout system.- VLSI systems for matrix multiplication.- Parallel algorithms for solving certain classes of linear recurrences.- O(1) parallel time incremental graph algorithms.- NC algorithms for comparability graphs, interval graphs, and testing for unique perfect matching.- Fast and efficient parallel algorithms for the exact inversion of integer matrices.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 536 pp. Englisch. N° de réf. du vendeur 9783540160427
Quantité disponible : 1 disponible(s)
Image d'archives
Foundations of Software Technology and Theoretical Computer Science: Fifth Conference, New Delhi, India, December 16-18, 1985. Proceedings (Lecture Notes in Computer Science)
Edité par
Springer, 1985
ISBN 10 : 3540160426
ISBN 13 : 9783540160427
Ancien ou d'occasion
Paperback
Vendeur : GuthrieBooks, Spring Branch, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Pages tanned from age. Text block clean and unmarked. Tight binding. N° de réf. du vendeur DA1411141
Quantité disponible : 1 disponible(s)
Image d'archives
Foundations of Software Technology and Theoretical Computer Science: Fifth Conference, New Delhi, India, December 16-18, 1985. Proceedings (Lecture Notes in Computer Science, 206)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020160875
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Foundations of Software Technology and Theoretical Computer Science
Edité par
Springer Berlin Heidelberg Nov 1985, 1985
ISBN 10 : 3540160426
ISBN 13 : 9783540160427
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The mathematics of programming.- Concurrent programming using actors: Exploiting large-scale parallelism.- A new class of high level programs for distributed computing systems.- A class of termination detection algorithms for distributed computations.- New protocols for the election of a leader in a ring.- Program simplification via symbolic interpretation.- PROLOG-based inductive theorem proving.- On the calling behaviour of procedures.- Approximation algorithms for planar matching.- Geometric optimization and the polynomial hierarchy.- Deriving object octree from images.- Deduction with relation matching.- Recursively defined domains and their induction principles.- Large database specifications from small views.- A decision method for temporal logic based on resolution.- A generalization of the Parikh vector for finite and infinite words.- The implication problem for functional and multivalued dependencies : An algebraic approach.- A simple characterization of database serializability.- Who needs to verify programs if you can test them.- Partial correctness semantics for CP[ , ¿, &].- A proof technique for rely/guarantee properties.- A complete proof system for SCCS with modal assertions.- Demand-driven evaluation on dataflow machine.- Design and implementation of a procedural VLSI layout system.- VLSI systems for matrix multiplication.- Parallel algorithms for solving certain classes of linear recurrences.- O(1) parallel time incremental graph algorithms.- NC algorithms for comparability graphs, interval graphs, and testing for unique perfect matching.- Fast and efficient parallel algorithms for the exact inversion of integer matrices. 536 pp. Englisch. N° de réf. du vendeur 9783540160427
Quantité disponible : 2 disponible(s)