The following pages link to Vasilij N. Lebedev (Q689131):
Displaying 28 items.
- (Q199900) (redirect page) (← links)
- Exponential examples of solving parity games (Q327255) (← links)
- Diagnosability of digital systems structured as minimal quasicomplete \(7 \times 7\) graph (Q334223) (← links)
- Effective algorithms for games with prohibitions and their applications (Q465301) (← links)
- Cyclical games with prohibitions (Q689132) (← links)
- Multiagent organization of system diagnosis of large toroidal digital systems (Q1002880) (← links)
- An average polynomial algorithm for solving antagonistic games on graphs (Q1647454) (← links)
- (Q1827804) (redirect page) (← links)
- Interval data minmax regret network optimization problems (Q1827805) (← links)
- On the complexity of minmax regret linear programming (Q1887882) (← links)
- Optimization of schedules with precedence logical conditions (Q1956933) (← links)
- Complexity of minimizing the total flow time with interval data and minmax regret criterion (Q2433804) (← links)
- Game aspect of program verification (Q2457076) (← links)
- Effectively solvable classes of cyclical games (Q2457098) (← links)
- Effective search for all maximal mean cycles in a graph (Q2567653) (← links)
- (Q2854280) (← links)
- Project scheduling under competition (Q3367030) (← links)
- (Q3824132) (← links)
- (Q4121382) (← links)
- A criterion and verification of the ergodicity of cyclic game forms (Q4204020) (← links)
- A new equilibrium in cyclic games on graphs (Q4522720) (← links)
- (Q5327950) (← links)
- A variational problem concerning the take-off of a space craft from a circular orbit (Q5530561) (← links)
- (Q5534720) (← links)
- (Q5545337) (← links)
- (Q5566934) (← links)
- (Q5574575) (← links)
- Stationary equilibria in cyclic games: search and structure (Q5942064) (← links)
