Fineman, Jeremy T.

1. Nearly Work-Efficient Parallel Algorithm for Digraph Reachability
   2017/11/06 by Fineman, Jeremy T. · 5 citations
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
2. Efficient Construction of Directed Hopsets and Parallel Approximate Shortest Paths
   2019/12/11 by Nairen Cao, Jeremy T. Fineman, Cao, Nairen +3 · 4 citations
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
3. Single-Source Shortest Paths with Negative Real Weights in O(mn^8/9) Time
   2023/11/04 by Fineman, Jeremy T. · 6 citations
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
4. Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines
   2025/11/20 by Dinitz, Michael, Fineman, Jeremy T., Umboh, Seeun William · 1 voice · 1 citation
   #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
5. Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution
   2023/02/15 by Michael A. Bender, Bender, Michael A., Jeremy T. Fineman +7 · 1 citation
   Computer Science · #Security in Wireless Sensor Networks #Cooperative Communication and Network Coding #Mobile Ad Hoc Networks