dblp.uni-trier.dewww.uni-trier.de

Yossi Azar Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

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

Coauthor Index

1Ittai Abraham [91]
2Ran Adler [59] [79]
3Noga Alon [1] [3] [4] [5] [6] [7] [9] [11] [13] [15] [19] [46] [52] [60] [87] [99] [109] [117] [121] [129]
4Nir Andelman [107] [123]
5Uri Arad [60]
6Amitai Armon [78] [80] [81]
7James Aspnes [21] [45]
8Adi Avidor [53] [69]
9Nir Avrahami [89] [124]
10Baruch Awerbuch [23] [28] [29] [30] [32] [33] [37] [38] [40] [42] [48] [50] [58] [65] [67] [68] [74] [83] [85] [87] [91] [92] [99] [105] [108] [114] [117] [121] [126] [132] [135]
11Yair Bartal [38] [41] [57] [91] [92]
12Benjamin E. Birnbaum [127] [134] [136] [137] [142]
13Avrim Blum [32] [50] [88] [102]
14Joan Boyar [62] [76]
15Andrei Z. Broder [14] [18] [22] [24] [25] [27] [35] [56]
16Niv Buchbinder [87] [99] [117]
17David P. Bunde [102]
18L. Elisa Celis [137]
19Yoel Chaiutin [120]
20Edith Cohen [86] [94]
21János Csirik [52]
22Nikhil R. Devanur [137]
23Amir Epstein [82] [104] [105] [106] [113] [135]
24Leah Epstein [36] [43] [47] [49] [52] [55] [63] [64] [75] [76] [77] [78] [80] [81] [82] [93] [95] [113]
25Thomas Erlebach [122] [138]
26Lene M. Favrholdt [62] [76]
27Meir Feder [71]
28Uriel Feige [130] [140]
29Esteban Feuerstein [41] [57]
30Amos Fiat [21] [37] [40] [41] [42] [45] [57] [68] [70] [86] [94] [112]
31Alan M. Frieze [25]
32Iftah Gamzu [125] [128] [133] [139] [140]
33Daniel Glasner [130]
34Edward F. Grove [33]
35Shai Gutner [109] [125] [128] [129]
36Kamal Jain [131]
37Bala Kalyanasundaram [20] [44]
38Ming-Yang Kao [33]
39Haim Kaplan [86] [94]
40Anna R. Karlin [14] [18] [24] [27] [35] [56] [70] [127] [134] [136] [142]
41Rohit Khandekar [132]
42P. Krishnan [33]
43Shay Kutten [90]
44Kim S. Larsen [62] [76]
45Frank Thomson Leighton (Tom Leighton) [37]
46Stefano Leonardi [41] [42] [57] [58] [68] [74]
47Meital Levy [112]
48Nir Levy [119]
49Nathan Linial (Nati Linial) [14] [35]
50Arik Litichevskey [101] [115]
51Zvi Lotker [108] [126]
52Eyal Lubetzky [71]
53Aleksander Madry [141]
54Dahlia Malkhi (Dalia Malki) [91]
55Mark S. Manasse (Mark Manasse) [22]
56Yishay Mansour [88] [102]
57Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu) [134]
58Frank McSherry [70]
59Adam Meyerson [85]
60Vahab S. Mirrokni (Seyed Vahab Mirrokni) [131] [135]
61Thomas Moscibroda [140] [141]
62Rajeev Motwani [51]
63Joseph Naor (Seffi Naor) [16] [17] [31] [34] [51] [87] [99] [117]
64N. S. Narayanaswamy [112]
65C. Thach Nguyen [127] [134] [136] [142]
66Morten N. Nielsen [62] [76]
67Debmalya Panigrahi [141]
68Boaz Patt-Shamir [90] [108] [121] [126]
69Elan Pavlov [91]
70Yuval Peres [137]
71Steven Phillips [14] [35]
72Nicholas Pippenger [8]
73Serge A. Plotkin [20] [21] [23] [28] [44] [45] [67]
74Kirk Pruhs [20] [44]
75Harald Räcke [86] [94]
76Prasad Raghavendra [140]
77Doron Rajwan [71]
78Yiftach Ravid [9]
79Oded Regev [54] [58] [61] [65] [66] [72] [73] [74] [78] [80] [116]
80Yossi Richter [77] [83] [84] [95] [98] [100] [103] [111] [114] [118]
81Raphael Rom [16] [17] [31] [34]
82Adi Rosén [41] [42] [57] [68]
83Jared Saia [70]
84Sergey V. Sevastianov [52]
85Jiri Sgall [53] [69] [73]
86Nadav Shulman [71]
87Alexander Skopalik [135]
88Motti Sorani [107] [123]
89Aravind Srinivasan [141]
90Rob van Stee [63]
91Shai Taub [97]
92Dekel Tsur [83] [114]
93Mark R. Tuttle [108] [126]
94Eli Upfal [27] [56]
95Santosh Vempala [32] [50]
96Arjen P. A. Vestjens [52]
97Uzi Vishkin [1] [2]
98Jeffrey Scott Vitter [33]
99Orli Waarts [20] [21] [28] [44] [45] [67]
100Gerhard J. Woeginger [46] [52] [73] [77] [95]
101Tal Yadid [46]
102Xiaoxin Yin [139]
103Rafi Zachut [110]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)