Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness von Bender, Michael A., Fineman, Jeremy T., Gilbert, Seth, Young, Maxwell

Volltext

A New Approach to Incremental Cycle Detection and Related Problems von Bender, Michael A., Fineman, Jeremy T., Gilbert, Seth, Tarjan, Robert E.

Volltext

Smoothed analysis of dynamic networks von Dinitz, Michael, Fineman, Jeremy T., Gilbert, Seth, Newport, Calvin

Volltext

Contention resolution on a fading channel von Fineman, Jeremy T., Gilbert, Seth, Kuhn, Fabian, Newport, Calvin

Volltext

NEARLY WORK-EFFICIENT PARALLEL ALGORITHM FOR DIGRAPH REACHABILITY von Fineman, Jeremy T.

Volltext

Experimental Analysis of Space-Bounded Schedulers von Simhadri, Harsha Vardhan, Blelloch, Guy E., Fineman, Jeremy T., Gibbons, Phillip B., Kyrola, Aapo

Volltext

The Worst Page-Replacement Policy von Agrawal, Kunal, Bender, Michael A., Fineman, Jeremy T.

Volltext

Contention Resolution with Heterogeneous Job Sizes von Bender, Michael A., Fineman, Jeremy T., Gilbert, Seth

Volltext

I/O-Efficient Algorithms for Topological Sort and Related Problems von Cao, Nairen, Fineman, Jeremy T., Russell, Katina, Yang, Eugene

Volltext

Self-Supervised Representation Learning on Electronic Health Records with Graph Kernel Infomax von Yao, Hao-Ren, Cao, Nairen, Russell, Katina, Chang, Der-Chen, Frieder, Ophir, Fineman, Jeremy T.

Volltext

Introduction to the Special Issue for SPAA 2018: Part 1

Volltext

Single-Source Shortest Paths with Negative Real Weights in $\tilde{O}(mn^{8/9})$ Time von Fineman, Jeremy T

Volltext bestellen

Reallocation Problems in Scheduling von Bender, Michael A., Farach-Colton, Martin, Fekete, Sándor P., Fineman, Jeremy T., Gilbert, Seth

Volltext

Cost-Oblivious Storage Reallocation von Bender, Michael A., Farach-Colton, Martín, Fekete, Sándor P., Fineman, Jeremy T., Gilbert, Seth

Volltext

Single-Source Shortest Paths with Negative Real Weights in \(\tilde{O}(mn^{8/9})\) Time von Fineman, Jeremy T

Volltext

Nearly Work-Efficient Parallel Algorithm for Digraph Reachability von Fineman, Jeremy T

Volltext bestellen

Internally deterministic parallel algorithms can be fast von Blelloch, Guy E., Fineman, Jeremy T., Gibbons, Phillip B., Shun, Julian

Volltext

Efficient Construction of Directed Hopsets and Parallel Approximate Shortest Paths von Cao, Nairen, Fineman, Jeremy T, Russell, Katina

Volltext bestellen

Fully Energy-Efficient Randomized Backoff: Slow Feedback Loops Yield Fast Contention Resolution von Bender, Michael A, Fineman, Jeremy T, Gilbert, Seth, Kuszmaul, John, Young, Maxwell

Volltext bestellen

Optimal (Randomized) Parallel Algorithms in the Binary-Forking Model von Blelloch, Guy E, Fineman, Jeremy T, Gu, Yan, Sun, Yihan

Volltext