S. N. Maheshwari: Foundations of Software Technology and Theoretical Computer Science : Fifth Conference, New Delhi, India, December 16-18, 1985. Proceedings - Taschenbuch
[EAN: 9783540160427], Neubuch, [PU: Springer Berlin Heidelberg], EDV / THEORIE SOFTWARE-ENTW. SOFTWARE ENGINEERING; RESOLUTION; ALGORITHM; ALGORITHMS; DESIGN; DISTRIBUTEDCOMPUTING; LOGIC; OBJECT; OPTIMIZATION; PROGRAMMING; SEMANTICS; TESTING; THEOREMPROVING; THEORETICALCOMPUTERSCIENCE, 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. 536 pp. Englisch, Books<
S. N. Maheshwari: Foundations of Software Technology and Theoretical Computer Science : Fifth Conference, New Delhi, India, December 16-18, 1985. Proceedings - Taschenbuch
[EAN: 9783540160427], Neubuch, [SC: 8.81], [PU: Springer Berlin Heidelberg], EDV / THEORIE SOFTWARE-ENTW. SOFTWARE ENGINEERING; RESOLUTION; ALGORITHM; ALGORITHMS; DESIGN; DISTRIBUTEDCOMPUTING; LOGIC; OBJECT; OPTIMIZATION; PROGRAMMING; SEMANTICS; TESTING; THEOREMPROVING; THEORETICALCOMPUTERSCIENCE, 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., Books<
S. N. Maheshwari: Foundations of Software Technology and Theoretical Computer Science : Fifth Conference, New Delhi, India, December 16-18, 1985. Proceedings - Taschenbuch
[EAN: 9783540160427], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], EDV / THEORIE SOFTWARE-ENTW. SOFTWARE ENGINEERING; RESOLUTION; ALGORITHM; ALGORITHMS; DESIGN; DISTRIBUTEDCOMPUTING; LOGIC; OBJECT; OPTIMIZATION; PROGRAMMING; SEMANTICS; TESTING; THEOREMPROVING; THEORETICALCOMPUTERSCIENCE, 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., Books<
[EAN: 9783540160427], Neubuch, [PU: Springer Berlin Heidelberg Nov 1985], EDV / THEORIE SOFTWARE-ENTW. SOFTWARE ENGINEERING; RESOLUTION; ALGORITHM; ALGORITHMS; DESIGN; DISTRIBUTEDCOMPUTING; LOGIC; OBJECT; OPTIMIZATION; PROGRAMMING; SEMANTICS; TESTING; THEOREMPROVING; THEORETICALCOMPUTERSCIENCE, 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, Books<
AbeBooks.de
BuchWeltWeit Inh. Ludwig Meier e.K., Bergisch Gladbach, Germany [57449362] [Rating: 5 (von 5)] NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Maheshwari, S. N. (Herausgeber): Foundations of Software Technology and Theoretical Computer Science Fifth Conference, New Delhi, India, December 16-18, 1985. Proceedings - neues Buch
Foundations of Software Technology and Theoretical Computer Science : Fifth Conference, New Delhi, India, December 16-18, 1985. Proceedings - Taschenbuch
[EAN: 9783540160427], Neubuch, [PU: Springer Berlin Heidelberg], EDV / THEORIE SOFTWARE-ENTW. SOFTWARE ENGINEERING; RESOLUTION; ALGORITHM; ALGORITHMS; DESIGN; DISTRIBUTEDCOMPUTING; LOGIC; OBJECT; OPTIMIZATION; PROGRAMMING; SEMANTICS; TESTING; THEOREMPROVING; THEORETICALCOMPUTERSCIENCE, 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. 536 pp. Englisch, Books<
Foundations of Software Technology and Theoretical Computer Science : Fifth Conference, New Delhi, India, December 16-18, 1985. Proceedings - Taschenbuch
[EAN: 9783540160427], Neubuch, [SC: 8.81], [PU: Springer Berlin Heidelberg], EDV / THEORIE SOFTWARE-ENTW. SOFTWARE ENGINEERING; RESOLUTION; ALGORITHM; ALGORITHMS; DESIGN; DISTRIBUTEDCOMPUTING; LOGIC; OBJECT; OPTIMIZATION; PROGRAMMING; SEMANTICS; TESTING; THEOREMPROVING; THEORETICALCOMPUTERSCIENCE, 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., Books<
S. N. Maheshwari: Foundations of Software Technology and Theoretical Computer Science : Fifth Conference, New Delhi, India, December 16-18, 1985. Proceedings - Taschenbuch
[EAN: 9783540160427], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], EDV / THEORIE SOFTWARE-ENTW. SOFTWARE ENGINEERING; RESOLUTION; ALGORITHM; ALGORITHMS; DESIGN; DISTRIBUTEDCOMPUTING; LOGIC; OBJECT; OPTIMIZATION; PROGRAMMING; SEMANTICS; TESTING; THEOREMPROVING; THEORETICALCOMPUTERSCIENCE, 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., Books<
[EAN: 9783540160427], Neubuch, [PU: Springer Berlin Heidelberg Nov 1985], EDV / THEORIE SOFTWARE-ENTW. SOFTWARE ENGINEERING; RESOLUTION; ALGORITHM; ALGORITHMS; DESIGN; DISTRIBUTEDCOMPUTING; LOGIC; OBJECT; OPTIMIZATION; PROGRAMMING; SEMANTICS; TESTING; THEOREMPROVING; THEORETICALCOMPUTERSCIENCE, 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, Books<
NEW BOOK. Versandkosten:Versandkostenfrei. (EUR 0.00) BuchWeltWeit Inh. Ludwig Meier e.K., Bergisch Gladbach, Germany [57449362] [Rating: 5 (von 5)]
Maheshwari, S. N. (Herausgeber): Foundations of Software Technology and Theoretical Computer Science Fifth Conference, New Delhi, India, December 16-18, 1985. Proceedings - neues Buch
1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.
Foundations of Software Technology and Theoretical Computer Science: Fifth Conference, New Delhi, India, December 16-18, 1985. Proceedings (Lecture Notes in Computer Science) [paperback] Maheshwari, S.N. [Nov 22, 1985]
Detailangaben zum Buch - Foundations of Software Technology and Theoretical Computer Science
EAN (ISBN-13): 9783540160427 ISBN (ISBN-10): 3540160426 Gebundene Ausgabe Taschenbuch Erscheinungsjahr: 1985 Herausgeber: Springer Berlin 522 Seiten Gewicht: 0,801 kg
Buch in der Datenbank seit 2007-10-26T12:10:35+02:00 (Berlin) Detailseite zuletzt geändert am 2024-04-17T16:51:07+02:00 (Berlin) ISBN/EAN: 9783540160427
ISBN - alternative Schreibweisen: 3-540-16042-6, 978-3-540-16042-7 Alternative Schreibweisen und verwandte Suchbegriffe: Autor des Buches: maheshwari Titel des Buches: 1985, theoretical computer science, new delhi, lecture notes computer science, software, science and technology, proceedings all india, foundations science
Daten vom Verlag:
Autor/in: S.N. Maheshwari Titel: Lecture Notes in Computer Science; Foundations of Software Technology and Theoretical Computer Science - Fifth Conference, New Delhi, India, December 16-18, 1985. Proceedings Verlag: Springer; Springer Berlin 527 Seiten Erscheinungsjahr: 1985-11-01 Berlin; Heidelberg; DE Sprache: Englisch 53,49 € (DE) 54,99 € (AT) 59,00 CHF (CH) Available XIII, 527 p.
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.
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
