18 results on '"Mihalis Yannakakis"'
Search Results
2. A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes.
3. How Good is the Chord Algorithm?
4. On the Complexity of Nash Equilibria and Other Fixed Points.
5. Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems.
6. Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications.
7. The Complexity of Multiterminal Cuts.
8. High-Probability Parallel Transitive-Closure Algorithms.
9. Simple Local Search Problems That are Hard to Solve.
10. Towards an Architecture-Independent Analysis of Parallel Algorithms.
11. Scheduling Interval-Ordered Tasks.
12. Node-Deletion Problems on Bipartite Graphs.
13. The Complexity of Reliable Concurrency Control.
14. Tools for Template Dependencies.
15. Freedom from Deadlock of Safe Locking Policies.
16. Edge-Deletion Problems.
17. Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs.
18. Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.