Tight Complexity Bounds for Parallel Comparison Sorting - Noga Alon; Yossi Azar; Uzi Vishkin (FOCS, 1986)

Tight Comparison Bounds on the Complexity of Parallel Sorting. - Yossi Azar; Uzi Vishkin (SIAM J. Comput., 1987)

The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms. - Noga Alon; Yossi Azar (SIAM J. Comput., 1988)

Sorting, Approximate Sorting, and Searching in Rounds. - Noga Alon; Yossi Azar (SIAM J. Discret. Math., 1988)

Parallel comparison sorting and searching - Yossi Azar (1988)

Finding an Approximate Maximum. - Noga Alon; Yossi Azar (SIAM J. Comput., 1989)

Universal sequences for complete graphs. - Noga Alon; Yossi Azar; Yiftach Ravid (Discret. Appl. Math., 1990)

Parallel selection. - Yossi Azar; Nicholas Pippenger (Discret. Appl. Math., 1990)

Parallel comparison algorithms for approximation problems. - Noga Alon; Yossi Azar (Comb., 1991)

Parallel Comparison Merging of Many-Ordered Lists. - Yossi Azar (Theor. Comput. Sci., 1991)

On-Line Steiner Trees in the Euclidean Plane. - Noga Alon; Yossi Azar (SCG, 1992)

On-line Load Balancing (Extended Abstract) - Yossi Azar; Andrei Z. Broder; Anna R. Karlin (FOCS, 1992)

Comparison-Sorting and Selecting in Totally Monotone Matrices. - Noga Alon; Yossi Azar (SODA, 1992)

Lower Bounds for Threshold and Symmetric Functions in Parallel Computation. - Yossi Azar (SIAM J. Comput., 1992)

Throughput-Competitive On-Line Routing - Baruch Awerbuch; Yossi Azar; Serge A. Plotkin (FOCS, 1993)

On-line Choice of On-line Algorithms. - Yossi Azar; Andrei Z. Broder; Mark S. Manasse (SODA, 1993)

On-line load balancing with applications to machine scheduling and virtual circuit routing. - James Aspnes; Yossi Azar; Amos Fiat; Serge A. Plotkin; Orli Waarts (STOC, 1993)

Online Load Balancing of Temporary Tasks. - Yossi Azar; Bala Kalyanasundaram; Serge A. Plotkin; Kirk Pruhs; Orli Waarts (WADS, 1993)

On-Line Steine Trees in the Euclidean Plane. - Noga Alon; Yossi Azar (Discret. Comput. Geom., 1993)

Local Optimization of Global Objectives: Competitive Distributed Deadlock Resolution and Resource Allocation - Baruch Awerbuch; Yossi Azar (FOCS, 1994)

Balanced allocations (extended abstract). - Yossi Azar; Andrei Z. Broder; Anna R. Karlin; Eli Upfal (STOC, 1994)

Lower Bounds for Insertion Methods for TSP. - Yossi Azar (Comb. Probab. Comput., 1994)

On the Problem of Approximating the Number of Bases of a Matroid. - Yossi Azar; Andrei Z. Broder; Alan M. Frieze (Inf. Process. Lett., 1994)

On-Line Load Balancing. - Yossi Azar; Andrei Z. Broder; Anna R. Karlin (Theor. Comput. Sci., 1994)

Load Balancing in the Lp Norm. - Baruch Awerbuch; Yossi Azar; Edward F. Grove; Ming-Yang Kao; P. Krishnan; Jeffrey Scott Vitter (FOCS, 1995)

Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. - Baruch Awerbuch; Yossi Azar; Avrim Blum; Santosh S. Vempala (STOC, 1995)

The Competitiveness of On-Line Assignments. - Yossi Azar; Joseph Naor; Raphael Rom (J. Algorithms, 1995)

Competitive multicast routing. - Baruch Awerbuch; Yossi Azar (Wirel. Networks, 1995)

On-line Load Balancing. - Yossi Azar (Online Algorithms, 1996)

On-line Competive Algorithms for Call Admission in Optical Networks. - Baruch Awerbuch; Yossi Azar; Amos Fiat; Stefano Leonardi 001; Adi Rosén (ESA, 1996)

Packet Routing via Min-Cost Circuit Routing. - Baruch Awerbuch; Yossi Azar; Amos Fiat (ISTCS, 1996)

Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract). - Baruch Awerbuch; Yossi Azar; Amos Fiat; Frank Thomson Leighton (STOC, 1996)

Biased Random Walks. - Yossi Azar; Andrei Z. Broder; Anna R. Karlin; Nathan Linial; Steven J. Phillips (Comb., 1996)

Routing Strategies for Fast Networks. - Yossi Azar; Joseph Naor; Raphael Rom (IEEE Trans. Computers, 1996)

On-Line Machine Covering. - Yossi Azar; Leah Epstein (ESA, 1997)

Buy-at-Bulk Network Design. - Baruch Awerbuch; Yossi Azar (FOCS, 1997)

Approximation Schemes for Scheduling. - Noga Alon; Yossi Azar; Gerhard J. Woeginger; Tal Yadid (SODA, 1997)

On-line routing of virtual circuits with applications to load balancing and machine scheduling. - James Aspnes; Yossi Azar; Amos Fiat; Serge A. Plotkin; Orli Waarts (J. ACM, 1997)

On Two Dimensional Packing. - Yossi Azar; Leah Epstein (J. Algorithms, 1997)

On-Line Load Balancing of Temporary Tasks. - Yossi Azar; Bala Kalyanasundaram; Serge A. Plotkin; Kirk Pruhs; Orli Waarts (J. Algorithms, 1997)

Approximation Schemes for Covering and Scheduling on Related Machines. - Yossi Azar; Leah Epstein (APPROX, 1998)

Ancient and New Algorithms for Load Balancing in the Lp Norm. - Adi Avidor; Yossi Azar; Jirí Sgall (SODA, 1998)

On-Line and Off-Line Approximation Algorithms for Vector Covering Problems. - Noga Alon; Yossi Azar; János Csirik; Leah Epstein; Sergey V. Sevastianov; Arjen P. A. Vestjens; Gerhard J. Woeginger (Algorithmica, 1998)

Approximating Probability Distributions Using Small Sample Spaces. - Yossi Azar; Rajeev Motwani 001; Joseph Naor (Comb., 1998)

New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen. - Baruch Awerbuch; Yossi Azar; Avrim Blum; Santosh S. Vempala (SIAM J. Comput., 1998)

Off-Line Temporary Tasks Assignment. - Yossi Azar; Oded Regev 001 (ESA, 1999)

Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths. - Noga Alon; Uri Arad; Yossi Azar (RANDOM-APPROX, 1999)

On Capital Investment. - Yossi Azar; Yair Bartal; Esteban Feuerstein; Amos Fiat; Stefano Leonardi 001; Adi Rosén (Algorithmica, 1999)

Balanced Allocations. - Yossi Azar; Andrei Z. Broder; Anna R. Karlin; Eli Upfal (SIAM J. Comput., 1999)

Maximizing job benefits on-line. - Baruch Awerbuch; Yossi Azar; Oded Regev 001 (APPROX, 2000)

Fair versus Unrestricted Bin Packing. - Yossi Azar; Joan Boyar; Lene M. Favrholdt; Kim S. Larsen; Morten N. Nielsen (SWAT, 2000)

Resource Augmentation in Load Balancing. - Yossi Azar; Leah Epstein; Rob van Stee (SWAT, 2000)

Strongly Polynomial Algorithms for the Unsplittable Flow Problem. - Yossi Azar; Oded Regev 001 (IPCO, 2001)

The Multicast Bandwidth Advantage in Serving a Web Site. - Yossi Azar; Meir Feder; Eyal Lubetzky; Doron Rajwan; Nadav Shulman (Networked Group Communication, 2001)

Spectral analysis of data. - Yossi Azar; Amos Fiat; Anna R. Karlin; Frank McSherry; Jared Saia (STOC, 2001)

Ancient and New Algorithms for Load Balancing in the lp Norm. - Adi Avidor; Yossi Azar; Jirí Sgall (Algorithmica, 2001)

On-Line Competitive Algorithms for Call Admission in Optical Networks. - Baruch Awerbuch; Yossi Azar; Amos Fiat; Stefano Leonardi 001; Adi Rosén (Algorithmica, 2001)

Competitive Routing of Virtual Circuits with Unknown Duration. - Baruch Awerbuch; Yossi Azar; Serge A. Plotkin; Orli Waarts (J. Comput. Syst. Sci., 2001)

On-line bin-stretching. - Yossi Azar; Oded Regev 001 (Theor. Comput. Sci., 2001)

Temporary tasks assignment resolved. - Amitai Armon; Yossi Azar; Leah Epstein; Oded Regev 001 (SODA, 2002)

Fair versus Unrestricted Bin Packing. - Yossi Azar; Joan Boyar; Lene M. Favrholdt; Kim S. Larsen; Morten N. Nielsen; Leah Epstein (Algorithmica, 2002)

On-line scheduling with precedence constraints. - Yossi Azar; Leah Epstein (Discret. Appl. Math., 2002)

Minimizing the Flow Time Without Migration. - Baruch Awerbuch; Yossi Azar; Stefano Leonardi 001; Oded Regev 001 (SIAM J. Comput., 2002)

Off-line temporary tasks assignment. - Yossi Azar; Oded Regev 001; Jirí Sgall; Gerhard J. Woeginger (Theor. Comput. Sci., 2002)

A Generic Scheme for Building Overlay Networks in Adversarial Scenarios. - Ittai Abraham; Baruch Awerbuch; Yossi Azar; Yair Bartal; Dahlia Malkhi; Elan Pavlov (IPDPS, 2003)

Combining online algorithms for rejection and acceptance. - Yossi Azar; Avrim Blum; Yishay Mansour (SPAA, 2003)

Reducing truth-telling online mechanisms to online optimization. - Baruch Awerbuch; Yossi Azar; Adam Meyerson (STOC, 2003)

Load Balancing of Temporary Tasks in the lp Norm. - Yossi Azar; Amir Epstein; Leah Epstein (WAOA, 2003)

Temporary Tasks Assignment Resolved. - Amitai Armon; Yossi Azar; Leah Epstein (Algorithmica, 2003)

On-line restricted assignment of temporary tasks with unknown durations. - Amitai Armon; Yossi Azar; Leah Epstein; Oded Regev 001 (Inf. Process. Lett., 2003)

Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms. - Ran Adler; Yossi Azar (J. Sched., 2003)

The zero-one principle for switching networks. - Yossi Azar; Yossi Richter (STOC, 2004)

All-Norm Approximation for Scheduling on Identical Machines. - Yossi Azar; Shai Taub (SWAT, 2004)

Online Packet Switching. - Yossi Azar (WAOA, 2004)

All-norm approximation algorithms. - Yossi Azar; Leah Epstein; Yossi Richter; Gerhard J. Woeginger (J. Algorithms, 2004)

Optimal oblivious routing in polynomial time. - Yossi Azar; Edith Cohen; Amos Fiat; Haim Kaplan; Harald Räcke (J. Comput. Syst. Sci., 2004)

On-Line Load Balancing of Temporary Tasks on Identical Machines. - Yossi Azar; Leah Epstein (SIAM J. Discret. Math., 2004)

On-line generalized Steiner problem. - Baruch Awerbuch; Yossi Azar; Yair Bartal (Theor. Comput. Sci., 2004)

Packet Routing and Information Gathering in Lines, Rings and Trees. - Yossi Azar; Rafi Zachut (ESA, 2005)

Convex programming for scheduling unrelated parallel machines. - Yossi Azar; Amir Epstein (STOC, 2005)

The Hardness of Network Design for Unsplittable Flow with Selfish Users. - Yossi Azar; Amir Epstein (WAOA, 2005)

Management of Multi-Queue Switches in QoS Networks. - Yossi Azar; Yossi Richter (Algorithmica, 2005)

Combining Online Algorithms for Acceptance and Rejection. - Yossi Azar; Avrim Blum; David P. Bunde; Yishay Mansour (Theory Comput., 2005)

Optimal Node Routing. - Yossi Azar; Yoel Chaiutin (STACS, 2006)

Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers. - Yossi Azar; Nir Levy (SWAT, 2006)

Maximizing Throughput in Multi-Queue Switches. - Yossi Azar; Arik Litichevskey (Algorithmica, 2006)

Combinatorial Algorithms for the Unsplittable Flow Problem. - Yossi Azar; Oded Regev 001 (Algorithmica, 2006)

A general approach to online network optimization problems. - Noga Alon; Baruch Awerbuch; Yossi Azar; Niv Buchbinder; Joseph Naor (ACM Trans. Algorithms, 2006)

An improved algorithm for CIOQ switches. - Yossi Azar; Yossi Richter (ACM Trans. Algorithms, 2006)

Tradeoffs in worst-case equilibria. - Baruch Awerbuch; Yossi Azar; Yossi Richter; Dekel Tsur (Theor. Comput. Sci., 2006)

Load balancing of temporary tasks in the lp norm. - Yossi Azar; Amir Epstein; Leah Epstein (Theor. Comput. Sci., 2006)

An improved algorithm for online coloring of intervals with bandwidth. - Yossi Azar; Amos Fiat; Meital Levy; N. S. Narayanaswamy (Theor. Comput. Sci., 2006)

Minimizing Total Flow Time and Total Completion Time with Immediate Dispatching. - Nir Avrahami; Yossi Azar (Algorithmica, 2007)

Truthful Approximation Mechanisms for Scheduling Selfish Related Machines. - Nir Andelman; Yossi Azar; Motti Sorani (Theory Comput. Syst., 2007)

Improved Approximation Algorithms for Budgeted Allocations. - Yossi Azar; Benjamin E. Birnbaum; Anna R. Karlin; Claire Mathieu; C. Thach Nguyen (ICALP (1), 2008)

Truthful Unification Framework for Packing Integer Programs with Choices. - Yossi Azar; Iftah Gamzu (ICALP (1), 2008)

Fast convergence to nearly optimal solutions in potential games. - Baruch Awerbuch; Yossi Azar; Amir Epstein; Vahab S. Mirrokni; Alexander Skopalik (EC, 2008)

Fast load balancing via bounded best response. - Baruch Awerbuch; Yossi Azar; Rohit Khandekar (SODA, 2008)

(Almost) optimal coordination mechanisms for unrelated machine scheduling. - Yossi Azar; Kamal Jain; Vahab S. Mirrokni (SODA, 2008)

Thinking Twice about Second-Price Ad Auctions - Yossi Azar; Benjamin E. Birnbaum; Anna R. Karlin; C. Thach Nguyen (CoRR, 2008)

Collaborate with Strangers to Find Own Preferences. - Baruch Awerbuch; Yossi Azar; Zvi Lotker; Boaz Patt-Shamir; Mark R. Tuttle (Theory Comput. Syst., 2008)

On Revenue Maximization in Second-Price Ad Auctions. - Yossi Azar; Benjamin E. Birnbaum; Anna R. Karlin; C. Thach Nguyen (ESA, 2009)

Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks. - Yossi Azar; Benjamin E. Birnbaum; L. Elisa Celis; Nikhil R. Devanur; Yuval Peres (FOCS, 2009)

Multiple intents re-ranking. - Yossi Azar; Iftah Gamzu; Xiaoxin Yin (STOC, 2009)

Foreword. - Yossi Azar; Thomas Erlebach (Algorithmica, 2009)

Tell Me Who I Am: An Interactive Recommendation System. - Noga Alon; Baruch Awerbuch; Yossi Azar; Boaz Patt-Shamir (Theory Comput. Syst., 2009)

The Online Set Cover Problem. - Noga Alon; Baruch Awerbuch; Yossi Azar; Niv Buchbinder; Joseph Naor (SIAM J. Comput., 2009)

Admission control to minimize rejections and online set cover with repetitions. - Noga Alon; Yossi Azar; Shai Gutner (ACM Trans. Algorithms, 2009)

Monotonicity in Bargaining Networks. - Yossi Azar; Nikhil R. Devanur; Kamal Jain; Yuval Rabani (SODA, 2010)

A Preemptive Algorithm for Maximizing Disjoint Paths on Trees. - Yossi Azar; Uriel Feige; Daniel Glasner (Algorithmica, 2010)

Optimal whitespace synchronization strategies - Yossi Azar; Ori Gurel-Gurevich; Eyal Lubetzky; Thomas Moscibroda (CoRR, 2010)

Truthful unsplittable flow for large capacity networks. - Yossi Azar; Iftah Gamzu; Shai Gutner (ACM Trans. Algorithms, 2010)

Distributed error confinement. - Yossi Azar; Shay Kutten; Boaz Patt-Shamir (ACM Trans. Algorithms, 2010)

Optimal Discovery Strategies in White Space Networks. - Yossi Azar; Ori Gurel-Gurevich; Eyal Lubetzky; Thomas Moscibroda (ESA, 2011)

Submodular Max-SAT. - Yossi Azar; Iftah Gamzu; Ran Roth (ESA, 2011)

Prompt Mechanism for Ad Placement over Time. - Yossi Azar; Ety Khaitzin (SAGT, 2011)

Ranking with Submodular Valuations. - Yossi Azar; Iftah Gamzu (SODA, 2011)

Recommender systems with non-binary grades. - Yossi Azar; Aviv Nisgav; Boaz Patt-Shamir (SPAA, 2011)

Buffer Management for Colored Packets with Deadlines. - Yossi Azar; Uriel Feige; Iftah Gamzu; Thomas Moscibroda; Prasad Raghavendra (Theory Comput. Syst., 2011)

Maximum bipartite flow in networks with adaptive channel width. - Yossi Azar; Aleksander Madry; Thomas Moscibroda; Debmalya Panigrahi; Aravind Srinivasan (Theor. Comput. Sci., 2011)

Mastering multi-player games. - Yossi Azar; Uriel Feige; Moshe Tennenholtz; Michal Feldman (AAMAS, 2012)

Efficient Submodular Function Maximization under Linear Packing Constraints. - Yossi Azar; Iftah Gamzu (ICALP (1), 2012)

Asymptotically optimal algorithm for stochastic adwords. - Nikhil R. Devanur; Balasubramanian Sivan; Yossi Azar (EC, 2012)

Online Load Balancing on Unrelated Machines with Startup Costs - Yossi Azar; Debmalya Panigrahi (CoRR, 2012)

Online Mixed Packing and Covering. - Yossi Azar; Umang Bhaskar; Lisa Fleischer; Debmalya Panigrahi (SODA, 2013)

Cloud scheduling with setup cost. - Yossi Azar; Naama Ben-Aroya; Nikhil R. Devanur; Navendu Jain (SPAA, 2013)

Tight bounds for online vector bin packing. - Yossi Azar; Ilan Reuven Cohen; Seny Kamara; F. Bruce Shepherd (STOC, 2013)

Colored Packets with Deadlines and Metric Space Transition Cost. - Yossi Azar; Adi Vardi (CoRR, 2013)

The Price of Routing Unsplittable Flow. - Baruch Awerbuch; Yossi Azar; Amir Epstein (SIAM J. Comput., 2013)

Sequential decision making with vector outcomes. - Yossi Azar; Uriel Feige; Michal Feldman; Moshe Tennenholtz (ITCS, 2014)

Generalized Reordering Buffer Management. - Yossi Azar; Matthias Englert; Iftah Gamzu; Eytan Kidron (STACS, 2014)

Online Covering with Convex Objectives and Applications. - Yossi Azar; Ilan Reuven Cohen; Debmalya Panigrahi (CoRR, 2014)

Co-Location-Resistant Clouds. - Yossi Azar; Seny Kamara; Ishai Menache; Mariana Raykova 001; F. Bruce Shepherd (IACR Cryptol. ePrint Arch., 2014)

Buffer Management for Packets with Processing Times. - Yossi Azar; Oren Gilon (ESA, 2015)

Serving in the Dark should be done Non-Uniformly. - Yossi Azar; Ilan Reuven Cohen (ICALP (1), 2015)

Truthful Online Scheduling with Commitments. - Yossi Azar; Inna Kalp-Shaltiel; Brendan Lucier; Ishai Menache; Joseph Naor; Jonathan Yaniv (EC, 2015)

Speed Scaling in the Non-clairvoyant Model. - Yossi Azar; Nikhil R. Devanur; Zhiyi Huang 002; Debmalya Panigrahi (SPAA, 2015)

TSP with Time Windows and Service Time. - Yossi Azar; Adi Vardi (CoRR, 2015)

Optimal Coordination Mechanisms for Unrelated Machine Scheduling. - Yossi Azar; Lisa Fleischer; Kamal Jain; Vahab S. Mirrokni; Zoya Svitkina (Oper. Res., 2015)

Online Algorithms for Covering and Packing Problems with Convex Objectives. - Yossi Azar; Niv Buchbinder; T.-H. Hubert Chan; Shahar Chen; Ilan Reuven Cohen; Anupam Gupta 001; Zhiyi Huang 002; Ning Kang 001; Viswanath Nagarajan; Joseph Naor; Debmalya Panigrahi (FOCS, 2016)

When Should an Expert Make a Prediction? - Yossi Azar; Amir Ban; Yishay Mansour (EC, 2016)

Packing Small Vectors. - Yossi Azar; Ilan Reuven Cohen; Amos Fiat; Alan Roytman (SODA, 2016)

Make-to-Order Integrated Scheduling and Distribution. - Yossi Azar; Amir Epstein; Lukasz Jez; Adi Vardi (SODA, 2016)

Dynamic Traveling Repair Problem with an Arbitrary Time Window. - Yossi Azar; Adi Vardi (WAOA, 2016)

How to Allocate Goods in an Online Market? - Yossi Azar; Niv Buchbinder; Kamal Jain (Algorithmica, 2016)

Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays. - Yossi Azar; Ashish Chiplunkar; Haim Kaplan (CoRR, 2016)

Min-Cost Bipartite Perfect Matching with Delays. - Itai Ashlagi; Yossi Azar; Moses Charikar; Ashish Chiplunkar; Ofir Geri; Haim Kaplan; Rahul Makhijani; Yuyi Wang 001; Roger Wattenhofer (APPROX-RANDOM, 2017)

Liquid Price of Anarchy. - Yossi Azar; Michal Feldman; Nick Gravin; Alan Roytman (SAGT, 2017)

Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays. - Yossi Azar; Ashish Chiplunkar; Haim Kaplan (SODA, 2017)

Online Lower Bounds via Duality. - Yossi Azar; Ilan Reuven Cohen; Alan Roytman (SODA, 2017)

The Strategy of Experts for Repeated Predictions. - Amir Ban; Yossi Azar; Yishay Mansour (WINE, 2017)

Scheduling with Deadlines and Buffer Management with Processing Requirements. - Yossi Azar; Oren Gilon (Algorithmica, 2017)

Truthful mechanism design via correlated tree rounding. - Yossi Azar; Martin Hoefer 001; Idan Maor; Rebecca Reiffenhäuser; Berthold Vöcking (Math. Program., 2017)

Improved Online Algorithm for Weighted Flow Time. - Yossi Azar; Noam Touitou (FOCS, 2018)

Prophet Secretary: Surpassing the 1-1/e Barrier. - Yossi Azar; Ashish Chiplunkar; Haim Kaplan (EC, 2018)

Randomized Algorithms for Online Vector Load Balancing. - Yossi Azar; Ilan Reuven Cohen; Debmalya Panigrahi (SODA, 2018)

Set Cover and Vertex Cover with Delay. - Yossi Azar; Ashish Chiplunkar; Shay Kutten; Noam Touitou (CoRR, 2018)

2-Approximation algorithm for a generalization of scheduling on unrelated parallel machines. - Yossi Azar; Jaya Prakash Champati; Ben Liang 001 (Inf. Process. Lett., 2018)

An improved algorithm for online machine minimization. - Yossi Azar; Sarel Cohen (Oper. Res. Lett., 2018)

Tractable near-optimal policies for crawling. - Yossi Azar; Eric Horvitz; Eyal Lubetzky; Yuval Peres; Dafna Shahaf (Proc. Natl. Acad. Sci. USA, 2018)

Efficient Allocation of Free Stuff. - Yossi Azar; Allan Borodin; Michal Feldman; Amos Fiat; Kineret Segal (AAMAS, 2019)

General Framework for Metric Optimization Problems with Delay or with Deadlines. - Yossi Azar; Noam Touitou (FOCS, 2019)

The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays. - Yossi Azar; Yuval Emek; Rob van Stee; Danny Vainstein (SPAA, 2019)

Tight Bounds for Clairvoyant Dynamic Bin Packing. - Yossi Azar; Danny Vainstein (ACM Trans. Parallel Comput., 2019)

Hierarchical Clustering: A 0.585 Revenue Approximation. - Noga Alon; Yossi Azar; Danny Vainstein (COLT, 2020)

Set Cover with Delay - Clairvoyance Is Not Required. - Yossi Azar; Ashish Chiplunkar; Shay Kutten; Noam Touitou (ESA, 2020)

Beyond Tree Embeddings - a Deterministic Framework for Network Design with Deadlines or Delay. - Yossi Azar; Noam Touitou (FOCS, 2020)

Deterministic Min-Cost Matching with Delays. - Yossi Azar; Amit Jacob Fanani (Theory Comput. Syst., 2020)

Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering. - Danny Vainstein; Vaggos Chatziafratis; Gui Citovsky; Anand Rajagopalan; Mohammad Mahdian; Yossi Azar (AISTATS, 2021)

The Min-Cost Matching with Concave Delays Problem. - Yossi Azar; Runtian Ren; Danny Vainstein (SODA, 2021)

Flow time scheduling with uncertain processing time. - Yossi Azar; Stefano Leonardi 001; Noam Touitou (STOC, 2021)

Online Service with Delay. - Yossi Azar; Arun Ganesh; Rong Ge 001; Debmalya Panigrahi (ACM Trans. Algorithms, 2021)

The Price of Bounded Preemption. - Noga Alon; Yossi Azar; Mark Berlin (ACM Trans. Parallel Comput., 2021)

Distortion-Oblivious Algorithms for Scheduling on Multiple Machines. - Yossi Azar; Eldad Peretz; Noam Touitou (ISAAC, 2022)

An $ alpha$-regret analysis of Adversarial Bilateral Trade. - Yossi Azar; Amos Fiat; Federico Fusco (NeurIPS, 2022)

Distortion-Oblivious Algorithms for Minimizing Flow Time. - Yossi Azar; Stefano Leonardi 001; Noam Touitou (SODA, 2022)

Online Graph Algorithms with Predictions. - Yossi Azar; Debmalya Panigrahi; Noam Touitou (SODA, 2022)

Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering. - Yossi Azar; Danny Vainstein (ICALP, 2023)

Discrete-Smoothness in Online Algorithms with Predictions. - Yossi Azar; Debmalya Panigrahi; Noam Touitou (NeurIPS, 2023)

The loss of serving in the dark. - Yossi Azar; Ilan Reuven Cohen; Iftah Gamzu (Inf. Process. Lett., 2023)

Competitive Vertex Recoloring. - Yossi Azar; Chay Machluf; Boaz Patt-Shamir; Noam Touitou (Algorithmica, 2023)

Introduction to the Special Issue for SPAA'21. - Yossi Azar; Julian Shun (ACM Trans. Parallel Comput., 2023)

List Update with Delays or Time Windows. - Yossi Azar; Shahar Lewkowicz; Danny Vainstein (ICALP, 2024)

An α-regret analysis of adversarial bilateral trade. - Yossi Azar; Amos Fiat; Federico Fusco (Artif. Intell., 2024)

List Update with Prediction. - Yossi Azar; Shahar Lewkowicz; Varun Suriyanarayana (AAAI, 2025)

Brief Announcement: Load Balancing with Duration Predictions. - Yossi Azar; Niv Buchbinder; Tomer Epshtein (SPAA, 2025)

Online Joint Replenishment Problem with Arbitrary Holding and Backlog Costs. - Yossi Azar; Shahar Lewkowicz (CoRR, 2025)

Competitive Bundle Trading. - Yossi Azar; Niv Buchbinder; Roie Levin; Or Vardi (CoRR, 2025)

Nearly Tight Bounds for the Online Sorting Problem. - Yossi Azar; Debmalya Panigrahi; Or Vardi (CoRR, 2025)