Custom cover image
Custom cover image

Theoretical computer science : 6th GI-Conference, Dortmund, January 5 - 7, 1983 / ed. by A. B. Cremers and H. P. Kriegel

Contributor(s): Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: Lecture notes in computer science ; 145Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1982Description: Online-Ressource (X, 365 S.)ISBN:
  • 9783540394211
Subject(s): Genre/Form: Additional physical formats: 3540119736 | 0387119736 | 9783540119739 | Erscheint auch als: Theoretical computer science. Druck-Ausgabe. Berlin : Springer, 1982. X, 365 S.DDC classification:
  • 004.0151 23
  • 001.64/01 19
LOC classification:
  • QA75.5-76.95
  • QA267
DOI: DOI: 10.1007/BFb0036464Online resources: Summary: 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.PPN: PPN: 744953227Package identifier: Produktsigel: ZDB-2-LNC | ZDB-2-SCS | ZDB-2-BAE | ZDB-2-SXCS | ZDB-2-SEB | ZDB-1-SLN
No physical items for this record

Reproduktion. (Springer eBook collection. Computer science)

KIT – The University in the Helmholtz Association                         Home | Impressum | Datenschutz | Barrierefreiheit | KIT