The following pages link to Marcin Jurdziński (Q293425):
Displaying 44 items.
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) (Q293426) (← links)
- Distributed methods for computing approximate equilibria (Q666675) (← links)
- Games with secure equilibria (Q854165) (← links)
- Undecidability of domino games and hhp-bisimilarity. (Q1401953) (← links)
- The covering and boundedness problems for branching vector addition systems (Q1936244) (← links)
- Reachability in two-clock timed automata is PSPACE-complete (Q2347796) (← links)
- When are emptiness and containment decidable for probabilistic automata? (Q2662671) (← links)
- (Q2754084) (← links)
- (Q2763539) (← links)
- (Q2920125) (← links)
- Approximate Well-Supported Nash Equilibria in Symmetric Bimatrix Games (Q2938662) (← links)
- Stochastic Timed Automata (Q2938760) (← links)
- Alternating automata on data trees and XPath satisfiability (Q2946637) (← links)
- Distributed Methods for Computing Approximate Equilibria (Q2959815) (← links)
- (Q3165971) (← links)
- (Q3172529) (← links)
- Concavely-Priced Probabilistic Timed Automata (Q3184689) (← links)
- A Deterministic Subexponential Algorithm for Solving Parity Games (Q3395043) (← links)
- Linear Complementarity Algorithms for Infinite Games (Q3401105) (← links)
- Calculating Probabilities of Real-Time Test Cases (Q3434607) (← links)
- Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time (Q3449481) (← links)
- A Simple P-Matrix Linear Complementarity Problem for Discounted Games (Q3507443) (← links)
- Model Checking Probabilistic Timed Automata with One or Two Clocks (Q3535619) (← links)
- Concavely-Priced Timed Automata (Q3543287) (← links)
- Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets (Q3543289) (← links)
- A deterministic subexponential algorithm for solving parity games (Q3581528) (← links)
- Average-Price-per-Reward Games on Hybrid Automata with Strong Resets (Q3600473) (← links)
- (Q4411830) (← links)
- (Q4501540) (← links)
- (Q4501547) (← links)
- (Q4636594) (← links)
- (Q4804914) (← links)
- (Q5002806) (← links)
- (Q5144638) (← links)
- (Q5144652) (← links)
- Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games (Q5236329) (← links)
- Computer Science Logic (Q5292630) (← links)
- Computer Science Logic (Q5311283) (← links)
- Reachability in Two-Clock Timed Automata Is PSPACE-Complete (Q5327435) (← links)
- Reachability-Time Games on Timed Automata (Q5428863) (← links)
- (Q5501249) (← links)
- Model Checking Probabilistic Timed Automata with One or Two Clocks (Q5758106) (← links)
- (Q5875379) (← links)
- Formal Methods for Components and Objects (Q5897449) (← links)
