Jeremy T. Fineman

activity

20082026

most citedSorting with Asymmetric Read and Write Costs

69 citations · 144 across the 20 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

cs.DS2023

Single-Source Shortest Paths with Negative Real Weights in $O ~ (m n^{8/9})$ Time

Jeremy T. Fineman

This paper presents a randomized algorithm for the problem of single-source shortest paths on directed graphs with real (both positive and negative) edge weights. Given an input gr…

cs.DC2023★ 1 cited

Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution

Michael A. Bender, Jeremy T. Fineman, Seth Gilbert +2

Contention resolution addresses the problem of coordinating access to a shared channel. Time proceeds in slots, and a packet transmission can be made in any slot. A packet is succe…

Single-Source Shortest Paths with Negative Real Weights in O~(mn8/9) Time

Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution

Single-Source Shortest Paths with Negative Real Weights in $O ~ (m n^{8/9})$ Time