LEADER 06311nam 22006975 450 001 996465683603316 005 20200704023246.0 010 $a3-540-44693-1 024 7 $a10.1007/3-540-44693-1 035 $a(CKB)1000000000211444 035 $a(SSID)ssj0000326855 035 $a(PQKBManifestationID)11213074 035 $a(PQKBTitleCode)TC0000326855 035 $a(PQKBWorkID)10297416 035 $a(PQKB)10365181 035 $a(DE-He213)978-3-540-44693-4 035 $a(MiAaPQ)EBC3071938 035 $a(PPN)155212044 035 $a(EXLCZ)991000000000211444 100 $a20121227d2001 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aSTACS 2001$b[electronic resource] $e18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001. Proceedings /$fedited by Afonso Ferreira, Horst Reichel 205 $a1st ed. 2001. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001. 215 $a1 online resource (XVI, 580 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2010 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-41695-1 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Presentations -- Recurrence in Infinite Words -- Generalized Model-Checking Problems for First-Order Logic -- Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra -- Contributions -- 2-Nested Simulation Is Not Finitely Equationally Axiomatizable -- On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems -- Matching Polygonal Curves with Respect to the Fréchet Distance -- On the Class of Languages Recognizable by 1-Way Quantum Finite Automata -- Star-Free Open Languages and Aperiodic Loops -- A 5/2n 2-Lower Bound for the Multiplicative Complexity of n × n-Matrix Multiplication -- Evasiveness of Subgraph Containment and Related Properties -- On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs -- On Presburger Liveness of Discrete Timed Automata -- Residual Finite State Automata -- Deterministic Radio Broadcasting at Low Cost -- The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE?Complete -- Recursive Randomized Coloring Beats Fair Dice Random Colorings -- Randomness, Computability, and Density -- On Multipartition Communication Complexity -- Scalable Sparse Topologies with Small Spectrum -- Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios -- The UPS Problem -- Gathering of Asynchronous Oblivious Robots with Limited Visibility -- Generalized Langton?s Ant: Dynamical Behavior and Complexity -- Optimal and Approximate Station Placement in Networks -- Learning Expressions over Monoids -- Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods -- On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages -- Efficient Minimal Perfect Hashing in Nearly Minimal Space -- Small PCPs with Low Query Complexity -- Space Efficient Algorithms for Series-Parallel Graphs -- A Toolkit for First Order Extensions of Monadic Games -- Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs -- Refining the Hierarchy of Blind Multicounter Languages -- A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab*c -- New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata -- The Complexity of Minimal Satisfiability Problems -- On the Minimal Hardware Complexity of Pseudorandom Function Generators -- Approximation Algorithms for Minimum Size 2-Connectivity Problems -- A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets -- An Ehrenfeucht-Fraïssé Approach to Collapse Results for First-Order Queries over Embedded Databases -- A New Logical Characterization of Büchi Automata -- A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph -- The Complexity of Copy Constant Detection in Parallel Programs -- Approximation Algorithms for the Bottleneck Stretch Factor Problem -- Semantical Principles in the Modal Logic of Coalgebras -- The #a = #b Pictures Are Recognizable -- A Logical Approach to Decidability of Hierarchies of Regular Star?Free Languages -- Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables -- New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2010 606 $aComputers 606 $aData structures (Computer science) 606 $aOptical data processing 606 $aComputer science?Mathematics 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aData Structures and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15009 606 $aImage Processing and Computer Vision$3https://scigraph.springernature.com/ontologies/product-market-codes/I22021 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aMathematics of Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I17001 615 0$aComputers. 615 0$aData structures (Computer science). 615 0$aOptical data processing. 615 0$aComputer science?Mathematics. 615 14$aTheory of Computation. 615 24$aData Structures and Information Theory. 615 24$aImage Processing and Computer Vision. 615 24$aData Structures. 615 24$aMathematics of Computing. 676 $a004 702 $aFerreira$b Afonso$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aReichel$b Horst$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aSymposium on Theoretical Aspects of Computer Science 906 $aBOOK 912 $a996465683603316 996 $aSTACS 2001$91424639 997 $aUNISA