Pages that link to "Item:Q2843225"
From MaRDI portal
The following pages link to Automata, Languages, and Programming (Q2843225):
Displaying 50 items.
- Algebraic Synchronization Trees and Processes (Q3166997) (← links)
- Streaming Tree Transducers (Q3166998) (← links)
- Causal Graph Dynamics (Q3166999) (← links)
- Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers (Q3167000) (← links)
- Monadic Datalog Containment (Q3167001) (← links)
- A Machine-Independent Characterization of Timed Languages (Q3167002) (← links)
- Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets (Q3167003) (← links)
- Toward Model Theory with Data Values (Q3167004) (← links)
- Robust Reachability in Timed Automata: A Game-Based Approach (Q3167005) (← links)
- Minimizing Expected Termination Time in One-Counter Markov Decision Processes (Q3167006) (← links)
- Prefix Rewriting for Nested-Words and Collapsible Pushdown Automata (Q3167007) (← links)
- A Saturation Method for Collapsible Pushdown Systems (Q3167009) (← links)
- Time and Parallelizability Results for Parity Games with Bounded Treewidth (Q3167011) (← links)
- Nominal Completion for Rewrite Systems with Binders (Q3167012) (← links)
- Discrete Generalised Polynomial Functors (Q3167013) (← links)
- Computing Game Metrics on Markov Decision Processes (Q3167014) (← links)
- Deciding First Order Properties of Matroids (Q3167015) (← links)
- Pebble Games with Algebraic Rules (Q3167016) (← links)
- Exponential Lower Bounds and Separation for Query Rewriting (Q3167017) (← links)
- Lattices of Logical Fragments over Words (Q3167018) (← links)
- On the Expressive Power of Cost Logics over Infinite Words (Q3167019) (← links)
- Coalgebraic Predicate Logic (Q3167020) (← links)
- Algorithmic Games for Full Ground References (Q3167021) (← links)
- Two-Level Game Semantics, Intersection Types, and Recursion Schemes (Q3167022) (← links)
- An Automata-Theoretic Model of Idealized Algol (Q3167024) (← links)
- Towards a Unified Theory of Operational and Axiomatic Semantics (Q3167025) (← links)
- Loader and Urzyczyn Are Logically Related (Q3167026) (← links)
- Languages of Profinite Words and the Limitedness Problem (Q3167027) (← links)
- The Complexity of Mean-Payoff Automaton Expression (Q3167028) (← links)
- On the Locality of Some NP-Complete Problems (Q3167029) (← links)
- Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs (Q3167030) (← links)
- Super-Fast Distributed Algorithms for Metric Facility Location (Q3167031) (← links)
- Preventing Unraveling in Social Networks: The Anchored k-Core Problem (Q3167033) (← links)
- Edge Fault Tolerance on Sparse Networks (Q3167034) (← links)
- Incentive Ratios of Fisher Markets (Q3167035) (← links)
- Computational Complexity of Traffic Hijacking under BGP and S-BGP (Q3167036) (← links)
- Efficiency-Revenue Trade-Offs in Auctions (Q3167037) (← links)
- Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports (Q3167038) (← links)
- A QPTAS for -Envy-Free Profit-Maximizing Pricing on Line Graphs (Q3167039) (← links)
- Minimizing Rosenthal Potential in Multicast Games (Q3167040) (← links)
- Multiparty Proximity Testing with Dishonest Majority from Equality Testing (Q3167042) (← links)
- Anonymous Card Shuffling and Its Applications to Parallel Mixnets (Q3167043) (← links)
- Byzantine Agreement with a Rational Adversary (Q3167044) (← links)
- Random Hyperbolic Graphs: Degree Sequence and Clustering (Q3167045) (← links)
- Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks (Q3167046) (← links)
- Counting Arbitrary Subgraphs in Data Streams (Q3167047) (← links)
- k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth (Q3167048) (← links)
- Contention Issues in Congestion Games (Q3167049) (← links)
- Online Mechanism Design (Randomized Rounding on the Fly) (Q3167050) (← links)
- Online Packing with Gradually Improving Capacity Estimations and Applications to Network Lifetime Maximization (Q3167052) (← links)
