Jeremy T. Fineman

CoRR, 2023

Robust and Listening-Efficient Contention Resolution.

[BibT_eX]

[DOI]

CoRR, 2023

Parallel Exact Shortest Paths in Almost Linear Work and Square Root Depth.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Efficient Construction of Directed Hopsets and Parallel Single-source Shortest Paths (Abstract).

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing, 2023

2022

I/O-Efficient Algorithms for Topological Sort and Related Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2022

Self-supervised Representation Learning on Electronic Health Records with Graph Kernel Infomax.

[BibT_eX]

[DOI]

CoRR, 2022

Smoothed Analysis of Information Spreading in Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Parallel Shortest Paths with Negative Edge Weights.

[BibT_eX]

[DOI]

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Brief Announcement: Nested Active-Time Scheduling.

[BibT_eX]

[DOI]

Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Nested Active-Time Scheduling.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021

Introduction to the Special Issue for SPAA 2018 - Part 2.

[BibT_eX]

[DOI]

Aydin Buluç

ACM Trans. Parallel Comput., 2021

Introduction to the Special Issue for SPAA 2018: Part 1.

[BibT_eX]

[DOI]

Aydin Buluç

ACM Trans. Parallel Comput., 2021

Sub-Linear Overhead in Static Schedules for Fault-Tolerant Transmission.

[BibT_eX]

[DOI]

Zhe Wang

Proceedings of the 42nd IEEE Real-Time Systems Symposium, 2021

Brief Announcement: An Improved Distributed Approximate Single Source Shortest Paths Algorithm.

[BibT_eX]

[DOI]

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020

Nearly Work-Efficient Parallel Algorithm for Digraph Reachability.

[BibT_eX]

[DOI]

SIAM J. Comput., 2020

Efficient construction of directed hopsets and parallel approximate shortest paths.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Improved Work Span Tradeoff for Single Source Reachability and Approximate Shortest Paths.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Optimal Parallel Algorithms in the Binary-Forking Model.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Contention Resolution with Message Deadlines.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

2019

Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness.

[BibT_eX]

[DOI]

J. ACM, 2019

Contention resolution on a fading channel.

[BibT_eX]

[DOI]

Distributed Comput., 2019

Efficient race detection with futures.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2019

2018

Smoothed analysis of dynamic networks.

[BibT_eX]

[DOI]

Distributed Comput., 2018

Race Detection and Reachability in Nearly Series-Parallel DAGs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Implicit Decomposition for Write-Efficient Connectivity Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

2017

Cost-Oblivious Storage Reallocation.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

File Maintenance: When in Doubt, Change the Layout!

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Cross-Referenced Dictionaries and the Limits of Write Optimization.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Load balancing with bounded convergence in dynamic networks.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

The Online House Numbering Problem: Min-Max Online List Labeling.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Experimental Analysis of Space-Bounded Schedulers.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2016

A New Approach to Incremental Cycle Detection and Related Problems.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Provably Good and Practically Efficient Parallel Race Detection for Fork-Join Programs.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Cache-Adaptive Analysis.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Parallel Algorithms for Asymmetric Read-Write Costs.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Contention Resolution on Multiple Channels with Collision Detection.

[BibT_eX]

[DOI]

Calvin Newport

Tonghe Wang

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

A case for distributed work-stealing in regular applications.

[BibT_eX]

[DOI]

Brendan Sheridan

Proceedings of the 6th ACM SIGPLAN Workshop on X10, 2016

Efficient Algorithms with Asymmetric Read and Write Costs.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Resource-Competitive Algorithms.

[BibT_eX]

[DOI]

SIGACT News, 2015

Efficient Algorithms under Asymmetric Read and Write Costs.

[BibT_eX]

[DOI]

CoRR, 2015

Reallocation Problems in Scheduling.

[BibT_eX]

[DOI]

Algorithmica, 2015

Scheduling Non-Unit Jobs to Minimize Calibrations.

[BibT_eX]

[DOI]

Brendan Sheridan

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Sorting with Asymmetric Read and Write Costs.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Cost-Oblivious Reallocation for Scheduling and Planning.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

NoiseOFF: A Backoff Protocol for a Dynamic, Noisy World.

[BibT_eX]

[DOI]

CoRR, 2014

Provably good scheduling for parallel programs that use data structures through implicit batching.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Brief announcement: cache-oblivious scheduling of streaming pipelines.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Cache-Adaptive Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Provably good scheduling for parallel programs that use data structures through implicit batching.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2014

Fair Maximal Independent Sets.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014

Cache-conscious scheduling of streaming pipelines on parallel machines with private caches.

[BibT_eX]

[DOI]

Jordyn Maglalang

Proceedings of the 21st International Conference on High Performance Computing, 2014

Cache-Oblivious Persistence.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

2013

Reducing contention through priority updates.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2013

Brief announcement: fair maximal independent sets in trees.

[BibT_eX]

[DOI]

Calvin C. Newport

Tonghe Wang

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Program-centric cost models for locality.

[BibT_eX]

[DOI]

Guy E. Blelloch

Phillip B. Gibbons

Proceedings of the ACM SIGPLAN Workshop on Memory Systems Performance and Correctness, 2013

2012

Brief announcement: the problem based benchmark suite.

[BibT_eX]

[DOI]

Kanat Tangwongsan

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Greedy sequential maximal independent set and matching are parallel on average.

[BibT_eX]

[DOI]

Guy E. Blelloch

Julian Shun

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Cache-conscious scheduling of streaming applications.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Internally deterministic parallel algorithms can be fast.

[BibT_eX]

[DOI]

Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2012

2011

Race Detectors for Cilk and Cilk++ Programs.

[BibT_eX]

[DOI]

Charles E. Leiserson

Proceedings of the Encyclopedia of Parallel Computing, 2011

Scheduling irregular parallel computations on hierarchical caches.

[BibT_eX]

[DOI]

Guy E. Blelloch

Phillip B. Gibbons

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Fundamental Graph Algorithms.

[BibT_eX]

[DOI]

Eric Robinson

Proceedings of the Graph Algorithms in the Language of Linear Algebra, 2011

2010

Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs.

[BibT_eX]

[DOI]

Gerth Stølting Brodal

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

Algorithms incorporating concurrency and caching.

[BibT_eX]

[DOI]

PhD thesis, 2009

The Worst Page-Replacement Policy.

[BibT_eX]

[DOI]

Michael A. Bender

Theory Comput. Syst., 2009

Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

A new approach to incremental topological ordering.

[BibT_eX]

[DOI]

Michael A. Bender

Christopher Y. Crutchfield

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

Improved approximations for multiprocessor scheduling under uncertainty.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Nested parallelism in transactional memory.

[BibT_eX]

[DOI]

Jim Sukha

Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2008

2007

Cache-oblivious streaming B-trees.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

2006

Contention Resolution with Heterogeneous Job Sizes.

[BibT_eX]

[DOI]

Michael A. Bender