Pages that link to "Item:Q2843225"
From MaRDI portal
The following pages link to Automata, Languages, and Programming (Q2843225):
Displaying 50 items.
- Distributed Algorithms for Network Diameter and Girth (Q3167054) (← links)
- Statistical Randomized Encodings: A Complexity Theoretic View (Q3448769) (← links)
- Tighter Fourier Transform Lower Bounds (Q3448770) (← links)
- Quantifying Competitiveness in Paging with Locality of Reference (Q3448771) (← links)
- Approximation Algorithms for Computing Maximin Share Allocations (Q3448772) (← links)
- Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare (Q3448773) (← links)
- Batched Point Location in SINR Diagrams via Algebraic Tools (Q3448774) (← links)
- On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs (Q3448775) (← links)
- Serving in the Dark should be done Non-Uniformly (Q3448776) (← links)
- Finding the Median (Obliviously) with Bounded Space (Q3448777) (← links)
- Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median (Q3448778) (← links)
- Solving Linear Programming with Constraints Unknown (Q3448779) (← links)
- Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources (Q3448780) (← links)
- Limitations of Algebraic Approaches to Graph Isomorphism Testing (Q3448781) (← links)
- Fully Dynamic Matching in Bipartite Graphs (Q3448782) (← links)
- Feasible Interpolation for QBF Resolution Calculi (Q3448783) (← links)
- Simultaneous Approximation of Constraint Satisfaction Problems (Q3448785) (← links)
- Design of Dynamic Algorithms via Primal-Dual Method (Q3448786) (← links)
- What Percentage of Programs Halt? (Q3448787) (← links)
- The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems (Q3448788) (← links)
- Spotting Trees with Few Leaves (Q3448789) (← links)
- Constraint Satisfaction Problems over the Integers with Successor (Q3448790) (← links)
- Hardness Amplification and the Approximate Degree of Constant-Depth Circuits (Q3448791) (← links)
- Algorithms and Complexity for Turaev-Viro Invariants (Q3448792) (← links)
- Big Data on the Rise? (Q3448793) (← links)
- Streaming Algorithms for Submodular Function Maximization (Q3448795) (← links)
- Multilinear Pseudorandom Functions (Q3448796) (← links)
- Zero-Fixing Extractors for Sub-Logarithmic Entropy (Q3448797) (← links)
- Interactive Proofs with Approximately Commuting Provers (Q3448798) (← links)
- Popular Matchings with Two-Sided Preferences and One-Sided Ties (Q3448799) (← links)
- On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols (Q3448801) (← links)
- Scheduling Bidirectional Traffic on a Path (Q3448803) (← links)
- On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace (Q3448804) (← links)
- On Planar Boolean CSP (Q3448805) (← links)
- Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation (Q3448807) (← links)
- A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q3448808) (← links)
- Lower Bounds for the Graph Homomorphism Problem (Q3448809) (← links)
- Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q3448810) (← links)
- Relative Discrepancy Does not Separate Information and Communication Complexity (Q3448811) (← links)
- A Galois Connection for Valued Constraint Languages of Infinite Size (Q3448812) (← links)
- Approximately Counting H-Colourings is $$\#\mathrm {BIS}$$-Hard (Q3448813) (← links)
- Taylor Polynomial Estimator for Estimating Frequency Moments (Q3448814) (← links)
- ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria (Q3448815) (← links)
- Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (Q3448816) (← links)
- Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search (Q3448817) (← links)
- Optimal Encodings for Range Top-$$k$$, Selection, and Min-Max (Q3448818) (← links)
- 2-Vertex Connectivity in Directed Graphs (Q3448819) (← links)
- Ground State Connectivity of Local Hamiltonians (Q3448820) (← links)
- Uniform Kernelization Complexity of Hitting Forbidden Minors (Q3448821) (← links)
- Counting Homomorphisms to Square-Free Graphs, Modulo 2 (Q3448822) (← links)
