( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Complexity of Multiterminal Cuts.

, , , , и . SIAM J. Comput., 23 (4): 864-894 (1994)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Mihalis Nicolaou

 

Другие публикации лиц с тем же именем

Scheduling Interval-Ordered Tasks., и . SIAM J. Comput., 8 (3): 405-409 (1979)Freedom from Deadlock of Safe Locking Policies.. SIAM J. Comput., 11 (2): 391-408 (1982)Node-Deletion Problems on Bipartite Graphs.. SIAM J. Comput., 10 (2): 310-327 (1981)Edge-Deletion Problems.. SIAM J. Comput., 10 (2): 297-309 (1981)The Complexity of Reliable Concurrency Control., и . SIAM J. Comput., 16 (3): 538-553 (1987)Linear Approximation of Shortest Superstrings, , , и . J. ACM, 41 (4): 630-647 (1994)Inference of Message Sequence Charts., , и . IEEE Trans. Software Eng., 29 (7): 623-633 (2003)Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria., , , и . ITCS, том 151 из LIPIcs, стр. 18:1-18:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Homa: An Efficient Topology and Route Management Approach in SD-WAN Overlays., , , и . INFOCOM, стр. 2351-2360. IEEE, (2020)A Theory of Safe Locking Policies in Database Systems.. J. ACM, 29 (3): 718-740 (1982)