Pages that link to "Item:Q3182909"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2009 (Q3182909):
Displaying 50 items.
- Synchronization of Regular Automata (Q3182910) (← links)
- Stochastic Process Creation (Q3182911) (← links)
- Stochastic Games with Finitary Objectives (Q3182912) (← links)
- Recent Advances in Population Protocols (Q3182913) (← links)
- Arithmetic Circuits, Monomial Algebras and Finite Automata (Q3182914) (← links)
- An Improved Approximation Bound for Spanning Star Forest and Color Saving (Q3182915) (← links)
- Energy-Efficient Communication in Multi-interface Wireless Networks (Q3182916) (← links)
- Private Capacities in Mechanism Design (Q3182917) (← links)
- Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules (Q3182918) (← links)
- Sampling Edge Covers in 3-Regular Graphs (Q3182920) (← links)
- Balanced Paths in Colored Graphs (Q3182921) (← links)
- Few Product Gates But Many Zeros (Q3182922) (← links)
- Branching Programs for Tree Evaluation (Q3182923) (← links)
- A Dichotomy Theorem for Polynomial Evaluation (Q3182924) (← links)
- DP-Complete Problems Derived from Extremal NP-Complete Properties (Q3182925) (← links)
- The Synchronization Problem for Locally Strongly Transitive Automata (Q3182926) (← links)
- Constructing Brambles (Q3182927) (← links)
- Self-indexed Text Compression Using Straight-Line Programs (Q3182928) (← links)
- Security and Tradeoffs of the Akl-Taylor Scheme and Its Variants (Q3182929) (← links)
- Parameterized Complexity Classes under Logical Reductions (Q3182930) (← links)
- The Communication Complexity of Non-signaling Distributions (Q3182931) (← links)
- How to Use Spanning Trees to Navigate in Graphs (Q3182932) (← links)
- Representing Groups on Graphs (Q3182934) (← links)
- Admissible Strategies in Infinite Games over Graphs (Q3182935) (← links)
- Future-Looking Logics on Data Words and Trees (Q3182936) (← links)
- A By-Level Analysis of Multiplicative Exponential Linear Logic (Q3182938) (← links)
- Hyper-minimisation Made Efficient (Q3182939) (← links)
- Choosability of P 5-Free Graphs (Q3182940) (← links)
- Time-Bounded Kolmogorov Complexity and Solovay Functions (Q3182941) (← links)
- The Longest Path Problem Is Polynomial on Interval Graphs (Q3182942) (← links)
- Synthesis for Structure Rewriting Systems (Q3182943) (← links)
- On the Hybrid Extension of CTL and CTL + (Q3182944) (← links)
- Bounds on Non-surjective Cellular Automata (Q3182945) (← links)
- FO Model Checking on Nested Pushdown Trees (Q3182946) (← links)
- The Prismoid of Resources (Q3182947) (← links)
- A Dynamic Algorithm for Reachability Games Played on Trees (Q3182948) (← links)
- An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable (Q3182949) (← links)
- Graph Decomposition for Improving Memoryless Periodic Exploration (Q3182950) (← links)
- On FO 2 Quantifier Alternation over Words (Q3182951) (← links)
- On the Recognizability of Self-generating Sets (Q3182952) (← links)
- The Isomorphism Problem for k-Trees Is Complete for Logspace (Q3182953) (← links)
- Snake-Deterministic Tiling Systems (Q3182954) (← links)
- Query Automata for Nested Words (Q3182955) (← links)
- A General Class of Models of $\mathcal{H}^*$ (Q3182956) (← links)
- The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I (Q3182957) (← links)
- Colouring Non-sparse Random Intersection Graphs (Q3182958) (← links)
- On the Structure of Optimal Greedy Computation (for Job Scheduling) (Q3182959) (← links)
- A Probabilistic PTAS for Shortest Common Superstring (Q3182960) (← links)
- The Cost of Stability in Network Flow Games (Q3182962) (← links)
- (Un)Decidability of Injectivity and Surjectivity in One-Dimensional Sand Automata (Q3182963) (← links)