| 1 A Work-Efficient Parallel Breadth-First Search Algorithm CE Leiserson, TB Schardl Massive Graph Analytics, 1, 2022 | 1 | 2022 |
| 2 Dynamic Connectivity ED Scribes, J Alman, V Firoiu, D Liu, TB Schardl | | |
| A hybrid scheduling scheme for parallel loops A Handleman, AG Rattew, ITA Lee, TB Schardl 2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2021 | 1 | 2021 |
| A Parallel Algorithm for the Single-Source Shortest Path Problem K Kelley, T Schardl | | 2010 |
| 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 | 267 | 2010 |
| Accelerating training and inference of graph neural networks with fast sampling and pipelining T Kaler, N Stathas, A Ouyang, AS Iliopoulos, T Schardl, CE Leiserson, ... Proceedings of Machine Learning and Systems 4, 172-189, 2022 | 49 | 2022 |
| ACM Transactions on L Chen, D Jannach, C Bauer, J Bee, R Burke, P Castells, B Goethals, ... ACM Transactions on 1 (1), 2023 | | 2023 |
| An Assessment of the Airborne Laser TB Schardl | | 2007 |
| Brief Announcement: Efficient Access History for Race Detection Y Xu, A Zhou, G Yin, K Agrawal, I Lee, T Schardl ACM| Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021 | | 2021 |
| Brief announcement: Open cilk TB Schardl, ITA Lee, CE Leiserson Proceedings of the 30th on Symposium on Parallelism in Algorithms and …, 2018 | 33 | 2018 |
| Cilkmem: Algorithms for analyzing the memory high-water mark of fork-join parallel programs T Kaler, W Kuszmaul, TB Schardl, D Vettorel Symposium on Algorithmic Principles of Computer Systems, 162-176, 2020 | 6 | 2020 |
| Communication-efficient graph neural networks with probabilistic neighborhood expansion analysis and caching T Kaler, A Iliopoulos, P Murzynowski, T Schardl, CE Leiserson, J Chen Proceedings of Machine Learning and Systems 5, 477-494, 2023 | 11 | 2023 |
| Design and analysis of a nondeterministic parallel breadth-first search algorithm TB Schardl Massachusetts Institute of Technology, 2010 | 3 | 2010 |
| Deterministic parallel random-number generation for dynamic-multithreading platforms CE Leiserson, TB Schardl, J Sukha ACM Sigplan Notices 47 (8), 193-204, 2012 | 71 | 2012 |
| Efficient access history for race detection Y Xu, A Zhou, GQ Yin, K Agrawal, ITA Lee, TB Schardl Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021 | 3 | 2021 |
| Efficient race detection for reducer hyperobjects ITA Lee, TB Schardl ACM Transactions on Parallel Computing (TOPC) 4 (4), 1-40, 2018 | 5 | 2018 |
| 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 | 20 | 2015 |
| Evolvegcn: Evolving graph convolutional networks for dynamic graphs A Pareja, G Domeniconi, J Chen, T Ma, T Suzumura, H Kanezashi, ... Proceedings of the AAAI conference on artificial intelligence 34 (04), 5363-5370, 2020 | 1040 | 2020 |
| Evolving graph convolutional networks for dynamic graphs J Chen, A Pareja, G Domeniconi, T Ma, T Suzumura, T Kaler, TB Schardl, ... US Patent 11,537,852, 2022 | 11 | 2022 |
| 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 | 40 | 2016 |
Charles E. LeisersonMIT在 mit.edu 的电子邮件经过验证
