Search

Your search keyword '"Mihalis Yannakakis"' showing total 49 results

Search Constraints

Start Over You searched for: Author "Mihalis Yannakakis" Remove constraint Author: "Mihalis Yannakakis" Topic time complexity Remove constraint Topic: time complexity
49 results on '"Mihalis Yannakakis"'

Search Results

1. Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations

2. The complexity of optimal multidimensional pricing for a unit-demand buyer

Catalog

Books, media, physical & digital resources

3. A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes

4. Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes

5. Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata

6. Recursive Markov Decision Processes and Recursive Stochastic Games

7. REACT to Cyber Attacks on Power Grids

8. Doubly Balanced Connected Graph Partitioning

9. Model Checking of Recursive Probabilistic Systems

10. Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems

11. Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations

12. Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes

13. Efficiently computing succinct trade-off curves

14. Analysis of recursive state machines

15. Model checking of hierarchical state machines

16. Primal-dual approximation algorithms for integral flow and multicut in trees

17. A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing

18. Stochastic Context-Free Grammars, Regular Languages, and Newton’s Method

19. The complexity of probabilistic verification

20. Timing Verification by Successive Approximation

21. Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations

22. Computation of Least Fixed Points

23. The Complexity of Multiterminal Cuts

24. Testing finite-state machines: state identification and verification

25. Computation of Equilibria and Stable Solutions

26. Memory-efficient algorithms for the verification of temporal properties

27. Modularity of cycles and paths in graphs

28. Recursive Stochastic Games with Positive Rewards

29. Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems

30. Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games

31. Checking LTL Properties of Recursive Markov Chains

32. Approximation of Multiobjective Optimization Problems

33. Model Checking of Message Sequence Charts

34. Multiway cuts in directed and node weighted graphs

35. Tie-breaking semantics and structural totality

36. Suboptimal cuts: Their enumeration, weight and number

37. Testing finite state machines

38. Linear approximation of shortest superstrings

40. Scheduling Interval-Ordered Tasks

41. On a Class of Totally Unimodular Matrices

42. On generating all maximal independent sets

43. Pfaffian orientations, 0–1 permanents, and even cycles in directed graphs

44. Independent database schemas

45. Scheduling Opposing Forests

46. A polynomial algorithm for the min-cut linear arrangement of trees

47. How easy is local search?

48. On Datalog vs Polynomial Time

49. Pfaffian orientations, 0/1 permanents, and even cycles in directed graphs