| 000 | 05737nam a22006135i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-32288-7 | ||
| 003 | DE-He213 | ||
| 005 | 20240730195314.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100301s2006 gw | s |||| 0|eng d | ||
| 020 |
_a9783540322887 _9978-3-540-32288-7 |
||
| 024 | 7 |
_a10.1007/11672142 _2doi |
|
| 050 | 4 | _aQA75.5-76.95 | |
| 072 | 7 |
_aUYA _2bicssc |
|
| 072 | 7 |
_aCOM014000 _2bisacsh |
|
| 072 | 7 |
_aUYA _2thema |
|
| 082 | 0 | 4 |
_a004.0151 _223 |
| 245 | 1 | 0 |
_aSTACS 2006 _h[electronic resource] : _b23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings / _cedited by Bruno Durand, Wolfgang Thomas. |
| 250 | _a1st ed. 2006. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2006. |
|
| 300 |
_aXIX, 714 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v3884 |
|
| 505 | 0 | _aThe Ubiquitous Digital Tree -- Flat Holonomies on Automata Networks -- Interprocedurally Analyzing Polynomial Identities -- External String Sorting: Faster and Cache-Oblivious -- Amortized Rigidness in Dynamic Cartesian Trees -- Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes -- On Critical Exponents in Fixed Points of Binary k-Uniform Morphisms -- Equivalence of -Algebras and Cubic Forms -- Complete Codes in a Sofic Shift -- Kolmogorov Complexity with Error -- Kolmogorov Complexity and the Recursion Theorem -- Entanglement in Interactive Proof Systems with Binary Answers -- Quantum Algorithms for Matching and Network Flows -- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound -- Estimating Entropy and Entropy Norm on Data Streams -- Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems -- Exact Price of Anarchy for Polynomial Congestion Games -- Oblivious Symmetric Alternation -- Combining Multiple Heuristics -- Conflict-Free Colorings of Rectangles Ranges -- Grid Vertex-Unfolding Orthogonal Polyhedra -- Theory and Application of Width Bounded Geometric Separator -- Invariants of Automatic Presentations and Semi-synchronous Transductions -- On the Accepting Power of 2-Tape Büchi Automata -- Weighted Picture Automata and Weighted Logics -- Markov Decision Processes with Multiple Objectives -- The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms -- Convergence and Approximation in Potential Games -- Fast FPT-Algorithms for Cleaning Grids -- Tradeoffs in Depth-Two Superconcentrators -- On Hypergraph and Graph Isomorphism with Bounded Color Classes -- Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences -- Online Learning andResource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets -- Regularity Problems for Visibly Pushdown Languages -- Regular Expressions and NFAs Without ?-Transitions -- Redundancy in Complete Sets -- Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds -- Linear Advice for Randomized Logarithmic Space -- Nested Pebbles and Transitive Closure -- Definability of Languages by Generalized First-Order Formulas over (N,+) -- Generalized Modal Satisfiability -- Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games -- DAG-Width and Parity Games -- Reliable Computations Based on Locally Decodable Codes -- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements -- A Faster Algorithm for the Steiner Tree Problem -- Generating Randomized Roundings with Cardinality Constraints and Derandomizations -- Online Sorting Buffers on Line -- Optimal Node Routing -- Memoryless Facility Location in One Pass -- Energy-Efficient Algorithms for Flow Time Minimization -- Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games -- Datalog and Constraint Satisfaction with Infinite Templates -- Evaluating Monotone Circuits on Cylinders, Planes and Tori -- Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two -- Weighted Asynchronous Cellular Automata -- On the Complexity of the "Most General" Firing Squad Synchronization Problem. | |
| 650 | 0 |
_aComputer science. _99832 |
|
| 650 | 0 |
_aAlgorithms. _93390 |
|
| 650 | 0 |
_aMachine theory. _9159824 |
|
| 650 | 0 |
_aArtificial intelligence _xData processing. _921787 |
|
| 650 | 0 |
_aComputer science _xMathematics. _93866 |
|
| 650 | 0 |
_aDiscrete mathematics. _912873 |
|
| 650 | 1 | 4 |
_aTheory of Computation. _9159825 |
| 650 | 2 | 4 |
_aAlgorithms. _93390 |
| 650 | 2 | 4 |
_aComputer Science Logic and Foundations of Programming. _942203 |
| 650 | 2 | 4 |
_aFormal Languages and Automata Theory. _9159826 |
| 650 | 2 | 4 |
_aData Science. _934092 |
| 650 | 2 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
| 700 | 1 |
_aDurand, Bruno. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9159827 |
|
| 700 | 1 |
_aThomas, Wolfgang. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9159828 |
|
| 710 | 2 |
_aSpringerLink (Online service) _9159829 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540323013 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540820499 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v3884 _9159830 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/11672142 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cELN | ||
| 999 |
_c95570 _d95570 |
||