Shai Vardi

Orcid: 0000-0003-4720-6826

According to our database1, Shai Vardi authored at least 33 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Minimization Fractional Prophet Inequalities for Sequential Procurement.
Math. Oper. Res., 2024

Black-Box Acceleration of Monotone Convex Program Solvers.
Oper. Res., 2024

Technical Note - On Hiring Secretaries with Stochastic Departures.
Oper. Res., 2024

Ex-Post Equilibrium Market Recommendations.
Proceedings of the 25th ACM Conference on Economics and Computation, 2024

2023
Communication-aware scheduling of precedence-constrained tasks on related machines.
Oper. Res. Lett., November, 2023

Dynamic Combinatorial Assignment.
CoRR, 2023

2022
The efficiency-fairness balance of Round Robin scheduling.
Oper. Res. Lett., 2022

Dynamic Fair Resource Division.
Math. Oper. Res., 2022

2019
Communication-Aware Scheduling of Precedence-Constrained Tasks.
SIGMETRICS Perform. Evaluation Rev., 2019

Logarithmic Communication for Distributed Optimization in Multi-Agent Systems.
Proc. ACM Meas. Anal. Comput. Syst., 2019

How to Hire Secretaries with Stochastic Departures.
Proceedings of the Web and Internet Economics - 15th International Conference, 2019

2018
Convex Prophet Inequalities.
SIGMETRICS Perform. Evaluation Rev., 2018

Constant-Time Local Computation Algorithms.
Theory Comput. Syst., 2018

Sublinear Graph Augmentation for Fast Query Implementation.
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

On the Probe Complexity of Local Computation Algorithms.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Randomly Coloring Graphs of Logarithmically Bounded Pathwidth.
Proceedings of the Approximation, 2018

Non-Exploitable Protocols for Repeated Cake Cutting.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

A Parallelizable Acceleration Framework for Packing Linear Programs.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Distributed Optimization via Local Computation Algorithms.
SIGMETRICS Perform. Evaluation Rev., 2017

Randomly coloring graphs of bounded treewidth.
CoRR, 2017

A note on the size of query trees.
CoRR, 2017

Sorting from Noisier Samples.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Controlled Dynamic Fair Division.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

2016
Local Computation Mechanism Design.
ACM Trans. Economics and Comput., 2016

New techniques and tighter bounds for local computation algorithms.
J. Comput. Syst. Sci., 2016

2015
Designing Local Computation Algorithms and Mechanisms
PhD thesis, 2015

The Returning Secretary.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Dynamic Fair Division with Minimal Disruptions.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

2014
The secretary returns.
CoRR, 2014

2013
A Local Computation Approximation Scheme to Maximum Matching.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Space-efficient local computation algorithms.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Converting Online Algorithms to Local Computation Algorithms.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Fast Local Computation Algorithms.
Proceedings of the Innovations in Computer Science, 2011


  Loading...