Theoretical Computer Science: 6th GI-Conference Dortmund, January 5-7, 1983: Lecture Notes in Computer Science, cartea 145
Editat de A.B. Cremers, H.-P. Kriegelen Limba Engleză Paperback – dec 1982
Din seria Lecture Notes in Computer Science
- 15% Preț: 549.48 lei
- 20% Preț: 322.44 lei
- 20% Preț: 324.00 lei
- 20% Preț: 315.78 lei
- 20% Preț: 238.01 lei
- 20% Preț: 1017.66 lei
- 20% Preț: 322.44 lei
- 20% Preț: 438.69 lei
- 20% Preț: 548.35 lei
- 20% Preț: 325.58 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 315.19 lei
- 20% Preț: 1005.39 lei
- 20% Preț: 554.59 lei
- 17% Preț: 360.19 lei
- 20% Preț: 620.45 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1120.51 lei
- 20% Preț: 560.32 lei
- 20% Preț: 611.22 lei
- 20% Preț: 319.10 lei
- 20% Preț: 552.64 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- 20% Preț: 1339.86 lei
- 20% Preț: 172.69 lei
- 20% Preț: 315.78 lei
- Preț: 361.23 lei
- 20% Preț: 969.58 lei
- 20% Preț: 256.27 lei
- 20% Preț: 782.28 lei
- 20% Preț: 301.95 lei
- 20% Preț: 504.57 lei
- 20% Preț: 722.90 lei
- 20% Preț: 369.12 lei
- 20% Preț: 334.72 lei
- 20% Preț: 550.29 lei
- Preț: 389.06 lei
- 20% Preț: 564.99 lei
- 20% Preț: 552.25 lei
- 20% Preț: 552.25 lei
- 20% Preț: 722.40 lei
- 20% Preț: 331.59 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 318.79 lei
Preț vechi: 398.49 lei
-20% Nou
Puncte Express: 478
Preț estimativ în valută:
61.03€ • 66.27$ • 51.32£
61.03€ • 66.27$ • 51.32£
Carte tipărită la comandă
Livrare economică 17-31 decembrie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540119739
ISBN-10: 3540119736
Pagini: 384
Ilustrații: XII, 368 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.54 kg
Ediția:1982
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540119736
Pagini: 384
Ilustrații: XII, 368 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.54 kg
Ediția:1982
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.