LEADER 07108nam 22007935 450 001 9910144033003321 005 20200629114928.0 010 $a3-540-45138-2 024 7 $a10.1007/b11836 035 $a(CKB)1000000000212097 035 $a(SSID)ssj0000324672 035 $a(PQKBManifestationID)11252790 035 $a(PQKBTitleCode)TC0000324672 035 $a(PQKBWorkID)10314275 035 $a(PQKB)11675064 035 $a(DE-He213)978-3-540-45138-9 035 $a(MiAaPQ)EBC3087629 035 $a(PPN)155181017 035 $a(EXLCZ)991000000000212097 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aMathematical Foundations of Computer Science 2003 $e28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings /$fedited by Branislav Rovan, Peter Vojtas 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (XIII, 692 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2747 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-40671-9 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Talks -- Distributed Quantum Computing -- Selfish Routing in Non-cooperative Networks: A Survey -- Process Algebraic Frameworks for the Specification and Analysis of Cryptographic Protocols -- Semantic and Syntactic Approaches to Simulation Relations -- On the Computational Complexity of Conservative Computing -- Constructing Infinite Graphs with a Decidable MSO-Theory -- Towards a Theory of Randomized Search Heuristics -- Contributed Papers -- Adversarial Models for Priority-Based Networks -- On Optimal Merging Networks -- Problems which Cannot Be Reduced to Any Proper Subproblems -- ACID-Unification Is NEXPTIME-Decidable -- Completeness in Differential Approximation Classes -- On the Length of the Minimum Solution of Word Equations in One Variable -- Smoothed Analysis of Three Combinatorial Problems -- Inferring Strings from Graphs and Arrays -- Faster Algorithms for k-Medians in Trees -- Periodicity and Transitivity for Cellular Automata in Besicovitch Topologies -- Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms -- Error-Bounded Probabilistic Computations between MA and AM -- A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves -- Symbolic Analysis of Crypto-Protocols Based on Modular Exponentiation -- Denotational Testing Semantics in Coinductive Form -- Lower Bounds for General Graph?Driven Read?Once Parity Branching Programs -- The Minimal Graph Model of Lambda Calculus -- Unambiguous Automata on Bi-infinite Words -- Relating Hierarchy of Temporal Properties to Model Checking -- Arithmetic Constant-Depth Circuit Complexity Classes -- Inverse NP Problems -- A Linear-Time Algorithm for 7-Coloring 1-Planar Graphs -- Generalized Satisfiability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity -- Randomized Algorithms for Determining the Majority on Graphs -- Using Transitive?Closure Logic for Deciding Linear Properties of Monoids -- Linear-Time Computation of Local Periods -- Two Dimensional Packing: The Power of Rotation -- Approximation Schemes for the Min-Max Starting Time Problem -- Quantum Testers for Hidden Group Properties -- Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces -- LTL with Past and Two-Way Very-Weak Alternating Automata -- Match-Bounded String Rewriting Systems -- Probabilistic and Nondeterministic Unary Automata -- On Matroid Properties Definable in the MSO Logic -- Characterizations of Catalytic Membrane Computing Systems -- Augmenting Local Edge-Connectivity between Vertices and Vertex Subsets in Undirected Graphs -- Scheduling and Traffic Allocation for Tasks with Bounded Splittability -- Computing Average Value in Ad Hoc Networks -- A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes -- Solving the Sabotage Game Is PSPACE-Hard -- The Approximate Well-Founded Semantics for Logic Programs with Uncertainty -- Which Is the Worst-Case Nash Equilibrium? -- A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory -- Generic Algorithms for the Generation of Combinatorial Objects -- On the Complexity of Some Problems in Interval Arithmetic -- An Abduction-Based Method for Index Relaxation in Taxonomy-Based Sources -- On Selection Functions that Do Not Preserve Normality -- On Converting CNF to DNF -- A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum -- On the Complexity of Some Equivalence Problems for Propositional Calculi -- Quantified Mu-Calculus for Control Synthesis -- On Probabilistic Quantified Satisfiability Games -- A Completeness Property of Wilke?s Tree Algebras -- Symbolic Topological Sorting with OBDDs -- Ershov?s Hierarchy of Real Numbers. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2747 606 $aComputer engineering 606 $aComputers 606 $aProgramming languages (Electronic computers) 606 $aData structures (Computer science) 606 $aComputer science?Mathematics 606 $aComputer graphics 606 $aComputer Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I27000 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 615 0$aComputer engineering. 615 0$aComputers. 615 0$aProgramming languages (Electronic computers). 615 0$aData structures (Computer science). 615 0$aComputer science?Mathematics. 615 0$aComputer graphics. 615 14$aComputer Engineering. 615 24$aTheory of Computation. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aData Structures. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 676 $a004.0151 702 $aRovan$b Branislav$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aVojtas$b Peter$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910144033003321 996 $aMathematical foundations of computer science 2003$92124642 997 $aUNINA