LEADER 06878nam 22007335 450 001 996466099103316 005 20200703042947.0 010 $a3-540-48663-1 024 7 $a10.1007/3-540-58338-6 035 $a(CKB)1000000000234157 035 $a(SSID)ssj0000324664 035 $a(PQKBManifestationID)11246405 035 $a(PQKBTitleCode)TC0000324664 035 $a(PQKBWorkID)10319250 035 $a(PQKB)10405781 035 $a(DE-He213)978-3-540-48663-3 035 $a(PPN)155231251 035 $a(EXLCZ)991000000000234157 100 $a20121227d1994 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aMathematical Foundations of Computer Science 1994$b[electronic resource] $e19th International Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994. Proceedings /$fedited by Igor Privara, Branislav Rovan, Peter Ruzicka 205 $a1st ed. 1994. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1994. 215 $a1 online resource (XI, 633 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v841 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-58338-6 327 $aModels, languages, and compiler technology for high performance computers -- On NC-real complexity classes for additive circuits and their relations with NC -- E-complete sets do not have optimal polynomial time approximations -- Solving polynomial fixed point equations -- Capturing complexity classes with Lindström quantifiers -- Communication throughput of interconnection networks -- Intuitive counterexamples for constructive fallacies -- Algebraic methods in the compositional analysis of logic programs -- Longest common subsequences -- Towards DNA sequencing chips -- On-line scheduling of parallel jobs -- Stable bistructure models of PCF -- A Competitive analysis of the list update problem with lookahead -- May and must convergency in concurrent ?-calculus -- Genericity and measure for exponential time -- Analysis of bounded disorder -- On languages accepted with simultaneous complexity bounds and their ranking problem -- A proof system for asynchronously communicating deterministic processes -- Embedding complete binary trees into star networks -- Inductive counting below logspace -- Decision problems for edge grammars -- ?The big sweep?: On the power of the wavefront approach to Voronoi diagrams -- Reliable minimum finding comparator networks -- On parallel complexity of maximum f-matching and the degree sequence problem -- A comparison of two lower bound methods for communication complexity -- Efficient solving of the word equations in one variable -- A ?-calculus with explicit substitutions: The late semantics -- Processes and hyperuniverses -- The combinatorial complexity of a finite string -- A fully abstract semantics for termination in Petri nets -- Passive and active rules in deductive databases -- Combinatorial results on the complexity of teaching and learning -- Degrees and reducibilities of easy tally sets -- MSO definable text languages -- Two lower bounds on distributive generation of languages -- Rational rewriting -- On the size of independent systems of equations in semigroups -- On a sublinear time parallel construction of optimal binary search trees -- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems -- The relationship between gossiping in vertex-disjoint paths mode and bisection width -- A comparison of finite and cellular automata -- Empty alternation -- On the minimization problem for ?-automata -- On the complexity of constructing optimal ordered binary decision diagrams -- Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach -- A completeness theorem for nondeterministic Kleene algebras -- How a rainbow coloring function can simulate wait-free handshaking -- Critical pairs in term graph rewriting -- Read-write causality -- Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable -- Complexity of EOL structural equivalence -- Shorter queues for permutation routing on meshes -- Full abstraction for the second order subset of an ALGOL-like language -- The finest homophonic partition and related code concepts. 330 $aThis volume constitutes the proceedings of the 19th International Symposium on Mathematical Foundations of Theoretical Computer Science, MFCS '94, held in Kosice, Slovakia in August 1994. MFCS '94 brought together specialists in theoretical fields of computer science from various countries in order to stimulate mathematical research in theoretical computer science. Besides 12 papers based on invited talks by renowned experts, the book contains 42 research contributions selected from a total of 112 submissions. All areas of theoretical computer science are presented, some from a particular mathematical point of view. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v841 606 $aComputers 606 $aAlgorithms 606 $aComputer logic 606 $aMathematical logic 606 $aSoftware engineering 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 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 615 0$aComputers. 615 0$aAlgorithms. 615 0$aComputer logic. 615 0$aMathematical logic. 615 0$aSoftware engineering. 615 14$aTheory of Computation. 615 24$aComputation by Abstract Devices. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 615 24$aSoftware Engineering. 676 $a004.0151 702 $aPrivara$b Igor$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRovan$b Branislav$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aRuzicka$b Peter$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466099103316 996 $aMathematical Foundations of Computer Science 1994$92830336 997 $aUNISA