Author of the publication

The Strong At-Most-Once Problem.

, , and . DISC, volume 7611 of Lecture Notes in Computer Science, page 386-400. Springer, (2012)

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.

 

Other publications of authors with the same name

Work-Competitive Scheduling on Task Dependency Graphs., , and . Parallel Process. Lett., 25 (2): 1550001:1-1550001:18 (2015)Data migration algorithms in heterogeneous storage systems: A comparative performance evaluation., , , and . NCA, page 105-108. IEEE Computer Society, (2017)Securing the Human: Broadening Diversity in Cybersecurity., , , , , , , , and . ITiCSE, page 251-252. ACM, (2019)Correct Audit Logging in Concurrent Systems., and . LSFA, volume 351 of Electronic Notes in Theoretical Computer Science, page 115-141. Elsevier, (2020)Data Migration in Large Scale Heterogeneous Storage Systems with Nodes to Spare., , , and . ICNC, page 854-858. IEEE, (2019)Securing the Human: A Review of Literature on Broadening Diversity in Cybersecurity Education., , , , , , , , and . ITiCSE-WGR, page 157-176. ACM, (2019)Randomized Work-Competitive Scheduling for Cooperative Computing on k-partite Task Graphs., , and . NCA, page 267-270. IEEE Computer Society, (2008)A2Cloud-RF: A random forest based statistical framework to guide resource selection for high-performance scientific computing on the cloud., , , , , , , and . Concurr. Comput. Pract. Exp., (2020)The Strong At-Most-Once Problem., , and . DISC, volume 7611 of Lecture Notes in Computer Science, page 386-400. Springer, (2012)Asynchronous Adaptive Task Allocation., , , and . ICDCS, page 83-92. IEEE Computer Society, (2015)