Author of the publication

Efficient Decentralized Algorithms for the Distributed Trigger Counting Problem.

, , , and . Theory Comput. Syst., 51 (4): 447-473 (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

A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints., , and . FSTTCS, volume 8 of LIPIcs, page 181-191. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Improved Algorithms for the Distributed Trigger Counting Problem., , and . IPDPS, page 515-523. IEEE, (2011)Optimizations in financial engineering: The Least-Squares Monte Carlo method of Longstaff and Schwartz., , , and . IPDPS, page 1-11. IEEE, (2008)Efficient Inferencing of Compressed Deep Neural Networks., , , , and . CoRR, (2017)An Efficient Decentralized Algorithm for the Distributed Trigger Counting Problem., , , and . ICDCN, volume 6522 of Lecture Notes in Computer Science, page 53-64. Springer, (2011)Brief Announcement: A Decentralized Algorithm for Distributed Trigger Counting., , , and . DISC, volume 6343 of Lecture Notes in Computer Science, page 398-400. Springer, (2010)Looking under the hood of the IBM blue gene/Q network., , , , , , , , , and 4 other author(s). SC, page 69. IEEE/ACM, (2012)Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers., , , , and . FSTTCS, volume 24 of LIPIcs, page 249-261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Breaking the speed and scalability barriers for graph exploration on distributed-memory machines., , , , , and . SC, page 13. IEEE/ACM, (2012)Efficient Decentralized Algorithms for the Distributed Trigger Counting Problem., , , and . Theory Comput. Syst., 51 (4): 447-473 (2012)