Umfang:
Online-Ressource (X, 365 S.)
Ausgabe:
Springer eBook collection. Computer science
ISBN:
9783540394211
Serie:
Lecture notes in computer science 145
Inhalt:
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.
Anmerkung:
Literaturangaben
Weitere Ausg.:
ISBN 3540119736
Weitere Ausg.:
ISBN 0387119736
Weitere Ausg.:
ISBN 9783540119739
Weitere Ausg.:
Erscheint auch als Druck-Ausgabe Theoretical computer science Berlin : Springer, 1982 ISBN 3540119736
Weitere Ausg.:
ISBN 0387119736
Sprache:
Englisch
Fachgebiete:
Informatik
Schlagwort(e):
Datenverarbeitung
;
Informatik
;
Konferenzschrift
URL:
Volltext
(Deutschlandweit zugänglich)
Mehr zum Autor:
Cremers, Armin B. 1946-
Bookmarklink
