The following pages link to STACS 2006 (Q5449783):
Displaying 50 items.
- Kolmogorov complexity and the Recursion Theorem (Q3093478) (← links)
- The Ubiquitous Digital Tree (Q5449784) (← links)
- Flat Holonomies on Automata Networks (Q5449785) (← links)
- Interprocedurally Analyzing Polynomial Identities (Q5449786) (← links)
- External String Sorting: Faster and Cache-Oblivious (Q5449787) (← links)
- Amortized Rigidness in Dynamic Cartesian Trees (Q5449788) (← links)
- Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes (Q5449789) (← links)
- On Critical Exponents in Fixed Points of Binary k-Uniform Morphisms (Q5449790) (← links)
- Equivalence of $\mathbb{F}$ -Algebras and Cubic Forms (Q5449791) (← links)
- Complete Codes in a Sofic Shift (Q5449792) (← links)
- Kolmogorov Complexity with Error (Q5449793) (← links)
- Entanglement in Interactive Proof Systems with Binary Answers (Q5449795) (← links)
- Quantum Algorithms for Matching and Network Flows (Q5449796) (← links)
- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound (Q5449797) (← links)
- Estimating Entropy and Entropy Norm on Data Streams (Q5449798) (← links)
- Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems (Q5449799) (← links)
- Exact Price of Anarchy for Polynomial Congestion Games (Q5449800) (← links)
- Oblivious Symmetric Alternation (Q5449801) (← links)
- Combining Multiple Heuristics (Q5449803) (← links)
- Conflict-Free Colorings of Rectangles Ranges (Q5449804) (← links)
- Grid Vertex-Unfolding Orthogonal Polyhedra (Q5449805) (← links)
- Theory and Application of Width Bounded Geometric Separator (Q5449806) (← links)
- Invariants of Automatic Presentations and Semi-synchronous Transductions (Q5449807) (← links)
- On the Accepting Power of 2-Tape Büchi Automata (Q5449808) (← links)
- Weighted Picture Automata and Weighted Logics (Q5449809) (← links)
- Markov Decision Processes with Multiple Objectives (Q5449810) (← links)
- The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms (Q5449811) (← links)
- Convergence and Approximation in Potential Games (Q5449812) (← links)
- Fast FPT-Algorithms for Cleaning Grids (Q5449813) (← links)
- Tradeoffs in Depth-Two Superconcentrators (Q5449814) (← links)
- On Hypergraph and Graph Isomorphism with Bounded Color Classes (Q5449815) (← links)
- Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences (Q5449816) (← links)
- Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets (Q5449817) (← links)
- Regularity Problems for Visibly Pushdown Languages (Q5449818) (← links)
- Regular Expressions and NFAs Without ε-Transitions (Q5449819) (← links)
- Redundancy in Complete Sets (Q5449820) (← links)
- Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds (Q5449821) (← links)
- Linear Advice for Randomized Logarithmic Space (Q5449822) (← links)
- Nested Pebbles and Transitive Closure (Q5449823) (← links)
- Definability of Languages by Generalized First-Order Formulas over (N,+) (Q5449824) (← links)
- Generalized Modal Satisfiability (Q5449825) (← links)
- Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games (Q5449826) (← links)
- DAG-Width and Parity Games (Q5449827) (← links)
- Reliable Computations Based on Locally Decodable Codes (Q5449828) (← links)
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements (Q5449829) (← links)
- A Faster Algorithm for the Steiner Tree Problem (Q5449830) (← links)
- Generating Randomized Roundings with Cardinality Constraints and Derandomizations (Q5449831) (← links)
- Online Sorting Buffers on Line (Q5449832) (← links)
- Optimal Node Routing (Q5449834) (← links)
- Memoryless Facility Location in One Pass (Q5449835) (← links)
