H p kriegel (12 risultati)
Editore: Paris, 1970
- Brossura
Da: LibrairieLaLettre2, Villefranche de Lauragais, FranciaLibrairieLaLettre2
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Discreto
EUR 8,00
EUR 35,00 spedizioneSpedito da Francia a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloBroché. Condizione: Etat moyen. in-8 Description :Ceras 128 pages, mention manuscrite couverture Langue : français.
- Brossura
Da: Books Puddle, New York, NY, U.S.A.Books Puddle
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 80,33
EUR 3,44 spedizioneSpedito in U.S.A.Quantità: 4 disponibili
Condizione: New. pp. 384.
- Brossura
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 94,05
EUR 13,94 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
- Brossura
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 62,91 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Partial functions in comstructive formal theories.- A Monte Carlo factoring algorithm with finite storage.- Theory of concurrency control.- Interprocedural data flow systems.- On the crossing-free, rectangular embedding of weighted graphs in the p…lane.- Discreteness, K-density and D-continuity of occurrence nets.- Controlled relativizations of P and NP.- The computational complexity of certain graph grammars.- Inconsistencies of pure LISP.- FIFO nets: A new model of parallel computation.- Une extension aux mots infinis de la notion de transduction rationnelle.- Algebraic and operational semantics of exceptions and errors.- The expected number of nodes and leaves at level k in ordered trees.- Complexity theory on real numbers and functions.- A multifit algorithm for uniform multiprocessor scheduling.- Analysis of polynomial approximation algorithms for constraint expressions.- Heuristics for minimum edge length rectangular partitions of rectilinear figures.- An axiomatic approach to semantics of specification languages.- Efficiency of universal parallel computers.- Coroutines and processes in block structured languages.- A general scheme for some deterministically parsable grammars and their strong equivalents.- A decidability result about sufficient-completeness of axiomatically specified abstract data types.- Two remarks on the power of counting.- Some operations and transductions that preserve rationality.- On algebras of computation sequences and proofs of equivalence of operational and denotational semantics.- Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits.- The equivalence problem for N.T.S. languages is deoidable.- Weakest expressible preconditions: A new tool for proving completeness results about Hoare calculi.- A hierarchy of sets of infinite trees.- Maintaining order in a generalized linked list.- Periodic versus arbitrary tessellations of the plane using polyominos of a single type.
- Brossura
Da: Mispah books, Redhill, SURRE, Regno UnitoMispah books
Contatta il venditoreVenditore con 4 stelleCondizione: Usato - Molto buono
EUR 118,67
EUR 29,10 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: Very Good. Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book.
- Brossura
Da: Chiron Media, Wallingford, Regno UnitoChiron Media
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 42,04
EUR 18,03 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 10 disponibili
Paperback. Condizione: New.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, Springer Dez 1982, 1982
- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Partial functions in comstructive formal theories.- A Monte Carlo factoring algorithm with finite storage.- Theory of concurrency control.- Interprocedural data flow systems.- On the crossing-free, rectangular embedding of weighted… graphs in the plane.- Discreteness, K-density and D-continuity of occurrence nets.- Controlled relativizations of P and NP.- The computational complexity of certain graph grammars.- Inconsistencies of pure LISP.- FIFO nets: A new model of parallel computation.- Une extension aux mots infinis de la notion de transduction rationnelle.- Algebraic and operational semantics of exceptions and errors.- The expected number of nodes and leaves at level k in ordered trees.- Complexity theory on real numbers and functions.- A multifit algorithm for uniform multiprocessor scheduling.- Analysis of polynomial approximation algorithms for constraint expressions.- Heuristics for minimum edge length rectangular partitions of rectilinear figures.- An axiomatic approach to semantics of specification languages.- Efficiency of universal parallel computers.- Coroutines and processes in block structured languages.- A general scheme for some deterministically parsable grammars and their strong equivalents.- A decidability result about sufficient-completeness of axiomatically specified abstract data types.- Two remarks on the power of counting.- Some operations and transductions that preserve rationality.- On algebras of computation sequences and proofs of equivalence of operational and denotational semantics.- Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits.- The equivalence problem for N.T.S. languages is deoidable.- Weakest expressible preconditions: A new tool for proving completeness results about Hoare calculi.- A hierarchy of sets of infinite trees.- Maintaining order in a generalized linked list.- Periodic versus arbitrary tessellations of the plane using polyominos of a single type. 384 pp. Englisch.
- Brossura
- Print on Demand
Da: Majestic Books, Hounslow, Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 79,43
EUR 7,56 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Condizione: New. Print on Demand pp. 384 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
- Brossura
- Print on Demand
Da: Biblios, frankfurt am main, HESSE, GermaniaBiblios
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 81,59
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 4 disponibili
Condizione: New. PRINT ON DEMAND pp. 384.
- Brossura
- Print on Demand
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 48,37
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Partial functions in comstructive formal theories.- A Monte Carlo factoring algorithm with finite storage.- Theory of concurrency control.- Interprocedural data flow systems.- On the crossing-free, rectangular embedd…ing of weighted graphs in the plane.- Dis.
- Brossura
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Partial functions in comstructive formal theories.- A Monte Carlo factoring algorithm with finite storage.- Theory of concurrency control.- Interprocedural data flow systems.- On the crossing-free, rectangular embedding of weighted gra…phs in the plane.- Discreteness, K-density and D-continuity of occurrence nets.- Controlled relativizations of P and NP.- The computational complexity of certain graph grammars.- Inconsistencies of pure LISP.- FIFO nets: A new model of parallel computation.- Une extension aux mots infinis de la notion de transduction rationnelle.- Algebraic and operational semantics of exceptions and errors.- The expected number of nodes and leaves at level k in ordered trees.- Complexity theory on real numbers and functions.- A multifit algorithm for uniform multiprocessor scheduling.- Analysis of polynomial approximation algorithms for constraint expressions.- Heuristics for minimum edge length rectangular partitions of rectilinear figures.- An axiomatic approach to semantics of specification languages.- Efficiency of universal parallel computers.- Coroutines and processes in block structured languages.- A general scheme for some deterministically parsable grammars and their strong equivalents.- A decidability result about sufficient-completeness of axiomatically specified abstract data types.- Two remarks on the power of counting.- Some operations and transductions that preserve rationality.- On algebras of computation sequences and proofs of equivalence of operational and denotational semantics.- Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits.- The equivalence problem for N.T.S. languages is deoidable.- Weakest expressible preconditions: A new tool for proving completeness results about Hoare calculi.- A hierarchy of sets of infinite trees.- Maintaining order in a generalized linked list.- Periodic versus arbitrary tessellations of the plane using polyominos of a single type.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 384 pp. Englisch.
Altre immagini- Brossura
- Print on Demand
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 50,25
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: Neu. Theoretical Computer Science | 6th GI-Conference Dortmund, January 5-7, 1983 | A. B. Cremers (u. a.) | Taschenbuch | xii | Englisch | 1982 | Springer | EAN 9783540119739 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[d…ot]com | Anbieter: preigu Print on Demand.
