( en | de | ru )

 

Disambiguation of "Spirakis, Paul G."

Author of the publication

copydeleteadd this publication to your clipboard
Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing (Extended Abstract)

, , , and . STOC, page 381-390. ACM, (1991)

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.

Paul-G Behler

Paul G Lankisch

Paul G Lankisch

Giuseppe G G Manzardo

G Schmidt

 

Other publications of authors with the same name

Potential Functions in Strategic Games., and . CSR, volume 7913 of Lecture Notes in Computer Science, page 283-297. Springer, (2013)The Complexity of Optimal Design of Temporally Connected Graphs., , , and . Theory Comput. Syst., 61 (3): 907-944 (2017)Scheduling tasks with dependencies on asymmetric multiprocessors., , and . PODC, page 454. ACM, (2008)Fundamental Control Algorithms in Mobile Networks., , , , and . SPAA, page 251-260. ACM, (1999)Efficient Approximation Algorithms in Random Intersection Graphs., , and . Handbook of Approximation Algorithms and Metaheuristics (2), Chapman and Hall/CRC, (2018)Randomized Approximation Techniques., and . Handbook of Approximation Algorithms and Metaheuristics (1), Chapman and Hall/CRC, (2018)Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs., , and . MFCS, volume 7464 of Lecture Notes in Computer Science, page 728-739. Springer, (2012)Mutants and Residents with Different Connection Graphs in the Moran Process., , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 790-804. Springer, (2018)The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs., , and . ICALP, volume 3142 of Lecture Notes in Computer Science, page 1029-1040. Springer, (2004)Stably Computing Order Statistics with Arithmetic Population Protocols., , , and . MFCS, volume 58 of LIPIcs, page 68:1-68:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)