The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yossi Azar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yossi Azar, Joseph Naor, Raphael Rom
    The Competitiveness of On-Line Assignments. [Citation Graph (2, 0)][DBLP]
    SODA, 1992, pp:203-210 [Conf]
  2. Baruch Awerbuch, Yossi Azar, Serge A. Plotkin
    Throughput-Competitive On-Line Routing [Citation Graph (1, 0)][DBLP]
    FOCS, 1993, pp:32-40 [Conf]
  3. James Aspnes, Yossi Azar, Amos Fiat, Serge A. Plotkin, Orli Waarts
    On-line load balancing with applications to machine scheduling and virtual circuit routing. [Citation Graph (1, 0)][DBLP]
    STOC, 1993, pp:623-631 [Conf]
  4. Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal
    Balanced allocations (extended abstract). [Citation Graph (1, 0)][DBLP]
    STOC, 1994, pp:593-602 [Conf]
  5. Yossi Azar, Andrei Z. Broder, Anna R. Karlin
    On-Line Load Balancing. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:130, n:1, pp:73-84 [Journal]
  6. Baruch Awerbuch, Yossi Azar, Oded Regev
    Maximizing job benefits on-line. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:42-50 [Conf]
  7. Yossi Azar, Leah Epstein
    Approximation Schemes for Covering and Scheduling on Related Machines. [Citation Graph (0, 0)][DBLP]
    APPROX, 1998, pp:39-47 [Conf]
  8. Noga Alon, Yossi Azar
    On-Line Steiner Trees in the Euclidean Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:337-343 [Conf]
  9. Yossi Azar
    On-line Load Balancing. [Citation Graph (0, 0)][DBLP]
    Online Algorithms, 1996, pp:178-195 [Conf]
  10. Yossi Azar, Yossi Richter
    An improved algorithm for CIOQ switches. [Citation Graph (0, 0)][DBLP]
    Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
  11. Yossi Azar, Oded Regev
    Off-Line Temporary Tasks Assignment. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:163-171 [Conf]
  12. Yossi Azar, Rafi Zachut
    Packet Routing and Information Gathering in Lines, Rings and Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:484-495 [Conf]
  13. Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén
    On-line Competive Algorithms for Call Admission in Optical Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:431-444 [Conf]
  14. Yossi Azar, Leah Epstein
    On-Line Machine Covering. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:23-36 [Conf]
  15. Yossi Azar, Arik Litichevskey
    Maximizing Throughput in Multi-queue Switches. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:53-64 [Conf]
  16. Yossi Azar, Yossi Richter
    An Improved Algorithm for CIOQ Switches. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:65-76 [Conf]
  17. Noga Alon, Yossi Azar
    The Average Complexity of Deterministic and Randomized Parallel Comparison Sorting Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:489-498 [Conf]
  18. Noga Alon, Yossi Azar
    Parallel Comparison Algorithms for Approximation Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:194-203 [Conf]
  19. Noga Alon, Yossi Azar, Uzi Vishkin
    Tight Complexity Bounds for Parallel Comparison Sorting [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:502-510 [Conf]
  20. Baruch Awerbuch, Yossi Azar
    Local Optimization of Global Objectives: Competitive Distributed Deadlock Resolution and Resource Allocation [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:240-249 [Conf]
  21. Baruch Awerbuch, Yossi Azar
    Buy-at-Bulk Network Design. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:542-547 [Conf]
  22. Baruch Awerbuch, Yossi Azar, Edward F. Grove, Ming-Yang Kao, P. Krishnan, Jeffrey Scott Vitter
    Load Balancing in the Lp Norm. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:383-391 [Conf]
  23. Yossi Azar, Andrei Z. Broder, Anna R. Karlin
    On-line Load Balancing (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:218-225 [Conf]
  24. Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén
    On Capital Investment. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:429-441 [Conf]
  25. Yossi Azar, Joseph Naor, Raphael Rom
    Routing Strategies for Fast Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1992, pp:170-179 [Conf]
  26. Yossi Azar, Oded Regev
    Strongly Polynomial Algorithms for the Unsplittable Flow Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:15-29 [Conf]
  27. Ittai Abraham, Baruch Awerbuch, Yossi Azar, Yair Bartal, Dahlia Malkhi, Elan Pavlov
    A Generic Scheme for Building Overlay Networks in Adversarial Scenarios. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:40- [Conf]
  28. Baruch Awerbuch, Yossi Azar, Amos Fiat
    Packet Routing via Min-Cost Circuit Routing. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:37-42 [Conf]
  29. Yossi Azar, Leah Epstein
    On-Line Load Balancing of Temporary Tasks on Identical Machines. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:119-125 [Conf]
  30. Yossi Azar, Meir Feder, Eyal Lubetzky, Doron Rajwan, Nadav Shulman
    The Multicast Bandwidth Advantage in Serving a Web Site. [Citation Graph (0, 0)][DBLP]
    Networked Group Communication, 2001, pp:88-99 [Conf]
  31. Yossi Azar, Shay Kutten, Boaz Patt-Shamir
    Distributed error confinement. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:33-42 [Conf]
  32. Noga Alon, Uri Arad, Yossi Azar
    Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:16-27 [Conf]
  33. Yossi Azar, Oded Regev
    On-Line Bin-Stretching. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:71-81 [Conf]
  34. Noga Alon, Yossi Azar
    Comparison-Sorting and Selecting in Totally Monotone Matrices. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:403-408 [Conf]
  35. Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
    A general approach to online network optimization problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:577-586 [Conf]
  36. Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Yadid
    Approximation Schemes for Scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:493-500 [Conf]
  37. Ran Adler, Yossi Azar
    Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:1-10 [Conf]
  38. Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev
    Temporary tasks assignment resolved. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:116-124 [Conf]
  39. Adi Avidor, Yossi Azar, Jiri Sgall
    Ancient and New Algorithms for Load Balancing in the Lp Norm. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:426-435 [Conf]
  40. Baruch Awerbuch, Yossi Azar, Yair Bartal
    On-line Generalized Steiner Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:68-74 [Conf]
  41. Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts
    Competitive Routing of Virtual Circuits with Unknown Duration. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:321-327 [Conf]
  42. Yossi Azar, Andrei Z. Broder, Mark S. Manasse
    On-line Choice of On-line Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:432-440 [Conf]
  43. Nir Avrahami, Yossi Azar
    Minimizing total flow time and total completion time with immediate dispatching. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:11-18 [Conf]
  44. Baruch Awerbuch, Yossi Azar, Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle
    Collaborate with strangers to find own preferences. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:263-269 [Conf]
  45. Yossi Azar, Avrim Blum, Yishay Mansour
    Combining online algorithms for rejection and acceptance. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:159-163 [Conf]
  46. Noga Alon, Baruch Awerbuch, Yossi Azar, Boaz Patt-Shamir
    Tell me who I am: an interactive recommendation system. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:1-10 [Conf]
  47. Noga Alon, Yossi Azar, Shai Gutner
    Admission control to minimize rejections and online set cover with repetitions. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:238-244 [Conf]
  48. Yossi Azar, Yoel Chaiutin
    Optimal Node Routing. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:596-607 [Conf]
  49. Nir Andelman, Yossi Azar, Motti Sorani
    Truthful Approximation Mechanisms for Scheduling Selfish Related Machines. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:69-82 [Conf]
  50. Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
    The online set cover problem. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:100-105 [Conf]
  51. Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh Vempala
    Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:277-283 [Conf]
  52. Baruch Awerbuch, Yossi Azar, Amir Epstein
    Large the price of routing unsplittable flow. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:57-66 [Conf]
  53. 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). [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:519-530 [Conf]
  54. Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev
    Minimizing the Flow Time Without Migration. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:198-205 [Conf]
  55. Baruch Awerbuch, Yossi Azar, Adam Meyerson
    Reducing truth-telling online mechanisms to online optimization. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:503-510 [Conf]
  56. Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven Phillips
    Biased Random Walks [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:1-9 [Conf]
  57. Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke
    Optimal oblivious routing in polynomial time. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:383-388 [Conf]
  58. Yossi Azar, Amir Epstein
    Convex programming for scheduling unrelated parallel machines. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:331-337 [Conf]
  59. Yossi Azar, Amos Fiat, Anna R. Karlin, Frank McSherry, Jared Saia
    Spectral analysis of data. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:619-626 [Conf]
  60. Yossi Azar, Yossi Richter
    Management of multi-queue switches in QoS networks. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:82-89 [Conf]
  61. Yossi Azar, Yossi Richter
    The zero-one principle for switching networks. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:64-71 [Conf]
  62. Yossi Azar, Shai Taub
    All-Norm Approximation for Scheduling on Identical Machines. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:298-310 [Conf]
  63. Yossi Azar, Leah Epstein
    On Two Dimensional Packing. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:321-332 [Conf]
  64. Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger
    All-Norm Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:288-297 [Conf]
  65. Yossi Azar, Leah Epstein, Rob van Stee
    Resource Augmentation in Load Balancing. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:189-199 [Conf]
  66. Yossi Azar, Nir Levy
    Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:5-16 [Conf]
  67. Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
    Fair versus Unrestricted Bin Packing. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:200-213 [Conf]
  68. Yossi Azar, Leah Epstein
    On-Line Scheduling with Precedence Constraints. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:164-174 [Conf]
  69. Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts
    Online Load Balancing of Temporary Tasks. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:119-130 [Conf]
  70. Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur
    Tradeoffs in Worst-Case Equilibria. [Citation Graph (0, 0)][DBLP]
    WAOA, 2003, pp:41-52 [Conf]
  71. Yossi Azar
    Online Packet Switching. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:1-5 [Conf]
  72. Yossi Azar, Amir Epstein
    The Hardness of Network Design for Unsplittable Flow with Selfish Users. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:41-54 [Conf]
  73. Yossi Azar, Amir Epstein, Leah Epstein
    Load Balancing of Temporary Tasks in the lp Norm. [Citation Graph (0, 0)][DBLP]
    WAOA, 2003, pp:53-66 [Conf]
  74. Amitai Armon, Yossi Azar, Leah Epstein
    Temporary Tasks Assignment Resolved. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:36, n:3, pp:295-314 [Journal]
  75. Adi Avidor, Yossi Azar, Jiri Sgall
    Ancient and New Algorithms for Load Balancing in the lp Norm. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:3, pp:422-441 [Journal]
  76. Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén
    On-Line Competitive Algorithms for Call Admission in Optical Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:1, pp:29-43 [Journal]
  77. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:21, n:1, pp:104-118 [Journal]
  78. Yossi Azar, Yair Bartal, Esteban Feuerstein, Amos Fiat, Stefano Leonardi, Adi Rosén
    On Capital Investment. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:25, n:1, pp:22-36 [Journal]
  79. Yossi Azar, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen, Leah Epstein
    Fair versus Unrestricted Bin Packing. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:2, pp:181-196 [Journal]
  80. Yossi Azar, Arik Litichevskey
    Maximizing Throughput in Multi-Queue Switches. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:1, pp:69-90 [Journal]
  81. Yossi Azar, Yossi Richter
    Management of Multi-Queue Switches in QoS Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:43, n:1-2, pp:81-96 [Journal]
  82. Yossi Azar, Oded Regev
    Combinatorial Algorithms for the Unsplittable Flow Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:1, pp:49-66 [Journal]
  83. Noga Alon, Yossi Azar
    Parallel comparison algorithms for approximation problems. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:2, pp:97-122 [Journal]
  84. Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nathan Linial, Steven Phillips
    Biased Random Walks. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:1, pp:1-18 [Journal]
  85. Yossi Azar, Rajeev Motwani, Joseph Naor
    Approximating Probability Distributions Using Small Sample Spaces. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:2, pp:151-171 [Journal]
  86. Yossi Azar
    Lower Bounds for Insertion Methods for TSP. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:285-292 [Journal]
  87. Yossi Azar, Leah Epstein
    On-line scheduling with precedence constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:119, n:1-2, pp:169-180 [Journal]
  88. Noga Alon, Yossi Azar
    On-Line Steine Trees in the Euclidean Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:113-121 [Journal]
  89. Yossi Azar, Andrei Z. Broder, Alan M. Frieze
    On the Problem of Approximating the Number of Bases of a Matroid. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:1, pp:9-11 [Journal]
  90. Amitai Armon, Yossi Azar, Leah Epstein, Oded Regev
    On-line restricted assignment of temporary tasks with unknown durations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:2, pp:67-72 [Journal]
  91. 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. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:3, pp:486-504 [Journal]
  92. Yossi Azar, Leah Epstein
    On Two Dimensional Packing. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:25, n:2, pp:290-310 [Journal]
  93. Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger
    All-norm approximation algorithms. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:52, n:2, pp:120-133 [Journal]
  94. Yossi Azar, Bala Kalyanasundaram, Serge A. Plotkin, Kirk Pruhs, Orli Waarts
    On-Line Load Balancing of Temporary Tasks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:22, n:1, pp:93-110 [Journal]
  95. Yossi Azar, Joseph Naor, Raphael Rom
    The Competitiveness of On-Line Assignments. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:2, pp:221-237 [Journal]
  96. Baruch Awerbuch, Yossi Azar, Serge A. Plotkin, Orli Waarts
    Competitive Routing of Virtual Circuits with Unknown Duration. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:3, pp:385-397 [Journal]
  97. Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, Harald Räcke
    Optimal oblivious routing in polynomial time. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:3, pp:383-394 [Journal]
  98. Ran Adler, Yossi Azar
    Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2003, v:6, n:2, pp:113-129 [Journal]
  99. Noga Alon, Yossi Azar
    Finding an Approximate Maximum. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:258-267 [Journal]
  100. Noga Alon, Yossi Azar
    The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:6, pp:1178-1192 [Journal]
  101. Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh Vempala
    New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:254-262 [Journal]
  102. Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev
    Minimizing the Flow Time Without Migration. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1370-1382 [Journal]
  103. Yossi Azar
    Lower Bounds for Threshold and Symmetric Functions in Parallel Computation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:2, pp:329-338 [Journal]
  104. Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal
    Balanced Allocations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:1, pp:180-200 [Journal]
  105. Yossi Azar, Uzi Vishkin
    Tight Comparison Bounds on the Complexity of Parallel Sorting. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:3, pp:458-464 [Journal]
  106. Noga Alon, Yossi Azar
    Sorting, Approximate Sorting, and Searching in Rounds. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:3, pp:269-280 [Journal]
  107. Yossi Azar, Leah Epstein
    On-Line Load Balancing of Temporary Tasks on Identical Machines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:2, pp:347-352 [Journal]
  108. Yossi Azar, Yossi Richter
    An improved algorithm for CIOQ switches. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:2, pp:282-295 [Journal]
  109. Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
    A general approach to online network optimization problems. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:4, pp:640-660 [Journal]
  110. Yossi Azar, Joseph Naor, Raphael Rom
    Routing Strategies for Fast Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:2, pp:165-173 [Journal]
  111. Baruch Awerbuch, Yossi Azar, Yair Bartal
    On-line generalized Steiner problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:2-3, pp:313-324 [Journal]
  112. Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur
    Tradeoffs in worst-case equilibria. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:361, n:2-3, pp:200-209 [Journal]
  113. Yossi Azar
    Parallel Comparison Merging of Many-Ordered Lists. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:83, n:2, pp:275-285 [Journal]
  114. Yossi Azar, Amir Epstein, Leah Epstein
    Load balancing of temporary tasks in the lp norm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:361, n:2-3, pp:314-328 [Journal]
  115. Yossi Azar, Amos Fiat, Meital Levy, N. S. Narayanaswamy
    An improved algorithm for online coloring of intervals with bandwidth. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:363, n:1, pp:18-27 [Journal]
  116. Yossi Azar, Oded Regev
    On-line bin-stretching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:268, n:1, pp:17-41 [Journal]
  117. Yossi Azar, Oded Regev, Jiri Sgall, Gerhard J. Woeginger
    Off-line temporary tasks assignment. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:419-428 [Journal]
  118. Baruch Awerbuch, Yossi Azar
    Competitive multicast routing. [Citation Graph (0, 0)][DBLP]
    Wireless Networks, 1995, v:1, n:1, pp:107-114 [Journal]
  119. Yossi Azar, Iftah Gamzu, Shai Gutner
    Truthful unsplittable flow for large capacity networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:320-329 [Conf]
  120. Nir Avrahami, Yossi Azar
    Minimizing Total Flow Time and Total Completion Time with Immediate Dispatching. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:3, pp:253-268 [Journal]
  121. Nir Andelman, Yossi Azar, Motti Sorani
    Truthful Approximation Mechanisms for Scheduling Selfish Related Machines. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:40, n:4, pp:423-436 [Journal]

  122. On Revenue Maximization in Second-Price Ad Auctions. [Citation Graph (, )][DBLP]


  123. How to Allocate Goods in an Online Market? [Citation Graph (, )][DBLP]


  124. Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks. [Citation Graph (, )][DBLP]


  125. Improved Approximation Algorithms for Budgeted Allocations. [Citation Graph (, )][DBLP]


  126. Truthful Unification Framework for Packing Integer Programs with Choices. [Citation Graph (, )][DBLP]


  127. Maximum Bipartite Flow in Networks with Adaptive Channel Width. [Citation Graph (, )][DBLP]


  128. Fast convergence to nearly optimal solutions in potential games. [Citation Graph (, )][DBLP]


  129. Fast load balancing via bounded best response. [Citation Graph (, )][DBLP]


  130. (Almost) optimal coordination mechanisms for unrelated machine scheduling. [Citation Graph (, )][DBLP]


  131. Monotonicity in Bargaining Networks. [Citation Graph (, )][DBLP]


  132. Buffer management for colored packets with deadlines. [Citation Graph (, )][DBLP]


  133. Multiple intents re-ranking. [Citation Graph (, )][DBLP]


  134. A Preemptive Algorithm for Maximizing Disjoint Paths on Trees. [Citation Graph (, )][DBLP]


  135. Foreword. [Citation Graph (, )][DBLP]


  136. Admission Control to Minimize Rejections and Online Set Cover with Repetitions [Citation Graph (, )][DBLP]


  137. Truthful Unsplittable Flow for Large Capacity Networks [Citation Graph (, )][DBLP]


  138. Thinking Twice about Second-Price Ad Auctions [Citation Graph (, )][DBLP]


  139. Convergence of Local Dynamics to Balanced Outcomes in Exchange Networks [Citation Graph (, )][DBLP]


  140. On Revenue Maximization in Second-Price Ad Auctions [Citation Graph (, )][DBLP]


  141. Optimal whitespace synchronization strategies [Citation Graph (, )][DBLP]


  142. Ranking with Submodular Valuations [Citation Graph (, )][DBLP]


  143. Efficient Submodular Function Maximization under Linear Packing Constraints [Citation Graph (, )][DBLP]


  144. Parallel selection. [Citation Graph (, )][DBLP]


  145. Universal sequences for complete graphs. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.015secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002