Yossi Azar

Baruch Awerbuch, Yossi Azar, Amir Epstein: The Price of Routing Unsplittable Flow. SIAM J. Comput. 42(1): 160-177 (2013)

Yossi Azar, Umang Bhaskar, Lisa Fleischer, Debmalya Panigrahi: Online Mixed Packing and Covering. SODA 2013: 85-100

Yossi Azar, Uriel Feige, Moshe Tennenholtz, Michal Feldman: Mastering multi-player games. AAMAS 2012: 897-904

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

Nikhil R. Devanur, Balasubramanian Sivan, Yossi Azar: Asymptotically optimal algorithm for stochastic adwords. ACM Conference on Electronic Commerce 2012: 388-404

Yossi Azar, Debmalya Panigrahi: Online Load Balancing on Unrelated Machines with Startup Costs. CoRR abs/1203.4619 (2012)

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)

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)

Yossi Azar, Iftah Gamzu, Ran Roth: Submodular Max-SAT. ESA 2011: 323-334

Yossi Azar, Ori Gurel-Gurevich, Eyal Lubetzky, Thomas Moscibroda: Optimal Discovery Strategies in White Space Networks. ESA 2011: 713-722

Yossi Azar, Ety Khaitsin: Prompt Mechanism for Ad Placement over Time. SAGT 2011: 19-30

Yossi Azar, Iftah Gamzu: Ranking with Submodular Valuations. SODA 2011: 1070-1079

Yossi Azar, Aviv Nisgav, Boaz Patt-Shamir: Recommender systems with non-binary grades. SPAA 2011: 245-252

Yossi Azar, Uriel Feige, Daniel Glasner: A Preemptive Algorithm for Maximizing Disjoint Paths on Trees. Algorithmica 57(3): 517-537 (2010)

Yossi Azar, Iftah Gamzu, Shai Gutner: Truthful unsplittable flow for large capacity networks. ACM Transactions on Algorithms 6(2) (2010)

Yossi Azar, Shay Kutten, Boaz Patt-Shamir: Distributed error confinement. ACM Transactions on Algorithms 6(3) (2010)

Yossi Azar, Niv Buchbinder, Kamal Jain: How to Allocate Goods in an Online Market? ESA (2) 2010: 51-62

Yossi Azar, Nikhil R. Devanur, Kamal Jain, Yuval Rabani: Monotonicity in Bargaining Networks. SODA 2010: 817-826

Yossi Azar, Ori Gurel-Gurevich, Eyal Lubetzky, Thomas Moscibroda: Optimal whitespace synchronization strategies. CoRR abs/1006.3334 (2010)

Yossi Azar, Iftah Gamzu: Ranking with Submodular Valuations. CoRR abs/1007.2503 (2010)

Yossi Azar, Iftah Gamzu: Efficient Submodular Function Maximization under Linear Packing Constraints. CoRR abs/1007.3604 (2010)

Yossi Azar, Thomas Erlebach: Foreword. Algorithmica 53(4): 455-456 (2009)

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)

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

Noga Alon, Yossi Azar, Shai Gutner: Admission control to minimize rejections and online set cover with repetitions. ACM Transactions on Algorithms 6(1) (2009)

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

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

Yossi Azar, Aleksander Madry, Thomas Moscibroda, Debmalya Panigrahi, Aravind Srinivasan: Maximum Bipartite Flow in Networks with Adaptive Channel Width. ICALP (2) 2009: 351-362

Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra: Buffer management for colored packets with deadlines. SPAA 2009: 319-327

Yossi Azar, Iftah Gamzu, Xiaoxin Yin: Multiple intents re-ranking. STOC 2009: 669-678

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)

Yossi Azar, Benjamin E. Birnbaum, Anna R. Karlin, C. Thach Nguyen: On Revenue Maximization in Second-Price Ad Auctions. CoRR abs/0908.2834 (2009)

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)

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

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

Baruch Awerbuch, Yossi Azar, Amir Epstein, Vahab S. Mirrokni, Alexander Skopalik: Fast convergence to nearly optimal solutions in potential games. ACM Conference on Electronic Commerce 2008: 264-273

Baruch Awerbuch, Yossi Azar, Rohit Khandekar: Fast load balancing via bounded best response. SODA 2008: 314-322

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

Yossi Azar, Uriel Feige, Daniel Glasner: A Preemptive Algorithm for Maximizing Disjoint Paths on Trees. SWAT 2008: 319-330

Noga Alon, Yossi Azar, Shai Gutner: Admission Control to Minimize Rejections and Online Set Cover with Repetitions. CoRR abs/0803.2842 (2008)

Yossi Azar, Iftah Gamzu, Shai Gutner: Truthful Unsplittable Flow for Large Capacity Networks. CoRR abs/0804.2112 (2008)

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

Nir Avrahami, Yossi Azar: Minimizing Total Flow Time and Total Completion Time with Immediate Dispatching. Algorithmica 47(3): 253-268 (2007)

Nir Andelman, Yossi Azar, Motti Sorani: Truthful Approximation Mechanisms for Scheduling Selfish Related Machines. Theory Comput. Syst. 40(4): 423-436 (2007)

Yossi Azar, Iftah Gamzu, Shai Gutner: Truthful unsplittable flow for large capacity networks. SPAA 2007: 320-329

Yossi Azar, Oded Regev: Combinatorial Algorithms for the Unsplittable Flow Problem. Algorithmica 44(1): 49-66 (2006)

Yossi Azar, Arik Litichevskey: Maximizing Throughput in Multi-Queue Switches. Algorithmica 45(1): 69-90 (2006)

Yossi Azar, Yossi Richter: An improved algorithm for CIOQ switches. ACM Transactions on Algorithms 2(2): 282-295 (2006)

Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor: A general approach to online network optimization problems. ACM Transactions on Algorithms 2(4): 640-660 (2006)

Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur: Tradeoffs in worst-case equilibria. Theor. Comput. Sci. 361(2-3): 200-209 (2006)

Yossi Azar, Amir Epstein, Leah Epstein: Load balancing of temporary tasks in the l_p norm. Theor. Comput. Sci. 361(2-3): 314-328 (2006)

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)

Noga Alon, Baruch Awerbuch, Yossi Azar, Boaz Patt-Shamir: Tell me who I am: an interactive recommendation system. SPAA 2006: 1-10

Yossi Azar, Yoel Chaiutin: Optimal Node Routing. STACS 2006: 596-607

Yossi Azar, Nir Levy: Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers. SWAT 2006: 5-16

Yossi Azar, Thomas Erlebach (Eds.): 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

Yossi Azar, Yossi Richter: Management of Multi-Queue Switches in QoS Networks. Algorithmica 43(1-2): 81-96 (2005)

Yossi Azar, Avrim Blum, David P. Bunde, Yishay Mansour: Combining Online Algorithms for Acceptance and Rejection. Theory of Computing 1(1): 105-117 (2005)

Yossi Azar, Yossi Richter: An improved algorithm for CIOQ switches. Algorithms for Optimization with Incomplete Information 2005

Yossi Azar, Rafi Zachut: Packet Routing and Information Gathering in Lines, Rings and Trees. ESA 2005: 484-495

Noga Alon, Yossi Azar, Shai Gutner: Admission control to minimize rejections and online set cover with repetitions. SPAA 2005: 238-244

Baruch Awerbuch, Yossi Azar, Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle: Collaborate with strangers to find own preferences. SPAA 2005: 263-269

Nir Andelman, Yossi Azar, Motti Sorani: Truthful Approximation Mechanisms for Scheduling Selfish Related Machines. STACS 2005: 69-82

Baruch Awerbuch, Yossi Azar, Amir Epstein: Large the price of routing unsplittable flow. STOC 2005: 57-66

Yossi Azar, Amir Epstein: Convex programming for scheduling unrelated parallel machines. STOC 2005: 331-337

Yossi Azar, Amir Epstein: The Hardness of Network Design for Unsplittable Flow with Selfish Users. WAOA 2005: 41-54

Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger: All-norm approximation algorithms. J. Algorithms 52(2): 120-133 (2004)

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)

Yossi Azar, Leah Epstein: On-Line Load Balancing of Temporary Tasks on Identical Machines. SIAM J. Discrete Math. 18(2): 347-352 (2004)

Baruch Awerbuch, Yossi Azar, Yair Bartal: On-line generalized Steiner problem. Theor. Comput. Sci. 324(2-3): 313-324 (2004)

Yossi Azar, Arik Litichevskey: Maximizing Throughput in Multi-queue Switches. ESA 2004: 53-64

Yossi Azar, Yossi Richter: An Improved Algorithm for CIOQ Switches. ESA 2004: 65-76

Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor: A general approach to online network optimization problems. SODA 2004: 577-586

Yossi Azar, Yossi Richter: The zero-one principle for switching networks. STOC 2004: 64-71

Yossi Azar, Shai Taub: All-Norm Approximation for Scheduling on Identical Machines. SWAT 2004: 298-310

Yossi Azar: Online Packet Switching. WAOA 2004: 1-5

Amitai Armon, Yossi Azar, Leah Epstein: Temporary Tasks Assignment Resolved. Algorithmica 36(3): 295-314 (2003)

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)

Ran Adler, Yossi Azar: Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms. J. Scheduling 6(2): 113-129 (2003)

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

Yossi Azar, Shay Kutten, Boaz Patt-Shamir: Distributed error confinement. PODC 2003: 33-42

Nir Avrahami, Yossi Azar: Minimizing total flow time and total completion time with immediate dispatching. SPAA 2003: 11-18

Yossi Azar, Avrim Blum, Yishay Mansour: Combining online algorithms for rejection and acceptance. SPAA 2003: 159-163

Yossi Azar, Yossi Richter: Management of multi-queue switches in QoS networks. STOC 2003: 82-89

Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor: The online set cover problem. STOC 2003: 100-105

Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke: Optimal oblivious routing in polynomial time. STOC 2003: 383-388

Baruch Awerbuch, Yossi Azar, Adam Meyerson: Reducing truth-telling online mechanisms to online optimization. STOC 2003: 503-510

Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur: Tradeoffs in Worst-Case Equilibria. WAOA 2003: 41-52

Yossi Azar, Amir Epstein, Leah Epstein: Load Balancing of Temporary Tasks in the l_p Norm. WAOA 2003: 53-66

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)

Yossi Azar, Leah Epstein: On-line scheduling with precedence constraints. Discrete Applied Mathematics 119(1-2): 169-180 (2002)

Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev: Minimizing the Flow Time Without Migration. SIAM J. Comput. 31(5): 1370-1382 (2002)

Yossi Azar, Oded Regev, Jiri Sgall, Gerhard J. Woeginger: Off-line temporary tasks assignment. Theor. Comput. Sci. 287(2): 419-428 (2002)

Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev: Temporary tasks assignment resolved. SODA 2002: 116-124

Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger: All-Norm Approximation Algorithms. SWAT 2002: 288-297

Adi Avidor, Yossi Azar, Jiri Sgall: Ancient and New Algorithms for Load Balancing in the l_p Norm. Algorithmica 29(3): 422-441 (2001)

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)

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)

Yossi Azar, Oded Regev: On-line bin-stretching. Theor. Comput. Sci. 268(1): 17-41 (2001)

Yossi Azar, Oded Regev: Strongly Polynomial Algorithms for the Unsplittable Flow Problem. IPCO 2001: 15-29

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

Yossi Azar, Amos Fiat, Anna R. Karlin, Frank McSherry, Jared Saia: Spectral analysis of data. STOC 2001: 619-626

Baruch Awerbuch, Yossi Azar, Oded Regev: Maximizing job benefits on-line. APPROX 2000: 42-50

Yossi Azar, Leah Epstein: On-Line Scheduling with Precedence Constraints. SWAT 2000: 164-174

Yossi Azar, Leah Epstein, Rob van Stee: Resource Augmentation in Load Balancing. SWAT 2000: 189-199

Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen: Fair versus Unrestricted Bin Packing. SWAT 2000: 200-213

Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén: On Capital Investment. Algorithmica 25(1): 22-36 (1999)

Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal: Balanced Allocations. SIAM J. Comput. 29(1): 180-200 (1999)

Yossi Azar, Oded Regev: Off-Line Temporary Tasks Assignment. ESA 1999: 163-171

Noga Alon, Uri Arad, Yossi Azar: Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths. RANDOM-APPROX 1999: 16-27

Ran Adler, Yossi Azar: Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms. SODA 1999: 1-10

Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev: Minimizing the Flow Time Without Migration. STOC 1999: 198-205

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)

Yossi Azar, Rajeev Motwani, Joseph Naor: Approximating Probability Distributions Using Small Sample Spaces. Combinatorica 18(2): 151-171 (1998)

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

Yossi Azar, Leah Epstein: Approximation Schemes for Covering and Scheduling on Related Machines. APPROX 1998: 39-47

Yossi Azar, Oded Regev: On-Line Bin-Stretching. RANDOM 1998: 71-81

Adi Avidor, Yossi Azar, Jiri Sgall: Ancient and New Algorithms for Load Balancing in the L_p Norm. SODA 1998: 426-435

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)

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)

Yossi Azar, Leah Epstein: On Two Dimensional Packing. J. Algorithms 25(2): 290-310 (1997)

Yossi Azar, Leah Epstein: On-Line Machine Covering. ESA 1997: 23-36

Baruch Awerbuch, Yossi Azar: Buy-at-Bulk Network Design. FOCS 1997: 542-547

Yossi Azar, Leah Epstein: On-Line Load Balancing of Temporary Tasks on Identical Machines. ISTCS 1997: 119-125

Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Yadid: Approximation Schemes for Scheduling. SODA 1997: 493-500

Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven Phillips: Biased Random Walks. Combinatorica 16(1): 1-18 (1996)

Yossi Azar, Joseph Naor, Raphael Rom: Routing Strategies for Fast Networks. IEEE Trans. Computers 45(2): 165-173 (1996)

Yossi Azar: On-line Load Balancing. Online Algorithms 1996: 178-195

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

Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén: On Capital Investment. ICALP 1996: 429-441

Baruch Awerbuch, Yossi Azar, Amos Fiat: Packet Routing via Min-Cost Circuit Routing. ISTCS 1996: 37-42

Baruch Awerbuch, Yossi Azar, Yair Bartal: On-line Generalized Steiner Problem. SODA 1996: 68-74

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

Yossi Azar, Leah Epstein: On Two Dimensional Packing. SWAT 1996: 321-332

Yossi Azar, Joseph Naor, Raphael Rom: The Competitiveness of On-Line Assignments. J. Algorithms 18(2): 221-237 (1995)

Baruch Awerbuch, Yossi Azar: Competitive multicast routing. Wireless Networks 1(1): 107-114 (1995)

Baruch Awerbuch, Yossi Azar, Edward F. Grove, Ming-Yang Kao, P. Krishnan, Jeffrey Scott Vitter: Load Balancing in the L_p Norm. FOCS 1995: 383-391

Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh Vempala: Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. STOC 1995: 277-283

Yossi Azar: Lower Bounds for Insertion Methods for TSP. Combinatorics, Probability & Computing 3: 285-292 (1994)

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)

Yossi Azar, Andrei Z. Broder, Anna R. Karlin: On-Line Load Balancing. Theor. Comput. Sci. 130(1): 73-84 (1994)

Baruch Awerbuch, Yossi Azar: Local Optimization of Global Objectives: Competitive Distributed Deadlock Resolution and Resource Allocation. FOCS 1994: 240-249

Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts: Competitive Routing of Virtual Circuits with Unknown Duration. SODA 1994: 321-327

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

Noga Alon, Yossi Azar: On-Line Steine Trees in the Euclidean Plane. Discrete & Computational Geometry 10: 113-121 (1993)

Baruch Awerbuch, Yossi Azar, Serge A. Plotkin: Throughput-Competitive On-Line Routing. FOCS 1993: 32-40

Yossi Azar, Andrei Z. Broder, Mark S. Manasse: On-line Choice of On-line Algorithms. SODA 1993: 432-440

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

Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts: Online Load Balancing of Temporary Tasks. WADS 1993: 119-130

Yossi Azar: Lower Bounds for Threshold and Symmetric Functions in Parallel Computation. SIAM J. Comput. 21(2): 329-338 (1992)

Noga Alon, Yossi Azar: On-Line Steiner Trees in the Euclidean Plane. Symposium on Computational Geometry 1992: 337-343

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

Yossi Azar, Joseph Naor, Raphael Rom: Routing Strategies for Fast Networks. INFOCOM 1992: 170-179

Yossi Azar, Joseph Naor, Raphael Rom: The Competitiveness of On-Line Assignments. SODA 1992: 203-210

Noga Alon, Yossi Azar: Comparison-Sorting and Selecting in Totally Monotone Matrices. SODA 1992: 403-408

Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven Phillips: Biased Random Walks. STOC 1992: 1-9

Noga Alon, Yossi Azar: Parallel comparison algorithms for approximation problems. Combinatorica 11(2): 97-122 (1991)

Yossi Azar: Parallel Comparison Merging of Many-Ordered Lists. Theor. Comput. Sci. 83(2): 275-285 (1991)

Noga Alon, Yossi Azar, Yiftach Ravid: Universal sequences for complete graphs. Discrete Applied Mathematics 27(1-2): 25-28 (1990)

Yossi Azar, Nicholas Pippenger: Parallel selection. Discrete Applied Mathematics 27(1-2): 49-58 (1990)

Noga Alon, Yossi Azar: Finding an Approximate Maximum. SIAM J. Comput. 18(2): 258-267 (1989)

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

Noga Alon, Yossi Azar: Sorting, Approximate Sorting, and Searching in Rounds. SIAM J. Discrete Math. 1(3): 269-280 (1988)

Noga Alon, Yossi Azar: Parallel Comparison Algorithms for Approximation Problems. FOCS 1988: 194-203

Yossi Azar, Uzi Vishkin: Tight Comparison Bounds on the Complexity of Parallel Sorting. SIAM J. Comput. 16(3): 458-464 (1987)

Noga Alon, Yossi Azar: The Average Complexity of Deterministic and Randomized Parallel Comparison Sorting Algorithms. FOCS 1987: 489-498

Noga Alon, Yossi Azar, Uzi Vishkin: Tight Complexity Bounds for Parallel Comparison Sorting. FOCS 1986: 502-510