( en | de | ru )

 

Disambiguation of "Shvartsman, Alexander A."

Author of the publication

copydeleteadd this publication to your clipboard
Towards practical deteministic write-all algorithms.

, , , , , and . SPAA, page 271-280. ACM, (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. You can also use the button next to the name to display some publications already assigned to the person.

Alexander A Borbély

Alexander A Bialasiewicz

Alexander Foss°a

Alexander A Beyer

Alexander A Bialasiewicz

 

Other publications of authors with the same name

The Complexity of Distributed Cooperation in the Presence of Failures., , and . OPODIS, page 245-264. Suger, Saint-Denis, rue Catulienne, France, (2000)A Binary Integer Programming Model for Optimal Object Distribution., , and . OPODIS, page 211-226. Hermes, (1998)Two Optimization Techniques for Component-Based Systems Deployment., , , and . SEKE, page 153-162. (2001)Cooperative computing with fragmentable and mergeable groups., and . SIROCCO, page 141-156. Carleton Scientific, (2000)Optimal Scheduling for Distributed Cooperation Without Communication., , and . SIROCCO, volume 8 of Proceedings in Informatics, page 259-274. Carleton Scientific, (2001)Highly scalable algorithms for robust string barcoding., , , and . Int. J. Bioinform. Res. Appl., 1 (2): 145-161 (2005)Failure-Sensitive Analysis of Parallel Algorithms with Controlled Memory Access Concurrency., , and . Parallel Process. Lett., 17 (2): 153-168 (2007)The Do-All problem with Byzantine processor failures., , , and . Theor. Comput. Sci., 333 (3): 433-454 (2005)Timing Conditions for Linearizability in Uniform Counting Networks., , , and . Theor. Comput. Sci., 220 (1): 67-91 (1999)Performing Tasks on Restartable Message-Passing Processors., , and . WDAG, volume 1320 of Lecture Notes in Computer Science, page 96-110. Springer, (1997)