04161nam 22005655 450 99646636700331620200701110007.03-540-39421-410.1007/BFb0036464(CKB)1000000000230232(SSID)ssj0000327185(PQKBManifestationID)11230128(PQKBTitleCode)TC0000327185(PQKBWorkID)10297576(PQKB)11321758(DE-He213)978-3-540-39421-1(PPN)155173685(EXLCZ)99100000000023023220121227d1982 u| 0engurnn#008mamaatxtccrTheoretical Computer Science[electronic resource] 6th GI-Conference Dortmund, January 5-7, 1983 /edited by A.B. Cremers, H.-P. Kriegel1st ed. 1982.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1982.1 online resource (XII, 368 p.)Lecture Notes in Computer Science,0302-9743 ;145Bibliographic Level Mode of Issuance: Monograph3-540-11973-6 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.Lecture Notes in Computer Science,0302-9743 ;145ComputersAlgorithmsTheory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Computation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Computers.Algorithms.Theory of Computation.Computation by Abstract Devices.Algorithm Analysis and Problem Complexity.004.0151Cremers A.Bedthttp://id.loc.gov/vocabulary/relators/edtKriegel H.-Pedthttp://id.loc.gov/vocabulary/relators/edtBOOK996466367003316Theoretical computer science104541UNISA