The following pages link to Oliver Friedmann (Q507320):
Displaying 21 items.
- An exponential lower bound for Cunningham's rule (Q507321) (← links)
- A superpolynomial lower bound for strategy iteration based on snare memorization (Q2446310) (← links)
- Satisfiability Games for Branching-Time Logics (Q2851673) (← links)
- Ramsey-Based Analysis of Parity Automata (Q2894266) (← links)
- TWO LOCAL STRATEGY ITERATION SCHEMES FOR PARITY GAME SOLVING (Q2909223) (← links)
- A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games (Q3009763) (← links)
- The Modal μ-Calculus Caught Off Guard (Q3010366) (← links)
- More on balanced diets (Q3021419) (← links)
- Recursive algorithm for parity games requires exponential time (Q3117548) (← links)
- An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms (Q3224689) (← links)
- THE STEVENS-STIRLING-ALGORITHM FOR SOLVING PARITY GAMES LOCALLY REQUIRES EXPONENTIAL TIME (Q3569271) (← links)
- Solving Parity Games in Practice (Q3648698) (← links)
- Deciding the unguarded modal -calculus (Q4583323) (← links)
- On guarded transformation in the modal -calculus (Q4644509) (← links)
- (Q5151004) (← links)
- Ramsey-Based Inclusion Checking for Visibly Pushdown Automata (Q5277899) (← links)
- Ramsey Goes Visibly Pushdown (Q5327436) (← links)
- (Q5365038) (← links)
- Subexponential lower bounds for randomized pivoting rules for the simplex algorithm (Q5419098) (← links)
- A Decision Procedure for CTL* Based on Tableaux and Automata (Q5747771) (← links)
- An exponential lower bound for Zadeh's pivot rule (Q6038661) (← links)
