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