Pages that link to "Item:Q2843225"

The following pages link to Automata, Languages, and Programming (Q2843225):

Displaying 50 items.

• Approximately Counting Locally-Optimal Structures (Q3448823) (← links)
• Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs (Q3448824) (← links)
• Fast Algorithms for Diameter-Optimally Augmenting Paths (Q3448826) (← links)
• Hollow Heaps (Q3448827) (← links)
• Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time (Q3448829) (← links)
• Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs (Q3448830) (← links)
• Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities (Q3448831) (← links)
• Local Reductions (Q3448833) (← links)
• Query Complexity in Expectation (Q3448835) (← links)
• Near-Linear Query Complexity for Graph Inference (Q3448836) (← links)
• A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set (Q3448837) (← links)
• Lower Bounds for Sums of Powers of Low Degree Univariates (Q3448839) (← links)
• Approximating CSPs Using LP Relaxation (Q3448840) (← links)
• Algebraic Properties of Valued Constraint Satisfaction Problem (Q3448842) (← links)
• Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic (Q3448843) (← links)
• On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (Q3448844) (← links)
• Replacing Mark Bits with Randomness in Fibonacci Heaps (Q3448845) (← links)
• A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
• Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points (Q3448848) (← links)
• Deterministic Truncation of Linear Matroids (Q3448849) (← links)
• Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (Q3448850) (← links)
• Amplification of One-Way Information Complexity via Codes and Noise Sensitivity (Q3448852) (← links)
• A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem (Q3448853) (← links)
• Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q3448854) (← links)
• Computing the Fréchet Distance Between Polygons with Holes (Q3448855) (← links)
• An Improved Private Mechanism for Small Databases (Q3448856) (← links)
• Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity (Q3448858) (← links)
• Condensed Unpredictability (Q3448859) (← links)
• Sherali-Adams Relaxations for Valued CSPs (Q3448860) (← links)
• Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm (Q3448861) (← links)
• The Simultaneous Communication of Disjointness with Applications to Data Streams (Q3448862) (← links)
• Towards the Graph Minor Theorems for Directed Graphs (Q3449461) (← links)
• Automated Synthesis of Distributed Controllers (Q3449462) (← links)
• Games for Dependent Types (Q3449463) (← links)
• Short Proofs of the Kneser-Lovász Coloring Principle (Q3449464) (← links)
• Provenance Circuits for Trees and Treelike Instances (Q3449465) (← links)
• Language Emptiness of Continuous-Time Parametric Timed Automata (Q3449466) (← links)
• Analysis of Probabilistic Systems via Generating Functions and Padé Approximation (Q3449467) (← links)
• The Complexity of Synthesis from Probabilistic Components (Q3449469) (← links)
• Edit Distance for Pushdown Automata (Q3449470) (← links)
• Solution Sets for Equations over Free Groups are EDT0L Languages (Q3449471) (← links)
• Limited Set quantifiers over Countable Linear Orderings (Q3449472) (← links)
• Reachability is in DynFO (Q3449473) (← links)
• Natural Homology (Q3449474) (← links)
• Trading Bounds for Memory in Games with Counters (Q3449476) (← links)
• Decision Problems of Tree Transducers with Origin (Q3449477) (← links)
• Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words (Q3449478) (← links)
• The Odds of Staying on Budget (Q3449479) (← links)
• From Sequential Specifications to Eventual Consistency (Q3449480) (← links)
• Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time (Q3449481) (← links)