Online Joint Replenishment Problem with Arbitrary Holding and Backlog Costs.

Yossi Azar Tel Aviv University, Israel http://www.math.tau.ac.il/~azar/ https://dl.acm.org/profile/81100215093 https://zbmath.org/authors/?q=ai:azar.yossi https://mathscinet.ams.org/mathscinet/MRAuthorID/28640 https://mathgenealogy.org/id.php?id=74772 https://orcid.org/0000-0002-5097-8993 https://www.wikidata.org/entity/Q102254977 https://id.loc.gov/authorities/names/no2006099087 https://d-nb.info/gnd/1257508571 Yossi Azar Shahar Lewkowicz Online Joint Replenishment Problem with Arbitrary Holding and Backlog Costs. 2702-2725 2026 SODA https://doi.org/10.1137/1.9781611978971.99 conf/soda/2026 db/conf/soda/soda2026.html#AzarL26 Yossi Azar Debmalya Panigrahi Or Vardi Nearly Tight Bounds for the Online Sorting Problem. 6642-6658 2026 SODA https://doi.org/10.1137/1.9781611978971.237 conf/soda/2026 db/conf/soda/soda2026.html#AzarPV26 Yossi Azar Niv Buchbinder Roie Levin Or Vardi Trading Prophets with Initial Capital. 81-90 2026 SOSA https://doi.org/10.1137/1.9781611978964.7 conf/sosa/2026 db/conf/sosa/sosa2026.html#AzarBLV26 Yossi Azar Shahar Lewkowicz Varun Suriyanarayana List Update with Prediction. 15436-15444 2025 AAAI https://doi.org/10.1609/aaai.v39i15.33694 conf/aaai/2025 db/conf/aaai/aaai2025.html#AzarLS25 Yossi Azar Niv Buchbinder Tomer Epshtein Brief Announcement: Load Balancing with Duration Predictions. 642-646 2025 SPAA https://doi.org/10.1145/3694906.3743323 conf/spaa/2025 db/conf/spaa/spaa2025.html#AzarBE25 Yossi Azar Debmalya Panigrahi Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025, New Orleans, LA, USA, January 12-15, 2025 SODA SIAM 2025 978-1-61197-832-2 https://doi.org/10.1137/1.9781611978322 db/conf/soda/soda2025.html

Yossi Azar Shahar Lewkowicz Online Joint Replenishment Problem with Arbitrary Holding and Backlog Costs. 2025 July abs/2507.16096 CoRR https://doi.org/10.48550/arXiv.2507.16096 db/journals/corr/corr2507.html#abs-2507-16096 streams/journals/corr

Yossi Azar Niv Buchbinder Roie Levin Or Vardi Competitive Bundle Trading. 2025 July abs/2507.23047 CoRR https://doi.org/10.48550/arXiv.2507.23047 db/journals/corr/corr2507.html#abs-2507-23047 streams/journals/corr

Yossi Azar Debmalya Panigrahi Or Vardi Nearly Tight Bounds for the Online Sorting Problem. 2025 August abs/2508.14287 CoRR https://doi.org/10.48550/arXiv.2508.14287 db/journals/corr/corr2508.html#abs-2508-14287 streams/journals/corr

Yossi Azar Niv Buchbinder Roie Levin Or Vardi Trading Prophets with Initial Capital. 2025 October abs/2510.16516 CoRR https://doi.org/10.48550/arXiv.2510.16516 db/journals/corr/corr2510.html#abs-2510-16516 streams/journals/corr

Yossi Azar Niv Buchbinder Tomer Epshtein Load Balancing with Duration Predictions. 2025 December abs/2512.12202 CoRR https://doi.org/10.48550/arXiv.2512.12202 db/journals/corr/corr2512.html#abs-2512-12202 streams/journals/corr

Yossi Azar Amos Fiat Federico Fusco 0001 An α-regret analysis of adversarial bilateral trade. 104231 2024 337 Artif. Intell. https://doi.org/10.1016/j.artint.2024.104231 db/journals/ai/ai337.html#AzarFF24 streams/journals/ai

Yossi Azar Shahar Lewkowicz Danny Vainstein List Update with Delays or Time Windows. 15:1-15:20 2024 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2024.15 conf/icalp/2024 db/conf/icalp/icalp2024.html#AzarLV24

Yossi Azar Chay Machluf Boaz Patt-Shamir Noam Touitou Competitive Vertex Recoloring. 2001-2027 2023 July 85 Algorithmica 7 https://doi.org/10.1007/s00453-022-01076-x db/journals/algorithmica/algorithmica85.html#AzarMPT23

Yossi Azar Ilan Reuven Cohen Iftah Gamzu The loss of serving in the dark. 106334 2023 180 Inf. Process. Lett. https://doi.org/10.1016/j.ipl.2022.106334 db/journals/ipl/ipl180.html#AzarCG23

Yossi Azar Julian Shun Introduction to the Special Issue for SPAA'21. 17:1 2023 December 10 ACM Trans. Parallel Comput. 4 https://doi.org/10.1145/3630608 db/journals/topc/topc10.html#AzarS23

Yossi Azar Danny Vainstein Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering. 13:1-13:18 2023 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2023.13 conf/icalp/2023 db/conf/icalp/icalp2023.html#AzarV23 Yossi Azar Debmalya Panigrahi Noam Touitou Discrete-Smoothness in Online Algorithms with Predictions. 2023 NeurIPS http://papers.nips.cc/paper_files/paper/2023/hash/82f0dae85424eb743017c90380e7ab9b-Abstract-Conference.html conf/nips/2023 db/conf/nips/neurips2023.html#AzarPT23

Yossi Azar Shahar Lewkowicz Danny Vainstein List Update with Delays or Time Windows. 2023 abs/2304.06565 CoRR https://doi.org/10.48550/arXiv.2304.06565 db/journals/corr/corr2304.html#abs-2304-06565

Yossi Azar Danny Vainstein Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering. 2023 abs/2305.01367 CoRR https://doi.org/10.48550/arXiv.2305.01367 db/journals/corr/corr2305.html#abs-2305-01367

Yossi Azar Chay Machluf Boaz Patt-Shamir Noam Touitou Competitive Vertex Recoloring. 13:1-13:20 2022 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2022.13 conf/icalp/2022 db/conf/icalp/icalp2022.html#AzarMPT22 Yossi Azar Eldad Peretz Noam Touitou Distortion-Oblivious Algorithms for Scheduling on Multiple Machines. 16:1-16:18 2022 ISAAC https://doi.org/10.4230/LIPIcs.ISAAC.2022.16 conf/isaac/2022 db/conf/isaac/isaac2022.html#AzarPT22 Yossi Azar Amos Fiat Federico Fusco 0001 An $\alpha$-regret analysis of Adversarial Bilateral Trade. 2022 conf/nips/2022 NeurIPS http://papers.nips.cc/paper_files/paper/2022/hash/0b2832072ff6df19e586c74e27d90f12-Abstract-Conference.html db/conf/nips/neurips2022.html#AzarFF22 Yossi Azar Debmalya Panigrahi Noam Touitou Online Graph Algorithms with Predictions. 35-66 2022 SODA https://doi.org/10.1137/1.9781611977073.3 conf/soda/2022 db/conf/soda/soda2022.html#AzarPT22 Yossi Azar Stefano Leonardi 0001 Noam Touitou Distortion-Oblivious Algorithms for Minimizing Flow Time. 252-274 2022 SODA https://doi.org/10.1137/1.9781611977073.13 conf/soda/2022 db/conf/soda/soda2022.html#AzarLT22

Yossi Azar Amos Fiat Federico Fusco 0001 An α-regret analysis of Adversarial Bilateral Trade. 2022 abs/2210.06846 CoRR https://doi.org/10.48550/arXiv.2210.06846 db/journals/corr/corr2210.html#abs-2210-06846

Yossi Azar Arun Ganesh Rong Ge 0001 Debmalya Panigrahi Online Service with Delay. 23:1-23:31 2021 17 ACM Trans. Algorithms 3 https://doi.org/10.1145/3459925 db/journals/talg/talg17.html#AzarGGP21

Noga Alon Yossi Azar Mark Berlin The Price of Bounded Preemption. 3:1-3:21 2021 8 ACM Trans. Parallel Comput. 1 https://doi.org/10.1145/3434377 db/journals/topc/topc8.html#AlonAB21

Danny Vainstein Vaggos Chatziafratis Gui Citovsky Anand Rajagopalan Mohammad Mahdian Yossi Azar Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering. 559-567 2021 AISTATS http://proceedings.mlr.press/v130/vainstein21a.html conf/aistats/2021 db/conf/aistats/aistats2021.html#VainsteinCCRMA21 Yossi Azar Runtian Ren Danny Vainstein The Min-Cost Matching with Concave Delays Problem. 301-320 2021 SODA https://doi.org/10.1137/1.9781611976465.20 conf/soda/2021 db/conf/soda/soda2021.html#AzarRV21 Yossi Azar Stefano Leonardi 0001 Noam Touitou Flow time scheduling with uncertain processing time. 1070-1080 2021 STOC https://doi.org/10.1145/3406325.3451023 conf/stoc/2021 db/conf/stoc/stoc2021.html#AzarLT21 Kunal Agrawal 0001 Yossi Azar SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, 6-8 July, 2021 ACM SPAA 2021 978-1-4503-8070-6 https://doi.org/10.1145/3409964 db/conf/spaa/spaa2021.html

Yossi Azar Stefano Leonardi 0001 Noam Touitou Flow Time Scheduling with Uncertain Processing Time. 2021 abs/2103.05604 CoRR https://arxiv.org/abs/2103.05604 db/journals/corr/corr2103.html#abs-2103-05604

Yossi Azar Stefano Leonardi 0001 Noam Touitou Distortion-Oblivious Algorithms for Minimizing Flow Time. 2021 abs/2109.08424 CoRR https://arxiv.org/abs/2109.08424 db/journals/corr/corr2109.html#abs-2109-08424

Yossi Azar Debmalya Panigrahi Noam Touitou Online Graph Algorithms with Predictions. 2021 abs/2112.11831 CoRR https://arxiv.org/abs/2112.11831 db/journals/corr/corr2112.html#abs-2112-11831

Yossi Azar Amit Jacob Fanani Deterministic Min-Cost Matching with Delays. 572-592 2020 64 Theory Comput. Syst. 4 https://doi.org/10.1007/s00224-019-09963-7 https://www.wikidata.org/entity/Q126406255 db/journals/mst/mst64.html#AzarF20

Noga Alon Yossi Azar Danny Vainstein Hierarchical Clustering: A 0.585 Revenue Approximation. 153-162 2020 COLT http://proceedings.mlr.press/v125/alon20b.html conf/colt/2020 db/conf/colt/colt2020.html#AlonAV20 Yossi Azar Ashish Chiplunkar Shay Kutten Noam Touitou Set Cover with Delay - Clairvoyance Is Not Required. 8:1-8:21 2020 ESA https://doi.org/10.4230/LIPIcs.ESA.2020.8 conf/esa/2020 db/conf/esa/esa2020.html#AzarCKT20 Yossi Azar Noam Touitou Beyond Tree Embeddings - a Deterministic Framework for Network Design with Deadlines or Delay. 1368-1379 2020 FOCS https://doi.org/10.1109/FOCS46700.2020.00129 conf/focs/2020 db/conf/focs/focs2020.html#AzarT20

Yossi Azar Noam Touitou Beyond Tree Embeddings - a Deterministic Framework for Network Design with Deadlines or Delay. 2020 abs/2004.07946 CoRR https://arxiv.org/abs/2004.07946 db/journals/corr/corr2004.html#abs-2004-07946

Noga Alon Yossi Azar Danny Vainstein Hierarchical Clustering: a 0.585 Revenue Approximation. 2020 abs/2006.01933 CoRR https://arxiv.org/abs/2006.01933 db/journals/corr/corr2006.html#abs-2006-01933

Yossi Azar Runtian Ren Danny Vainstein The Min-Cost Matching with Concave Delays Problem. 2020 abs/2011.02017 CoRR https://arxiv.org/abs/2011.02017 db/journals/corr/corr2011.html#abs-2011-02017

Yossi Azar Danny Vainstein Tight Bounds for Clairvoyant Dynamic Bin Packing. 15:1-15:21 2019 6 ACM Trans. Parallel Comput. 3 https://doi.org/10.1145/3364214 https://www.wikidata.org/entity/Q127019494 db/journals/topc/topc6.html#AzarV19

Yossi Azar Allan Borodin Michal Feldman Amos Fiat Kineret Segal Efficient Allocation of Free Stuff. 918-925 2019 AAMAS http://dl.acm.org/citation.cfm?id=3331785 conf/atal/2019 db/conf/atal/aamas2019.html#AzarBFFS19 Yossi Azar Noam Touitou General Framework for Metric Optimization Problems with Delay or with Deadlines. 60-71 2019 FOCS https://doi.org/10.1109/FOCS.2019.00013 conf/focs/2019 db/conf/focs/focs2019.html#AzarT19 Yossi Azar Yuval Emek Rob van Stee Danny Vainstein The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays. 1-10 2019 SPAA https://doi.org/10.1145/3323165.3323180 conf/spaa/2019 db/conf/spaa/spaa2019.html#AzarESV19

Yossi Azar Noam Touitou General Framework for Metric Optimization Problems with Delay or with Deadlines. 2019 abs/1904.07131 CoRR http://arxiv.org/abs/1904.07131 db/journals/corr/corr1904.html#abs-1904-07131

Yossi Azar Jaya Prakash Champati Ben Liang 0001 2-Approximation algorithm for a generalization of scheduling on unrelated parallel machines. 39-43 2018 139 Inf. Process. Lett. https://doi.org/10.1016/j.ipl.2018.07.005 db/journals/ipl/ipl139.html#AzarCL18

Yossi Azar Sarel Cohen An improved algorithm for online machine minimization. 128-133 2018 46 Oper. Res. Lett. 1 https://doi.org/10.1016/j.orl.2017.11.013 db/journals/orl/orl46.html#AzarC18

Yossi Azar Eric Horvitz Eyal Lubetzky Yuval Peres Dafna Shahaf Tractable near-optimal policies for crawling. 8099-8103 2018 115 Proc. Natl. Acad. Sci. USA 32 https://doi.org/10.1073/pnas.1801519115 https://www.wikidata.org/entity/Q64912237 db/journals/pnas/pnas115.html#AzarHLPS18

Yossi Azar Noam Touitou Improved Online Algorithm for Weighted Flow Time. 427-437 2018 FOCS https://doi.org/10.1109/FOCS.2018.00048 https://doi.ieeecomputersociety.org/10.1109/FOCS.2018.00048 conf/focs/2018 db/conf/focs/focs2018.html#AzarT18 Yossi Azar Ashish Chiplunkar Haim Kaplan Prophet Secretary: Surpassing the 1-1/e Barrier. 303-318 2018 EC https://doi.org/10.1145/3219166.3219182 conf/sigecom/2018 db/conf/sigecom/sigecom2018.html#AzarCK18 Yossi Azar Ilan Reuven Cohen Debmalya Panigrahi Randomized Algorithms for Online Vector Load Balancing. 980-991 2018 SODA https://doi.org/10.1137/1.9781611975031.63 conf/soda/2018 db/conf/soda/soda2018.html#AzarCP18 Noga Alon Yossi Azar Mark Berlin The Price of Bounded Preemption. 301-310 2018 SPAA https://doi.org/10.1145/3210377.3210407 conf/spaa/2018 db/conf/spaa/spaa2018.html#AlonAB18 Yossi Azar Amit Jacob Fanani Deterministic Min-Cost Matching with Delays. 21-35 2018 WAOA https://doi.org/10.1007/978-3-030-04693-4_2 conf/waoa/2018 db/conf/waoa/waoa2018.html#AzarF18 Yossi Azar Hannah Bast Grzegorz Herman 26th Annual European Symposium on Algorithms, ESA 2018, Helsinki, Finland, August 20-22, 2018 ESA Schloss Dagstuhl - Leibniz-Zentrum für Informatik LIPIcs 112 2018 978-3-95977-081-1 http://www.dagstuhl.de/dagpub/978-3-95977-081-1 db/conf/esa/esa2018.html

Yossi Azar Amit Jacob Fanani Deterministic Min-Cost Matching with Delays. 2018 abs/1806.03708 CoRR http://arxiv.org/abs/1806.03708 db/journals/corr/corr1806.html#abs-1806-03708

Yossi Azar Ashish Chiplunkar Shay Kutten Noam Touitou Set Cover and Vertex Cover with Delay. 2018 abs/1807.08543 CoRR http://arxiv.org/abs/1807.08543 db/journals/corr/corr1807.html#abs-1807-08543

Yossi Azar Oren Gilon Scheduling with Deadlines and Buffer Management with Processing Requirements. 1246-1262 2017 78 Algorithmica 4 https://doi.org/10.1007/s00453-016-0257-1 db/journals/algorithmica/algorithmica78.html#AzarG17

Yossi Azar Martin Hoefer 0001 Idan Maor Rebecca Reiffenhäuser Berthold Vöcking Truthful mechanism design via correlated tree rounding. 445-469 2017 163 Math. Program. 1-2 https://doi.org/10.1007/s10107-016-1068-5 db/journals/mp/mp163.html#AzarHMRV17

Itai Ashlagi Yossi Azar Moses Charikar Ashish Chiplunkar Ofir Geri Haim Kaplan Rahul Makhijani Yuyi Wang 0001 Roger Wattenhofer Min-Cost Bipartite Perfect Matching with Delays. 1:1-1:20 2017 APPROX-RANDOM https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.1 conf/approx/2017 db/conf/approx/approx2017.html#AshlagiACCGKMWW17 Yossi Azar Michal Feldman Nick Gravin Alan Roytman Liquid Price of Anarchy. 3-15 2017 SAGT https://doi.org/10.1007/978-3-319-66700-3_1 conf/sagt/2017 db/conf/sagt/sagt2017.html#AzarFGR17 Yossi Azar Ilan Reuven Cohen Alan Roytman Online Lower Bounds via Duality. 1038-1050 2017 SODA https://doi.org/10.1137/1.9781611974782.66 http://dl.acm.org/citation.cfm?id=3039752 conf/soda/2017 db/conf/soda/soda2017.html#AzarCR17 Yossi Azar Ashish Chiplunkar Haim Kaplan Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays. 1051-1061 2017 SODA https://doi.org/10.1137/1.9781611974782.67 http://dl.acm.org/citation.cfm?id=3039753 conf/soda/2017 db/conf/soda/soda2017.html#AzarCK17 Yossi Azar Danny Vainstein Tight Bounds for Clairvoyant Dynamic Bin Packing. 77-86 2017 SPAA https://doi.org/10.1145/3087556.3087570 conf/spaa/2017 db/conf/spaa/spaa2017.html#AzarV17 Yossi Azar Arun Ganesh Rong Ge 0001 Debmalya Panigrahi Online service with delay. 551-563 2017 STOC https://doi.org/10.1145/3055399.3055475 conf/stoc/2017 db/conf/stoc/stoc2017.html#AzarGGP17 Amir Ban Yossi Azar Yishay Mansour The Strategy of Experts for Repeated Predictions. 44-57 2017 WINE https://doi.org/10.1007/978-3-319-71924-5_4 conf/wine/2017 db/conf/wine/wine2017.html#BanAM17

Yossi Azar Arun Ganesh Rong Ge 0001 Debmalya Panigrahi Online Service with Delay. 2017 abs/1708.05611 CoRR http://arxiv.org/abs/1708.05611 db/journals/corr/corr1708.html#abs-1708-05611

Amir Ban Yossi Azar Yishay Mansour The Strategy of Experts for Repeated Predictions. 2017 abs/1710.00537 CoRR http://arxiv.org/abs/1710.00537 db/journals/corr/corr1710.html#abs-1710-00537

Yossi Azar Ashish Chiplunkar Haim Kaplan Prophet Secretary: Surpassing the 1-1/e Barrier. 2017 abs/1711.01834 CoRR http://arxiv.org/abs/1711.01834 db/journals/corr/corr1711.html#abs-1711-01834

Yossi Azar Noam Touitou Improved Online Algorithm for Weighted Flow Time. 2017 abs/1712.10273 CoRR http://arxiv.org/abs/1712.10273 db/journals/corr/corr1712.html#abs-1712-10273

Yossi Azar Niv Buchbinder Kamal Jain How to Allocate Goods in an Online Market? 589-601 2016 74 Algorithmica 2 https://doi.org/10.1007/s00453-014-9964-7 db/journals/algorithmica/algorithmica74.html#AzarBJ16

Yossi Azar Niv Buchbinder T.-H. Hubert Chan Shahar Chen Ilan Reuven Cohen Anupam Gupta 0001 Zhiyi Huang 0002 Ning Kang 0001 Viswanath Nagarajan Joseph Naor Debmalya Panigrahi Online Algorithms for Covering and Packing Problems with Convex Objectives. 148-157 2016 FOCS https://doi.org/10.1109/FOCS.2016.24 https://doi.ieeecomputersociety.org/10.1109/FOCS.2016.24 conf/focs/2016 db/conf/focs/focs2016.html#AzarBCCCG0KNNP16 Yossi Azar Amir Ban Yishay Mansour When Should an Expert Make a Prediction? 125-142 2016 EC https://doi.org/10.1145/2940716.2940729 conf/sigecom/2016 db/conf/sigecom/sigecom2016.html#AzarBM16 Yossi Azar Amir Epstein Lukasz Jez Adi Vardi Make-to-Order Integrated Scheduling and Distribution. 140-154 2016 SODA https://doi.org/10.1137/1.9781611974331.ch11 http://dl.acm.org/citation.cfm?id=2884446 conf/soda/2016 db/conf/soda/soda2016.html#AzarEJV16 Yossi Azar Ilan Reuven Cohen Amos Fiat Alan Roytman Packing Small Vectors. 1511-1525 2016 SODA https://doi.org/10.1137/1.9781611974331.ch103 http://dl.acm.org/citation.cfm?id=2884538 conf/soda/2016 db/conf/soda/soda2016.html#AzarCFR16 Yossi Azar Adi Vardi Dynamic Traveling Repair Problem with an Arbitrary Time Window. 14-26 2016 WAOA https://doi.org/10.1007/978-3-319-51741-4_2 conf/waoa/2016 db/conf/waoa/waoa2016.html#AzarV16

Yossi Azar Ilan Reuven Cohen Alan Roytman Online Lower Bounds via Duality. 2016 abs/1604.01697 CoRR http://arxiv.org/abs/1604.01697 db/journals/corr/corr1604.html#AzarCR16

Amir Ban Yossi Azar Yishay Mansour When should an expert make a prediction? 2016 abs/1605.07483 CoRR http://arxiv.org/abs/1605.07483 db/journals/corr/corr1605.html#BanAM16

Yossi Azar Ashish Chiplunkar Haim Kaplan Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays. 2016 abs/1610.05155 CoRR http://arxiv.org/abs/1610.05155 db/journals/corr/corr1610.html#AzarCK16

Yossi Azar Lisa Fleischer Kamal Jain Vahab S. Mirrokni Zoya Svitkina Optimal Coordination Mechanisms for Unrelated Machine Scheduling. 489-500 2015 63 Oper. Res. 3 https://doi.org/10.1287/opre.2015.1363 db/journals/ior/ior63.html#AzarFJMS15

Yossi Azar Oren Gilon Buffer Management for Packets with Processing Times. 47-58 2015 ESA https://doi.org/10.1007/978-3-662-48350-3_5 conf/esa/2015 db/conf/esa/esa2015.html#AzarG15 Yossi Azar Ilan Reuven Cohen Serving in the Dark should be done Non-Uniformly. 91-102 2015 ICALP (1) https://doi.org/10.1007/978-3-662-47672-7_8 conf/icalp/2015-1 db/conf/icalp/icalp2015-1.html#AzarC15 Yossi Azar Martin Hoefer 0001 Idan Maor Rebecca Reiffenhäuser Berthold Vöcking Truthful Mechanism Design via Correlated Tree Rounding. 415-432 2015 EC https://doi.org/10.1145/2764468.2764503 conf/sigecom/2015 db/conf/sigecom/sigecom2015.html#AzarHMRV15 Yossi Azar Inna Kalp-Shaltiel Brendan Lucier Ishai Menache Joseph Naor Jonathan Yaniv Truthful Online Scheduling with Commitments. 715-732 2015 EC https://doi.org/10.1145/2764468.2764535 conf/sigecom/2015 db/conf/sigecom/sigecom2015.html#AzarKLMNY15 Yossi Azar Nikhil R. Devanur Zhiyi Huang 0002 Debmalya Panigrahi Speed Scaling in the Non-clairvoyant Model. 133-142 2015 SPAA https://doi.org/10.1145/2755573.2755582 conf/spaa/2015 db/conf/spaa/spaa2015.html#AzarD0P15

Yossi Azar Adi Vardi TSP with Time Windows and Service Time. 2015 abs/1501.06158 CoRR http://arxiv.org/abs/1501.06158 db/journals/corr/corr1501.html#AzarV15

Yossi Azar Inna Kalp-Shaltiel Brendan Lucier Ishai Menache Joseph Naor Jonathan Yaniv Truthful Online Scheduling with Commitments. 2015 abs/1507.00773 CoRR http://arxiv.org/abs/1507.00773 db/journals/corr/corr1507.html#AzarKLMNY15

Yossi Azar Michal Feldman Nick Gravin Alan Roytman Liquid Price of Anarchy. 2015 abs/1511.01132 CoRR http://arxiv.org/abs/1511.01132 db/journals/corr/corr1511.html#AzarFGR15

Yossi Azar Seny Kamara Ishai Menache Mariana Raykova 0001 F. Bruce Shepherd Co-Location-Resistant Clouds. 9-20 2014 CCSW https://doi.org/10.1145/2664168.2664179 conf/ccs/2014ccsw db/conf/ccs/ccsw2014.html#AzarKM0S14 Yossi Azar Uriel Feige Michal Feldman Moshe Tennenholtz Sequential decision making with vector outcomes. 195-206 2014 ITCS https://doi.org/10.1145/2554797.2554817 conf/innovations/2014 db/conf/innovations/innovations2014.html#AzarFFT14 Yossi Azar Matthias Englert Iftah Gamzu Eytan Kidron Generalized Reordering Buffer Management. 87-98 2014 STACS https://doi.org/10.4230/LIPIcs.STACS.2014.87 conf/stacs/2014 db/conf/stacs/stacs2014.html#AzarEGK14

Yossi Azar Ilan Reuven Cohen Debmalya Panigrahi Online Covering with Convex Objectives and Applications. 2014 abs/1412.3507 CoRR http://arxiv.org/abs/1412.3507 db/journals/corr/corr1412.html#AzarCP14

Yossi Azar Seny Kamara Ishai Menache Mariana Raykova 0001 F. Bruce Shepherd Co-Location-Resistant Clouds. 713 2014 2014 IACR Cryptol. ePrint Arch. http://eprint.iacr.org/2014/713 db/journals/iacr/iacr2014.html#AzarKM0S14a

Baruch Awerbuch Yossi Azar Amir Epstein The Price of Routing Unsplittable Flow. 160-177 2013 42 SIAM J. Comput. 1 https://doi.org/10.1137/070702370 db/journals/siamcomp/siamcomp42.html#AwerbuchAE13

Yossi Azar Umang Bhaskar Lisa Fleischer Debmalya Panigrahi Online Mixed Packing and Covering. 85-100 2013 SODA https://doi.org/10.1137/1.9781611973105.6 conf/soda/2013 db/conf/soda/soda2013.html#AzarBFP13 Yossi Azar Naama Ben-Aroya Nikhil R. Devanur Navendu Jain Cloud scheduling with setup cost. 298-304 2013 SPAA https://doi.org/10.1145/2486159.2486195 conf/spaa/2013 db/conf/spaa/spaa2013.html#AzarBDJ13 Yossi Azar Ilan Reuven Cohen Iftah Gamzu The loss of serving in the dark. 951-960 2013 STOC https://doi.org/10.1145/2488608.2488729 conf/stoc/2013 db/conf/stoc/stoc2013.html#AzarCG13 Yossi Azar Ilan Reuven Cohen Seny Kamara F. Bruce Shepherd Tight bounds for online vector bin packing. 961-970 2013 STOC https://doi.org/10.1145/2488608.2488730 conf/stoc/2013 db/conf/stoc/stoc2013.html#AzarCKS13

Yossi Azar Adi Vardi Colored Packets with Deadlines and Metric Space Transition Cost. 2013 CoRR http://arxiv.org/abs/1309.0251 abs/1309.0251 db/journals/corr/corr1309.html#AzarV13

Yossi Azar Uriel Feige Moshe Tennenholtz Michal Feldman Mastering multi-player games. 897-904 2012 AAMAS http://dl.acm.org/citation.cfm?id=2343825 conf/atal/2012 db/conf/atal/aamas2012.html#AzarFTF12 Yossi Azar Iftah Gamzu Efficient Submodular Function Maximization under Linear Packing Constraints. 38-50 2012 ICALP (1) https://doi.org/10.1007/978-3-642-31594-7_4 conf/icalp/2012-1 db/conf/icalp/icalp2012-1.html#AzarG12 Nikhil R. Devanur Balasubramanian Sivan Yossi Azar Asymptotically optimal algorithm for stochastic adwords. 388-404 2012 EC https://doi.org/10.1145/2229012.2229043 conf/sigecom/2012 db/conf/sigecom/sigecom2012.html#DevanurSA12

Yossi Azar Debmalya Panigrahi Online Load Balancing on Unrelated Machines with Startup Costs http://arxiv.org/abs/1203.4619 2012 CoRR abs/1203.4619 db/journals/corr/corr1203.html#abs-1203-4619

Yossi Azar Uriel Feige Iftah Gamzu Thomas Moscibroda Prasad Raghavendra Buffer Management for Colored Packets with Deadlines. 738-756 2011 49 Theory Comput. Syst. 4 https://doi.org/10.1007/s00224-011-9346-3 db/journals/mst/mst49.html#AzarFGMR11

Yossi Azar Aleksander Madry Thomas Moscibroda Debmalya Panigrahi Aravind Srinivasan Maximum bipartite flow in networks with adaptive channel width. 2577-2587 2011 412 Theor. Comput. Sci. 24 https://doi.org/10.1016/j.tcs.2010.10.023 db/journals/tcs/tcs412.html#AzarMMPS11

Yossi Azar Iftah Gamzu Ran Roth Submodular Max-SAT. 323-334 2011 ESA https://doi.org/10.1007/978-3-642-23719-5_28 conf/esa/2011 db/conf/esa/esa2011.html#AzarGR11 Yossi Azar Ori Gurel-Gurevich Eyal Lubetzky Thomas Moscibroda Optimal Discovery Strategies in White Space Networks. 713-722 2011 ESA https://doi.org/10.1007/978-3-642-23719-5_60 conf/esa/2011 db/conf/esa/esa2011.html#AzarGLM11 Yossi Azar Ety Khaitzin Prompt Mechanism for Ad Placement over Time. 19-30 2011 SAGT https://doi.org/10.1007/978-3-642-24829-0_4 conf/sagt/2011 db/conf/sagt/sagt2011.html#AzarK11 Yossi Azar Iftah Gamzu Ranking with Submodular Valuations. 1070-1079 2011 SODA https://doi.org/10.1137/1.9781611973082.81 http://dl.acm.org/citation.cfm?id=2133117 conf/soda/2011 db/conf/soda/soda2011.html#AzarG11 Yossi Azar Aviv Nisgav Boaz Patt-Shamir Recommender systems with non-binary grades. 245-252 2011 SPAA https://doi.org/10.1145/1989493.1989528 conf/spaa/2011 db/conf/spaa/spaa2011.html#AzarNP11

Yossi Azar Uriel Feige Daniel Glasner A Preemptive Algorithm for Maximizing Disjoint Paths on Trees. 517-537 2010 57 Algorithmica 3 https://doi.org/10.1007/s00453-009-9305-4 db/journals/algorithmica/algorithmica57.html#AzarFG10

Yossi Azar Iftah Gamzu Shai Gutner Truthful unsplittable flow for large capacity networks. 2010 6 ACM Trans. Algorithms 2 https://doi.org/10.1145/1721837.1721852 db/journals/talg/talg6.html#AzarGG10 36:1-36:20

Yossi Azar Shay Kutten Boaz Patt-Shamir Distributed error confinement. 2010 6 ACM Trans. Algorithms 3 https://doi.org/10.1145/1798596.1798601 https://www.wikidata.org/entity/Q130983753 db/journals/talg/talg6.html#AzarKP10 48:1-48:23

Yossi Azar Niv Buchbinder Kamal Jain How to Allocate Goods in an Online Market? 51-62 2010 ESA (2) https://doi.org/10.1007/978-3-642-15781-3_5 conf/esa/2010-2 db/conf/esa/esa2010-2.html#AzarBJ10 Yossi Azar Nikhil R. Devanur Kamal Jain Yuval Rabani Monotonicity in Bargaining Networks. 817-826 2010 SODA https://doi.org/10.1137/1.9781611973075.67 conf/soda/2010 db/conf/soda/soda2010.html#AzarDJR10

Yossi Azar Ori Gurel-Gurevich Eyal Lubetzky Thomas Moscibroda Optimal whitespace synchronization strategies http://arxiv.org/abs/1006.3334 2010 CoRR abs/1006.3334 db/journals/corr/corr1006.html#abs-1006-3334

Yossi Azar Iftah Gamzu Ranking with Submodular Valuations http://arxiv.org/abs/1007.2503 2010 CoRR abs/1007.2503 db/journals/corr/corr1007.html#abs-1007-2503

Yossi Azar Iftah Gamzu Efficient Submodular Function Maximization under Linear Packing Constraints http://arxiv.org/abs/1007.3604 2010 CoRR abs/1007.3604 db/journals/corr/corr1007.html#abs-1007-3604

Yossi Azar Thomas Erlebach Foreword. 455-456 2009 53 Algorithmica 4 https://doi.org/10.1007/s00453-008-9262-3 db/journals/algorithmica/algorithmica53.html#AzarE09

Noga Alon Baruch Awerbuch Yossi Azar Boaz Patt-Shamir Tell Me Who I Am: An Interactive Recommendation System. 261-279 2009 45 Theory Comput. Syst. 2 https://doi.org/10.1007/s00224-008-9100-7 db/journals/mst/mst45.html#AlonAAP09

Noga Alon Baruch Awerbuch Yossi Azar Niv Buchbinder Joseph Naor The Online Set Cover Problem. 361-370 2009 39 SIAM J. Comput. 2 https://doi.org/10.1137/060661946 db/journals/siamcomp/siamcomp39.html#AlonAABN09

Noga Alon Yossi Azar Shai Gutner Admission control to minimize rejections and online set cover with repetitions. 2009 6 ACM Trans. Algorithms 1 https://doi.org/10.1145/1644015.1644026 db/journals/talg/talg6.html#AlonAG09 11:1-11:13

Yossi Azar Benjamin E. Birnbaum Anna R. Karlin C. Thach Nguyen On Revenue Maximization in Second-Price Ad Auctions. 155-166 2009 ESA https://doi.org/10.1007/978-3-642-04128-0_14 conf/esa/2009 db/conf/esa/esa2009.html#AzarBKN09 Yossi Azar Benjamin E. Birnbaum L. Elisa Celis Nikhil R. Devanur Yuval Peres Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks. 293-302 2009 FOCS https://doi.org/10.1109/FOCS.2009.33 https://doi.ieeecomputersociety.org/10.1109/FOCS.2009.33 conf/focs/2009 db/conf/focs/focs2009.html#AzarBCDP09 Yossi Azar Aleksander Madry Thomas Moscibroda Debmalya Panigrahi Aravind Srinivasan Maximum Bipartite Flow in Networks with Adaptive Channel Width. 351-362 2009 ICALP (2) https://doi.org/10.1007/978-3-642-02930-1_29 conf/icalp/2009-2 db/conf/icalp/icalp2009-2.html#AzarMMPS09 Yossi Azar Uriel Feige Iftah Gamzu Thomas Moscibroda Prasad Raghavendra Buffer management for colored packets with deadlines. 319-327 2009 SPAA https://doi.org/10.1145/1583991.1584068 conf/spaa/2009 db/conf/spaa/spaa2009.html#AzarFGMR09 Yossi Azar Iftah Gamzu Xiaoxin Yin Multiple intents re-ranking. 669-678 2009 STOC https://doi.org/10.1145/1536414.1536505 conf/stoc/2009 db/conf/stoc/stoc2009.html#AzarGY09

Yossi Azar Benjamin E. Birnbaum L. Elisa Celis Nikhil R. Devanur Yuval Peres Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks http://arxiv.org/abs/0907.4356 2009 CoRR abs/0907.4356 db/journals/corr/corr0907.html#abs-0907-4356

Yossi Azar Benjamin E. Birnbaum Anna R. Karlin C. Thach Nguyen On Revenue Maximization in Second-Price Ad Auctions http://arxiv.org/abs/0908.2834 2009 CoRR abs/0908.2834 db/journals/corr/corr0908.html#abs-0908-2834

Baruch Awerbuch Yossi Azar Zvi Lotker Boaz Patt-Shamir Mark R. Tuttle Collaborate with Strangers to Find Own Preferences. 27-41 2008 42 Theory Comput. Syst. 1 https://doi.org/10.1007/s00224-007-9016-7 db/journals/mst/mst42.html#AwerbuchALPT08

Yossi Azar Benjamin E. Birnbaum Anna R. Karlin Claire Mathieu C. Thach Nguyen Improved Approximation Algorithms for Budgeted Allocations. 186-197 2008 ICALP (1) https://doi.org/10.1007/978-3-540-70575-8_16 conf/icalp/2008-1 db/conf/icalp/icalp2008-1.html#AzarBKMN08 Yossi Azar Iftah Gamzu Truthful Unification Framework for Packing Integer Programs with Choices. 833-844 2008 ICALP (1) https://doi.org/10.1007/978-3-540-70575-8_68 conf/icalp/2008-1 db/conf/icalp/icalp2008-1.html#AzarG08 Baruch Awerbuch Yossi Azar Amir Epstein Vahab S. Mirrokni Alexander Skopalik Fast convergence to nearly optimal solutions in potential games. 264-273 2008 EC https://doi.org/10.1145/1386790.1386832 conf/sigecom/2008 db/conf/sigecom/sigecom2008.html#AwerbuchAEMS08 Baruch Awerbuch Yossi Azar Rohit Khandekar Fast load balancing via bounded best response. 314-322 2008 SODA http://dl.acm.org/citation.cfm?id=1347082.1347117 conf/soda/2008 db/conf/soda/soda2008.html#AwerbuchAK08 Yossi Azar Kamal Jain Vahab S. Mirrokni (Almost) optimal coordination mechanisms for unrelated machine scheduling. 323-332 2008 SODA http://dl.acm.org/citation.cfm?id=1347082.1347118 conf/soda/2008 db/conf/soda/soda2008.html#AzarJM08 Yossi Azar Uriel Feige Daniel Glasner A Preemptive Algorithm for Maximizing Disjoint Paths on Trees. 319-330 2008 SWAT https://doi.org/10.1007/978-3-540-69903-3_29 conf/swat/2008 db/conf/swat/swat2008.html#AzarFG08

Noga Alon Yossi Azar Shai Gutner Admission Control to Minimize Rejections and Online Set Cover with Repetitions http://arxiv.org/abs/0803.2842 2008 CoRR abs/0803.2842 db/journals/corr/corr0803.html#abs-0803-2842

Yossi Azar Iftah Gamzu Shai Gutner Truthful Unsplittable Flow for Large Capacity Networks http://arxiv.org/abs/0804.2112 2008 CoRR abs/0804.2112 db/journals/corr/corr0804.html#abs-0804-2112

Yossi Azar Benjamin E. Birnbaum Anna R. Karlin C. Thach Nguyen Thinking Twice about Second-Price Ad Auctions http://arxiv.org/abs/0809.1895 2008 CoRR abs/0809.1895 db/journals/corr/corr0809.html#abs-0809-1895

Nir Avrahami Yossi Azar Minimizing Total Flow Time and Total Completion Time with Immediate Dispatching. 253-268 2007 47 Algorithmica 3 https://doi.org/10.1007/s00453-006-0193-6 db/journals/algorithmica/algorithmica47.html#AvrahamiA07

Nir Andelman Yossi Azar Motti Sorani Truthful Approximation Mechanisms for Scheduling Selfish Related Machines. 423-436 2007 40 Theory Comput. Syst. 4 https://doi.org/10.1007/s00224-006-1316-9 db/journals/mst/mst40.html#AndelmanAS07

Yossi Azar Iftah Gamzu Shai Gutner Truthful unsplittable flow for large capacity networks. 320-329 2007 conf/spaa/2007 SPAA https://doi.org/10.1145/1248377.1248432 db/conf/spaa/spaa2007.html#AzarGG07

Yossi Azar Oded Regev 0001 Combinatorial Algorithms for the Unsplittable Flow Problem. 49-66 2006 44 Algorithmica 1 https://doi.org/10.1007/s00453-005-1172-z db/journals/algorithmica/algorithmica44.html#AzarR06

Yossi Azar Arik Litichevskey Maximizing Throughput in Multi-Queue Switches. 69-90 2006 45 Algorithmica 1 https://doi.org/10.1007/s00453-005-1190-x db/journals/algorithmica/algorithmica45.html#AzarL06

Yossi Azar Yossi Richter An improved algorithm for CIOQ switches. 282-295 2006 2 ACM Trans. Algorithms 2 https://doi.org/10.1145/1150334.1150342 db/journals/talg/talg2.html#AzarR06

Noga Alon Baruch Awerbuch Yossi Azar Niv Buchbinder Joseph Naor A general approach to online network optimization problems. 640-660 2006 2 ACM Trans. Algorithms 4 https://doi.org/10.1145/1198513.1198522 db/journals/talg/talg2.html#AlonAABN06

Baruch Awerbuch Yossi Azar Yossi Richter Dekel Tsur Tradeoffs in worst-case equilibria. 200-209 2006 361 Theor. Comput. Sci. 2-3 https://doi.org/10.1016/j.tcs.2006.05.010 db/journals/tcs/tcs361.html#AwerbuchART06

Yossi Azar Amir Epstein Leah Epstein Load balancing of temporary tasks in the lp norm. 314-328 2006 361 Theor. Comput. Sci. 2-3 https://doi.org/10.1016/j.tcs.2006.05.016 db/journals/tcs/tcs361.html#AzarEE06

Yossi Azar Amos Fiat Meital Levy N. S. Narayanaswamy An improved algorithm for online coloring of intervals with bandwidth. 18-27 2006 363 Theor. Comput. Sci. 1 https://doi.org/10.1016/j.tcs.2006.06.014 db/journals/tcs/tcs363.html#AzarFLN06

Noga Alon Baruch Awerbuch Yossi Azar Boaz Patt-Shamir Tell me who I am: an interactive recommendation system. 1-10 2006 conf/spaa/2006 SPAA https://doi.org/10.1145/1148109.1148111 db/conf/spaa/spaa2006.html#AlonAAP06 Yossi Azar Yoel Chaiutin Optimal Node Routing. 596-607 2006 conf/stacs/2006 STACS https://doi.org/10.1007/11672142_49 db/conf/stacs/stacs2006.html#AzarC06 Yossi Azar Nir Levy Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers. 5-16 2006 conf/swat/2006 SWAT https://doi.org/10.1007/11785293_4 db/conf/swat/swat2006.html#AzarL06 Yossi Azar Thomas Erlebach Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings ESA Lecture Notes in Computer Science 4168 Springer 2006 3-540-38875-3 https://doi.org/10.1007/11841036 https://www.wikidata.org/entity/Q56384695 db/conf/esa/esa2006.html

Yossi Azar Yossi Richter Management of Multi-Queue Switches in QoS Networks. 81-96 2005 43 Algorithmica 1-2 https://doi.org/10.1007/s00453-005-1159-9 db/journals/algorithmica/algorithmica43.html#AzarR05

Yossi Azar Avrim Blum David P. Bunde Yishay Mansour Combining Online Algorithms for Acceptance and Rejection. 105-117 2005 1 Theory Comput. 1 https://doi.org/10.4086/toc.2005.v001a006 db/journals/toc/toc1.html#AzarBBM05

Yossi Azar Rafi Zachut Packet Routing and Information Gathering in Lines, Rings and Trees. 484-495 2005 conf/esa/2005 ESA https://doi.org/10.1007/11561071_44 db/conf/esa/esa2005.html#AzarZ05 Noga Alon Yossi Azar Shai Gutner Admission control to minimize rejections and online set cover with repetitions. 238-244 2005 conf/spaa/2005 SPAA https://doi.org/10.1145/1073970.1074010 db/conf/spaa/spaa2005.html#AlonAG05 Baruch Awerbuch Yossi Azar Zvi Lotker Boaz Patt-Shamir Mark R. Tuttle Collaborate with strangers to find own preferences. 263-269 2005 conf/spaa/2005 SPAA https://doi.org/10.1145/1073970.1074014 db/conf/spaa/spaa2005.html#AwerbuchALPT05 Nir Andelman Yossi Azar Motti Sorani Truthful Approximation Mechanisms for Scheduling Selfish Related Machines. 69-82 https://doi.org/10.1007/978-3-540-31856-9_6 2005 conf/stacs/2005 STACS db/conf/stacs/stacs2005.html#AndelmanAS05 Baruch Awerbuch Yossi Azar Amir Epstein The Price of Routing Unsplittable Flow. 57-66 2005 conf/stoc/2005 STOC https://doi.org/10.1145/1060590.1060599 db/conf/stoc/stoc2005.html#AwerbuchAE05 Yossi Azar Amir Epstein Convex programming for scheduling unrelated parallel machines. 331-337 2005 conf/stoc/2005 STOC https://doi.org/10.1145/1060590.1060639 db/conf/stoc/stoc2005.html#AzarE05 Yossi Azar Amir Epstein The Hardness of Network Design for Unsplittable Flow with Selfish Users. 41-54 2005 conf/waoa/2005 WAOA https://doi.org/10.1007/11671411_4 db/conf/waoa/waoa2005.html#AzarE05 Yossi Azar Yossi Richter An improved algorithm for CIOQ switches. 2005 conf/dagstuhl/2005P5031 Algorithms for Optimization with Incomplete Information http://drops.dagstuhl.de/opus/volltexte/2005/67 db/conf/dagstuhl/P5031.html#AzarR05

Yossi Azar Leah Epstein Yossi Richter Gerhard J. Woeginger All-norm approximation algorithms. 120-133 2004 52 J. Algorithms 2 https://doi.org/10.1016/j.jalgor.2004.02.003 db/journals/jal/jal52.html#AzarERW04

Yossi Azar Edith Cohen Amos Fiat Haim Kaplan Harald Räcke Optimal oblivious routing in polynomial time. 383-394 2004 69 J. Comput. Syst. Sci. 3 https://doi.org/10.1016/j.jcss.2004.04.010 db/journals/jcss/jcss69.html#AzarCFKR04

Yossi Azar Leah Epstein On-Line Load Balancing of Temporary Tasks on Identical Machines. 347-352 2004 18 SIAM J. Discret. Math. 2 https://doi.org/10.1137/S0895480197329296 db/journals/siamdm/siamdm18.html#AzarE04

Baruch Awerbuch Yossi Azar Yair Bartal On-line generalized Steiner problem. 313-324 2004 324 Theor. Comput. Sci. 2-3 https://doi.org/10.1016/j.tcs.2004.05.021 db/journals/tcs/tcs324.html#AwerbuchAB04

Yossi Azar Arik Litichevskey Maximizing Throughput in Multi-queue Switches. 53-64 https://doi.org/10.1007/978-3-540-30140-0_7 2004 conf/esa/2004 ESA db/conf/esa/esa2004.html#AzarL04 Yossi Azar Yossi Richter An Improved Algorithm for CIOQ Switches. 65-76 https://doi.org/10.1007/978-3-540-30140-0_8 2004 conf/esa/2004 ESA db/conf/esa/esa2004.html#AzarR04 Noga Alon Baruch Awerbuch Yossi Azar Niv Buchbinder Joseph Naor A general approach to online network optimization problems. 577-586 2004 conf/soda/2004 SODA http://dl.acm.org/citation.cfm?id=982792.982879 db/conf/soda/soda2004.html#AlonAABN04 Yossi Azar Yossi Richter The zero-one principle for switching networks. 64-71 2004 conf/stoc/2004 STOC https://doi.org/10.1145/1007352.1007369 db/conf/stoc/stoc2004.html#AzarR04 Yossi Azar Shai Taub All-Norm Approximation for Scheduling on Identical Machines. 298-310 https://doi.org/10.1007/978-3-540-27810-8_26 2004 conf/swat/2004 SWAT db/conf/swat/swat2004.html#AzarT04 Yossi Azar Online Packet Switching. 1-5 https://doi.org/10.1007/978-3-540-31833-0_1 2004 conf/waoa/2004 WAOA db/conf/waoa/waoa2004.html#Azar04

Amitai Armon Yossi Azar Leah Epstein Temporary Tasks Assignment Resolved. 295-314 2003 36 Algorithmica 3 https://doi.org/10.1007/s00453-003-1017-6 db/journals/algorithmica/algorithmica36.html#ArmonAE03

Amitai Armon Yossi Azar Leah Epstein Oded Regev 0001 On-line restricted assignment of temporary tasks with unknown durations. 67-72 2003 85 Inf. Process. Lett. 2 https://doi.org/10.1016/S0020-0190(02)00350-2 db/journals/ipl/ipl85.html#ArmonAER03

Ran Adler Yossi Azar Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms. 113-129 2003 6 J. Sched. 2 db/journals/scheduling/scheduling6.html#AdlerA03 https://doi.org/10.1023/A:1022933824889

Ittai Abraham Baruch Awerbuch Yossi Azar Yair Bartal Dahlia Malkhi Elan Pavlov A Generic Scheme for Building Overlay Networks in Adversarial Scenarios. 40 2003 conf/ipps/2003 IPDPS https://doi.org/10.1109/IPDPS.2003.1213125 https://doi.ieeecomputersociety.org/10.1109/IPDPS.2003.1213125 db/conf/ipps/ipdps2003.html#AbrahamAABMP03 Yossi Azar Shay Kutten Boaz Patt-Shamir Distributed error confinement. 33-42 2003 conf/podc/2003 PODC https://doi.org/10.1145/872035.872041 https://www.wikidata.org/entity/Q130993655 db/conf/podc/podc2003.html#AzarKP03 Nir Avrahami Yossi Azar Minimizing total flow time and total completion time with immediate dispatching. 11-18 2003 conf/spaa/2003 SPAA https://doi.org/10.1145/777412.777415 db/conf/spaa/spaa2003.html#AvrahamiA03 Yossi Azar Avrim Blum Yishay Mansour Combining online algorithms for rejection and acceptance. 159-163 2003 conf/spaa/2003 SPAA https://doi.org/10.1145/777412.777438 db/conf/spaa/spaa2003.html#AzarBM03 Yossi Azar Yossi Richter Management of multi-queue switches in QoS networks. 82-89 2003 conf/stoc/2003 STOC https://doi.org/10.1145/780542.780556 db/conf/stoc/stoc2003.html#AzarR03 Noga Alon Baruch Awerbuch Yossi Azar Niv Buchbinder Joseph Naor The online set cover problem. 100-105 2003 conf/stoc/2003 STOC https://doi.org/10.1145/780542.780558 db/conf/stoc/stoc2003.html#AlonAA03 Yossi Azar Edith Cohen Amos Fiat Haim Kaplan Harald Räcke Optimal oblivious routing in polynomial time. 383-388 2003 conf/stoc/2003 STOC https://doi.org/10.1145/780542.780599 db/conf/stoc/stoc2003.html#AzarCFKR03 Baruch Awerbuch Yossi Azar Adam Meyerson Reducing truth-telling online mechanisms to online optimization. 503-510 2003 conf/stoc/2003 STOC https://doi.org/10.1145/780542.780616 db/conf/stoc/stoc2003.html#AwerbuchAM03 Baruch Awerbuch Yossi Azar Yossi Richter Dekel Tsur Tradeoffs in Worst-Case Equilibria. 41-52 https://doi.org/10.1007/978-3-540-24592-6_4 2003 conf/waoa/2003 WAOA db/conf/waoa/waoa2003.html#AwerbuchART03 Yossi Azar Amir Epstein Leah Epstein Load Balancing of Temporary Tasks in the lp Norm. 53-66 https://doi.org/10.1007/978-3-540-24592-6_5 2003 conf/waoa/2003 WAOA db/conf/waoa/waoa2003.html#AzarEE03

Yossi Azar Joan Boyar Lene M. Favrholdt Kim S. Larsen Morten N. Nielsen Leah Epstein Fair versus Unrestricted Bin Packing. 181-196 2002 34 Algorithmica 2 https://doi.org/10.1007/s00453-002-0965-6 db/journals/algorithmica/algorithmica34.html#AzarBFLNE02

Yossi Azar Leah Epstein On-line scheduling with precedence constraints. 169-180 2002 119 Discret. Appl. Math. 1-2 db/journals/dam/dam119.html#AzarE02 https://doi.org/10.1016/S0166-218X(01)00272-4 https://www.wikidata.org/entity/Q127333533

Baruch Awerbuch Yossi Azar Stefano Leonardi 0001 Oded Regev 0001 Minimizing the Flow Time Without Migration. 1370-1382 2002 31 SIAM J. Comput. 5 https://doi.org/10.1137/S009753970037446X db/journals/siamcomp/siamcomp31.html#AwerbuchALR02

Yossi Azar Oded Regev 0001 Jirí Sgall Gerhard J. Woeginger Off-line temporary tasks assignment. 419-428 2002 287 Theor. Comput. Sci. 2 db/journals/tcs/tcs287.html#AzarRSW02 https://doi.org/10.1016/S0304-3975(01)00254-7

Amitai Armon Yossi Azar Leah Epstein Oded Regev 0001 Temporary tasks assignment resolved. 116-124 2002 conf/soda/2002 SODA http://dl.acm.org/citation.cfm?id=545381.545396 db/conf/soda/soda2002.html#ArmonAER02 Yossi Azar Leah Epstein Yossi Richter Gerhard J. Woeginger All-Norm Approximation Algorithms. 288-297 2002 conf/swat/2002 SWAT https://doi.org/10.1007/3-540-45471-3_30 db/conf/swat/swat2002.html#AzarERW02

Adi Avidor Yossi Azar Jirí Sgall Ancient and New Algorithms for Load Balancing in the lp Norm. 422-441 2001 29 Algorithmica 3 https://doi.org/10.1007/s004530010051 db/journals/algorithmica/algorithmica29.html#AvidorAS01

Baruch Awerbuch Yossi Azar Amos Fiat Stefano Leonardi 0001 Adi Rosén On-Line Competitive Algorithms for Call Admission in Optical Networks. 29-43 2001 31 Algorithmica 1 https://doi.org/10.1007/s00453-001-0039-1 db/journals/algorithmica/algorithmica31.html#AwerbuchAFLR01

Baruch Awerbuch Yossi Azar Serge A. Plotkin Orli Waarts Competitive Routing of Virtual Circuits with Unknown Duration. 385-397 2001 62 J. Comput. Syst. Sci. 3 db/journals/jcss/jcss62.html#AwerbuchAPW01 https://doi.org/10.1006/jcss.1999.1662

Yossi Azar Oded Regev 0001 On-line bin-stretching. 17-41 2001 268 Theor. Comput. Sci. 1 db/journals/tcs/tcs268.html#AzarR01 https://doi.org/10.1016/S0304-3975(00)00258-9

Yossi Azar Oded Regev 0001 Strongly Polynomial Algorithms for the Unsplittable Flow Problem. 15-29 2001 conf/ipco/2001 IPCO https://doi.org/10.1007/3-540-45535-3_2 db/conf/ipco/ipco2001.html#AzarR01 Yossi Azar Meir Feder Eyal Lubetzky Doron Rajwan Nadav Shulman The Multicast Bandwidth Advantage in Serving a Web Site. 88-99 2001 conf/ngc/2001 Networked Group Communication https://doi.org/10.1007/3-540-45546-9_7 db/conf/ngc/ngc2001.html#AzarFLRS01 Yossi Azar Amos Fiat Anna R. Karlin Frank McSherry Jared Saia Spectral analysis of data. 619-626 2001 conf/stoc/2001 STOC https://doi.org/10.1145/380752.380859 db/conf/stoc/stoc2001.html#AzarFKMS01 Baruch Awerbuch Yossi Azar Oded Regev 0001 Maximizing job benefits on-line. 42-50 https://doi.org/10.1007/3-540-44436-X_6 2000 conf/approx/2000 APPROX db/conf/approx/approx2000.html#AwerbuchAR00 Yossi Azar Leah Epstein On-Line Scheduling with Precedence Constraints. 164-174 https://doi.org/10.1007/3-540-44985-X_15 2000 conf/swat/2000 SWAT db/conf/swat/swat2000.html#AzarE00 Yossi Azar Leah Epstein Rob van Stee Resource Augmentation in Load Balancing. 189-199 https://doi.org/10.1007/3-540-44985-X_17 2000 conf/swat/2000 SWAT db/conf/swat/swat2000.html#AzarES00 Yossi Azar Joan Boyar Lene M. Favrholdt Kim S. Larsen Morten N. Nielsen Fair versus Unrestricted Bin Packing. 200-213 https://doi.org/10.1007/3-540-44985-X_18 2000 conf/swat/2000 SWAT db/conf/swat/swat2000.html#AzarBFLN00

Yossi Azar Yair Bartal Esteban Feuerstein Amos Fiat Stefano Leonardi 0001 Adi Rosén On Capital Investment. 22-36 1999 25 Algorithmica 1 https://doi.org/10.1007/PL00009281 db/journals/algorithmica/algorithmica25.html#AzarBFFLR99

Yossi Azar Andrei Z. Broder Anna R. Karlin Eli Upfal Balanced Allocations. 180-200 1999 29 SIAM J. Comput. 1 db/journals/siamcomp/siamcomp29.html#AzarBKU99 https://doi.org/10.1137/S0097539795288490 https://www.wikidata.org/entity/Q60960865

Yossi Azar Oded Regev 0001 Off-Line Temporary Tasks Assignment. 163-171 https://doi.org/10.1007/3-540-48481-7_15 1999 conf/esa/1999 ESA db/conf/esa/esa99.html#AzarR99 Noga Alon Uri Arad Yossi Azar Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths. 16-27 1999 conf/random/1999 RANDOM-APPROX db/conf/random/random1999.html#AlonAA99 https://doi.org/10.1007/978-3-540-48413-4_3 Ran Adler Yossi Azar Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms. 1-10 1999 conf/soda/1999 SODA http://dl.acm.org/citation.cfm?id=314500.314512 db/conf/soda/soda99.html#AdlerA99 Baruch Awerbuch Yossi Azar Stefano Leonardi 0001 Oded Regev 0001 Minimizing the Flow Time Without Migration. 198-205 1999 conf/stoc/1999 STOC https://doi.org/10.1145/301250.301304 db/conf/stoc/stoc1999.html#AwerbuchALR99

Noga Alon Yossi Azar János Csirik Leah Epstein Sergey V. Sevastianov Arjen P. A. Vestjens Gerhard J. Woeginger On-Line and Off-Line Approximation Algorithms for Vector Covering Problems. 104-118 1998 21 Algorithmica 1 db/journals/algorithmica/algorithmica21.html#AlonACESVW98 https://doi.org/10.1007/PL00009203

Yossi Azar Rajeev Motwani 0001 Joseph Naor Approximating Probability Distributions Using Small Sample Spaces. 151-171 1998 18 Comb. 2 https://doi.org/10.1007/PL00009813 db/journals/combinatorica/combinatorica18.html#AzarMN98

Baruch Awerbuch Yossi Azar Avrim Blum Santosh S. Vempala New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen. 254-262 1998 28 SIAM J. Comput. 1 db/journals/siamcomp/siamcomp28.html#AwerbuchABV98 https://doi.org/10.1137/S009753979528826X

Yossi Azar Leah Epstein Approximation Schemes for Covering and Scheduling on Related Machines. 39-47 https://doi.org/10.1007/BFb0053962 1998 conf/approx/1998 APPROX db/conf/approx/approx1998.html#AzarE98 Yossi Azar Oded Regev 0001 On-Line Bin-Stretching. 71-81 1998 conf/random/1998 RANDOM https://doi.org/10.1007/3-540-49543-6_7 db/conf/random/random1998.html#AzarR98 Adi Avidor Yossi Azar Jirí Sgall Ancient and New Algorithms for Load Balancing in the Lp Norm. 426-435 1998 conf/soda/1998 SODA db/conf/soda/soda98.html#AvidorAS98 http://dl.acm.org/citation.cfm?id=314613.314774

James Aspnes Yossi Azar Amos Fiat Serge A. Plotkin Orli Waarts On-line routing of virtual circuits with applications to load balancing and machine scheduling. 486-504 1997 44 J. ACM 3 https://doi.org/10.1145/258128.258201 db/journals/jacm/jacm44.html#AspnesAFPW97

Yossi Azar Bala Kalyanasundaram Serge A. Plotkin Kirk Pruhs Orli Waarts On-Line Load Balancing of Temporary Tasks. 93-110 1997 22 J. Algorithms 1 db/journals/jal/jal22.html#AzarKPPW97 https://doi.org/10.1006/jagm.1995.0799

Yossi Azar Leah Epstein On Two Dimensional Packing. 290-310 1997 25 J. Algorithms 2 db/journals/jal/jal25.html#AzarE97 https://doi.org/10.1006/jagm.1997.0876

Yossi Azar Leah Epstein On-Line Machine Covering. 23-36 1997 conf/esa/1997 ESA db/conf/esa/esa97.html#AzarE97 https://doi.org/10.1007/3-540-63397-9_3 Baruch Awerbuch Yossi Azar Buy-at-Bulk Network Design. 542-547 1997 conf/focs/1997 FOCS https://doi.org/10.1109/SFCS.1997.646143 https://doi.ieeecomputersociety.org/10.1109/SFCS.1997.646143 db/conf/focs/focs97.html#AwerbuchA97 Yossi Azar Leah Epstein On-Line Load Balancing of Temporary Tasks on Identical Machines. 119-125 1997 conf/istcs/1997 ISTCS https://doi.org/10.1109/ISTCS.1997.595163 https://doi.ieeecomputersociety.org/10.1109/ISTCS.1997.595163 db/conf/istcs/istcs1997.html#AzarE97 Noga Alon Yossi Azar Gerhard J. Woeginger Tal Yadid Approximation Schemes for Scheduling. 493-500 1997 conf/soda/1997 SODA db/conf/soda/soda97.html#AlonAWY97 http://dl.acm.org/citation.cfm?id=314161.314371

Yossi Azar Andrei Z. Broder Anna R. Karlin Nathan Linial Steven J. Phillips Biased Random Walks. 1-18 1996 16 Comb. 1 db/journals/combinatorica/combinatorica16.html#AzarBKLP96 https://doi.org/10.1007/BF01300124

Yossi Azar Joseph Naor Raphael Rom Routing Strategies for Fast Networks. 165-173 1996 45 IEEE Trans. Computers 2 db/journals/tc/tc45.html#AzarNR96 https://doi.org/10.1109/12.485380 http://doi.ieeecomputersociety.org/10.1109/12.485380

Yossi Azar On-line Load Balancing. 178-195 1996 conf/dagstuhl/1996oa Online Algorithms db/conf/dagstuhl/oa96.html#Azar96 https://doi.org/10.1007/BFb0029569 Baruch Awerbuch Yossi Azar Amos Fiat Stefano Leonardi 0001 Adi Rosén On-line Competive Algorithms for Call Admission in Optical Networks. 431-444 1996 conf/esa/1996 ESA db/conf/esa/esa96.html#AwerbuchAFLR96 https://doi.org/10.1007/3-540-61680-2_73 Yossi Azar Yair Bartal Esteban Feuerstein Amos Fiat Stefano Leonardi 0001 Adi Rosén On Capital Investment. 429-441 1996 conf/icalp/1996 ICALP db/conf/icalp/icalp96.html#AzarBFFLR96 https://doi.org/10.1007/3-540-61440-0_148 Baruch Awerbuch Yossi Azar Amos Fiat Packet Routing via Min-Cost Circuit Routing. 37-42 1996 conf/istcs/1996 ISTCS db/conf/istcs/istcs1996.html#AwerbuchAF96 Baruch Awerbuch Yossi Azar Yair Bartal On-line Generalized Steiner Problem. 68-74 1996 conf/soda/1996 SODA db/conf/soda/soda96.html#AwerbuchAB96 http://dl.acm.org/citation.cfm?id=313852.313888 Baruch Awerbuch Yossi Azar Amos Fiat Frank Thomson Leighton Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract). 519-530 1996 conf/stoc/1996 STOC https://doi.org/10.1145/237814.238000 db/conf/stoc/stoc1996.html#AwerbuchAFL96 Yossi Azar Leah Epstein On Two Dimensional Packing. 321-332 1996 conf/swat/1996 SWAT db/conf/swat/swat96.html#AzarE96 https://doi.org/10.1007/3-540-61422-2_142

Yossi Azar Joseph Naor Raphael Rom The Competitiveness of On-Line Assignments. 221-237 1995 18 J. Algorithms 2 db/journals/jal/jal18.html#AzarNR95 https://doi.org/10.1006/jagm.1995.1008

Baruch Awerbuch Yossi Azar Competitive multicast routing. 107-114 1995 1 Wirel. Networks 1 db/journals/winet/winet1.html#AwerbuchA95 https://doi.org/10.1007/BF01196262

Baruch Awerbuch Yossi Azar Edward F. Grove Ming-Yang Kao P. Krishnan Jeffrey Scott Vitter Load Balancing in the Lp Norm. 383-391 1995 conf/focs/1995 FOCS db/conf/focs/focs95.html#AwerbuchAGKKV95 https://doi.org/10.1109/SFCS.1995.492494 https://doi.ieeecomputersociety.org/10.1109/SFCS.1995.492494 Baruch Awerbuch Yossi Azar Avrim Blum Santosh S. Vempala Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. 277-283 1995 conf/stoc/STOC27 STOC https://doi.org/10.1145/225058.225139 db/conf/stoc/stoc1995.html#AwerbuchABV95

Yossi Azar Lower Bounds for Insertion Methods for TSP. 285-292 1994 3 Comb. Probab. Comput. db/journals/cpc/cpc3.html#Azar94 https://doi.org/10.1017/S096354830000119X

Yossi Azar Andrei Z. Broder Alan M. Frieze On the Problem of Approximating the Number of Bases of a Matroid. 9-11 1994 50 Inf. Process. Lett. 1 db/journals/ipl/ipl50.html#AzarBF94 https://doi.org/10.1016/0020-0190(94)90037-X https://www.wikidata.org/entity/Q57401584

Yossi Azar Andrei Z. Broder Anna R. Karlin On-Line Load Balancing. 73-84 1994 130 Theor. Comput. Sci. 1 db/journals/tcs/tcs130.html#AzarBK94 https://doi.org/10.1016/0304-3975(94)90153-8

Local Optimization of Global Objectives: Competitive Distributed Deadlock Resolution and Resource Allocation Baruch Awerbuch Yossi Azar 240-249 conf/focs/FOCS35 1994 FOCS db/conf/focs/focs94.html#AwerbuchA94 https://doi.org/10.1109/SFCS.1994.365690 https://doi.ieeecomputersociety.org/10.1109/SFCS.1994.365690 Baruch Awerbuch Yossi Azar Serge A. Plotkin Orli Waarts Competitive Routing of Virtual Circuits with Unknown Duration. 321-327 1994 conf/soda/1994 SODA db/conf/soda/soda94.html#AwerbuchAPW94 http://dl.acm.org/citation.cfm?id=314464.314508 Yossi Azar Andrei Z. Broder Anna R. Karlin Eli Upfal Balanced allocations (extended abstract). 593-602 1994 conf/stoc/STOC26 STOC https://doi.org/10.1145/195058.195412 db/conf/stoc/stoc1994.html#AzarBKU94

Noga Alon Yossi Azar On-Line Steine Trees in the Euclidean Plane. 113-121 1993 10 Discret. Comput. Geom. db/journals/dcg/dcg10.html#AlonA93 https://doi.org/10.1007/BF02573969

Throughput-Competitive On-Line Routing Baruch Awerbuch Yossi Azar Serge A. Plotkin 32-40 conf/focs/FOCS34 1993 FOCS db/conf/focs/focs93.html#AwerbuchAP93 https://doi.org/10.1109/SFCS.1993.366884 https://doi.ieeecomputersociety.org/10.1109/SFCS.1993.366884 Yossi Azar Andrei Z. Broder Mark S. Manasse On-line Choice of On-line Algorithms. 432-440 1993 conf/soda/1993 SODA db/conf/soda/soda93.html#AzarBM93 http://dl.acm.org/citation.cfm?id=313559.313847 James Aspnes Yossi Azar Amos Fiat Serge A. Plotkin Orli Waarts On-line load balancing with applications to machine scheduling and virtual circuit routing. 623-631 1993 conf/stoc/STOC25 STOC https://doi.org/10.1145/167088.167248 db/conf/stoc/stoc1993.html#AspnesAFPW93 Yossi Azar Bala Kalyanasundaram Serge A. Plotkin Kirk Pruhs Orli Waarts Online Load Balancing of Temporary Tasks. 119-130 1993 conf/wads/1993 WADS db/conf/wads/wads93.html#AzarKPPW93 https://doi.org/10.1007/3-540-57155-8_241

Yossi Azar Lower Bounds for Threshold and Symmetric Functions in Parallel Computation. 329-338 1992 21 SIAM J. Comput. 2 db/journals/siamcomp/siamcomp21.html#Azar92 https://doi.org/10.1137/0221024

Noga Alon Yossi Azar On-Line Steiner Trees in the Euclidean Plane. 337-343 1992 conf/compgeom/1992 SCG https://doi.org/10.1145/142675.142744 db/conf/compgeom/compgeom92.html#AlonA92 On-line Load Balancing (Extended Abstract) Yossi Azar Andrei Z. Broder Anna R. Karlin 218-225 conf/focs/FOCS33 1992 FOCS db/conf/focs/focs92.html#AzarBK92 https://doi.org/10.1109/SFCS.1992.267770 https://doi.ieeecomputersociety.org/10.1109/SFCS.1992.267770 Yossi Azar Joseph Naor Raphael Rom Routing Strategies for Fast Networks. 170-179 1992 conf/infocom/1992 INFOCOM db/conf/infocom/infocom1992-1.html#AzarNR92 https://doi.org/10.1109/INFCOM.1992.263551 https://doi.ieeecomputersociety.org/10.1109/INFCOM.1992.263551 Yossi Azar Joseph Naor Raphael Rom The Competitiveness of On-Line Assignments. 203-210 1992 conf/soda/1992 SODA http://dl.acm.org/citation.cfm?id=139404.139450 db/conf/soda/soda92.html#AzarNR92 Noga Alon Yossi Azar Comparison-Sorting and Selecting in Totally Monotone Matrices. 403-408 1992 conf/soda/1992 SODA http://dl.acm.org/citation.cfm?id=139404.139484 db/conf/soda/soda92.html#AlonA92 Biased Random Walks Yossi Azar Andrei Z. Broder Anna R. Karlin Nathan Linial Steven J. Phillips 1-9 conf/stoc/STOC24 1992 STOC db/conf/stoc/stoc92.html#AzarBKLP92 https://doi.org/10.1145/129712.129713

Noga Alon Yossi Azar Parallel comparison algorithms for approximation problems. 97-122 1991 11 Comb. 2 db/journals/combinatorica/combinatorica11.html#AlonA91 https://doi.org/10.1007/BF01206355

Yossi Azar Parallel Comparison Merging of Many-Ordered Lists. 275-285 1991 83 Theor. Comput. Sci. 2 db/journals/tcs/tcs83.html#Azar91 https://doi.org/10.1016/0304-3975(91)90279-B

Noga Alon Yossi Azar Yiftach Ravid Universal sequences for complete graphs. 25-28 1990 27 Discret. Appl. Math. 1-2 https://doi.org/10.1016/0166-218X(90)90125-V db/journals/dam/dam27.html#AlonAR90

Yossi Azar Nicholas Pippenger Parallel selection. 49-58 1990 27 Discret. Appl. Math. 1-2 https://doi.org/10.1016/0166-218X(90)90128-Y db/journals/dam/dam27.html#AzarP90

Noga Alon Yossi Azar Finding an Approximate Maximum. 258-267 1989 18 SIAM J. Comput. 2 db/journals/siamcomp/siamcomp18.html#AlonA89 https://doi.org/10.1137/0218017

Yossi Azar Parallel comparison sorting and searching Tel Aviv University, Israel 1988 Tel Aviv University Library https://tau.primo.exlibrisgroup.com/permalink/972TAU_INST/bai57q/alma9932915098804146

Noga Alon Yossi Azar The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms. 1178-1192 1988 17 SIAM J. Comput. 6 db/journals/siamcomp/siamcomp17.html#AlonA88 https://doi.org/10.1137/0217074

Noga Alon Yossi Azar Sorting, Approximate Sorting, and Searching in Rounds. 269-280 1988 1 SIAM J. Discret. Math. 3 db/journals/siamdm/siamdm1.html#AlonA88 https://doi.org/10.1137/0401028

Parallel Comparison Algorithms for Approximation Problems Noga Alon Yossi Azar 194-203 conf/focs/FOCS29 1988 FOCS db/conf/focs/focs88.html#AlonA88 https://doi.org/10.1109/SFCS.1988.21937 https://doi.ieeecomputersociety.org/10.1109/SFCS.1988.21937

Yossi Azar Uzi Vishkin Tight Comparison Bounds on the Complexity of Parallel Sorting. 458-464 1987 16 SIAM J. Comput. 3 db/journals/siamcomp/siamcomp16.html#AzarV87 https://doi.org/10.1137/0216032

The Average Complexity of Deterministic and Randomized Parallel Comparison Sorting Algorithms Noga Alon Yossi Azar 489-498 conf/focs/FOCS28 1987 FOCS db/conf/focs/focs87.html#AlonA87 https://doi.org/10.1109/SFCS.1987.54 https://doi.ieeecomputersociety.org/10.1109/SFCS.1987.54 Tight Complexity Bounds for Parallel Comparison Sorting Noga Alon Yossi Azar Uzi Vishkin 502-510 conf/focs/FOCS27 1986 FOCS db/conf/focs/focs86.html#AlonAV86 https://doi.org/10.1109/SFCS.1986.57 https://doi.ieeecomputersociety.org/10.1109/SFCS.1986.57 Ittai Abraham Ran Adler Kunal Agrawal 0001 Noga Alon Nir Andelman Uri Arad Amitai Armon Itai Ashlagi James Aspnes Adi Avidor Nir Avrahami Baruch Awerbuch Amir Ban Yair Bartal Hannah Bast Naama Ben-Aroya Mark Berlin Umang Bhaskar Benjamin E. Birnbaum Avrim Blum Allan Borodin Joan Boyar Andrei Z. Broder Niv Buchbinder David P. Bunde L. Elisa Celis Yoel Chaiutin Jaya Prakash Champati T.-H. Hubert Chan Moses Charikar Vaggos Chatziafratis Shahar Chen Ashish Chiplunkar Gui Citovsky Edith Cohen Ilan Reuven Cohen Sarel Cohen János Csirik Nikhil R. Devanur Yuval Emek Matthias Englert Tomer Epshtein Amir Epstein Leah Epstein Thomas Erlebach Amit Jacob Fanani Lene M. Favrholdt Meir Feder Uriel Feige Michal Feldman Esteban Feuerstein Amos Fiat Lisa Fleischer Alan M. Frieze Federico Fusco 0001 Iftah Gamzu Arun Ganesh Rong Ge 0001 Ofir Geri Oren Gilon Daniel Glasner Nick Gravin Edward F. Grove Anupam Gupta 0001 Ori Gurel-Gurevich Shai Gutner Grzegorz Herman Martin Hoefer 0001 Eric Horvitz Zhiyi Huang 0002 Kamal Jain Navendu Jain Lukasz Jez Inna Kalp-Shaltiel Bala Kalyanasundaram Seny Kamara Ning Kang 0001 Ming-Yang Kao Haim Kaplan Anna R. Karlin Ety Khaitzin Rohit Khandekar Eytan Kidron P. Krishnan Shay Kutten Kim S. Larsen Frank Thomson Leighton Stefano Leonardi 0001 Roie Levin Meital Levy Nir Levy Shahar Lewkowicz Ben Liang 0001 Nathan Linial Arik Litichevskey Zvi Lotker Eyal Lubetzky Brendan Lucier Chay Machluf Aleksander Madry Mohammad Mahdian Rahul Makhijani Dahlia Malkhi Mark S. Manasse Yishay Mansour Idan Maor Claire Mathieu Frank McSherry Ishai Menache Adam Meyerson Vahab S. Mirrokni Thomas Moscibroda Rajeev Motwani 0001 Viswanath Nagarajan Joseph Naor N. S. Narayanaswamy C. Thach Nguyen Morten N. Nielsen Aviv Nisgav Debmalya Panigrahi Boaz Patt-Shamir Elan Pavlov Yuval Peres Eldad Peretz Steven J. Phillips Nicholas Pippenger Serge A. Plotkin Kirk Pruhs Yuval Rabani Harald Räcke Prasad Raghavendra Anand Rajagopalan Doron Rajwan Yiftach Ravid Mariana Raykova 0001 Oded Regev 0001 Rebecca Reiffenhäuser Runtian Ren Yossi Richter Raphael Rom Adi Rosén Ran Roth Alan Roytman Jared Saia Kineret Segal Sergey SevastyanovSergey V. Sevastianov Jirí Sgall Dafna Shahaf F. Bruce Shepherd Nadav Shulman Julian Shun Balasubramanian Sivan Alexander Skopalik Motti Sorani Aravind Srinivasan Rob van Stee Varun Suriyanarayana Zoya Svitkina Shai Taub Moshe Tennenholtz Noam Touitou Dekel Tsur Mark R. Tuttle Eli Upfal Danny Vainstein Adi Vardi Or Vardi Santosh S. Vempala Arjen P. A. Vestjens Uzi Vishkin Jeffrey Scott Vitter Berthold Vöcking Orli Waarts Yuyi Wang 0001 Roger Wattenhofer Gerhard J. Woeginger Tal Yadid Jonathan Yaniv Xiaoxin Yin Rafi Zachut