LEADER 04161nam  22005655  450 
001 996466367003316
005 20200701110007.0
010   $a3-540-39421-4
024 7 $a10.1007/BFb0036464
035   $a(CKB)1000000000230232
035   $a(SSID)ssj0000327185
035   $a(PQKBManifestationID)11230128
035   $a(PQKBTitleCode)TC0000327185
035   $a(PQKBWorkID)10297576
035   $a(PQKB)11321758
035   $a(DE-He213)978-3-540-39421-1
035   $a(PPN)155173685
035   $a(EXLCZ)991000000000230232
100   $a20121227d1982      u|             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aTheoretical Computer Science$b[electronic resource] $e6th GI-Conference Dortmund, January 5-7, 1983 /$fedited by A.B. Cremers, H.-P. Kriegel
205   $a1st ed. 1982.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1982.
215   $a1 online resource (XII, 368 p.)
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v145
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-11973-6 
327   $aPartial 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.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v145
606   $aComputers
606   $aAlgorithms
606   $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005
606   $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013
606   $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021
615  0$aComputers.
615  0$aAlgorithms.
615 14$aTheory of Computation.
615 24$aComputation by Abstract Devices.
615 24$aAlgorithm Analysis and Problem Complexity.
676   $a004.0151
702   $aCremers$b A.B$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aKriegel$b H.-P$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996466367003316
996   $aTheoretical computer science$9104541
997   $aUNISA