Follow
Jeremy T. Fineman
Jeremy T. Fineman
Georgetown University
No verified email - Homepage
Title
Cited by
Cited by
Year
Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks
A Buluç, JT Fineman, M Frigo, JR Gilbert, CE Leiserson
Proceedings of the twenty-first annual symposium on Parallelism in …, 2009
5372009
Brief announcement: The problem based benchmark suite
J Shun, GE Blelloch, JT Fineman, PB Gibbons, A Kyrola, HV Simhadri, ...
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in …, 2012
2472012
Cache-oblivious streaming B-trees
MA Bender, M Farach-Colton, JT Fineman, YR Fogel, BC Kuszmaul, ...
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms …, 2007
2072007
Internally deterministic parallel algorithms can be fast
GE Blelloch, JT Fineman, PB Gibbons, J Shun
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of …, 2012
2052012
Greedy sequential maximal independent set and matching are parallel on average
GE Blelloch, JT Fineman, J Shun
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in …, 2012
1642012
Concurrent cache-oblivious B-trees
MA Bender, JT Fineman, S Gilbert, BC Kuszmaul
Proceedings of the seventeenth annual ACM symposium on Parallelism in …, 2005
1292005
Scheduling irregular parallel computations on hierarchical caches
GE Blelloch, JT Fineman, PB Gibbons, HV Simhadri
Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011
1062011
Nested parallelism in transactional memory
K Agrawal, JT Fineman, J Sukha
Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of …, 2008
962008
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs
MA Bender, JT Fineman, S Gilbert, CE Leiserson
Proceedings of the sixteenth annual ACM symposium on Parallelism in …, 2004
882004
A new approach to incremental cycle detection and related problems
MA Bender, JT Fineman, S Gilbert, RE Tarjan
ACM Transactions on Algorithms (TALG) 12 (2), 1-22, 2015
86*2015
Sorting with asymmetric read and write costs
GE Blelloch, JT Fineman, PB Gibbons, Y Gu, J Shun
Proceedings of the 27th ACM symposium on Parallelism in Algorithms and …, 2015
722015
Optimal parallel algorithms in the binary-forking model
GE Blelloch, JT Fineman, Y Gu, Y Sun
Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020
632020
Parallel algorithms for asymmetric read-write costs
N Ben-David, GE Blelloch, JT Fineman, PB Gibbons, Y Gu, C McGuffey, ...
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and …, 2016
622016
Reducing contention through priority updates
J Shun, GE Blelloch, JT Fineman, PB Gibbons
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in …, 2013
592013
Efficient algorithms with asymmetric read and write costs
GE Blelloch, JT Fineman, PB Gibbons, Y Gu, J Shun
arXiv preprint arXiv:1511.01038, 2015
532015
Cache-adaptive algorithms
MA Bender, R Ebrahimi, JT Fineman, G Ghasemiesfeh, R Johnson, ...
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
522014
Provably good and practically efficient parallel race detection for fork-join programs
R Utterback, K Agrawal, JT Fineman, ITA Lee
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and …, 2016
512016
Sequential random permutation, list contraction and tree contraction are highly parallel
J Shun, Y Gu, GE Blelloch, JT Fineman, PB Gibbons
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
502014
How to scale exponential backoff: Constant throughput, polylog access attempts, and robustness
MA Bender, JT Fineman, S Gilbert, M Young
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016
472016
Cache-oblivious dynamic dictionaries with update/query tradeoffs
GS Brodal, ED Demaine, JT Fineman, J Iacono, S Langerman, JI Munro
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
472010
The system can't perform the operation now. Try again later.
Articles 1–20