Pages that link to "Item:Q5145269"
From MaRDI portal
The following pages link to Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Q5145269):
Displaying 50 items.
- Type-two polynomial-time and restricted lookahead (Q1989320) (← links)
- Regular transducer expressions for regular transformations (Q2064527) (← links)
- Playing with Repetitions in Data Words Using Energy Games (Q3300789) (← links)
- Sequential Relational Decomposition (Q5094122) (← links)
- Black Ninjas in the Dark (Q5145270) (← links)
- Inner Models of Univalence (Q5145271) (← links)
- Continuous Reasoning (Q5145272) (← links)
- Quasi-Open Bisimilarity with Mismatch is Intuitionistic (Q5145273) (← links)
- Distribution-based objectives for Markov Decision Processes (Q5145274) (← links)
- A Simple and Optimal Complementation Algorithm for Büchi Automata (Q5145275) (← links)
- Syntax and Semantics of Quantitative Type Theory (Q5145276) (← links)
- Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem (Q5145277) (← links)
- Impredicative Encodings of (Higher) Inductive Types (Q5145279) (← links)
- Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes (Q5145280) (← links)
- Extensional and Intensional Semantic Universes (Q5145281) (← links)
- A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP (Q5145282) (← links)
- A Hybrid, Dynamic Logic for Hybrid-Dynamic Information Flow (Q5145283) (← links)
- Regular and First-Order List Functions (Q5145284) (← links)
- Definable decompositions for graphs of bounded linear cliquewidth (Q5145285) (← links)
- On computability and tractability for infinite sets (Q5145286) (← links)
- Automaton-Based Criteria for Membership in CTL (Q5145288) (← links)
- Rewriting with Frobenius (Q5145289) (← links)
- Sound up-to techniques and Complete abstract domains (Q5145290) (← links)
- Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS (Q5145291) (← links)
- Concurrency and Probability (Q5145292) (← links)
- Higher Groups in Homotopy Type Theory (Q5145293) (← links)
- The concurrent game semantics of Probabilistic PCF (Q5145294) (← links)
- Tree-depth, quantifier elimination, and quantifier rank (Q5145295) (← links)
- A parameterized halting problem, the linear time hierarchy, and the MRDP theorem (Q5145296) (← links)
- Computability Beyond Church-Turing via Choice Sequences (Q5145297) (← links)
- On Higher Inductive Types in Cubical Type Theory (Q5145298) (← links)
- Strong Sums in Focused Logic (Q5145299) (← links)
- Probabilistic Stable Functions on Discrete Cones are Power Series (Q5145300) (← links)
- Unary negation fragment with equivalence relations has the finite model property (Q5145301) (← links)
- Logics for Word Transductions with Synthesis (Q5145302) (← links)
- Work Analysis with Resource-Aware Session Types (Q5145303) (← links)
- A pseudo-quasi-polynomial algorithm for mean-payoff parity games (Q5145306) (← links)
- Logical paradoxes in quantum computation (Q5145307) (← links)
- Causal Computational Complexity of Distributed Processes (Q5145308) (← links)
- Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth (Q5145309) (← links)
- Eager Functions as Processes (Q5145310) (← links)
- What's in a game? (Q5145311) (← links)
- One Theorem to Rule Them All (Q5145312) (← links)
- A Theory of Register Monitors (Q5145314) (← links)
- The State Complexity of Alternating Automata (Q5145316) (← links)
- Rational Synthesis Under Imperfect Information (Q5145317) (← links)
- ReLoC (Q5145319) (← links)
- Quantitative Behavioural Reasoning for Higher-order Effectful Programs (Q5145320) (← links)
- Classical realizability as a classifier for nondeterminism (Q5145321) (← links)
- Compositional Game Theory (Q5145322) (← links)
