default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYossi Azar
Person information
- affiliation: Tel Aviv University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j77]Yossi Azar
, Amos Fiat, Federico Fusco:
An α-regret analysis of adversarial bilateral trade. Artif. Intell. 337: 104231 (2024)- [c139]Yossi Azar, Shahar Lewkowicz, Danny Vainstein:
List Update with Delays or Time Windows. ICALP 2024: 15:1-15:20 - 2023
- [j76]Yossi Azar, Chay Machluf, Boaz Patt-Shamir, Noam Touitou:
Competitive Vertex Recoloring. Algorithmica 85(7): 2001-2027 (2023) - [j75]Yossi Azar, Ilan Reuven Cohen, Iftah Gamzu:
The loss of serving in the dark. Inf. Process. Lett. 180: 106334 (2023) - [j74]Yossi Azar, Julian Shun:
Introduction to the Special Issue for SPAA'21. ACM Trans. Parallel Comput. 10(4): 17:1 (2023) - [c138]Yossi Azar, Danny Vainstein:
Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering. ICALP 2023: 13:1-13:18 - [c137]Yossi Azar, Debmalya Panigrahi, Noam Touitou:
Discrete-Smoothness in Online Algorithms with Predictions. NeurIPS 2023 - [i36]Yossi Azar, Shahar Lewkowicz, Danny Vainstein:
List Update with Delays or Time Windows. CoRR abs/2304.06565 (2023) - [i35]Yossi Azar, Danny Vainstein:
Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering. CoRR abs/2305.01367 (2023) - 2022
- [c136]Yossi Azar, Chay Machluf, Boaz Patt-Shamir, Noam Touitou:
Competitive Vertex Recoloring. ICALP 2022: 13:1-13:20 - [c135]Yossi Azar, Eldad Peretz, Noam Touitou:
Distortion-Oblivious Algorithms for Scheduling on Multiple Machines. ISAAC 2022: 16:1-16:18 - [c134]Yossi Azar, Amos Fiat, Federico Fusco:
An $\alpha$-regret analysis of Adversarial Bilateral Trade. NeurIPS 2022 - [c133]Yossi Azar, Debmalya Panigrahi, Noam Touitou:
Online Graph Algorithms with Predictions. SODA 2022: 35-66 - [c132]Yossi Azar, Stefano Leonardi, Noam Touitou:
Distortion-Oblivious Algorithms for Minimizing Flow Time. SODA 2022: 252-274 - [i34]Yossi Azar, Amos Fiat, Federico Fusco:
An α-regret analysis of Adversarial Bilateral Trade. CoRR abs/2210.06846 (2022) - 2021
- [j73]Yossi Azar, Arun Ganesh, Rong Ge, Debmalya Panigrahi:
Online Service with Delay. ACM Trans. Algorithms 17(3): 23:1-23:31 (2021) - [j72]Noga Alon, Yossi Azar, Mark Berlin:
The Price of Bounded Preemption. ACM Trans. Parallel Comput. 8(1): 3:1-3:21 (2021) - [c131]Danny Vainstein, Vaggos Chatziafratis, Gui Citovsky, Anand Rajagopalan, Mohammad Mahdian, Yossi Azar:
Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering. AISTATS 2021: 559-567 - [c130]Yossi Azar, Runtian Ren, Danny Vainstein:
The Min-Cost Matching with Concave Delays Problem. SODA 2021: 301-320 - [c129]Yossi Azar, Stefano Leonardi, Noam Touitou:
Flow time scheduling with uncertain processing time. STOC 2021: 1070-1080 - [e3]Kunal Agrawal, Yossi Azar:
SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, 6-8 July, 2021. ACM 2021, ISBN 978-1-4503-8070-6 [contents] - [i33]Danny Vainstein, Vaggos Chatziafratis, Gui Citovsky, Anand Rajagopalan, Mohammad Mahdian, Yossi Azar:
Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering. CoRR abs/2101.10639 (2021) - [i32]Yossi Azar, Stefano Leonardi, Noam Touitou:
Flow Time Scheduling with Uncertain Processing Time. CoRR abs/2103.05604 (2021) - [i31]Yossi Azar, Stefano Leonardi, Noam Touitou:
Distortion-Oblivious Algorithms for Minimizing Flow Time. CoRR abs/2109.08424 (2021) - [i30]Yossi Azar, Debmalya Panigrahi, Noam Touitou:
Online Graph Algorithms with Predictions. CoRR abs/2112.11831 (2021) - 2020
- [j71]Yossi Azar, Amit Jacob Fanani:
Deterministic Min-Cost Matching with Delays. Theory Comput. Syst. 64(4): 572-592 (2020) - [c128]Noga Alon, Yossi Azar, Danny Vainstein:
Hierarchical Clustering: A 0.585 Revenue Approximation. COLT 2020: 153-162 - [c127]Yossi Azar, Ashish Chiplunkar, Shay Kutten, Noam Touitou:
Set Cover with Delay - Clairvoyance Is Not Required. ESA 2020: 8:1-8:21 - [c126]Yossi Azar, Noam Touitou:
Beyond Tree Embeddings - a Deterministic Framework for Network Design with Deadlines or Delay. FOCS 2020: 1368-1379 - [i29]Yossi Azar, Noam Touitou:
Beyond Tree Embeddings - a Deterministic Framework for Network Design with Deadlines or Delay. CoRR abs/2004.07946 (2020) - [i28]Noga Alon, Yossi Azar, Danny Vainstein:
Hierarchical Clustering: a 0.585 Revenue Approximation. CoRR abs/2006.01933 (2020) - [i27]Yossi Azar, Runtian Ren, Danny Vainstein:
The Min-Cost Matching with Concave Delays Problem. CoRR abs/2011.02017 (2020)
2010 – 2019
- 2019
- [j70]Yossi Azar, Danny Vainstein:
Tight Bounds for Clairvoyant Dynamic Bin Packing. ACM Trans. Parallel Comput. 6(3): 15:1-15:21 (2019) - [c125]Yossi Azar, Allan Borodin, Michal Feldman, Amos Fiat, Kineret Segal:
Efficient Allocation of Free Stuff. AAMAS 2019: 918-925 - [c124]Yossi Azar, Noam Touitou:
General Framework for Metric Optimization Problems with Delay or with Deadlines. FOCS 2019: 60-71 - [c123]Yossi Azar, Yuval Emek, Rob van Stee, Danny Vainstein:
The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays. SPAA 2019: 1-10 - [i26]Yossi Azar, Noam Touitou:
General Framework for Metric Optimization Problems with Delay or with Deadlines. CoRR abs/1904.07131 (2019) - 2018
- [j69]Yossi Azar, Jaya Prakash Champati, Ben Liang:
2-Approximation algorithm for a generalization of scheduling on unrelated parallel machines. Inf. Process. Lett. 139: 39-43 (2018) - [j68]Yossi Azar, Sarel Cohen:
An improved algorithm for online machine minimization. Oper. Res. Lett. 46(1): 128-133 (2018) - [j67]Yossi Azar, Eric Horvitz, Eyal Lubetzky, Yuval Peres, Dafna Shahaf:
Tractable near-optimal policies for crawling. Proc. Natl. Acad. Sci. USA 115(32): 8099-8103 (2018) - [c122]Yossi Azar, Noam Touitou:
Improved Online Algorithm for Weighted Flow Time. FOCS 2018: 427-437 - [c121]Yossi Azar, Ashish Chiplunkar, Haim Kaplan:
Prophet Secretary: Surpassing the 1-1/e Barrier. EC 2018: 303-318 - [c120]Yossi Azar, Ilan Reuven Cohen, Debmalya Panigrahi:
Randomized Algorithms for Online Vector Load Balancing. SODA 2018: 980-991 - [c119]Noga Alon, Yossi Azar, Mark Berlin:
The Price of Bounded Preemption. SPAA 2018: 301-310 - [c118]Yossi Azar, Amit Jacob Fanani:
Deterministic Min-Cost Matching with Delays. WAOA 2018: 21-35 - [e2]Yossi Azar, Hannah Bast, Grzegorz Herman:
26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland. LIPIcs 112, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-081-1 [contents] - [i25]Yossi Azar, Amit Jacob Fanani:
Deterministic Min-Cost Matching with Delays. CoRR abs/1806.03708 (2018) - [i24]Yossi Azar, Ashish Chiplunkar, Shay Kutten, Noam Touitou:
Set Cover and Vertex Cover with Delay. CoRR abs/1807.08543 (2018) - 2017
- [j66]Yossi Azar, Oren Gilon:
Scheduling with Deadlines and Buffer Management with Processing Requirements. Algorithmica 78(4): 1246-1262 (2017) - [j65]Yossi Azar, Martin Hoefer, Idan Maor, Rebecca Reiffenhäuser, Berthold Vöcking:
Truthful mechanism design via correlated tree rounding. Math. Program. 163(1-2): 445-469 (2017) - [c117]Itai Ashlagi, Yossi Azar, Moses Charikar, Ashish Chiplunkar, Ofir Geri, Haim Kaplan, Rahul Makhijani, Yuyi Wang, Roger Wattenhofer:
Min-Cost Bipartite Perfect Matching with Delays. APPROX-RANDOM 2017: 1:1-1:20 - [c116]Yossi Azar, Michal Feldman, Nick Gravin, Alan Roytman:
Liquid Price of Anarchy. SAGT 2017: 3-15 - [c115]Yossi Azar, Ilan Reuven Cohen, Alan Roytman:
Online Lower Bounds via Duality. SODA 2017: 1038-1050 - [c114]Yossi Azar, Ashish Chiplunkar, Haim Kaplan:
Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays. SODA 2017: 1051-1061 - [c113]Yossi Azar, Danny Vainstein:
Tight Bounds for Clairvoyant Dynamic Bin Packing. SPAA 2017: 77-86 - [c112]Yossi Azar, Arun Ganesh, Rong Ge, Debmalya Panigrahi:
Online service with delay. STOC 2017: 551-563 - [c111]Amir Ban, Yossi Azar, Yishay Mansour:
The Strategy of Experts for Repeated Predictions. WINE 2017: 44-57 - [i23]Yossi Azar, Arun Ganesh, Rong Ge, Debmalya Panigrahi:
Online Service with Delay. CoRR abs/1708.05611 (2017) - [i22]Amir Ban, Yossi Azar, Yishay Mansour:
The Strategy of Experts for Repeated Predictions. CoRR abs/1710.00537 (2017) - [i21]Yossi Azar, Ashish Chiplunkar, Haim Kaplan:
Prophet Secretary: Surpassing the 1-1/e Barrier. CoRR abs/1711.01834 (2017) - [i20]Yossi Azar, Noam Touitou:
Improved Online Algorithm for Weighted Flow Time. CoRR abs/1712.10273 (2017) - 2016
- [j64]Yossi Azar, Niv Buchbinder, Kamal Jain:
How to Allocate Goods in an Online Market? Algorithmica 74(2): 589-601 (2016) - [c110]Yossi Azar, Niv Buchbinder, T.-H. Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang, Ning Kang, Viswanath Nagarajan, Joseph Naor, Debmalya Panigrahi:
Online Algorithms for Covering and Packing Problems with Convex Objectives. FOCS 2016: 148-157 - [c109]Yossi Azar, Amir Ban, Yishay Mansour:
When Should an Expert Make a Prediction? EC 2016: 125-142 - [c108]Yossi Azar, Amir Epstein, Lukasz Jez, Adi Vardi:
Make-to-Order Integrated Scheduling and Distribution. SODA 2016: 140-154 - [c107]Yossi Azar, Ilan Reuven Cohen, Amos Fiat, Alan Roytman:
Packing Small Vectors. SODA 2016: 1511-1525 - [c106]Yossi Azar, Adi Vardi:
Dynamic Traveling Repair Problem with an Arbitrary Time Window. WAOA 2016: 14-26 - [i19]Yossi Azar, Ilan Reuven Cohen, Alan Roytman:
Online Lower Bounds via Duality. CoRR abs/1604.01697 (2016) - [i18]Amir Ban, Yossi Azar, Yishay Mansour:
When should an expert make a prediction? CoRR abs/1605.07483 (2016) - [i17]Yossi Azar, Ashish Chiplunkar, Haim Kaplan:
Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays. CoRR abs/1610.05155 (2016) - 2015
- [j63]Yossi Azar, Lisa Fleischer, Kamal Jain, Vahab S. Mirrokni, Zoya Svitkina:
Optimal Coordination Mechanisms for Unrelated Machine Scheduling. Oper. Res. 63(3): 489-500 (2015) - [c105]Yossi Azar, Oren Gilon:
Buffer Management for Packets with Processing Times. ESA 2015: 47-58 - [c104]Yossi Azar, Ilan Reuven Cohen:
Serving in the Dark should be done Non-Uniformly. ICALP (1) 2015: 91-102 - [c103]Yossi Azar, Martin Hoefer, Idan Maor, Rebecca Reiffenhäuser, Berthold Vöcking:
Truthful Mechanism Design via Correlated Tree Rounding. EC 2015: 415-432 - [c102]Yossi Azar, Inna Kalp-Shaltiel, Brendan Lucier, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Truthful Online Scheduling with Commitments. EC 2015: 715-732 - [c101]Yossi Azar, Nikhil R. Devanur, Zhiyi Huang, Debmalya Panigrahi:
Speed Scaling in the Non-clairvoyant Model. SPAA 2015: 133-142 - [i16]Yossi Azar, Adi Vardi:
TSP with Time Windows and Service Time. CoRR abs/1501.06158 (2015) - [i15]Yossi Azar, Inna Kalp-Shaltiel, Brendan Lucier, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Truthful Online Scheduling with Commitments. CoRR abs/1507.00773 (2015) - [i14]Yossi Azar, Michal Feldman, Nick Gravin, Alan Roytman:
Liquid Price of Anarchy. CoRR abs/1511.01132 (2015) - 2014
- [c100]Yossi Azar, Seny Kamara, Ishai Menache, Mariana Raykova, F. Bruce Shepherd:
Co-Location-Resistant Clouds. CCSW 2014: 9-20 - [c99]Yossi Azar, Uriel Feige, Michal Feldman, Moshe Tennenholtz:
Sequential decision making with vector outcomes. ITCS 2014: 195-206 - [c98]Yossi Azar, Matthias Englert, Iftah Gamzu, Eytan Kidron:
Generalized Reordering Buffer Management. STACS 2014: 87-98 - [i13]Yossi Azar, Ilan Reuven Cohen, Debmalya Panigrahi:
Online Covering with Convex Objectives and Applications. CoRR abs/1412.3507 (2014) - [i12]Yossi Azar, Seny Kamara, Ishai Menache, Mariana Raykova, F. Bruce Shepherd:
Co-Location-Resistant Clouds. IACR Cryptol. ePrint Arch. 2014: 713 (2014) - 2013
- [j62]Baruch Awerbuch, Yossi Azar, Amir Epstein:
The Price of Routing Unsplittable Flow. SIAM J. Comput. 42(1): 160-177 (2013) - [c97]Yossi Azar, Umang Bhaskar, Lisa Fleischer, Debmalya Panigrahi:
Online Mixed Packing and Covering. SODA 2013: 85-100 - [c96]Yossi Azar, Naama Ben-Aroya, Nikhil R. Devanur, Navendu Jain:
Cloud scheduling with setup cost. SPAA 2013: 298-304 - [c95]Yossi Azar, Ilan Reuven Cohen, Iftah Gamzu:
The loss of serving in the dark. STOC 2013: 951-960 - [c94]Yossi Azar, Ilan Reuven Cohen, Seny Kamara, F. Bruce Shepherd:
Tight bounds for online vector bin packing. STOC 2013: 961-970 - [i11]Yossi Azar, Adi Vardi:
Colored Packets with Deadlines and Metric Space Transition Cost. CoRR abs/1309.0251 (2013) - 2012
- [c93]Yossi Azar, Uriel Feige, Moshe Tennenholtz, Michal Feldman:
Mastering multi-player games. AAMAS 2012: 897-904 - [c92]Yossi Azar, Iftah Gamzu:
Efficient Submodular Function Maximization under Linear Packing Constraints. ICALP (1) 2012: 38-50 - [c91]Nikhil R. Devanur, Balasubramanian Sivan, Yossi Azar:
Asymptotically optimal algorithm for stochastic adwords. EC 2012: 388-404 - [i10]Yossi Azar, Debmalya Panigrahi:
Online Load Balancing on Unrelated Machines with Startup Costs. CoRR abs/1203.4619 (2012) - 2011
- [j61]Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra:
Buffer Management for Colored Packets with Deadlines. Theory Comput. Syst. 49(4): 738-756 (2011) - [j60]Yossi Azar, Aleksander Madry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan:
Maximum bipartite flow in networks with adaptive channel width. Theor. Comput. Sci. 412(24): 2577-2587 (2011) - [c90]Yossi Azar, Iftah Gamzu, Ran Roth:
Submodular Max-SAT. ESA 2011: 323-334 - [c89]Yossi Azar, Ori Gurel-Gurevich, Eyal Lubetzky, Thomas Moscibroda:
Optimal Discovery Strategies in White Space Networks. ESA 2011: 713-722 - [c88]Yossi Azar, Ety Khaitzin:
Prompt Mechanism for Ad Placement over Time. SAGT 2011: 19-30 - [c87]Yossi Azar, Iftah Gamzu:
Ranking with Submodular Valuations. SODA 2011: 1070-1079 - [c86]Yossi Azar, Aviv Nisgav, Boaz Patt-Shamir:
Recommender systems with non-binary grades. SPAA 2011: 245-252 - 2010
- [j59]Yossi Azar, Uriel Feige, Daniel Glasner:
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees. Algorithmica 57(3): 517-537 (2010) - [j58]Yossi Azar, Iftah Gamzu, Shai Gutner:
Truthful unsplittable flow for large capacity networks. ACM Trans. Algorithms 6(2): 36:1-36:20 (2010) - [j57]Yossi Azar, Shay Kutten, Boaz Patt-Shamir:
Distributed error confinement. ACM Trans. Algorithms 6(3): 48:1-48:23 (2010) - [c85]Yossi Azar, Niv Buchbinder, Kamal Jain:
How to Allocate Goods in an Online Market? ESA (2) 2010: 51-62 - [c84]Yossi Azar, Nikhil R. Devanur, Kamal Jain, Yuval Rabani:
Monotonicity in Bargaining Networks. SODA 2010: 817-826 - [i9]Yossi Azar, Ori Gurel-Gurevich, Eyal Lubetzky, Thomas Moscibroda:
Optimal whitespace synchronization strategies. CoRR abs/1006.3334 (2010) - [i8]Yossi Azar, Iftah Gamzu:
Ranking with Submodular Valuations. CoRR abs/1007.2503 (2010) - [i7]Yossi Azar, Iftah Gamzu:
Efficient Submodular Function Maximization under Linear Packing Constraints. CoRR abs/1007.3604 (2010)
2000 – 2009
- 2009
- [j56]Yossi Azar, Thomas Erlebach:
Foreword. Algorithmica 53(4): 455-456 (2009) - [j55]Noga Alon, Baruch Awerbuch, Yossi Azar, Boaz Patt-Shamir:
Tell Me Who I Am: An Interactive Recommendation System. Theory Comput. Syst. 45(2): 261-279 (2009) - [j54]Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor:
The Online Set Cover Problem. SIAM J. Comput. 39(2): 361-370 (2009) - [j53]Noga Alon, Yossi Azar, Shai Gutner:
Admission control to minimize rejections and online set cover with repetitions. ACM Trans. Algorithms 6(1): 11:1-11:13 (2009) - [c83]Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, C. Thach Nguyen:
On Revenue Maximization in Second-Price Ad Auctions. ESA 2009: 155-166 - [c82]Yossi Azar, Benjamin E. Birnbaum, L. Elisa Celis, Nikhil R. Devanur, Yuval Peres:
Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks. FOCS 2009: 293-302 - [c81]Yossi Azar, Aleksander Madry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan:
Maximum Bipartite Flow in Networks with Adaptive Channel Width. ICALP (2) 2009: 351-362 - [c80]Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra:
Buffer management for colored packets with deadlines. SPAA 2009: 319-327 - [c79]Yossi Azar, Iftah Gamzu, Xiaoxin Yin:
Multiple intents re-ranking. STOC 2009: 669-678 - [i6]Yossi Azar, Benjamin E. Birnbaum, L. Elisa Celis, Nikhil R. Devanur, Yuval Peres:
Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks. CoRR abs/0907.4356 (2009) - [i5]Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, C. Thach Nguyen:
On Revenue Maximization in Second-Price Ad Auctions. CoRR abs/0908.2834 (2009) - 2008
- [j52]Baruch Awerbuch, Yossi Azar, Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle:
Collaborate with Strangers to Find Own Preferences. Theory Comput. Syst. 42(1): 27-41 (2008) - [c78]Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, Claire Mathieu, C. Thach Nguyen:
Improved Approximation Algorithms for Budgeted Allocations. ICALP (1) 2008: 186-197 - [c77]Yossi Azar, Iftah Gamzu:
Truthful Unification Framework for Packing Integer Programs with Choices. ICALP (1) 2008: 833-844 - [c76]Baruch Awerbuch, Yossi Azar, Amir Epstein, Vahab S. Mirrokni, Alexander Skopalik:
Fast convergence to nearly optimal solutions in potential games. EC 2008: 264-273 - [c75]Baruch Awerbuch, Yossi Azar, Rohit Khandekar:
Fast load balancing via bounded best response. SODA 2008: 314-322 - [c74]Yossi Azar, Kamal Jain, Vahab S. Mirrokni:
(Almost) optimal coordination mechanisms for unrelated machine scheduling. SODA 2008: 323-332 - [c73]Yossi Azar, Uriel Feige, Daniel Glasner:
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees. SWAT 2008: 319-330 - [i4]Noga Alon, Yossi Azar, Shai Gutner:
Admission Control to Minimize Rejections and Online Set Cover with Repetitions. CoRR abs/0803.2842 (2008) - [i3]Yossi Azar, Iftah Gamzu, Shai Gutner:
Truthful Unsplittable Flow for Large Capacity Networks. CoRR abs/0804.2112 (2008) - [i2]Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, C. Thach Nguyen:
Thinking Twice about Second-Price Ad Auctions. CoRR abs/0809.1895 (2008) - 2007
- [j51]Nir Avrahami, Yossi Azar:
Minimizing Total Flow Time and Total Completion Time with Immediate Dispatching. Algorithmica 47(3): 253-268 (2007) - [j50]Nir Andelman, Yossi Azar, Motti Sorani:
Truthful Approximation Mechanisms for Scheduling Selfish Related Machines. Theory Comput. Syst. 40(4): 423-436 (2007) - [c72]Yossi Azar, Iftah Gamzu, Shai Gutner:
Truthful unsplittable flow for large capacity networks. SPAA 2007: 320-329 - 2006
- [j49]Yossi Azar, Oded Regev:
Combinatorial Algorithms for the Unsplittable Flow Problem. Algorithmica 44(1): 49-66 (2006) - [j48]Yossi Azar, Arik Litichevskey:
Maximizing Throughput in Multi-Queue Switches. Algorithmica 45(1): 69-90 (2006) - [j47]Yossi Azar, Yossi Richter:
An improved algorithm for CIOQ switches. ACM Trans. Algorithms 2(2): 282-295 (2006) - [j46]Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor:
A general approach to online network optimization problems. ACM Trans. Algorithms 2(4): 640-660 (2006) - [j45]Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur:
Tradeoffs in worst-case equilibria. Theor. Comput. Sci. 361(2-3): 200-209 (2006) - [j44]Yossi Azar, Amir Epstein, Leah Epstein:
Load balancing of temporary tasks in the lp norm. Theor. Comput. Sci. 361(2-3): 314-328 (2006) - [j43]Yossi Azar, Amos Fiat, Meital Levy, N. S. Narayanaswamy:
An improved algorithm for online coloring of intervals with bandwidth. Theor. Comput. Sci. 363(1): 18-27 (2006) - [c71]Noga Alon, Baruch Awerbuch, Yossi Azar, Boaz Patt-Shamir:
Tell me who I am: an interactive recommendation system. SPAA 2006: 1-10 - [c70]Yossi Azar, Yoel Chaiutin:
Optimal Node Routing. STACS 2006: 596-607 - [c69]Yossi Azar, Nir Levy:
Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers. SWAT 2006: 5-16 - [e1]Yossi Azar, Thomas Erlebach:
Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings. Lecture Notes in Computer Science 4168, Springer 2006, ISBN 3-540-38875-3 [contents] - 2005
- [j42]Yossi Azar, Yossi Richter:
Management of Multi-Queue Switches in QoS Networks. Algorithmica 43(1-2): 81-96 (2005) - [j41]Yossi Azar, Avrim Blum, David P. Bunde, Yishay Mansour:
Combining Online Algorithms for Acceptance and Rejection. Theory Comput. 1(1): 105-117 (2005) - [c68]Yossi Azar, Rafi Zachut:
Packet Routing and Information Gathering in Lines, Rings and Trees. ESA 2005: 484-495 - [c67]Noga Alon, Yossi Azar, Shai Gutner:
Admission control to minimize rejections and online set cover with repetitions. SPAA 2005: 238-244 - [c66]Baruch Awerbuch, Yossi Azar, Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle:
Collaborate with strangers to find own preferences. SPAA 2005: 263-269 - [c65]Nir Andelman, Yossi Azar, Motti Sorani:
Truthful Approximation Mechanisms for Scheduling Selfish Related Machines. STACS 2005: 69-82 - [c64]Baruch Awerbuch, Yossi Azar, Amir Epstein:
The Price of Routing Unsplittable Flow. STOC 2005: 57-66 - [c63]Yossi Azar, Amir Epstein:
Convex programming for scheduling unrelated parallel machines. STOC 2005: 331-337 - [c62]Yossi Azar, Amir Epstein:
The Hardness of Network Design for Unsplittable Flow with Selfish Users. WAOA 2005: 41-54 - [i1]Yossi Azar, Yossi Richter:
An improved algorithm for CIOQ switches. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [j40]Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger:
All-norm approximation algorithms. J. Algorithms 52(2): 120-133 (2004) - [j39]Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke:
Optimal oblivious routing in polynomial time. J. Comput. Syst. Sci. 69(3): 383-394 (2004) - [j38]Yossi Azar, Leah Epstein:
On-Line Load Balancing of Temporary Tasks on Identical Machines. SIAM J. Discret. Math. 18(2): 347-352 (2004) - [j37]Baruch Awerbuch, Yossi Azar, Yair Bartal:
On-line generalized Steiner problem. Theor. Comput. Sci. 324(2-3): 313-324 (2004) - [c61]Yossi Azar, Arik Litichevskey:
Maximizing Throughput in Multi-queue Switches. ESA 2004: 53-64 - [c60]Yossi Azar, Yossi Richter:
An Improved Algorithm for CIOQ Switches. ESA 2004: 65-76 - [c59]Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor:
A general approach to online network optimization problems. SODA 2004: 577-586 - [c58]Yossi Azar, Yossi Richter:
The zero-one principle for switching networks. STOC 2004: 64-71 - [c57]Yossi Azar, Shai Taub:
All-Norm Approximation for Scheduling on Identical Machines. SWAT 2004: 298-310 - [c56]Yossi Azar:
Online Packet Switching. WAOA 2004: 1-5 - 2003
- [j36]Amitai Armon, Yossi Azar, Leah Epstein:
Temporary Tasks Assignment Resolved. Algorithmica 36(3): 295-314 (2003) - [j35]Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev:
On-line restricted assignment of temporary tasks with unknown durations. Inf. Process. Lett. 85(2): 67-72 (2003) - [j34]Ran Adler, Yossi Azar:
Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms. J. Sched. 6(2): 113-129 (2003) - [c55]Ittai Abraham, Baruch Awerbuch, Yossi Azar, Yair Bartal, Dahlia Malkhi, Elan Pavlov:
A Generic Scheme for Building Overlay Networks in Adversarial Scenarios. IPDPS 2003: 40 - [c54]Yossi Azar, Shay Kutten, Boaz Patt-Shamir:
Distributed error confinement. PODC 2003: 33-42 - [c53]Nir Avrahami, Yossi Azar:
Minimizing total flow time and total completion time with immediate dispatching. SPAA 2003: 11-18 - [c52]Yossi Azar, Avrim Blum, Yishay Mansour:
Combining online algorithms for rejection and acceptance. SPAA 2003: 159-163 - [c51]Yossi Azar, Yossi Richter:
Management of multi-queue switches in QoS networks. STOC 2003: 82-89 - [c50]Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor:
The online set cover problem. STOC 2003: 100-105 - [c49]Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke:
Optimal oblivious routing in polynomial time. STOC 2003: 383-388 - [c48]Baruch Awerbuch, Yossi Azar, Adam Meyerson:
Reducing truth-telling online mechanisms to online optimization. STOC 2003: 503-510 - [c47]Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur:
Tradeoffs in Worst-Case Equilibria. WAOA 2003: 41-52 - [c46]Yossi Azar, Amir Epstein, Leah Epstein:
Load Balancing of Temporary Tasks in the lp Norm. WAOA 2003: 53-66 - 2002
- [j33]Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen, Leah Epstein:
Fair versus Unrestricted Bin Packing. Algorithmica 34(2): 181-196 (2002) - [j32]Yossi Azar, Leah Epstein:
On-line scheduling with precedence constraints. Discret. Appl. Math. 119(1-2): 169-180 (2002) - [j31]Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev:
Minimizing the Flow Time Without Migration. SIAM J. Comput. 31(5): 1370-1382 (2002) - [j30]Yossi Azar, Oded Regev, Jirí Sgall, Gerhard J. Woeginger:
Off-line temporary tasks assignment. Theor. Comput. Sci. 287(2): 419-428 (2002) - [c45]Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev:
Temporary tasks assignment resolved. SODA 2002: 116-124 - [c44]Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger:
All-Norm Approximation Algorithms. SWAT 2002: 288-297 - 2001
- [j29]Adi Avidor, Yossi Azar, Jirí Sgall:
Ancient and New Algorithms for Load Balancing in the lp Norm. Algorithmica 29(3): 422-441 (2001) - [j28]Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén:
On-Line Competitive Algorithms for Call Admission in Optical Networks. Algorithmica 31(1): 29-43 (2001) - [j27]Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts:
Competitive Routing of Virtual Circuits with Unknown Duration. J. Comput. Syst. Sci. 62(3): 385-397 (2001) - [j26]Yossi Azar, Oded Regev:
On-line bin-stretching. Theor. Comput. Sci. 268(1): 17-41 (2001) - [c43]Yossi Azar, Oded Regev:
Strongly Polynomial Algorithms for the Unsplittable Flow Problem. IPCO 2001: 15-29 - [c42]Yossi Azar, Meir Feder, Eyal Lubetzky, Doron Rajwan, Nadav Shulman:
The Multicast Bandwidth Advantage in Serving a Web Site. Networked Group Communication 2001: 88-99 - [c41]Yossi Azar, Amos Fiat, Anna R. Karlin, Frank McSherry, Jared Saia:
Spectral analysis of data. STOC 2001: 619-626 - 2000
- [c40]Baruch Awerbuch, Yossi Azar, Oded Regev:
Maximizing job benefits on-line. APPROX 2000: 42-50 - [c39]Yossi Azar, Leah Epstein:
On-Line Scheduling with Precedence Constraints. SWAT 2000: 164-174 - [c38]Yossi Azar, Leah Epstein, Rob van Stee:
Resource Augmentation in Load Balancing. SWAT 2000: 189-199 - [c37]Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen:
Fair versus Unrestricted Bin Packing. SWAT 2000: 200-213
1990 – 1999
- 1999
- [j25]Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén:
On Capital Investment. Algorithmica 25(1): 22-36 (1999) - [j24]Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal:
Balanced Allocations. SIAM J. Comput. 29(1): 180-200 (1999) - [c36]Yossi Azar, Oded Regev:
Off-Line Temporary Tasks Assignment. ESA 1999: 163-171 - [c35]Noga Alon, Uri Arad, Yossi Azar:
Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths. RANDOM-APPROX 1999: 16-27 - [c34]Ran Adler, Yossi Azar:
Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms. SODA 1999: 1-10 - [c33]Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev:
Minimizing the Flow Time Without Migration. STOC 1999: 198-205 - 1998
- [j23]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. Algorithmica 21(1): 104-118 (1998) - [j22]Yossi Azar, Rajeev Motwani, Joseph Naor:
Approximating Probability Distributions Using Small Sample Spaces. Comb. 18(2): 151-171 (1998) - [j21]Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh S. Vempala:
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen. SIAM J. Comput. 28(1): 254-262 (1998) - [c32]Yossi Azar, Leah Epstein:
Approximation Schemes for Covering and Scheduling on Related Machines. APPROX 1998: 39-47 - [c31]Yossi Azar, Oded Regev:
On-Line Bin-Stretching. RANDOM 1998: 71-81 - [c30]Adi Avidor, Yossi Azar, Jirí Sgall:
Ancient and New Algorithms for Load Balancing in the Lp Norm. SODA 1998: 426-435 - 1997
- [j20]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. J. ACM 44(3): 486-504 (1997) - [j19]Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts:
On-Line Load Balancing of Temporary Tasks. J. Algorithms 22(1): 93-110 (1997) - [j18]Yossi Azar, Leah Epstein:
On Two Dimensional Packing. J. Algorithms 25(2): 290-310 (1997) - [c29]Yossi Azar, Leah Epstein:
On-Line Machine Covering. ESA 1997: 23-36 - [c28]Baruch Awerbuch, Yossi Azar:
Buy-at-Bulk Network Design. FOCS 1997: 542-547 - [c27]Yossi Azar, Leah Epstein:
On-Line Load Balancing of Temporary Tasks on Identical Machines. ISTCS 1997: 119-125 - [c26]Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Yadid:
Approximation Schemes for Scheduling. SODA 1997: 493-500 - 1996
- [j17]Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven J. Phillips:
Biased Random Walks. Comb. 16(1): 1-18 (1996) - [j16]Yossi Azar, Joseph Naor, Raphael Rom:
Routing Strategies for Fast Networks. IEEE Trans. Computers 45(2): 165-173 (1996) - [c25]Yossi Azar:
On-line Load Balancing. Online Algorithms 1996: 178-195 - [c24]Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén:
On-line Competive Algorithms for Call Admission in Optical Networks. ESA 1996: 431-444 - [c23]Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén:
On Capital Investment. ICALP 1996: 429-441 - [c22]Baruch Awerbuch, Yossi Azar, Amos Fiat:
Packet Routing via Min-Cost Circuit Routing. ISTCS 1996: 37-42 - [c21]Baruch Awerbuch, Yossi Azar, Yair Bartal:
On-line Generalized Steiner Problem. SODA 1996: 68-74 - [c20]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). STOC 1996: 519-530 - [c19]Yossi Azar, Leah Epstein:
On Two Dimensional Packing. SWAT 1996: 321-332 - 1995
- [j15]Yossi Azar, Joseph Naor, Raphael Rom:
The Competitiveness of On-Line Assignments. J. Algorithms 18(2): 221-237 (1995) - [j14]Baruch Awerbuch, Yossi Azar:
Competitive multicast routing. Wirel. Networks 1(1): 107-114 (1995) - [c18]Baruch Awerbuch, Yossi Azar, Edward F. Grove, Ming-Yang Kao, P. Krishnan, Jeffrey Scott Vitter:
Load Balancing in the Lp Norm. FOCS 1995: 383-391 - [c17]Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh S. Vempala:
Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. STOC 1995: 277-283 - 1994
- [j13]Yossi Azar:
Lower Bounds for Insertion Methods for TSP. Comb. Probab. Comput. 3: 285-292 (1994) - [j12]Yossi Azar, Andrei Z. Broder, Alan M. Frieze:
On the Problem of Approximating the Number of Bases of a Matroid. Inf. Process. Lett. 50(1): 9-11 (1994) - [j11]Yossi Azar, Andrei Z. Broder, Anna R. Karlin:
On-Line Load Balancing. Theor. Comput. Sci. 130(1): 73-84 (1994) - [c16]Baruch Awerbuch, Yossi Azar:
Local Optimization of Global Objectives: Competitive Distributed Deadlock Resolution and Resource Allocation. FOCS 1994: 240-249 - [c15]Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts:
Competitive Routing of Virtual Circuits with Unknown Duration. SODA 1994: 321-327 - [c14]Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal:
Balanced allocations (extended abstract). STOC 1994: 593-602 - 1993
- [j10]Noga Alon, Yossi Azar:
On-Line Steine Trees in the Euclidean Plane. Discret. Comput. Geom. 10: 113-121 (1993) - [c13]Baruch Awerbuch, Yossi Azar, Serge A. Plotkin:
Throughput-Competitive On-Line Routing. FOCS 1993: 32-40 - [c12]Yossi Azar, Andrei Z. Broder, Mark S. Manasse:
On-line Choice of On-line Algorithms. SODA 1993: 432-440 - [c11]James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts:
On-line load balancing with applications to machine scheduling and virtual circuit routing. STOC 1993: 623-631 - [c10]Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts:
Online Load Balancing of Temporary Tasks. WADS 1993: 119-130 - 1992
- [j9]Yossi Azar:
Lower Bounds for Threshold and Symmetric Functions in Parallel Computation. SIAM J. Comput. 21(2): 329-338 (1992) - [c9]Noga Alon, Yossi Azar:
On-Line Steiner Trees in the Euclidean Plane. SCG 1992: 337-343 - [c8]Yossi Azar, Andrei Z. Broder, Anna R. Karlin:
On-line Load Balancing (Extended Abstract). FOCS 1992: 218-225 - [c7]Yossi Azar, Joseph Naor, Raphael Rom:
Routing Strategies for Fast Networks. INFOCOM 1992: 170-179 - [c6]Yossi Azar, Joseph Naor, Raphael Rom:
The Competitiveness of On-Line Assignments. SODA 1992: 203-210 - [c5]Noga Alon, Yossi Azar:
Comparison-Sorting and Selecting in Totally Monotone Matrices. SODA 1992: 403-408 - [c4]Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven J. Phillips:
Biased Random Walks. STOC 1992: 1-9 - 1991
- [j8]Noga Alon, Yossi Azar:
Parallel comparison algorithms for approximation problems. Comb. 11(2): 97-122 (1991) - [j7]Yossi Azar:
Parallel Comparison Merging of Many-Ordered Lists. Theor. Comput. Sci. 83(2): 275-285 (1991) - 1990
- [j6]Noga Alon, Yossi Azar, Yiftach Ravid:
Universal sequences for complete graphs. Discret. Appl. Math. 27(1-2): 25-28 (1990) - [j5]Yossi Azar, Nicholas Pippenger:
Parallel selection. Discret. Appl. Math. 27(1-2): 49-58 (1990)
1980 – 1989
- 1989
- [j4]Noga Alon, Yossi Azar:
Finding an Approximate Maximum. SIAM J. Comput. 18(2): 258-267 (1989) - 1988
- [b1]Yossi Azar:
Parallel comparison sorting and searching. Tel Aviv University, Israel, 1988 - [j3]Noga Alon, Yossi Azar:
The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms. SIAM J. Comput. 17(6): 1178-1192 (1988) - [j2]Noga Alon, Yossi Azar:
Sorting, Approximate Sorting, and Searching in Rounds. SIAM J. Discret. Math. 1(3): 269-280 (1988) - [c3]Noga Alon, Yossi Azar:
Parallel Comparison Algorithms for Approximation Problems. FOCS 1988: 194-203 - 1987
- [j1]Yossi Azar, Uzi Vishkin:
Tight Comparison Bounds on the Complexity of Parallel Sorting. SIAM J. Comput. 16(3): 458-464 (1987) - [c2]Noga Alon, Yossi Azar:
The Average Complexity of Deterministic and Randomized Parallel Comparison Sorting Algorithms. FOCS 1987: 489-498 - 1986
- [c1]Noga Alon, Yossi Azar, Uzi Vishkin:
Tight Complexity Bounds for Parallel Comparison Sorting. FOCS 1986: 502-510
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-11-07 21:34 CET 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:
