Fondamenti della tecnologia software e dell'informatica teorica: Quinta conferenza, Nuova Delhi, India, 16-18 dicembre 1985. Atti Fondamenti della tecnologia software e dell'informatica teorica: Quinta conferenza, Nuova Delhi, India, 16-18 dicembre 1985. Atti
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: GuthrieBooks, Spring Branch, TX, U.S.A.
Paperback. Condizione: 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. Codice articolo DA1411141
Quantità: 1 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 5890763
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9783540160427_new
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 5890763-n
Quantità: Più di 20 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: 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. Codice articolo 9783540160427
Quantità: 2 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 5890763-n
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: As New. Unread book in perfect condition. Codice articolo 5890763
Quantità: Più di 20 disponibili
Da: moluna, Greven, Germania
Condizione: 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 . Codice articolo 4882890
Quantità: Più di 20 disponibili
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Taschenbuch. Condizione: 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 KG, Sachsenplatz 4-6, 1201 Wien 536 pp. Englisch. Codice articolo 9783540160427
Quantità: 1 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Taschenbuch. Condizione: 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. Codice articolo 9783540160427
Quantità: 1 disponibili