( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Linear-Consistency Testing.

, , , и . J. Comput. Syst. Sci., 62 (4): 589-607 (2001)

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.

Gennadi Rabinovitch

Isaak Rabinowitsch

Aladár Rabinek

Michael -O Jung

Eugene Rabinowitch

 

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

On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem., и . POPL, стр. 133-138. ACM Press, (1981)Efficient Randomized Pattern-Matching Algorithms., и . IBM J. Res. Dev., 31 (2): 249-260 (1987)DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems.. DISC, том 4731 из Lecture Notes in Computer Science, стр. 506-508. Springer, (2007)Lower Bounds for Randomized Mutual Exclusion., , , и . SIAM J. Comput., 27 (6): 1550-1563 (1998)Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk., и . Theory Comput. Syst., 35 (3): 289-304 (2002)Probabilistic Automata. Inf. Control., 6 (3): 230-245 (сентября 1963)Practical secrecy-preserving, verifiably correct and trustworthy auctions., , , и . ICEC, том 156 из ACM International Conference Proceeding Series, стр. 70-81. ACM, (2006)Complexity of Computations.. Commun. ACM, 20 (9): 625-633 (1977)Corrigendum: CACM 21(3): 231 (1978).Scheduling Cilk multithreaded parallel programs on processors of different speeds., и . SPAA, стр. 13-21. ACM, (2000)Achieving Independence in Logarithmic Number of Rounds., и . PODC, стр. 260-268. ACM, (1987)