Pages that link to "Item:Q2843225"
From MaRDI portal
The following pages link to Automata, Languages, and Programming (Q2843225):
Displaying 50 items.
- Precedence-Constrained Scheduling of Malleable Jobs with Preemption (Q5167795) (← links)
- Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability (Q5167796) (← links)
- QCSP on Semicomplete Digraphs (Q5167797) (← links)
- Fast Pseudorandomness for Independence and Load Balancing (Q5167798) (← links)
- Determining Majority in Networks with Local Interactions and Very Small Local Memory (Q5167799) (← links)
- Lower Bounds for Oblivious Subspace Embeddings (Q5167800) (← links)
- On Input Indistinguishable Proof Systems (Q5167801) (← links)
- Secure Computation Using Leaky Tokens (Q5167802) (← links)
- An Improved Interactive Streaming Algorithm for the Distinct Elements Problem (Q5167803) (← links)
- A Faster Parameterized Algorithm for Treedepth (Q5167804) (← links)
- Pseudorandom Graphs in Data Structures (Q5167805) (← links)
- Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications (Q5167806) (← links)
- The Mondshein Sequence (Q5167807) (← links)
- Balanced Allocations: A Simple Proof for the Heavily Loaded Case (Q5167808) (← links)
- Close to Uniform Prime Number Generation with Fewer Random Bits (Q5167809) (← links)
- Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs (Q5167810) (← links)
- Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem (Q5167811) (← links)
- On Learning, Lower Bounds and (un)Keeping Promises (Q5167812) (← links)
- Certificates in Data Structures (Q5167813) (← links)
- Optimal Query Complexity for Estimating the Trace of a Matrix (Q5167814) (← links)
- Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles (Q5167815) (← links)
- Spatial Mixing of Coloring Random Graphs (Q5167816) (← links)
- Symmetric Groups and Quotient Complexity of Boolean Operations (Q5167822) (← links)
- Handling Infinitely Branching WSTS (Q5167823) (← links)
- Transducers with Origin Information (Q5167824) (← links)
- Weak MSO+U with Path Quantifiers over Infinite Trees (Q5167825) (← links)
- On the Decidability of MSO+U on Infinite Trees (Q5167826) (← links)
- A Coalgebraic Foundation for Coinductive Union Types (Q5167827) (← links)
- Turing Degrees of Limit Sets of Cellular Automata (Q5167828) (← links)
- On the Complexity of Temporal-Logic Path Checking (Q5167829) (← links)
- Parameterised Linearisability (Q5167830) (← links)
- Games with a Weak Adversary (Q5167831) (← links)
- The Complexity of Ergodic Mean-payoff Games (Q5167832) (← links)
- Toward a Structure Theory of Regular Infinitary Trace Languages (Q5167833) (← links)
- Unary Pushdown Automata and Straight-Line Programs (Q5167834) (← links)
- Robustness against Power is PSpace-complete (Q5167835) (← links)
- A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic (Q5167836) (← links)
- Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs (Q5167837) (← links)
- Coalgebraic Weak Bisimulation from Recursive Equations over Monads (Q5167838) (← links)
- Piecewise Boolean Algebras and Their Domains (Q5167839) (← links)
- Between Linearizability and Quiescent Consistency (Q5167840) (← links)
- Bisimulation Equivalence of First-Order Grammars (Q5167841) (← links)
- Context Unification is in PSPACE (Q5167842) (← links)
- Monodic Fragments of Probabilistic First-Order Logic (Q5167843) (← links)
- Stability and Complexity of Minimising Probabilistic Automata (Q5167844) (← links)
- Kleene Algebra with Equations (Q5167845) (← links)
- All–Instances Termination of Chase is Undecidable (Q5167846) (← links)
- Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus (Q5167847) (← links)
- On the Positivity Problem for Simple Linear Recurrence Sequences, (Q5167848) (← links)
- Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences (Q5167849) (← links)