Efficient Calculation of Determinants of Symbolic Matrices with Many Variables - Tanya Khovanova; Ziv Scully (CoRR, 2013)

Motors and Impossible Firing Patterns in the Parallel Chip-Firing Game. - Tian-Yi Jiang; Ziv Scully; Yan X. Zhang (SIAM J. Discret. Math., 2015)

A program optimization for automatic database result caching. - Ziv Scully; Adam Chlipala (POPL, 2017)

Optimally Scheduling Jobs with Multiple Tasks. - Ziv Scully; Guy E. Blelloch; Mor Harchol-Balter; Alan Scheller-Wolf (SIGMETRICS Perform. Evaluation Rev., 2017)

SOAP Bubbles: Robust Scheduling Under Adversarial Noise. - Ziv Scully; Mor Harchol-Balter (Allerton, 2018)

Optimal Scheduling and Exact Response Time Analysis for Multistage Jobs. - Ziv Scully; Mor Harchol-Balter; Alan Scheller-Wolf (CoRR, 2018)

SRPT for multiserver systems. - Isaac Grosof; Ziv Scully; Mor Harchol-Balter (Perform. Evaluation, 2018)

SOAP: One Clean Analysis of All Age-Based Scheduling Policies. - Ziv Scully; Mor Harchol-Balter; Alan Scheller-Wolf (Proc. ACM Meas. Anal. Comput. Syst., 2018)

Unfair Scheduling Patterns in NUMA Architectures. - Naama Ben-David; Ziv Scully; Guy E. Blelloch (PACT, 2019)

The Markovian Price of Information. - Anupam Gupta 001; Haotian Jiang; Ziv Scully; Sahil Singla 001 (IPCO, 2019)

Load Balancing Guardrails: Keeping Your Heavy Traffic on the Road to Low Response Times. - Isaac Grosof; Ziv Scully; Mor Harchol-Balter (Proc. ACM Meas. Anal. Comput. Syst., 2019)

Mean Field Analysis of Join-Below-Threshold Load Balancing for Resource Sharing Servers. - Illés Horváth; Ziv Scully; Benny Van Houdt (Proc. ACM Meas. Anal. Comput. Syst., 2019)

The Gittins Policy is Nearly Optimal in the M/G/k under Extremely General Conditions. - Ziv Scully; Isaac Grosof; Mor Harchol-Balter (Proc. ACM Meas. Anal. Comput. Syst., 2020)

Simple Near-Optimal Scheduling for the M/G/1. - Ziv Scully; Mor Harchol-Balter; Alan Scheller-Wolf (Proc. ACM Meas. Anal. Comput. Syst., 2020)

Characterizing Policies with Optimal Response Time Tails under Heavy-Tailed Job Sizes. - Ziv Scully; Lucas van Kreveld; Onno J. Boxma; Jan-Pieter L. Dorsman; Adam Wierman (Proc. ACM Meas. Anal. Comput. Syst., 2020)

Load balancing guardrails: keeping your heavy traffic on the road to low response times (invited paper). - Isaac Grosof; Ziv Scully; Mor Harchol-Balter (STOC, 2021)

The Gittins Policy in the M/G/1 Queue. - Ziv Scully; Mor Harchol-Balter (WiOpt, 2021)

How to Schedule Near-Optimally under Real-World Constraints. - Ziv Scully; Mor Harchol-Balter (CoRR, 2021)

Optimal multiserver scheduling with unknown job sizes in heavy traffic. - Ziv Scully; Isaac Grosof; Mor Harchol-Balter (Perform. Evaluation, 2021)

Optimal Scheduling in the Multiserver-job Model under Heavy Traffic. - Isaac Grosof; Ziv Scully; Mor Harchol-Balter; Alan Scheller-Wolf (Proc. ACM Meas. Anal. Comput. Syst., 2021)

Nudge: Stochastically Improving upon FCFS. - Isaac Grosof; Kunhe Yang; Ziv Scully; Mor Harchol-Balter (Proc. ACM Meas. Anal. Comput. Syst., 2021)

Uniform Bounds for Scheduling with Job Size Estimates. - Ziv Scully; Isaac Grosof; Michael Mitzenmacher (ITCS, 2022)

On the Gittins index for multistage jobs. - Samuli Aalto; Ziv Scully (Queueing Syst. Theory Appl., 2022)

The most common queueing theory questions asked by computer systems practitioners. - Mor Harchol-Balter; Ziv Scully (SIGMETRICS Perform. Evaluation Rev., 2022)

Bounding Mean Slowdown in Multiserver Systems. - Ziv Scully (SIGMETRICS Perform. Evaluation Rev., 2022)

When Does the Gittins Policy Have Asymptotically Optimal Response Time Tail? - Ziv Scully; Lucas van Kreveld (SIGMETRICS Perform. Evaluation Rev., 2022)

A New Toolbox for Scheduling Theory. - Ziv Scully (SIGMETRICS Perform. Evaluation Rev., 2022)

Minimizing the mean slowdown in the M/G/1 queue. - Samuli Aalto; Ziv Scully (Queueing Syst. Theory Appl., 2023)

The Role of Advanced Math in Teaching Performance Modeling. - Ziv Scully (SIGMETRICS Perform. Evaluation Rev., 2023)

Reducing Heavy-Traffic Response Time with Asymmetric Dispatching. - Runhan Xie; Ziv Scully (SIGMETRICS Perform. Evaluation Rev., 2023)

Cost-aware Bayesian Optimization via the Pandora's Box Gittins Index. - Qian Xie 005; Raul Astudillo; Peter I. Frazier; Ziv Scully; Alexander Terenin (NeurIPS, 2024)

Local hedging approximately solves Pandora's box problems with nonobligatory inspection. - Ziv Scully; Laura Doval (CoRR, 2024)

Combinatorial Selection with Costly Information. - Shuchi Chawla 001; Dimitris Christou; Amit Harlev; Ziv Scully (CoRR, 2024)

Performance of the Gittins policy in the G/G/1 and G/G/k, with and without setup times. - Yige Hong; Ziv Scully (Perform. Evaluation, 2024)

Heavy-Traffic Optimal Size- and State-Aware Dispatching. - Runhan Xie; Isaac Grosof; Ziv Scully (Proc. ACM Meas. Anal. Comput. Syst., 2024)

Strongly Tail-Optimal Scheduling in the Light-Tailed M/G/1. - George Yu; Ziv Scully (Proc. ACM Meas. Anal. Comput. Syst., 2024)

Transform Analysis of Preemption Overhead in the M/G/1. - Shefali Ramakrishna; Ziv Scully (SIGMETRICS Perform. Evaluation Rev., 2024)

When Does the Gittins Policy Have Asymptotically Optimal Response Time Tail in the M/G/1? - Ziv Scully; Lucas van Kreveld (Oper. Res., 2025)

A Gittins Policy for Optimizing Tail Latency. - Amit Harlev; George Yu; Ziv Scully (Proc. ACM Meas. Anal. Comput. Syst., 2025)

The Gittins Index: A Design Principle for Decision-Making Under Uncertainty. - Ziv Scully; Alexander Terenin (CoRR, 2025)

Cost-aware Stopping for Bayesian Optimization. - Qian Xie 005; Linda Cai; Alexander Terenin; Peter I. Frazier; Ziv Scully (CoRR, 2025)