A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers) CE Leiserson, TB Schardl Proceedings of the twenty-second annual ACM symposium on Parallelism in …, 2010 | 190 | 2010 |

On-the-fly pipeline parallelism ITA Lee, CE Leiserson, TB Schardl, Z Zhang, J Sukha ACM Transactions on Parallel Computing (TOPC) 2 (3), 1-42, 2015 | 53 | 2015 |

Ordering heuristics for parallel graph coloring W Hasenplaugh, T Kaler, TB Schardl, CE Leiserson Proceedings of the 26th ACM symposium on Parallelism in algorithms and …, 2014 | 53 | 2014 |

Tapir: Embedding fork-join parallelism into LLVM's intermediate representation TB Schardl, WS Moses, CE Leiserson Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of …, 2017 | 41 | 2017 |

Deterministic parallel random-number generation for dynamic-multithreading platforms CE Leiserson, TB Schardl, J Sukha ACM Sigplan Notices 47 (8), 193-204, 2012 | 39 | 2012 |

The Cilkprof scalability profiler TB Schardl, BC Kuszmaul, ITA Lee, WM Leiserson, CE Leiserson Proceedings of the 27th ACM symposium on Parallelism in Algorithms and …, 2015 | 32 | 2015 |

Executing dynamic data-graph computations deterministically using chromatic scheduling T Kaler, W Hasenplaugh, TB Schardl, CE Leiserson ACM Transactions on Parallel Computing (TOPC) 3 (1), 1-31, 2016 | 23 | 2016 |

Efficiently detecting races in cilk programs that use reducer hyperobjects ITA Lee, TB Schardl Proceedings of the 27th ACM symposium on Parallelism in Algorithms and …, 2015 | 15 | 2015 |

On the efficiency of localized work stealing W Suksompong, CE Leiserson, TB Schardl Information Processing Letters 116 (2), 100-106, 2016 | 12 | 2016 |

Scalable graph learning for anti-money laundering: A first look M Weber, J Chen, T Suzumura, A Pareja, T Ma, H Kanezashi, T Kaler, ... arXiv preprint arXiv:1812.00076, 2018 | 9 | 2018 |

Who needs crossings? Hardness of plane graph rigidity Z Abel, ED Demaine, ML Demaine, S Eisenstat, J Lynch, TB Schardl 32nd International Symposium on Computational Geometry (SoCG 2016), 2016 | 8 | 2016 |

The CSI framework for compiler-inserted program instrumentation TB Schardl, T Denniston, D Doucet, BC Kuszmaul, ITA Lee, CE Leiserson Proceedings of the ACM on Measurement and Analysis of Computing Systems 1 (2 …, 2017 | 6 | 2017 |

Upper bounds on number of steals in rooted trees CE Leiserson, TB Schardl, W Suksompong Theory of Computing Systems 58 (2), 223-240, 2016 | 6 | 2016 |

Performance engineering of multicore software: Developing a science of fast code for the post-Moore era TB Schardl Massachusetts Institute of Technology, 2016 | 4 | 2016 |

Finding a hamiltonian path in a cube with specified turns is hard Z Abel, ED Demaine, ML Demaine, S Eisenstat, J Lynch, TB Schardl Information and Media Technologies 8 (3), 685-694, 2013 | 4 | 2013 |

Folding equilateral plane graphs Z Abel, ED Demaine, ML Demaine, S Eisenstat, J Lynch, TB Schardl, ... International Journal of Computational Geometry & Applications 23 (02), 75-92, 2013 | 3 | 2013 |

Brief announcement: Open cilk TB Schardl, ITA Lee, CE Leiserson Proceedings of the 30th on Symposium on Parallelism in Algorithms and …, 2018 | 2 | 2018 |

Parallel single-source shortest paths K Kelley, TB Schardl MIT computer science and artificial intelligence laboratory, internal report, 2010 | 2 | 2010 |

Design and analysis of a nondeterministic parallel breadth-first search algorithm TB Schardl Massachusetts Institute of Technology, 2010 | 2 | 2010 |

Cilkmem: Algorithms for Analyzing the Memory High-Water Mark of Fork-Join Parallel Programs T Kaler, W Kuszmaul, TB Schardl, D Vettorel arXiv preprint arXiv:1910.12340, 2019 | 1 | 2019 |