Pages that link to "Item:Q2843225"
From MaRDI portal
The following pages link to Automata, Languages, and Programming (Q2843225):
Displaying 50 items.
- Nominal Kleene Coalgebra (Q3449483) (← links)
- On Determinisation of Good-for-Games Automata (Q3449484) (← links)
- Owicki-Gries Reasoning for Weak Memory Models (Q3449485) (← links)
- On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension (Q3449486) (← links)
- Compressed Tree Canonization (Q3449487) (← links)
- Parsimonious Types and Non-uniform Computation (Q3449488) (← links)
- Baire Category Quantifier in Monadic Second Order Logic (Q3449489) (← links)
- Liveness of Parameterized Timed Networks (Q3449490) (← links)
- Symmetric Strategy Improvement (Q3449491) (← links)
- Effect Algebras, Presheaves, Non-locality and Contextuality (Q3449492) (← links)
- On the Complexity of Intersecting Regular, Context-Free, and Tree Languages (Q3449493) (← links)
- Containment of Monadic Datalog Programs via Bounded Clique-Width (Q3449494) (← links)
- An Approach to Computing Downward Closures (Q3449495) (← links)
- Symmetric Graph Properties Have Independent Edges (Q3449496) (← links)
- Polylogarithmic-Time Leader Election in Population Protocols (Q3449497) (← links)
- Core Size and Densification in Preferential Attachment Networks (Q3449499) (← links)
- Maintaining Near-Popular Matchings (Q3449500) (← links)
- Ultra-Fast Load Balancing on Scale-Free Networks (Q3449501) (← links)
- Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms (Q3449502) (← links)
- The Range of Topological Effects on Communication (Q3449503) (← links)
- Secretary Markets with Local Information (Q3449504) (← links)
- A Simple and Optimal Ancestry Labeling Scheme for Trees (Q3449505) (← links)
- Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs (Q3449507) (← links)
- A Unified Framework for Strong Price of Anarchy in Clustering Games (Q3449509) (← links)
- On the Diameter of Hyperbolic Random Graphs (Q3449510) (← links)
- Tight Bounds for Cost-Sharing in Weighted Congestion Games (Q3449511) (← links)
- Distributed Broadcast Revisited: Towards Universal Optimality (Q3449512) (← links)
- Adaptively Secure Coin-Flipping, Revisited (Q3449514) (← links)
- Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem (Q3449515) (← links)
- Normalization Phenomena in Asynchronous Networks (Q3449516) (← links)
- Broadcast from Minicast Secure Against General Adversaries (Q3449517) (← links)
- Online Checkpointing with Improved Worst-Case Guarantees (Q3458748) (← links)
- Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks (Q4554941) (← links)
- A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor (Q4962182) (← links)
- Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions (Q4962217) (← links)
- Approximating Semi-matchings in Streaming and in Two-Party Communication (Q4962609) (← links)
- For-All Sparse Recovery in Near-Optimal Time (Q4962672) (← links)
- Sporadic Solutions to Zero-One Exclusion Tasks (Q5167726) (← links)
- Verifying and Synthesizing Software with Recursive Functions (Q5167727) (← links)
- Weak Parity (Q5167728) (← links)
- Consequences of Faster Alignment of Sequences (Q5167729) (← links)
- Distance Labels with Optimal Local Stretch (Q5167730) (← links)
- Time-Expanded Packings (Q5167731) (← links)
- Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM (Q5167732) (← links)
- The Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average (Q5167733) (← links)
- Tighter Relations between Sensitivity and Other Complexity Measures (Q5167734) (← links)
- On Hardness of Jumbled Indexing (Q5167735) (← links)
- Morphing Planar Graph Drawings Optimally (Q5167736) (← links)
- Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs (Q5167737) (← links)
- On the Role of Shared Randomness in Simultaneous Communication (Q5167738) (← links)
