Pages that link to "Item:Q3088024"

The following pages link to Mathematical Foundations of Computer Science 2011 (Q3088024):

Displaying 50 items.

• Duality and Recognition (Q3088025) (← links)
• Some Variants of the Star Height Problem (Q3088026) (← links)
• The Least-Core of Threshold Network Flow Games (Q3088027) (← links)
• Adhesivity Is Not Enough: Local Church-Rosser Revisited (Q3088028) (← links)
• Quantitative Refinement for Weighted Modal Transition Systems (Q3088029) (← links)
• Faster Coupon Collecting via Replication with Applications in Gossiping (Q3088030) (← links)
• Verifying Proofs in Constant Depth (Q3088031) (← links)
• The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree (Q3088032) (← links)
• Model Checking Coverability Graphs of Vector Addition Systems (Q3088033) (← links)
• Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking (Q3088034) (← links)
• The Reachability Problem for Vector Addition System with One Zero-Test (Q3088035) (← links)
• The Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed Complexity (Q3088036) (← links)
• Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains (Q3088037) (← links)
• Pattern-Guided Data Anonymization and Clustering (Q3088038) (← links)
• Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete (Q3088039) (← links)
• Energy and Mean-Payoff Parity Markov Decision Processes (Q3088040) (← links)
• The Role of Polymorphism in the Characterisation of Complexity by Soft Types (Q3088041) (← links)
• An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection (Q3088042) (← links)
• On the Use of Guards for Logics with Data (Q3088044) (← links)
• An Elementary Proof of a 3n − o(n) Lower Bound on the Circuit Complexity of Affine Dispersers (Q3088045) (← links)
• On the Complexity of the l-diversity Problem (Q3088046) (← links)
• Infinite Synchronizing Words for Probabilistic Automata (Q3088047) (← links)
• Characterizing EF over Infinite Trees and Modal Logic on Transitive Graphs (Q3088048) (← links)
• Parity Games on Graphs with Medium Tree-Width (Q3088049) (← links)
• Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable (Q3088050) (← links)
• On Minimising Automata with Errors (Q3088051) (← links)
• Contracting a Chordal Graph to a Split Graph or a Tree (Q3088052) (← links)
• Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages (Q3088053) (← links)
• A Universally Defined Undecidable Unimodal Logic (Q3088054) (← links)
• On the Approximability of Minimum Topic Connected Overlay and Its Special Instances (Q3088055) (← links)
• Can Everybody Sit Closer to Their Friends Than Their Enemies? (Q3088056) (← links)
• Submodularity on a Tree: Unifying $L^\natural$ -Convex and Bisubmodular Functions (Q3088057) (← links)
• Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions (Q3088058) (← links)
• Size and Computation of Injective Tree Automatic Presentations (Q3088059) (← links)
• Symmetric Functions Capture General Functions (Q3088060) (← links)
• Compressed Word Problems for Inverse Monoids (Q3088061) (← links)
• Pushing for Weighted Tree Automata (Q3088063) (← links)
• Periodicity Algorithms for Partial Words (Q3088064) (← links)
• State Complexity of Operations on Input-Driven Pushdown Automata (Q3088065) (← links)
• Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem (Q3088066) (← links)
• Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern Emergence (Q3088067) (← links)
• Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach (Q3088068) (← links)
• Distributed Synthesis for Regular and Contextfree Specifications (Q3088069) (← links)
• Geometric Graphs with Randomly Deleted Edges - Connectivity and Routing Protocols (Q3088070) (← links)
• Untimed Language Preservation in Timed Systems (Q3088071) (← links)
• Lower Bounds for Linear Decision Trees via an Energy Complexity Argument (Q3088072) (← links)
• Weak Cost Monadic Logic over Infinite Trees (Q3088073) (← links)
• Linear Problem Kernels for Planar Graph Problems with Small Distance Property (Q3088074) (← links)
• New Parameterized Algorithms for the Edge Dominating Set Problem (Q3088075) (← links)
• Hard Functions for Low-Degree Polynomials over Prime Fields (Q5894222) (← links)