default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShai Vardi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Palma London
, Shai Vardi, Reza Eghbali, Adam Wierman:
Black-Box Acceleration of Monotone Convex Program Solvers. Oper. Res. 72(2): 796-815 (2024)- [j13]Thomas Kesselheim, Christos-Alexandros Psomas, Shai Vardi:
Technical Note - On Hiring Secretaries with Stochastic Departures. Oper. Res. 72(5): 2076-2081 (2024) - [j12]Junjie Qin, Shai Vardi, Adam Wierman:
Minimization Fractional Prophet Inequalities for Sequential Procurement. Math. Oper. Res. 49(2): 928-947 (2024) - 2023
- [j11]Yu Su, Shai Vardi, Xiaoqi Ren, Adam Wierman:
Communication-aware scheduling of precedence-constrained tasks on related machines. Oper. Res. Lett. 51(6): 709-716 (2023) - [i14]Thành Nguyen, Alexander Teytelboym, Shai Vardi:
Dynamic Combinatorial Assignment. CoRR abs/2303.13967 (2023) - 2022
- [j10]Shai Vardi, Alexandros Psomas, Eric J. Friedman:
Dynamic Fair Resource Division. Math. Oper. Res. 47(2): 945-968 (2022) - [j9]Benjamin Moseley, Shai Vardi:
The efficiency-fairness balance of Round Robin scheduling. Oper. Res. Lett. 50(1): 20-27 (2022) - 2020
- [c18]Palma London, Shai Vardi, Adam Wierman:
Logarithmic Communication for Distributed Optimization in Multi-Agent Systems. SIGMETRICS (Abstracts) 2020: 97-98 - [i13]Yu Su, Xiaoqi Ren, Shai Vardi, Adam Wierman:
Communication-Aware Scheduling of Precedence-Constrained Tasks on Related Machines. CoRR abs/2004.14639 (2020)
2010 – 2019
- 2019
- [j8]Palma London, Shai Vardi, Adam Wierman:
Logarithmic Communication for Distributed Optimization in Multi-Agent Systems. Proc. ACM Meas. Anal. Comput. Syst. 3(3): 48:1-48:29 (2019) - [j7]Yu Su, Xiaoqi Ren, Shai Vardi, Adam Wierman, Yuxiong He:
Communication-Aware Scheduling of Precedence-Constrained Tasks. SIGMETRICS Perform. Evaluation Rev. 47(2): 21-23 (2019) - [c17]Thomas Kesselheim, Alexandros Psomas, Shai Vardi:
How to Hire Secretaries with Stochastic Departures. WINE 2019: 343 - [i12]Thomas Kesselheim, Alexandros Psomas, Shai Vardi:
How to Hire Secretaries with Stochastic Departures. CoRR abs/1909.08660 (2019) - 2018
- [j6]Yishay Mansour, Boaz Patt-Shamir, Shai Vardi:
Constant-Time Local Computation Algorithms. Theory Comput. Syst. 62(2): 249-267 (2018) - [j5]Junjie Qin, Ram Rajagopal, Shai Vardi, Adam Wierman:
Convex Prophet Inequalities. SIGMETRICS Perform. Evaluation Rev. 46(2): 39-41 (2018) - [j4]Junjie Qin, Ram Rajagopal, Shai Vardi, Adam Wierman:
Convex Prophet Inequalities. SIGMETRICS Perform. Evaluation Rev. 46(2): 85-86 (2018) - [c16]Omer Tamuz, Shai Vardi, Juba Ziani:
Non-Exploitable Protocols for Repeated Cake Cutting. AAAI 2018: 1226-1233 - [c15]Palma London, Shai Vardi, Adam Wierman, Hanling Yi:
A Parallelizable Acceleration Framework for Packing Linear Programs. AAAI 2018: 3706-3713 - [c14]Shai Vardi:
Randomly Coloring Graphs of Logarithmically Bounded Pathwidth. APPROX-RANDOM 2018: 57:1-57:19 - [c13]Uriel Feige, Boaz Patt-Shamir, Shai Vardi:
On the Probe Complexity of Local Computation Algorithms. ICALP 2018: 50:1-50:14 - [c12]Palma London, Shai Vardi, Adam Wierman, Hanling Yi:
A Parallelizable Acceleration Framework for Packing Linear Programs. ITA 2018: 1-10 - [c11]Artur Czumaj, Yishay Mansour, Shai Vardi:
Sublinear Graph Augmentation for Fast Query Implementation. WAOA 2018: 181-203 - 2017
- [j3]Palma London, Niangjun Chen, Shai Vardi, Adam Wierman:
Distributed Optimization via Local Computation Algorithms. SIGMETRICS Perform. Evaluation Rev. 45(2): 30-32 (2017) - [c10]Eric J. Friedman, Christos-Alexandros Psomas, Shai Vardi:
Controlled Dynamic Fair Division. EC 2017: 461-478 - [c9]Aviad Rubinstein, Shai Vardi:
Sorting from Noisier Samples. SODA 2017: 960-972 - [i11]Uriel Feige, Boaz Patt-Shamir, Shai Vardi:
On the Probe Complexity of Local Computation Algorithms. CoRR abs/1703.07734 (2017) - [i10]Shai Vardi:
A note on the size of query trees. CoRR abs/1708.00510 (2017) - [i9]Shai Vardi:
Randomly coloring graphs of bounded treewidth. CoRR abs/1708.02677 (2017) - [i8]Palma London, Shai Vardi, Adam Wierman, Hanling Yi:
A Parallelizable Acceleration Framework for Packing Linear Programs. CoRR abs/1711.06656 (2017) - 2016
- [j2]Omer Reingold, Shai Vardi:
New techniques and tighter bounds for local computation algorithms. J. Comput. Syst. Sci. 82(7): 1180-1200 (2016) - [j1]Avinatan Hassidim, Yishay Mansour, Shai Vardi:
Local Computation Mechanism Design. ACM Trans. Economics and Comput. 4(4): 21:1-21:24 (2016) - 2015
- [b1]Shai Vardi:
Designing Local Computation Algorithms and Mechanisms. Tel Aviv University, Israel, 2015 - [c8]Eric J. Friedman, Christos-Alexandros Psomas, Shai Vardi:
Dynamic Fair Division with Minimal Disruptions. EC 2015: 697-713 - [c7]Shai Vardi:
The Returning Secretary. STACS 2015: 716-729 - [c6]Yishay Mansour, Boaz Patt-Shamir, Shai Vardi:
Constant-Time Local Computation Algorithms. WAOA 2015: 110-121 - 2014
- [c5]Avinatan Hassidim, Yishay Mansour, Shai Vardi:
Local computation mechanism design. EC 2014: 601-616 - [i7]Shai Vardi:
The secretary returns. CoRR abs/1404.0614 (2014) - [i6]Omer Reingold, Shai Vardi:
New Techniques and Tighter Bounds for Local Computation Algorithms. CoRR abs/1404.5398 (2014) - 2013
- [c4]Yishay Mansour, Shai Vardi:
A Local Computation Approximation Scheme to Maximum Matching. APPROX-RANDOM 2013: 260-273 - [i5]Yishay Mansour, Shai Vardi:
A Local Computation Approximation Scheme to Maximum Matching. CoRR abs/1306.5003 (2013) - [i4]Avinatan Hassidim, Yishay Mansour, Shai Vardi:
Local computation mechanism design. CoRR abs/1311.3939 (2013) - 2012
- [c3]Yishay Mansour, Aviad Rubinstein, Shai Vardi, Ning Xie:
Converting Online Algorithms to Local Computation Algorithms. ICALP (1) 2012: 653-664 - [c2]Noga Alon, Ronitt Rubinfeld, Shai Vardi, Ning Xie:
Space-efficient local computation algorithms. SODA 2012: 1132-1139 - [i3]Yishay Mansour, Aviad Rubinstein, Shai Vardi, Ning Xie:
Converting online algorithms to local computation algorithms. CoRR abs/1205.1312 (2012) - 2011
- [c1]Ronitt Rubinfeld, Gil Tamir, Shai Vardi, Ning Xie:
Fast Local Computation Algorithms. ICS 2011: 223-238 - [i2]Ronitt Rubinfeld, Gil Tamir, Shai Vardi, Ning Xie:
Fast Local Computation Algorithms. CoRR abs/1104.1377 (2011) - [i1]Noga Alon, Ronitt Rubinfeld, Shai Vardi, Ning Xie:
Space-efficient Local Computation Algorithms. CoRR abs/1109.6178 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
