( en | de | ru )

 

Disambiguation of "Manevich, Roman"

Author of the publication

copydeleteadd this publication to your clipboard
JANUS: exploiting parallelism via hindsight.

, , , and . PLDI, page 145-156. ACM, (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.

Olga Romanow

Max Viktor Romanus

Kornel Romaniuk

Fouad Romani

Uta Romanowski

 

Other publications of authors with the same name

Learning the Scope of Applicability for Task Planning Knowledge in Experience-Based Planning Domains., , , and . IROS, page 3973-3979. IEEE, (2019)Elixir: a system for synthesizing concurrent graph programs., , and . OOPSLA, page 375-394. ACM, (2012)Parameterized verification of transactional memories., , and . PLDI, page 134-145. ACM, (2010)Computing the Scope of Applicability for Acquired Task Knowledge in Experience-Based Planning Domains., , , and . CoRR, (2019)Heap Decomposition for Concurrent Shape Analysis., , , , and . SAS, volume 5079 of Lecture Notes in Computer Science, page 363-377. Springer, (2008)The tao of parallelism in algorithms., , , , , , , , , and 2 other author(s). PLDI, page 12-25. ACM, (2011)A shape analysis for optimizing parallel graph programs., , , and . POPL, page 159-172. ACM, (2011)Thread Quantification for Concurrent Shape Analysis., , , , and . CAV, volume 5123 of Lecture Notes in Computer Science, page 399-413. Springer, (2008)Learning Task Knowledge and its Scope of Applicability in Experience-Based Planning Domains., , , and . CoRR, (2019)Harnessing Static Analysis to Help Learn Pseudo-Inverses of String Manipulating Procedures for Automatic Test Generation., , , and . VMCAI, volume 11990 of Lecture Notes in Computer Science, page 180-201. Springer, (2020)