pith. sign in

Jeremy T. Fineman

Identifiers

  • name variant Jeremy T. Fineman 0.60 · backfill

Papers (11)

  1. Nearly Work-Efficient Parallel Algorithm for Digraph Reachability cs.DS · 2017 · author #1
  2. Implicit Decomposition for Write-Efficient Connectivity Algorithms cs.DS · 2017 · author #3
  3. Sorting with Asymmetric Read and Write Costs cs.DS · 2016 · author #2
  4. Efficient Algorithms with Asymmetric Read and Write Costs cs.DS · 2015 · author #2
  5. Smoothed Analysis of Dynamic Networks cs.DC · 2015 · author #2
  6. Cost-oblivious storage reallocation cs.DS · 2014 · author #4
  7. Cache-Oblivious Persistence cs.DS · 2014 · author #2
  8. How to Scale Exponential Backoff cs.DC · 2014 · author #2
  9. Reallocation Problems in Scheduling cs.DS · 2013 · author #4
  10. A New Approach to Incremental Cycle Detection and Related Problems cs.DS · 2011 · author #2
  11. Improved Approximations for Multiprocessor Scheduling Under Uncertainty cs.DC · 2008 · author #3

Mentions

  • 1305.6555 #4 · backfill · confidence 0.70 Jeremy T. Fineman
  • 1112.0784 #2 · backfill · confidence 0.70 Jeremy T. Fineman
  • 0802.2418 #3 · backfill · confidence 0.70 Jeremy T. Fineman

Frequent Coauthors