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

Uriel Feige 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
151EEUriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh: PASS Approximation. APPROX-RANDOM 2009: 111-124
150EENoga Alon, Uriel Feige: On the power of two, three and four probes. SODA 2009: 346-354
149EEAmin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik: On smoothed k-CNF formulas and the Walksat algorithm. SODA 2009: 451-460
148EEYossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra: Buffer management for colored packets with deadlines. SPAA 2009: 319-327
147EEUriel Feige, Kunal Talwar: Approximating the Bandwidth of Caterpillars. Algorithmica 55(1): 190-204 (2009)
146EEReid Andersen, Uriel Feige: Interchanging distance and capacity in probabilistic mappings CoRR abs/0907.3631: (2009)
145EEUriel Feige, Ofer Zeitouni: Deterministic approximation for the cover time of trees CoRR abs/0909.2005: (2009)
2008
144EEArash Asadpour, Uriel Feige, Amin Saberi: Santa Claus Meets Hypergraph Matchings. APPROX-RANDOM 2008: 10-20
143EEUriel Feige, Mohit Singh: Edge Coloring and Decompositions of Weighted Graphs. ESA 2008: 405-416
142EEUriel Feige: On Estimation Algorithms vs Approximation Algorithms. FSTTCS 2008
141EEUriel Feige: On allocations that maximize fairness. SODA 2008: 287-293
140EEYossi Azar, Uriel Feige, Daniel Glasner: A Preemptive Algorithm for Maximizing Disjoint Paths on Trees. SWAT 2008: 319-330
139EEUriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh: A combinatorial allocation mechanism with penalties for banner advertising. WWW 2008: 169-178
138EEReid Andersen, Christian Borgs, Jennifer T. Chayes, Uriel Feige, Abraham D. Flaxman, Adam Kalai, Vahab S. Mirrokni, Moshe Tennenholtz: Trust-based recommendation systems: an axiomatic approach. WWW 2008: 199-208
137EEUriel Feige, MohammadTaghi Hajiaghayi, James R. Lee: Improved Approximation Algorithms for Minimum Weight Vertex Separators. SIAM J. Comput. 38(2): 629-657 (2008)
136EEErik D. Demaine, Uriel Feige, MohammadTaghi Hajiaghayi, Mohammad R. Salavatipour: Combination Can Be Hard: Approximability of the Unique Coverage Problem. SIAM J. Comput. 38(4): 1464-1483 (2008)
135EEUriel Feige, Eran Ofek: Finding a Maximum Independent Set in a Sparse Random Graph. SIAM J. Discrete Math. 22(2): 693-718 (2008)
2007
134 David S. Johnson, Uriel Feige: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007 ACM 2007
133EEUriel Feige, Mohit Singh: Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs. APPROX-RANDOM 2007: 104-118
132EEUriel Feige: Refuting Smoothed 3CNF Formulas. FOCS 2007: 407-417
131EEUriel Feige, Vahab S. Mirrokni, Jan Vondrák: Maximizing Non-Monotone Submodular Functions. FOCS 2007: 461-471
130EEUriel Feige, Guy Kindler, Ryan O'Donnell: Understanding Parallel Repetition Requires Understanding Foams. IEEE Conference on Computational Complexity 2007: 179-192
129EEUriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S. Mirrokni: Robust Combinatorial Optimization with Exponential Scenarios. IPCO 2007: 439-453
128EEUriel Feige, Guy Kindler, Ryan O'Donnell: Understanding Parallel Repetition Requires Understanding Foams. Electronic Colloquium on Computational Complexity (ECCC) 14(043): (2007)
127EEUriel Feige, James R. Lee: An improved approximation ratio for the minimum linear arrangement problem. Inf. Process. Lett. 101(1): 26-29 (2007)
126EEUriel Feige, Eran Ofek: Easily refutable subformulas of large random 3CNF formulas. Theory of Computing 3(1): 25-43 (2007)
2006
125EEUriel Feige, Elchanan Mossel, Dan Vilenchik: Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems. APPROX-RANDOM 2006: 339-350
124EEUriel Feige, Jeong Han Kim, Eran Ofek: Witnesses for non-satisfiability of dense random 3CNF formulas. FOCS 2006: 497-508
123EEUriel Feige, Jan Vondrák: Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e. FOCS 2006: 667-676
122EEErik D. Demaine, Mohammad Taghi Hajiaghayi, Uriel Feige, Mohammad R. Salavatipour: Combination can be hard: approximability of the unique coverage problem. SODA 2006: 162-171
121EEUriel Feige, Mohammad Mahdian: Finding small balanced separators. STOC 2006: 375-384
120EEUriel Feige: On maximizing welfare when utility functions are subadditive. STOC 2006: 41-50
119EEUriel Feige, Eran Ofek: Random 3CNF formulas elude the Lovasz theta function CoRR abs/cs/0603084: (2006)
118EEEran Ofek, Uriel Feige: Random 3CNF formulas elude the Lovasz theta function. Electronic Colloquium on Computational Complexity (ECCC) 13(043): (2006)
117EEUriel Feige, Daniel Reichman: On the hardness of approximating Max-Satisfy. Inf. Process. Lett. 97(1): 31-35 (2006)
116EEUriel Feige, Michael Langberg: The RPR2 rounding technique for semidefinite programs. J. Algorithms 60(1): 1-23 (2006)
115EEUriel Feige: On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph. SIAM J. Comput. 35(4): 964-984 (2006)
2005
114EEUriel Feige, Eran Ofek: Finding a Maximum Independent Set in a Sparse Random Graph. APPROX-RANDOM 2005: 282-293
113EEUriel Feige, Kunal Talwar: Approximating the Bandwidth of Caterpillars. APPROX-RANDOM 2005: 62-73
112EEUriel Feige: Rigorous analysis of heuristics for NP-hard problems. SODA 2005: 927
111EEUriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee: Improved approximation algorithms for minimum-weight vertex separators. STOC 2005: 563-572
110EEUriel Feige, Abraham Flaxman, Jason D. Hartline, Robert D. Kleinberg: On the Competitive Ratio of the Random Sampling Auction. WINE 2005: 878-886
109EEUriel Feige, Eran Ofek: Finding a Maximum Independent Set in a Sparse Random Graph Electronic Colloquium on Computational Complexity (ECCC)(050): (2005)
108EEUriel Feige, Eran Ofek: Spectral techniques applied to sparse random graphs. Random Struct. Algorithms 27(2): 251-275 (2005)
107EEEden Chlamtac, Uriel Feige: Improved approximation of the minimum cover time. Theor. Comput. Sci. 341(1-3): 22-38 (2005)
2004
106EEUriel Feige, Daniel Reichman: On Systems of Linear Equations with Two Variables per Equation. APPROX-RANDOM 2004: 117-127
105EEUriel Feige, Eran Ofek: Easily Refutable Subformulas of Large Random 3CNF Formulas. ICALP 2004: 519-530
104EEUriel Feige: On sums of independent random variables with unbounded variance, and estimating the average degree in a graph. STOC 2004: 594-603
103EEUriel Feige, László Lovász, Prasad Tetali: Approximating Min Sum Set Cover. Algorithmica 40(4): 219-234 (2004)
102EEUriel Feige, Daniel Reichman: On The Hardness of Approximating Max-Satisfy Electronic Colloquium on Computational Complexity (ECCC)(119): (2004)
101EEUriel Feige, Daniele Micciancio: The inapproximability of lattice and coding problems with preprocessing. J. Comput. Syst. Sci. 69(1): 45-67 (2004)
100EEUriel Feige, Michael Langberg, Gideon Schechtman: Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers. SIAM J. Comput. 33(6): 1338-1368 (2004)
99EEUriel Feige: Approximating Maximum Clique by Removing Subgraphs. SIAM J. Discrete Math. 18(2): 219-225 (2004)
2003
98EEUriel Feige: Approximation thresholds for combinatorial optimization problems CoRR cs.CC/0304039: (2003)
97EEUriel Feige, Robert Krauthgamer, Kobbi Nissim: On Cutting a Few Vertices from a Graph. Discrete Applied Mathematics 127(3): 643-649 (2003)
96EEUriel Feige, Orly Yahalom: On the complexity of finding balanced oneway cuts. Inf. Process. Lett. 87(1): 1-5 (2003)
95EEUriel Feige, Yuri Rabinovich: Deterministic approximation of the cover time. Random Struct. Algorithms 23(1): 1-22 (2003)
94EEUriel Feige, Robert Krauthgamer: The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set. SIAM J. Comput. 32(2): 345-370 (2003)
2002
93EEUriel Feige, Eran Ofek, Udi Wieder: Approximating Maximum Edge Coloring in Multigraphs. APPROX 2002: 108-121
92EEUriel Feige, László Lovász, Prasad Tetali: Approximating Min-sum Set Cover. APPROX 2002: 94-107
91EEUriel Feige, Michael Langberg, Gideon Schechtman: Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers. FOCS 2002: 283-292
90EEUriel Feige, Daniele Micciancio: The Inapproximability of Lattice and Coding Problems with Preprocessing. IEEE Conference on Computational Complexity 2002: 44-52
89EEUriel Feige: Relations between Average Case Complexity and Approximation Complexity. IEEE Conference on Computational Complexity 2002: 5
88EEUriel Feige: Relations between average case complexity and approximation complexity. STOC 2002: 534-543
87EEUriel Feige, Christian Scheideler: Improved Bounds for Acyclic Job Shop Scheduling. Combinatorica 22(3): 361-399 (2002)
86EEUriel Feige, Oleg Verbitsky: Error Reduction by Parallel Repetition - A Negative Result. Combinatorica 22(4): 461-478 (2002)
85EEUriel Feige, Marek Karpinski, Michael Langberg: Improved approximation of Max-Cut on graphs of bounded degree. J. Algorithms 43(2): 201-219 (2002)
84EEUriel Feige, Gideon Schechtman: On the optimality of the random hyperplane rounding technique for MAX CUT. Random Struct. Algorithms 20(3): 403-440 (2002)
83EEUriel Feige, Robert Krauthgamer: A Polylogarithmic Approximation of the Minimum Bisection. SIAM J. Comput. 31(4): 1090-1118 (2002)
82EEUriel Feige, Magnús M. Halldórsson, Guy Kortsarz, Aravind Srinivasan: Approximating the Domatic Number. SIAM J. Comput. 32(1): 172-195 (2002)
81 Uriel Feige, Giora Rayzman: On the drift of short schedules. Theor. Comput. Sci. 289(1): 473-484 (2002)
2001
80EEUriel Feige, Michael Langberg: The RPR2 Rounding Technique for Semidefinite Programs. ICALP 2001: 213-224
79EEUriel Feige, Gideon Schechtman: On the integrality ratio of semidefinite relaxations of MAX CUT. STOC 2001: 433-442
78EEUriel Feige, David Peleg, Guy Kortsarz: The Dense k-Subgraph Problem. Algorithmica 29(3): 410-421 (2001)
77EEUriel Feige, Marek Karpinski, Michael Langberg: A note on approximating Max-Bisection on regular graphs. Inf. Process. Lett. 79(4): 181-188 (2001)
76EEUriel Feige, Michael Langberg: Approximation Algorithms for Maximization Problems Arising in Graph Partitioning. J. Algorithms 41(2): 174-211 (2001)
75EEUriel Feige, Joe Kilian: Heuristics for Semirandom Graph Problems. J. Comput. Syst. Sci. 63(4): 639-671 (2001)
2000
74EEUriel Feige, Michael Langberg, Kobbi Nissim: On the hardness of approximating N P witnesses. APPROX 2000: 120-131
73 Uriel Feige, Robert Krauthgamer: A polylogarithmic approximation of the minimum bisection. FOCS 2000: 105-115
72EEAndrei Z. Broder, Uriel Feige: Min-Wise versus linear independence (extended abstract). SODA 2000: 147-154
71EEUriel Feige, Magnús M. Halldórsson, Guy Kortsarz: Approximating the domatic number. STOC 2000: 134-143
70EEUriel Feige, Robert Krauthgamer, Kobbi Nissim: Approximating the minimum bisection size (extended abstract). STOC 2000: 530-536
69EEUriel Feige: Coping with the NP-Hardness of the Graph Bandwidth Problem. SWAT 2000: 10-19
68EEUriel Feige, Robert Krauthgamer: Networks on Which Hot-Potato Routing Does Not Livelock. Distributed Computing 13(1): 53-58 (2000)
67EEUriel Feige, Marek Karpinski, Michael Langberg: Improved Approximation of MAX-CUT on Graphs of Bounded Degree Electronic Colloquium on Computational Complexity (ECCC) 7(21): (2000)
66EEUriel Feige, Marek Karpinski, Michael Langberg: A Note on Approximating MAX-BISECTION on Regular Graphs Electronic Colloquium on Computational Complexity (ECCC) 7(43): (2000)
65EEUriel Feige, Joe Kilian: Finding OR in a noisy broadcast network. Inf. Process. Lett. 73(1-2): 69-75 (2000)
64 Uriel Feige: Approximating the Bandwidth via Volume Respecting Embeddings. J. Comput. Syst. Sci. 60(3): 510-539 (2000)
63 Uriel Feige, Robert Krauthgamer: Finding and certifying a large hidden clique in a semirandom graph. Random Struct. Algorithms 16(2): 195-208 (2000)
62 Uriel Feige, Joe Kilian: Two-Prover Protocols - Low Error at Affordable Rates. SIAM J. Comput. 30(1): 324-346 (2000)
61EEYonatan Aumann, Judit Bar-Ilan, Uriel Feige: On the cost of recomputing: Tight bounds on pebbling with faults. Theor. Comput. Sci. 233(1-2): 247-261 (2000)
1999
60EEUriel Feige: Noncryptographic Selection Protocols. FOCS 1999: 142-153
59 Uriel Feige: Randomized Rounding for Semidefinite Programs-Variations on the MAX CUT Example. RANDOM-APPROX 1999: 189-196
58EEUriel Feige: Nonmonotonic Phenomena in Packet Routing. STOC 1999: 583-591
57 Uriel Feige, Dror Lapidot, Adi Shamir: Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions. SIAM J. Comput. 29(1): 1-28 (1999)
1998
56EEUriel Feige, Joe Kilian: Heuristics for Finding Large Independent Sets, with Applications to Coloring Semi-Random Graphs. FOCS 1998: 674-683
55EEUriel Feige, Christian Scheideler: Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). STOC 1998: 624-633
54EEUriel Feige: Approximating the Bandwidth via Volume Respecting Embeddings (Extended Abstract). STOC 1998: 90-99
53EEUriel Feige: A Threshold of ln n for Approximating Set Cover. J. ACM 45(4): 634-652 (1998)
52 Uriel Feige, Joe Kilian: Zero Knowledge and the Chromatic Number. J. Comput. Syst. Sci. 57(2): 187-199 (1998)
1997
51EEUriel Feige, Giora Rayzman: On the Drift of Short Schedules. CIAC 1997: 74-85
50EEUriel Feige, Robert Krauthgamer: Stereoscopic families of permutations, and their applications. ISTCS 1997: 85-95
49EEUriel Feige, Joe Kilian: Making Games Short (Extended Abstract). STOC 1997: 506-516
48EEUriel Feige, Joe Kilian: On Limited versus Polynomial Nondeterminism. Chicago J. Theor. Comput. Sci. 1997: (1997)
47 Uriel Feige: Randomized Graph Products, Chromatic Numbers, and the Lovász vartheta-Funktion. Combinatorica 17(1): 79-90 (1997)
46 Uriel Feige, Carsten Lund: On the Hardness of Computing the Permanent of Random Matrices. Computational Complexity 6(2): 101-132 (1997)
45 Uriel Feige: Collecting Coupons on Trees, and the Cover Time of Random Walks. Computational Complexity 6(4): 341-356 (1997)
44 Uriel Feige: A Spectrum of Time-Space Trade-Offs for Undirected s-t Connectivity. J. Comput. Syst. Sci. 54(2): 305-316 (1997)
1996
43EEUriel Feige, Joe Kilian: Zero Knowledge and the Chromatic Number. IEEE Conference on Computational Complexity 1996: 278-287
42EEUriel Feige, Oleg Verbitsky: Error Reduction by Parallel Repetition - a Negative Result. IEEE Conference on Computational Complexity 1996: 70-76
41 Uriel Feige, Yuri Rabinovich: Deterministic Approximation of the Cover Time. ISTCS 1996: 208-218
40EEUriel Feige: A Threshold of ln n for Approximating Set Cover (Preliminary Version). STOC 1996: 314-318
39EERan Canetti, Uriel Feige, Oded Goldreich, Moni Naor: Adaptively Secure Multi-Party Computation. STOC 1996: 639-648
38EEUriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy: Interactive Proofs and the Hardness of Approximating Cliques. J. ACM 43(2): 268-292 (1996)
37EEGreg Barnes, Uriel Feige: Short Random Walks on Graphs. SIAM J. Discrete Math. 9(1): 19-28 (1996)
36EEDon Coppersmith, Uriel Feige, James B. Shearer: Random Walks on Regular and Irregular Graphs. SIAM J. Discrete Math. 9(2): 301-308 (1996)
35EEUriel Feige: A Fast Randomized LOGSPACE Algorithm for Graph Connectivity. Theor. Comput. Sci. 169(2): 147-160 (1996)
1995
34 Uriel Feige, Michel X. Goemans: Aproximating the Value of Two Prover Proof Systems, With Applications to MAX 2SAT and MAX DICUT. ISTCS 1995: 182-189
33 Mihir Bellare, Uriel Feige, Joe Kilian: On the Role of Shared Randomness in Two Prover Proof Systems. ISTCS 1995: 199-208
32 Uriel Feige: Observations on Hot Potato Routing. ISTCS 1995: 30-39
31EEUriel Feige, Joe Kilian: Impossibility results for recycling random bits in two-prover proof systems. STOC 1995: 457-468
30EEUriel Feige: Randomized graph products, chromatic numbers, and Lovasz theta-function. STOC 1995: 635-640
29 Noga Alon, Uriel Feige, Avi Wigderson, David Zuckerman: Derandomized Graph Products. Computational Complexity 5(1): 60-75 (1995)
28 Uriel Feige: A Tight Upper Bound on the Cover Time for Random Walks on Graphs. Random Struct. Algorithms 6(1): 51-54 (1995)
27 Uriel Feige: A Tight Lower Bound on the Cover Time for Random Walks on Graphs. Random Struct. Algorithms 6(4): 433-438 (1995)
1994
26EEYonatan Aumann, Judit Bar-Ilan, Uriel Feige: On the Cost of Recomputing: Tight Bounds on Pebbling with Faults. ICALP 1994: 47-58
25EEUriel Feige: A Fast Randomized LOGSPACE Algorithm for Graph Connectivity. ICALP 1994: 499-507
24EEUriel Feige, Joe Kilian: Two prover protocols: low error at affordable rates. STOC 1994: 172-183
23EEUriel Feige, Joe Kilian, Moni Naor: A minimal model for secure computation (extended abstract). STOC 1994: 554-563
22 Uriel Feige, Prabhakar Raghavan, David Peleg, Eli Upfal: Computing with Noisy Information. SIAM J. Comput. 23(5): 1001-1018 (1994)
1993
21EEYonatan Aumann, Uriel Feige: On Message Proof Systems with Known Space Verifiers. CRYPTO 1993: 85-99
20 Uriel Feige: A Randomized Time-Space Tradefoff of \tildeO(m\tildeR) for USTCON FOCS 1993: 238-246
19EEGreg Barnes, Uriel Feige: Short random walks on graphs. STOC 1993: 728-737
1992
18EECynthia Dwork, Uriel Feige, Joe Kilian, Moni Naor, Shmuel Safra: Low Communication 2-Prover Zero-Knowledge Proofs for NP. CRYPTO 1992: 215-227
17 Uriel Feige, Prabhakar Raghavan: Exact Analysis of Hot-Potato Routing (Extended Abstract) FOCS 1992: 553-562
16 Uriel Feige, Carsten Lund: On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract) STOC 1992: 643-654
15 Uriel Feige, László Lovász: Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract) STOC 1992: 733-744
14 Uriel Feige: On the Complexity of Finite Random Functions. Inf. Process. Lett. 44(6): 295-296 (1992)
13 Uriel Feige, Adi Shamir: Multi-Oracle Interactive Protocols with Constant Space Verifiers. J. Comput. Syst. Sci. 44(2): 259-271 (1992)
1991
12 Uriel Feige, Shafi Goldwasser, László Lovász, Shmuel Safra, Mario Szegedy: Approximating Clique is Almost NP-Complete (Preliminary Version) FOCS 1991: 2-12
11 Uriel Feige: On the Success Probability of the Two Provers in One-Round Proof Systems. Structure in Complexity Theory Conference 1991: 116-123
1990
10 Uriel Feige, Dror Lapidot, Adi Shamir: Multiple Non-Interactive Zero Knowledge Proofs Based on a Single Random String (Extended Abstract) FOCS 1990: 308-317
9EEUriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal: Randomized Broadcast in Networks. SIGAL International Symposium on Algorithms 1990: 128-137
8 Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal: Computing with Unreliable Information (Preliminary Version) STOC 1990: 128-137
7 Uriel Feige, Adi Shamir: Witness Indistinguishable and Witness Hiding Protocols STOC 1990: 416-426
6 Uriel Feige, David Peleg, Prabhakar Raghavan, Eli Upfal: Randomized Broadcast in Networks. Random Struct. Algorithms 1(4): 447-460 (1990)
1989
5EEUriel Feige, Adi Shamir: Zero Knowledge Proofs of Knowledge in Two Rounds. CRYPTO 1989: 526-544
4 Uriel Feige, Adi Shamir: Multi-Oracle Interactive Protocols with Space Bounded Verifiers. Structure in Complexity Theory Conference 1989: 158-164
1988
3EEUriel Feige, Adi Shamir, Moshe Tennenholtz: The Noisy Oracle Problem. CRYPTO 1988: 284-296
2 Uriel Feige, Amos Fiat, Adi Shamir: Zero-Knowledge Proofs of Identity. J. Cryptology 1(2): 77-94 (1988)
1987
1 Uriel Feige, Amos Fiat, Adi Shamir: Zero Knowledge Proofs of Identity STOC 1987: 210-217

Coauthor Index

1Noga Alon [29] [150]
2Reid Andersen [138] [146]
3Arash Asadpour [144]
4Yonatan Aumann [21] [26] [61]
5Yossi Azar [140] [148]
6Judit Bar-Ilan [26] [61]
7Greg Barnes [19] [37]
8Mihir Bellare [33]
9Christian Borgs [138]
10Andrei Z. Broder [72]
11Ran Canetti [39]
12Jennifer T. Chayes [138]
13Eden Chlamtac [107]
14Amin Coja-Oghlan [149]
15Don Coppersmith [36]
16Erik D. Demaine [122] [136]
17Cynthia Dwork [18]
18Amos Fiat [1] [2]
19Abraham D. Flaxman (Abraham Flaxman) [110] [138]
20Alan M. Frieze [149]
21Iftah Gamzu [148]
22Daniel Glasner [140]
23Michel X. Goemans [34]
24Oded Goldreich [39]
25Shafi Goldwasser [12] [38]
26Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi) [111] [122] [136] [137]
27Magnús M. Halldórsson [71] [82]
28Jason D. Hartline [110]
29Nicole Immorlica [139] [151]
30Kamal Jain [129]
31David S. Johnson [134]
32Adam Tauman Kalai (Adam Kalai) [138]
33Marek Karpinski [66] [67] [77] [85]
34Joe Kilian [18] [23] [24] [31] [33] [43] [48] [49] [52] [56] [62] [65] [75]
35Jeong Han Kim [124]
36Guy Kindler [128] [130]
37Robert D. Kleinberg (Robert Kleinberg) [110]
38Guy Kortsarz [71] [78] [82]
39Robert Krauthgamer [50] [63] [68] [70] [73] [83] [94] [97]
40Michael Krivelevich [149]
41Michael Langberg [66] [67] [74] [76] [77] [80] [85] [91] [100] [116]
42Dror Lapidot [10] [57]
43James R. Lee [111] [127] [137]
44László Lovász [12] [15] [38] [92] [103]
45Carsten Lund [16] [46]
46Mohammad Mahdian [121] [129]
47Daniele Micciancio [90] [101]
48Vahab S. Mirrokni (Seyed Vahab Mirrokni) [129] [131] [138] [139] [151]
49Thomas Moscibroda [148]
50Elchanan Mossel [125]
51Moni Naor [18] [23] [39]
52Hamid Nazerzadeh [139] [151]
53Kobbi Nissim [70] [74] [97]
54Ryan O'Donnell [128] [130]
55Eran Ofek [93] [105] [108] [109] [114] [118] [119] [124] [126] [135]
56David Peleg [6] [8] [9] [22] [78]
57Yuri Rabinovich [41] [95]
58Prabhakar Raghavan [6] [8] [9] [17] [22]
59Prasad Raghavendra [148]
60Giora Rayzman [51] [81]
61Daniel Reichman [102] [106] [117]
62Amin Saberi [144]
63Shmuel Safra [12] [18] [38]
64Mohammad R. Salavatipour [122] [136]
65Gideon Schechtman [79] [84] [91] [100]
66Christian Scheideler [55] [87]
67Adi Shamir [1] [2] [3] [4] [5] [7] [10] [13] [57]
68James B. Shearer [36]
69Mohit Singh [133] [143]
70Aravind Srinivasan [82]
71Mario Szegedy [12] [38]
72Kunal Talwar [113] [147]
73Moshe Tennenholtz [3] [138]
74Prasad Tetali [92] [103]
75Eli Upfal [6] [8] [9] [22]
76Oleg Verbitsky [42] [86]
77Dan Vilenchik [125] [149]
78Jan Vondrák [123] [131]
79Udi Wieder [93]
80Avi Wigderson [29]
81Orly Yahalom [96]
82Ofer Zeitouni [145]
83David Zuckerman [29]

Colors in the list of coauthors

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