Roman Manevich

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Dimitrios Prountzos

> Home > Persons > Roman Manevich

Publications

2015
[c18]
- view
  authority control:
- export record
  dblp key:
  - conf/pldi/PrountzosMP15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pldi/PrountzosMP15
Dimitrios Prountzos, Roman Manevich, Keshav Pingali:
Synthesizing parallel graph programs via automated planning. PLDI 2015: 533-544
2012
[c17]
- view
  authority control:
- export record
  dblp key:
  - conf/oopsla/PrountzosMP12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/oopsla/PrountzosMP12
Dimitrios Prountzos, Roman Manevich, Keshav Pingali:
Elixir: a system for synthesizing concurrent graph programs. OOPSLA 2012: 375-394
2011
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/pldi/PingaliNKBHKLLMMPS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pldi/PingaliNKBHKLLMMPS11
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Martin Burtscher, Muhammad Amber Hassaan, Rashid Kaleem, Tsung-Hsien Lee, Andrew Lenharth, Roman Manevich, Mario Méndez-Lojo, Dimitrios Prountzos, Xin Sui:
The tao of parallelism in algorithms. PLDI 2011: 12-25
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/popl/PrountzosMPM11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/popl/PrountzosMPM11
Dimitrios Prountzos, Roman Manevich, Keshav Pingali, Kathryn S. McKinley:
A shape analysis for optimizing parallel graph programs. POPL 2011: 159-172

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.