From post

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

Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data.

M. Greenwald, S. Khanna, K. Kunal, B. Pierce, и A. Schmitt. DISC, том 4167 из Lecture Notes in Computer Science, стр. 269-283. Springer, (2006)

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.

The Network as a Storage Device: Dynamic Routing with Bounded Buffers.S. Angelov, S. Khanna, и K. Kunal. APPROX-RANDOM, том 3624 из Lecture Notes in Computer Science, стр. 1-13. Springer, (2005)Sorting and Selection with Random Costs.S. Angelov, K. Kunal, и A. McGregor. LATIN, том 4957 из Lecture Notes in Computer Science, стр. 48-59. Springer, (2008)Bandwidth Maximization in Multicasting.N. Garg, R. Khandekar, K. Kunal, и V. Pandit. ESA, том 2832 из Lecture Notes in Computer Science, стр. 242-253. Springer, (2003)The Network as a Storage Device: Dynamic Routing with Bounded Buffers.S. Angelov, S. Khanna, и K. Kunal. Algorithmica, 55 (1): 71-94 (2009)A Formal Investigation of.S. Khanna, K. Kunal, и B. Pierce. FSTTCS, том 4855 из Lecture Notes in Computer Science, стр. 485-496. Springer, (2007)Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data.M. Greenwald, S. Khanna, K. Kunal, B. Pierce, и A. Schmitt. DISC, том 4167 из Lecture Notes in Computer Science, стр. 269-283. Springer, (2006)