Pages that link to "Item:Q3012786"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q3012786):
Displaying 50 items.
- Nearly optimal bounds for distributed wireless scheduling in the SINR model (Q287982) (← links)
- Improved constructions for non-adaptive threshold group testing (Q378256) (← links)
- Generic expression hardness results for primitive positive formula comparison (Q1951576) (← links)
- A tighter insertion-based approximation of the crossing number (Q2012882) (← links)
- Suffix trays and suffix trists: structures for faster text indexing (Q2354023) (← links)
- Robust simulations and significant separations (Q2407096) (← links)
- Finite-state dimension and real arithmetic (Q2461795) (← links)
- Complexity of propositional proofs under a promise (Q2946606) (← links)
- Improved Approximation for the Directed Spanner Problem (Q3012787) (← links)
- An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity (Q3012788) (← links)
- Approximation Schemes for Capacitated Geometric Network Design (Q3012789) (← links)
- An O(logn)-Competitive Algorithm for Online Constrained Forest Problems (Q3012790) (← links)
- On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (Q3012791) (← links)
- Advice Coins for Classical and Quantum Computation (Q3012792) (← links)
- Quantum Commitments from Complexity Assumptions (Q3012793) (← links)
- Limitations on Quantum Dimensionality Reduction (Q3012794) (← links)
- On Tree-Constrained Matchings and Generalizations (Q3012795) (← links)
- Tight Bounds for Linkages in Planar Graphs (Q3012796) (← links)
- Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (Q3012798) (← links)
- Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes (Q3012799) (← links)
- Pairwise-Interaction Games (Q3012801) (← links)
- Settling the Complexity of Local Max-Cut (Almost) Completely (Q3012803) (← links)
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (Q3012804) (← links)
- On Variants of File Caching (Q3012805) (← links)
- On the Advice Complexity of the k-Server Problem (Q3012806) (← links)
- Sleep Management on Multiple Machines for Energy and Flow Time (Q3012808) (← links)
- Meeting Deadlines: How Much Speed Suffices? (Q3012809) (← links)
- Range Majority in Constant Time and Linear Space (Q3012810) (← links)
- Dynamic Planar Range Maxima Queries (Q3012811) (← links)
- Compact Navigation and Distance Oracles for Graphs with Small Treewidth (Q3012812) (← links)
- Player-Centric Byzantine Agreement (Q3012813) (← links)
- Limits on the Computational Power of Random Strings (Q3012814) (← links)
- The Decimation Process in Random k-SAT (Q3012815) (← links)
- Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority (Q3012816) (← links)
- The Fourier Entropy–Influence Conjecture for Certain Classes of Boolean Functions (Q3012817) (← links)
- Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm (Q3012818) (← links)
- Submodular Cost Allocation Problem and Applications (Q3012819) (← links)
- Buyback Problem - Approximate Matroid Intersection with Cancellation Costs (Q3012820) (← links)
- Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience (Q3012821) (← links)
- New Algorithms for Learning in Presence of Errors (Q3012822) (← links)
- Constraint Satisfaction Parameterized by Solution Size (Q3012823) (← links)
- Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (Q3012824) (← links)
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q3012825) (← links)
- Domination When the Stars Are Out (Q3012826) (← links)
- Recoverable Values for Independent Sets (Q3012827) (← links)
- Vertex Cover in Graphs with Locally Few Colors (Q3012828) (← links)
- Maximizing Polynomials Subject to Assignment Constraints (Q3012829) (← links)
- Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width (Q3012830) (← links)
- Efficient Sample Extractors for Juntas with Applications (Q3012831) (← links)
- Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications (Q3012832) (← links)
