From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Issues of Correctness in Database Concurrency Control by Locking

M. Yannakakis. STOC, стр. 363-367. ACM, (1981)

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.

Scheduling Interval-Ordered Tasks.C. Papadimitriou, и M. Yannakakis. SIAM J. Comput., 8 (3): 405-409 (1979)Freedom from Deadlock of Safe Locking Policies.M. Yannakakis. SIAM J. Comput., 11 (2): 391-408 (1982)Node-Deletion Problems on Bipartite Graphs.M. Yannakakis. SIAM J. Comput., 10 (2): 310-327 (1981)Edge-Deletion Problems.M. Yannakakis. SIAM J. Comput., 10 (2): 297-309 (1981)Computation of Least Fixed Points.M. Yannakakis. MFCS, том 7464 из Lecture Notes in Computer Science, стр. 63. Springer, (2012)Automata, Probability, and Recursion.M. Yannakakis. CIAA, том 5148 из Lecture Notes in Computer Science, стр. 23-32. Springer, (2008)Adaptive Model Checking.A. Groce, D. Peled, и M. Yannakakis. TACAS, том 2280 из Lecture Notes in Computer Science, стр. 357-370. Springer, (2002)Recursive Concurrent Stochastic Games.K. Etessami, и M. Yannakakis. ICALP (2), том 4052 из Lecture Notes in Computer Science, стр. 324-335. Springer, (2006)The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract).C. Papadimitriou, и M. Yannakakis. ICALP, том 71 из Lecture Notes in Computer Science, стр. 460-470. Springer, (1979)Probability and Recursion.K. Etessami, и M. Yannakakis. ISAAC, том 3827 из Lecture Notes in Computer Science, стр. 2-4. Springer, (2005)