|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-32288-7 |
| 003 |
DE-He213 |
| 005 |
20230405232206.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2006 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540322887
|9 978-3-540-32288-7
|
| 024 |
7 |
|
|a 10.1007/11672142
|2 doi
|
| 050 |
|
4 |
|a QA75.5-76.95
|
| 072 |
|
7 |
|a UYA
|2 bicssc
|
| 072 |
|
7 |
|a COM037000
|2 bisacsh
|
| 072 |
|
7 |
|a UYA
|2 thema
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 245 |
1 |
0 |
|a STACS 2006
|h [electronic resource] :
|b 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings /
|c edited by Bruno Durand, Wolfgang Thomas.
|
| 250 |
|
|
|a 1st ed. 2006.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2006.
|
| 300 |
|
|
|a XIX, 714 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 3884
|
| 505 |
0 |
|
|a The 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 and Resource-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 |
|a Computer science.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Machine theory.
|
| 650 |
|
0 |
|a Artificial intelligence-Data processing.
|
| 650 |
|
0 |
|a Computer science-Mathematics.
|
| 650 |
|
0 |
|a Discrete mathematics.
|
| 650 |
1 |
4 |
|a Theory of Computation.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Computer Science Logic and Foundations of Programming.
|
| 650 |
2 |
4 |
|a Formal Languages and Automata Theory.
|
| 650 |
2 |
4 |
|a Data Science.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 700 |
1 |
|
|a Durand, Bruno.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Thomas, Wolfgang.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540820499
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540323013
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 3884
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/11672142
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
