Theoretical Computer Science [[electronic resource] ] : 6th GI-Conference Dortmund, January 5-7, 1983 / / edited by A.B. Cremers, H.-P. Kriegel

• Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1982
• Edizione: 1st ed. 1982.
• Descrizione fisica: 1 online resource (XII, 368 p.)
• Disciplina: 004.0151
• Soggetto topico: Computers; Algorithms; Theory of Computation; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity
• Persona (resp. second.): CremersA.B; KriegelH.-P
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di contenuto: 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.
• Titolo autorizzato: Theoretical computer science
• ISBN: 3-540-39421-4
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Lingua di pubblicazione: Inglese
• Record Nr.: 996466367003316
• Lo trovi qui: Univ. di Salerno
• Serie: Lecture Notes in Computer Science, . 0302-9743 ; ; 145