Publications
The Cilkprof Scalability Profiler,
, SPAA '15: Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures, 06/2015, Portland, Oregon, USA, (2015)
Design and Analysis of a Nondeterministic Parallel Breadth-First Search Algorithm,
, Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science, 05/2010, Volume M.Eng, Cambridge, MA, USA, p.77, (2010)
Deterministic parallel random-number generation for dynamic-multithreading platforms,
, PPoPP '12: Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, New Orleans, Louisiana, USA, (2012)
On the efficiency of localized work stealing,
, Information Processing Letters, 02/2016, Volume 116, Issue 2, p.100 - 106, (2016)
Efficiently Detecting Races in Cilk Programs That Use Reducer Hyperobjects,
, SPAA '15: Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures, Portland, Oregon, USA, (2015)
Invited to a special issue of ACM Transactions on Parallel Computing.
Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling,
, ACM Transactions on Parallel Computing - Special Issue for SPAA 2014, 06/2016, Volume 3, Issue 1, p.1 - 31, (2016)
Executing dynamic data-graph computations deterministically using chromatic scheduling,
, SPAA '14: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, Prague, Czech Republic, (2014)
Invited to a special issue of ACM Transactions on Parallel Computing.
Finding a Hamiltonian Path in a Cube with Specified Turns is Hard,
, Journal of Information Processing, Volume 21, Issue 3, p.368 - 377, (2013)
Folding Equilateral Plane Graphs,
, ISAAC '11: Proceedings of the 22nd International Symposium on Algorithms and Computation, Berlin, Heidelberg, (2011)
Folding Equilateral Plane Graphs,
, International Journal of Computational Geometry & Applications, 04/2013, Volume 23, Issue 2, p.75 - 92, (2013)
On-the-Fly Pipeline Parallelism,
, ACM Transactions on Parallel Computing - Special Issue for SPAA 2013, 10/2015, Volume 2, Issue 3, p.1 - 42, (2015)
On-the-fly pipeline parallelism,
, SPAA '13 - Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, Montréal, Québec, Canada, (2013)
Invited to a special issue of ACM Transactions on Parallel Computing.
Ordering heuristics for parallel graph coloring,
, SPAA '14: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, Prague, Czech Republic, (2014)
Performance Engineering of Multicore Software: Developing a Science of Fast Code for the Post-Moore Era,
, Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science, 09/2016, Volume Ph.D., Cambridge, MA, USA, p.328, (2016)
Tapir: Embedding Fork-Join Parallelism into LLVM's Intermediate Representation,
, PPoPP '17: Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Austin, Texas, USA, (2017)
Won best paper award.
Upper Bounds on Number of Steals in Rooted Trees,
, Theory of Computing Systems, 02/2016, Volume 58, Issue 2, p.223 - 240, (2016)
Who Needs Crossings? Hardness of Plane Graph Rigidity,
, SoCG 2016: 32nd International Symposium on Computational Geometry, Dagstuhl, Germany, (2016)
A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers),
, SPAA '10: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures, 06/2010, Thira, Santorini, Greece, (2010)