LEADER 07239nam 22008295 450 001 9910767527803321 005 20230220124512.0 010 $a1-280-86534-2 010 $a9786610865345 010 $a3-540-70918-5 024 7 $a10.1007/978-3-540-70918-3 035 $a(CKB)1000000000284150 035 $a(SSID)ssj0000310192 035 $a(PQKBManifestationID)11239010 035 $a(PQKBTitleCode)TC0000310192 035 $a(PQKBWorkID)10288151 035 $a(PQKB)11103492 035 $a(DE-He213)978-3-540-70918-3 035 $a(MiAaPQ)EBC3061501 035 $a(MiAaPQ)EBC301786 035 $a(Au-PeEL)EBL301786 035 $a(OCoLC)299753315 035 $a(MiAaPQ)EBC6743009 035 $a(Au-PeEL)EBL6743009 035 $a(OCoLC)184984757 035 $a(PPN)123160316 035 $a(EXLCZ)991000000000284150 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aSTACS 2007 $e24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings /$fedited by Wolfgang Thomas, Pascal Weil 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (XVIII, 710 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4393 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-70917-7 320 $aIncludes bibliographic references and index. 327 $aInvited Talks -- A Calculus and Algebra for Distributed Data Management -- The Büchi Complementation Saga -- Speed-Up Techniques for Shortest-Path Computations -- Session 1A -- Compact Forbidden-Set Routing -- A New Bound for Pure Greedy Hot Potato Routing -- Wavelength Management in WDM Rings to Maximize the Number of Connections -- Session 1B -- A First Investigation of Sturmian Trees -- On the Size of the Universal Automaton of a Regular Language -- Correlations of Partial Words -- Session 2A -- Testing Convexity Properties of Tree Colorings -- Why Almost All k-Colorable Graphs Are Easy -- Session 2B -- On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds -- A New Rank Technique for Formula Size Lower Bounds -- Session 3A -- Hard Metrics from Cayley Graphs of Abelian Groups -- Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs -- Light Orthogonal Networks with Constant Geometric Dilation -- Session 3B -- Admissibility in Infinite Games -- Pure Stationary Optimal Strategies in Markov Decision Processes -- Symmetries and the Complexity of Pure Nash Equilibrium -- Session 4A -- Computing Representations of Matroids of Bounded Branch-Width -- Characterizing Minimal Interval Completions -- Session 4B -- The Complexity of Unions of Disjoint Sets -- Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity -- Session 5A -- Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets -- On the Complexity of Affine Image Matching -- Session 5B -- On Fixed Point Equations over Commutative Semirings -- An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings -- Session 6A -- A Cubic Kernel for Feedback Vertex Set -- The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting -- An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs -- Session 6B -- A Search Algorithm for the Maximal Attractor of a Cellular Automaton -- Universal Tilings -- On the Complexity of Unary Tiling-Recognizable Picture Languages -- Session 7A -- A Characterization of Strong Learnability in the Statistical Query Model -- On the Consistency of Discrete Bayesian Learning -- Session 7B -- VPSPACE and a Transfer Theorem over the Reals -- On Symmetric Signatures in Holographic Algorithms -- Session 8A -- Randomly Rounding Rationals with Cardinality Constraints and Derandomizations -- Cheating to Get Better Roommates in a Random Stable Matching -- A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window -- Session 8B -- Arithmetizing Classes Around NC 1 and L -- The Polynomially Bounded Perfect Matching Problem Is in NC 2 -- Languages with Bounded Multiparty Communication Complexity -- Session 9A -- New Approximation Algorithms for Minimum Cycle Bases of Graphs -- On Completing Latin Squares -- Small Space Representations for Metric Min-Sum k-Clustering and Their Applications -- Session 9B -- An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic -- Bounded-Variable Fragments of Hybrid Logics -- Rank-1 Modal Logics Are Coalgebraic -- Session 10A -- An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups -- Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem -- Quantum Network Coding -- Session 10B -- Reachability in Unions of Commutative Rewriting Systems Is Decidable -- Associative-Commutative Deducibility Constraints -- On the Automatic Analysis of Recursive Security Protocols with XOR -- Session 11A -- Improved Online Algorithms for the Sorting Buffer Problem -- Cost Sharing Methods for Makespan and Completion Time Scheduling -- Session 11B -- Planar Graphs: Logical Complexity and Parallel Isomorphism Tests -- Enumerating All Solutions for Constraint Satisfaction Problems. 330 $aThis book constitutes the refereed proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2007, held in Aachen, Germany in February 2007. The 56 revised full papers presented together with 3 invited papers were carefully reviewed and selected from about 400 submissions. The papers address the whole range of theoretical computer science including algorithms and data structures, automata and formal languages, complexity theory, logic in computer science, semantics, specification, and verification of programs, rewriting and deduction, as well as current challenges like biological computing, quantum computing, and mobile and net computing. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4393 606 $aComputer science 606 $aAlgorithms 606 $aMachine theory 606 $aArtificial intelligence?Data processing 606 $aTheory of Computation 606 $aAlgorithms 606 $aComputer Science Logic and Foundations of Programming 606 $aFormal Languages and Automata Theory 606 $aData Science 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aMachine theory. 615 0$aArtificial intelligence?Data processing. 615 14$aTheory of Computation. 615 24$aAlgorithms. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aFormal Languages and Automata Theory. 615 24$aData Science. 676 $a004 702 $aThomas$b Wolfgang$f1947- 702 $aWeil$b Pascal 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910767527803321 996 $aSTACS 2007$9772469 997 $aUNINA