Titolo: Foundations of Software Technology and Theoretical Computer Science: Fifth Conference, New Delhi, India, December 16-18, 1985. Proceedings (Lecture Notes in Computer Science, 206)
Editore: Springer
Data di pubblicazione: 1985
Lingua: Inglese
ISBN 10: 3540160426
ISBN 13: 9783540160427
Rilegatura: Brossura
Condizione: New

Descrizione articolo

Riassunto

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

Contenuti

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.

Descrizione libreria

Quality books, speedy shipping, and great customer service! Please note that used items may not include access codes or cards, CD's or other accessories, regardless of what is stated in item title. If you need to guarantee that these items are included, please purchase a brand new copy.

Visita la pagina della libreria

Informazioni sull?azienda del venditore

J2B Holdings, LLC
13770 NOEL RD, #803600, Dallas, TX, 75240, U.S.A.

Condizioni di vendita e spedizione

Condizioni di vendita

We guarantee the condition of every book as it's described on the AbeBooks web
sites. Please note that used items may not include access codes or cards, CD's
or other accessories, regardless of what is stated in item title. If you need to
guarantee that these items are included, please purchase a brand new copy.

All requests for refunds and/or returns will be processed in accordance with
AbeBooks policies. If you're dissatisfied with your purchase (Incorrect Book/Not
as Described/Damaged) or if ...

Ulteriori informazioni

Diritto di recesso

Condizioni di spedizione

Books ordered via expedited shipping should arrive between 2 and 7 business days after shipment confirmation. Books ordered via standard shipping should arrive between 4 and 14 business days after shipment confirmation.

Tariffe di spedizione nazionale per U.S.A.

Tariffe di spedizione nazionale per U.S.A.
Quantit� dell?ordine	Da 4 a 10 giorni lavorativi	Da 3 a 6 giorni lavorativi
Primo articolo	EUR 3.40	EUR 5.96

I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.