Jeremy T. Fineman
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
63
Venues
15
Active years
2004–2026
Best venue rank
A*
Where they publish
Papers
63 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | ICALP | Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines. | Michael Dinitz, Jeremy T. Fineman, Seeun William Umboh |
| 2026 | SPAA | The Local/Global Disk Problem: How to Use Shared High-Bandwidth Storage Economically. | Michael A. Bender, Philip Bille, Martn Farach-Colton, Jeremy T. Fineman, Inge Li Grtz, Michael T. Goodrich, Hanna Komls, Bradley C. Kuszmaul, William Kuszmaul, Rose Silver, Todd Veldhuizen, Renfei Zhou |
| 2025 | ECRTS | Analysis of EDF for Real-Time Multiprocessor Systems with Resource Sharing. | Kunal Agrawal, Sanjoy K. Baruah, Jeremy T. Fineman, Alberto Marchetti-Spaccamela, Jinhao Zhao |
| 2024 | PODC | Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution. | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, John Kuszmaul, Maxwell Young |
| 2024 | STOC | Single-Source Shortest Paths with Negative Real Weights in | Jeremy T. Fineman |
| 2023 | SODA | Parallel Exact Shortest Paths in Almost Linear Work and Square Root Depth. | Nairen Cao, Jeremy T. Fineman |
| 2022 | ISAAC | Nested Active-Time Scheduling. | Nairen Cao, Jeremy T. Fineman, Shi Li, Julin Mestre, Katina Russell, Seeun William Umboh |
| 2022 | SPAA | Brief Announcement: Nested Active-Time Scheduling. | Nairen Cao, Jeremy T. Fineman, Shi Li, Julin Mestre, Katina Russell, Seeun William Umboh |
| 2022 | SPAA | Parallel Shortest Paths with Negative Edge Weights. | Nairen Cao, Jeremy T. Fineman, Katina Russell |
| 2021 | PODC | Brief Announcement: An Improved Distributed Approximate Single Source Shortest Paths Algorithm. | Nairen Cao, Jeremy T. Fineman, Katina Russell |
| 2021 | RTSS | Sub-Linear Overhead in Static Schedules for Fault-Tolerant Transmission. | Zhe Wang, Kunal Agrawal, Jeremy T. Fineman |
| 2020 | STOC | Efficient construction of directed hopsets and parallel approximate shortest paths. | Nairen Cao, Jeremy T. Fineman, Katina Russell |
| 2020 | SPAA | Contention Resolution with Message Deadlines. | Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young |
| 2020 | SPAA | Optimal Parallel Algorithms in the Binary-Forking Model. | Guy E. Blelloch, Jeremy T. Fineman, Yan Gu, Yihan Sun |
| 2020 | SPAA | Improved Work Span Tradeoff for Single Source Reachability and Approximate Shortest Paths. | Nairen Cao, Jeremy T. Fineman, Katina Russell |
| 2019 | PPoPP | Efficient race detection with futures. | Robert Utterback, Kunal Agrawal, Jeremy T. Fineman, I-Ting Angelina Lee |
| 2019 | SODA | I/O-Efficient Algorithms for Topological Sort and Related Problems. | Nairen Cao, Jeremy T. Fineman, Katina Russell, Eugene Yang |
| 2018 | SODA | Race Detection and Reachability in Nearly Series-Parallel DAGs. | Kunal Agrawal, Joseph Devietti, Jeremy T. Fineman, I-Ting Angelina Lee, Robert Utterback, Changming Xu |
| 2018 | STOC | Nearly work-efficient parallel algorithm for digraph reachability. | Jeremy T. Fineman |
| 2017 | ESA | The Online House Numbering Problem: Min-Max Online List Labeling. | William E. Devanny, Jeremy T. Fineman, Michael T. Goodrich, Tsvi Kopelowitz |
| 2017 | INFOCOM | Load balancing with bounded convergence in dynamic networks. | Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin Newport |
| 2017 | SODA | Cross-Referenced Dictionaries and the Limits of Write Optimization. | Peyman Afshani, Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Mayank Goswami, Meng-Tsung Tsai |
| 2017 | SODA | File Maintenance: When in Doubt, Change the Layout! | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Tsvi Kopelowitz, Pablo Montes |
| 2016 | ESA | Efficient Algorithms with Asymmetric Read and Write Costs. | Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun |
| 2016 | PLDI | A case for distributed work-stealing in regular applications. | Brendan Sheridan, Jeremy T. Fineman |
| 2016 | PODC | Contention Resolution on a Fading Channel. | Jeremy T. Fineman, Seth Gilbert, Fabian Kuhn, Calvin C. Newport |
| 2016 | PODC | Contention Resolution on Multiple Channels with Collision Detection. | Jeremy T. Fineman, Calvin Newport, Tonghe Wang |
| 2016 | SODA | How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness. | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young |
| 2016 | SPAA | Parallel Algorithms for Asymmetric Read-Write Costs. | Naama Ben-David, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun |
| 2016 | SPAA | Cache-Adaptive Analysis. | Michael A. Bender, Erik D. Demaine, Roozbeh Ebrahimi, Jeremy T. Fineman, Rob Johnson, Andrea Lincoln, Jayson Lynch, Samuel McCauley |
| 2016 | SPAA | Provably Good and Practically Efficient Parallel Race Detection for Fork-Join Programs. | Robert Utterback, Kunal Agrawal, Jeremy T. Fineman, I-Ting Angelina Lee |
| 2015 | SODA | Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel. | Julian Shun, Yan Gu, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons |
| 2015 | SPAA | Cost-Oblivious Reallocation for Scheduling and Planning. | Michael A. Bender, Martin Farach-Colton, Sndor P. Fekete, Jeremy T. Fineman, Seth Gilbert |
| 2015 | SPAA | Sorting with Asymmetric Read and Write Costs. | Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun |
| 2015 | SPAA | Scheduling Non-Unit Jobs to Minimize Calibrations. | Jeremy T. Fineman, Brendan Sheridan |
| 2014 | ESA | Cache-Oblivious Persistence. | Pooya Davoodi, Jeremy T. Fineman, John Iacono, zgr zkan |
| 2014 | HiPC | Cache-conscious scheduling of streaming pipelines on parallel machines with private caches. | Kunal Agrawal, Jordyn Maglalang, Jeremy T. Fineman |
| 2014 | PODS | Cost-oblivious storage reallocation. | Michael A. Bender, Martin Farach-Colton, Sndor P. Fekete, Jeremy T. Fineman, Seth Gilbert |
| 2014 | PPoPP | Provably good scheduling for parallel programs that use data structures through implicit batching. | Kunal Agrawal, Jeremy T. Fineman, Brendan Sheridan, Jim Sukha, Robert Utterback |
| 2014 | SODA | Cache-Adaptive Algorithms. | Michael A. Bender, Roozbeh Ebrahimi, Jeremy T. Fineman, Golnaz Ghasemiesfeh, Rob Johnson, Samuel McCauley |
| 2014 | SPAA | Brief announcement: cache-oblivious scheduling of streaming pipelines. | Kunal Agrawal, Jeremy T. Fineman |
| 2014 | SPAA | Provably good scheduling for parallel programs that use data structures through implicit batching. | Kunal Agrawal, Jeremy T. Fineman, Kefu Lu, Brendan Sheridan, Jim Sukha, Robert Utterback |
| 2014 | SPAA | Experimental analysis of space-bounded schedulers. | Harsha Vardhan Simhadri, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola |
| 2013 | PLDI | Program-centric cost models for locality. | Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Harsha Vardhan Simhadri |
| 2013 | PODC | Brief announcement: fair maximal independent sets in trees. | Jeremy T. Fineman, Calvin C. Newport, Tonghe Wang |
| 2013 | PPoPP | Reducing contention through priority updates. | Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons |
| 2013 | SPAA | Reallocation problems in scheduling. | Michael A. Bender, Martin Farach-Colton, Sndor P. Fekete, Jeremy T. Fineman, Seth Gilbert |
| 2013 | SPAA | Reducing contention through priority updates. | Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons |
| 2012 | PPoPP | Internally deterministic parallel algorithms can be fast. | Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Julian Shun |
| 2012 | SPAA | Cache-conscious scheduling of streaming applications. | Kunal Agrawal, Jeremy T. Fineman, Jordan Krage, Charles E. Leiserson, Sivan Toledo |
| 2012 | SPAA | Greedy sequential maximal independent set and matching are parallel on average. | Guy E. Blelloch, Jeremy T. Fineman, Julian Shun |
| 2012 | SPAA | Brief announcement: the problem based benchmark suite. | Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola, Harsha Vardhan Simhadri, Kanat Tangwongsan |
| 2011 | SPAA | Scheduling irregular parallel computations on hierarchical caches. | Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Harsha Vardhan Simhadri |
| 2010 | SODA | Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. | Gerth Stlting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, J. Ian Munro |
| 2009 | SODA | A new approach to incremental topological ordering. | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert |
| 2009 | SPAA | Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks. | Aydin Bulu, Jeremy T. Fineman, Matteo Frigo, John R. Gilbert, Charles E. Leiserson |
| 2008 | PPoPP | Nested parallelism in transactional memory. | Kunal Agrawal, Jeremy T. Fineman, Jim Sukha |
| 2008 | SPAA | Improved approximations for multiprocessor scheduling under uncertainty. | Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T. Fineman, David R. Karger, Jacob Scott |
| 2007 | FUN | The Worst Page-Replacement Policy. | Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman |
| 2007 | SPAA | Cache-oblivious streaming B-trees. | Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson |
| 2006 | ESA | Contention Resolution with Heterogeneous Job Sizes. | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert |
| 2005 | SPAA | Concurrent cache-oblivious b-trees. | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Bradley C. Kuszmaul |
| 2004 | SPAA | On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs. | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Charles E. Leiserson |