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

Vijay V. Vazirani

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
123EEVijay V. Vazirani: Nash Bargaining Via Flexible Budget Markets. AAIM 2008: 2
122EENoam Berger, Nevin Kapur, Leonard J. Schulman, Vijay V. Vazirani: Solvency Games. FSTTCS 2008
121EEDeeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani: New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem. IPCO 2008: 344-358
120EEAnirudh Ramachandran, Srinivasan Seetharaman, Nick Feamster, Vijay V. Vazirani: Fast monitoring of traffic subpopulations. Internet Measurement Comference 2008: 257-270
119EEVijay V. Vazirani: Nash Bargaining Via Flexible Budget Markets. SWAT 2008: 4
118EEDeeparnab Chakrabarty, Gagan Goel, Vijay V. Vazirani, Lei Wang, Changyuan Yu: Efficiency, Fairness and Competitiveness in Nash Bargaining Games. WINE 2008: 498-505
117EENayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda: Random Bichromatic Matchings. Algorithmica 50(4): 418-445 (2008)
116EEVijay V. Vazirani, Wang Lei: Continuity Properties of Equilibria in Some Fisher and Arrow-Debreu Market Models. Electronic Colloquium on Computational Complexity (ECCC) 15(047): (2008)
115EENoam Berger, Nevin Kapur, Leonard J. Schulman, Vijay V. Vazirani: Solvency Games. Electronic Colloquium on Computational Complexity (ECCC) 15(089): (2008)
114EENikhil R. Devanur, Christos H. Papadimitriou, Amin Saberi, Vijay V. Vazirani: Market equilibrium via a primal--dual algorithm for a convex program. J. ACM 55(5): (2008)
113EEIvona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda: Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems. SIAM J. Comput. 37(5): 1429-1454 (2008)
112EEKamal Jain, Vijay V. Vazirani: Equitable Cost Allocations via Primal--Dual-Type Algorithms. SIAM J. Comput. 38(1): 241-256 (2008)
2007
111EEKamal Jain, Vijay V. Vazirani: Eisenberg-Gale markets: algorithms and structural properties. STOC 2007: 364-373
110EENimrod Megiddo, Vijay V. Vazirani: Continuity Properties of Equilibrium Prices and Allocations in Linear Fisher Markets. WINE 2007: 362-367
109EEVijay V. Vazirani: Markets and the Primal-Dual Paradigm. WINE 2007: 4
108EEAranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani: AdWords and generalized online matching. J. ACM 54(5): (2007)
107EEDinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Vazirani: A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property. Theor. Comput. Sci. 378(2): 143-152 (2007)
106EESanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani: An auction-based market equilibrium algorithm for a production model. Theor. Comput. Sci. 378(2): 153-164 (2007)
2006
105EEDeeparnab Chakrabarty, Aranyak Mehta, Vijay V. Vazirani: Design Is as Easy as Optimization. ICALP (1) 2006: 477-488
104EEMohammad Taghi Hajiaghayi, Kamal Jain, Lap Chi Lau, Ion I. Mandoiu, Alexander Russell, Vijay V. Vazirani: Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping. International Conference on Computational Science (2) 2006: 758-766
103EENayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda: Random Bichromatic Matchings. LATIN 2006: 190-201
102EEIvona Bezáková, Daniel Stefankovic, Vijay V. Vazirani, Eric Vigoda: Accelerating simulated annealing for the permanent and combinatorial counting problems. SODA 2006: 900-907
101EEDeeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani: New Results on Rationality and Strongly Polynomial Time Solvability in Eisenberg-Gale Markets. WINE 2006: 239-250
100EEDeeparnab Chakrabarty, Nikhil R. Devanur, Vijay V. Vazirani: Eisenberg-Gale Markets: Rationality, Strongly Polynomial Solvability, and Competition Monotonicity. Electronic Colloquium on Computational Complexity (ECCC) 13(029): (2006)
99EEKamal Jain, Vijay V. Vazirani, Gideon Yuval: On the capacity of multiple unicast sessions in undirected graphs. IEEE Transactions on Information Theory 52(6): 2805-2809 (2006)
98EEAranyak Mehta, Scott Shenker, Vijay V. Vazirani: Posted price profit maximization for multicast by approximating fixed points. J. Algorithms 58(2): 150-164 (2006)
2005
97EEAranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani: AdWords and Generalized On-line Matching. FOCS 2005: 264-273
96EEKamal Jain, Vijay V. Vazirani, Yinyu Ye: Market equilibria for homothetic, quasi-concave utilities and economies of scale in production. SODA 2005: 63-71
95EESanjiv Kapoor, Aranyak Mehta, Vijay V. Vazirani: An Auction-Based Market Equilibrium Algorithm for a Production Model. WINE 2005: 102-111
94EENikhil R. Devanur, Naveen Garg, Rohit Khandekar, Vinayaka Pandit, Amin Saberi, Vijay V. Vazirani: Price of Anarchy, Locality Gap, and a Network Service Provider Game. WINE 2005: 1046-1055
93EEKamal Jain, Aranyak Mehta, Kunal Talwar, Vijay V. Vazirani: A Simple Characterization for Truth-Revealing Single-Item Auctions. WINE 2005: 122-128
92EEDinesh Garg, Kamal Jain, Kunal Talwar, Vijay V. Vazirani: A Primal-Dual Algorithm for Computing Fisher Equilibrium in the Absence of Gross Substitutability Property. WINE 2005: 24-33
91EELeonard J. Schulman, Vijay V. Vazirani: A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution. Combinatorica 25(4): 465-486 (2005)
90EENikhil R. Devanur, Milena Mihail, Vijay V. Vazirani: Strategyproof cost-sharing mechanisms for set cover and facility location games. Decision Support Systems 39(1): 11-22 (2005)
2004
89EEAranyak Mehta, Vijay V. Vazirani: Randomized truthful auctions of digital goods are randomizations over truthful auctions. ACM Conference on Electronic Commerce 2004: 120-124
88EERahul Garg, Sanjiv Kapoor, Vijay V. Vazirani: An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case. APPROX-RANDOM 2004: 128-138
87EENaveen Garg, Vijay V. Vazirani, Mihalis Yannakakis: Multiway cuts in node weighted graphs. J. Algorithms 50(1): 49-61 (2004)
2003
86EENikhil R. Devanur, Milena Mihail, Vijay V. Vazirani: Strategyproof cost-sharing mechanisms for set cover and facility location games. ACM Conference on Electronic Commerce 2003: 108-114
85EENikhil R. Devanur, Vijay V. Vazirani: Extensions of the spending constraint-model: existence and uniqueness of equilibria (extended abstract). ACM Conference on Electronic Commerce 2003: 202-203
84EEAranyak Mehta, Scott Shenker, Vijay V. Vazirani: Profit-maximizing multicast pricing by approximating fixed points. ACM Conference on Electronic Commerce 2003: 218-219
83EENikhil R. Devanur, Vijay V. Vazirani: An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case. FSTTCS 2003: 149-155
82EEMicah Adler, Eran Halperin, Richard M. Karp, Vijay V. Vazirani: A stochastic process on the hypercube with applications to peer-to-peer networks. STOC 2003: 575-584
81EEKamal Jain, Vijay V. Vazirani: An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem. Algorithmica 38(3): 433-439 (2003)
80EEKamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50(6): 795-824 (2003)
2002
79 Klaus Jansen, Stefano Leonardi, Vijay V. Vazirani: Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings Springer 2002
78EENikhil R. Devanur, Christos H. Papadimitriou, Amin Saberi, Vijay V. Vazirani: Market Equilibrium via a Primal-Dual-Type Algorithm. FOCS 2002: 389-395
77EEKamal Jain, Vijay V. Vazirani: Equitable cost allocations via primal-dual-type algorithms. STOC 2002: 313-321
76EEKamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani: Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP CoRR cs.DS/0207028: (2002)
75EEKamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, David P. Williamson: A primal-dual schema based approximation algorithm for the element connectivity problem. J. Algorithms 45(1): 1-15 (2002)
2001
74EERamarathnam Venkatesan, Vijay V. Vazirani, Saurabh Sinha: A Graph Theoretic Approach to Software Watermarking. Information Hiding 2001: 157-168
73EEMohammad Mahdian, Evangelos Markakis, Amin Saberi, Vijay V. Vazirani: A Greedy Facility Location Algorithm Analyzed Using Dual Fitting. RANDOM-APPROX 2001: 127-137
72EEKamal Jain, Vijay V. Vazirani: Applications of approximation algorithms to cooperative games. STOC 2001: 364-372
71EEKamal Jain, Vijay V. Vazirani: Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation. J. ACM 48(2): 274-296 (2001)
2000
70EEKamal Jain, Vijay V. Vazirani: An approximation algorithm for the fault tolerant metric facility location problem. APPROX 2000: 177-183
69EEVijay V. Vazirani: Primal-Dual Schema Based Approximation Algorithms. Theoretical Aspects of Computer Science 2000: 198-207
68EEIon I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganley: A new heuristic for rectilinear Steiner trees. IEEE Trans. on CAD of Integrated Circuits and Systems 19(10): 1129-1139 (2000)
67EEVijay V. Vazirani: Recent results on approximating the Steiner tree problem and its generalizations. Theor. Comput. Sci. 235(1): 205-216 (2000)
1999
66EEKamal Jain, Vijay V. Vazirani: Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems. FOCS 1999: 2-13
65EEIon I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganley: A new heuristic for rectilinear Steiner trees. ICCAD 1999: 157-162
64EEKamal Jain, Ion I. Mandoiu, Vijay V. Vazirani, David P. Williamson: A Primal-Dual Schema Based Approximation Algorithm for the Element Connectivity Problem. SODA 1999: 484-489
63EESridhar Rajagopalan, Vijay V. Vazirani: On the Bidirected Cut Relaxation for the Metric Steiner Tree Problem. SODA 1999: 742-751
62EELeonard J. Schulman, Vijay V. Vazirani: Majorizing Estimators and the Approximation of #P-Complete Problems. STOC 1999: 288-294
61 Naveen Garg, Huzur Saran, Vijay V. Vazirani: Finding Separator Cuts in Planar Graphs within Twice the Optimal. SIAM J. Comput. 29(1): 159-179 (1999)
1998
60EEVijay V. Vazirani: The Steiner Tree Problem and Its Generalizations. APPROX 1998: 33-38
59 Kamal Jain, Ion I. Mandoiu, Vijay V. Vazirani: The 'Art of Trellis Decoding' Is Computationally Hardi - For Large Fields. IEEE Transactions on Information Theory 44(3): 1211-1214 (1998)
58 Sridhar Rajagopalan, Vijay V. Vazirani: Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs. SIAM J. Comput. 28(2): 525-540 (1998)
1997
57 Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis: Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees. Algorithmica 18(1): 3-20 (1997)
1996
56 Vijay V. Vazirani, Huzur Saran, B. Sundar Rajan: An Efficient Algorithm for Constructing Minimal Trellises for Codes over Finite Abelian Groups. FOCS 1996: 144-153
55 Vijay V. Vazirani, Huzur Saran, B. Sundar Rajan: An efficient algorithm for constructing minimal trellises for codes over finite abelian groups. IEEE Transactions on Information Theory 42(6): 1839-1854 (1996)
54 Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis: Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications. SIAM J. Comput. 25(2): 235-251 (1996)
1995
53 Vijay V. Vazirani: Primal-Dual Schema Based Approximation Algorithms (Abstract). COCOON 1995: 650-652
52 David P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani: A Primal-Dual Approximation Algorithm for Generalized Steiner Network Problems. Combinatorica 15(3): 435-454 (1995)
51 Huzur Saran, Vijay V. Vazirani: Finding k Cuts within Twice the Optimal. SIAM J. Comput. 24(1): 101-108 (1995)
1994
50 Naveen Garg, Huzur Saran, Vijay V. Vazirani: Finding separator cuts in planar graphs within twice the optimal FOCS 1994: 14-23
49 Vivek Arora, Santosh Vempala, Huzur Saran, Vijay V. Vazirani: A Limited-Backtrack Greedy Schema for Approximation Algorithms. FSTTCS 1994: 318-329
48 Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis: Multiway Cuts in Directed and Node Weighted Graphs. ICALP 1994: 487-498
47 Vijay V. Vazirani: A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(sqrt{V E}) General Graph Maximum Matching Algorithm. Combinatorica 14(1): 71-109 (1994)
46 H. Narayanan, Huzur Saran, Vijay V. Vazirani: Randomized Parallel Algorithms for Matroid Union and Intersection, With Applications to Arboresences and Edge-Disjoint Spanning Trees. SIAM J. Comput. 23(2): 387-397 (1994)
45 Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani: On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages. Theor. Comput. Sci. 127(2): 255-267 (1994)
1993
44 Sridhar Rajagopalan, Vijay V. Vazirani: Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs FOCS 1993: 322-331
43 Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis: Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover. ICALP 1993: 64-75
42 Naveen Garg, Vijay V. Vazirani: A polyhedron with all s-t cuts as vertices, and adjacency of cuts. IPCO 1993: 281-289
41EENaveen Garg, Vijay V. Vazirani, Mihalis Yannakakis: Approximate max-flow min-(multi)cut theorems and their applications. STOC 1993: 698-707
40EEDavid P. Williamson, Michel X. Goemans, Milena Mihail, Vijay V. Vazirani: A primal-dual approximation algorithm for generalized Steiner network problems. STOC 1993: 708-717
39 Éva Tardos, Vijay V. Vazirani: Improved Bounds for the Max-Flow Min-Multicut Ratio for Planar and K_r, r-Free Graphs. Inf. Process. Lett. 47(2): 77-80 (1993)
38 David Pearson, Vijay V. Vazirani: Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets. J. Algorithms 14(2): 171-179 (1993)
1992
37 Vijay V. Vazirani, Mihalis Yannakakis: Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract). ICALP 1992: 366-377
36EEH. Narayanan, Huzur Saran, Vijay V. Vazirani: Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arboresences and Edge-Disjoint Spanning Trees. SODA 1992: 357-366
35 Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani: Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph. SIAM J. Comput. 21(3): 486-506 (1992)
1991
34 Huzur Saran, Vijay V. Vazirani: Finding k-cuts within Twice the Optimal FOCS 1991: 743-751
33 Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani: On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages. ICALP 1991: 728-738
32 Dalit Naor, Vijay V. Vazirani: Representing and Enumerating Edge Connectivity Cuts in RNC. WADS 1991: 273-285
31 Samir Khuller, Vijay V. Vazirani: Planar Graph Coloring is not Self-Reducible, Assuming P != NP. Theor. Comput. Sci. 88(1): 183-189 (1991)
1990
30 David Pearson, Vijay V. Vazirani: A Fast Parallel Algorithm for Finding a Maximal Bipartite Set. FSTTCS 1990: 225-231
29 Vijay V. Vazirani: A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(\surdVE) General Graph Matching Algorithm. IPCO 1990: 509-530
28 Richard M. Karp, Umesh V. Vazirani, Vijay V. Vazirani: An Optimal Algorithm for On-line Bipartite Matching STOC 1990: 352-358
1989
27 Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani: Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem, and for Finding a Kuratowski Homeomorph FOCS 1989: 300-305
26EEVijay V. Vazirani, Mihalis Yannakakis: Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs. Discrete Applied Mathematics 25(1-2): 179-190 (1989)
25 Vijay V. Vazirani: NC Algorithms for Computing the Number of Perfect Matchings in K_3,3-Free Graphs and Related Problems Inf. Comput. 80(2): 152-164 (1989)
24 Michael O. Rabin, Vijay V. Vazirani: Maximum Matchings in General Graphs Through Randomization. J. Algorithms 10(4): 557-567 (1989)
23 Umesh V. Vazirani, Vijay V. Vazirani: The Two-Processor Scheduling Problem is in Random NC. SIAM J. Comput. 18(6): 1140-1148 (1989)
1988
22 Vijay V. Vazirani, Mihalis Yannakakis: Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs. ICALP 1988: 667-681
21 Vijay V. Vazirani: NC Algorithms for Computing the Number of Perfect Matchings in K3, 3-free Graphs and Related Problems. SWAT 1988: 233-242
1987
20 Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani: Matching Is as Easy as Matrix Inversion STOC 1987: 345-354
19 Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani: Global Wire Routing in Two-Dimensional Arrays. Algorithmica 2: 113-129 (1987)
18 Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani: Matching is as easy as matrix inversion. Combinatorica 7(1): 105-113 (1987)
1986
17 Umesh V. Vazirani, Vijay V. Vazirani: Sampling a Population with a Semi-Random Source. FSTTCS 1986: 443-452
16 Mark Jerrum, Leslie G. Valiant, Vijay V. Vazirani: Random Generation of Combinatorial Structures from a Uniform Distribution. Theor. Comput. Sci. 43: 169-188 (1986)
15 Leslie G. Valiant, Vijay V. Vazirani: NP is as Easy as Detecting Unique Solutions. Theor. Comput. Sci. 47(3): 85-93 (1986)
1985
14 Umesh V. Vazirani, Vijay V. Vazirani: Random Polynomial Time Is Equal to Slightly-random Polynomial Time FOCS 1985: 417-428
13 Dexter Kozen, Umesh V. Vazirani, Vijay V. Vazirani: NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching. FSTTCS 1985: 496-503
12 Umesh V. Vazirani, Vijay V. Vazirani: The Two-Processor Scheduling Problem is in R-NC STOC 1985: 11-21
11 Leslie G. Valiant, Vijay V. Vazirani: NP Is as Easy as Detecting Unique Solutions STOC 1985: 458-463
1984
10EEUmesh V. Vazirani, Vijay V. Vazirani: Efficient and Secure Pseudo-Random Number Generation. CRYPTO 1984: 193-202
9 Umesh V. Vazirani, Vijay V. Vazirani: Efficient and Secure Pseudo-Random Number Generation (Extended Abstract) FOCS 1984: 458-463
1983
8 Manuel Blum, Umesh V. Vazirani, Vijay V. Vazirani: Reducibility Among Protocols. CRYPTO 1983: 137-146
7 Umesh V. Vazirani, Vijay V. Vazirani: RSA Bits are 732+epsilon Secure. CRYPTO 1983: 369-375
6 Umesh V. Vazirani, Vijay V. Vazirani: Trapdoor Pseudo-random Number Generators, with Applications to Protocol Design FOCS 1983: 23-30
5 Richard M. Karp, Frank Thomson Leighton, Ronald L. Rivest, Clark D. Thompson, Umesh V. Vazirani, Vijay V. Vazirani: Global Wire Routing in Two-Dimensional Arrays (Extended Abstract) FOCS 1983: 453-459
4 Umesh V. Vazirani, Vijay V. Vazirani: A Natural Encoding Scheme Proved Probabilistic Polynomial Complete. Theor. Comput. Sci. 24: 291-300 (1983)
1982
3 Umesh V. Vazirani, Vijay V. Vazirani: A Natural Encoding Scheme Proved Probabilistic Polynomial Complete FOCS 1982: 40-44
2 Larry J. Stockmeyer, Vijay V. Vazirani: NP-Completeness of Some Generalizations of the Maximum Matching Problem. Inf. Process. Lett. 15(1): 14-19 (1982)
1980
1 Silvio Micali, Vijay V. Vazirani: An O(sqrt(|v|) |E|) Algorithm for Finding Maximum Matching in General Graphs FOCS 1980: 17-27

Coauthor Index

1Micah Adler [82]
2Vivek Arora [49]
3Noam Berger [115] [122]
4Ivona Bezáková [102] [113]
5Nayantara Bhatnagar [103] [117]
6Manuel Blum [8]
7Deeparnab Chakrabarty [100] [101] [105] [118] [121]
8Nikhil R. Devanur [78] [83] [85] [86] [90] [94] [100] [101] [114] [121]
9Nick Feamster [120]
10Joseph L. Ganley [65] [68]
11Dinesh Garg [92] [107]
12Naveen Garg [41] [42] [43] [48] [50] [54] [57] [61] [87] [94]
13Rahul Garg [88]
14Gagan Goel [118]
15Michel X. Goemans [40] [52]
16Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi) [104]
17Eran Halperin [82]
18Kamal Jain [59] [64] [66] [70] [71] [72] [75] [76] [77] [80] [81] [92] [93] [96] [99] [104] [107] [111] [112]
19Klaus Jansen [79]
20Mark Jerrum [16]
21Sanjiv Kapoor [88] [95] [106]
22Nevin Kapur [115] [122]
23Richard M. Karp [5] [19] [28] [82]
24Rohit Khandekar [94]
25Samir Khuller [27] [31] [33] [35] [45]
26Dexter Kozen [13]
27Lap Chi Lau [104]
28Wang Lei [116]
29Frank Thomson Leighton (Tom Leighton) [5] [19]
30Stefano Leonardi [79]
31Mohammad Mahdian [73] [76] [80]
32Ion I. Mandoiu [59] [64] [65] [68] [75] [104]
33Evangelos Markakis (Vangelis Markakis) [73] [76] [80]
34Nimrod Megiddo [110]
35Aranyak Mehta [84] [89] [93] [95] [97] [98] [105] [106] [108]
36Silvio Micali [1]
37Milena Mihail [40] [52] [86] [90]
38Stephen G. Mitchell [27] [33] [35] [45]
39Ketan Mulmuley [18] [20]
40Dalit Naor [32]
41H. Narayanan [36] [46]
42Vinayaka Pandit [94]
43Christos H. Papadimitriou [78] [114]
44David Pearson [30] [38]
45Michael O. Rabin [24]
46Sridhar Rajagopalan [44] [58] [63]
47B. Sundar Rajan (Bikash Sundar Rajan) [55] [56]
48Anirudh Ramachandran [120]
49Dana Randall [103] [117]
50Ronald L. Rivest [5] [19]
51Alexander Russell [104]
52Amin Saberi [73] [76] [78] [80] [94] [97] [108] [114]
53Huzur Saran [34] [36] [46] [49] [50] [51] [55] [56] [61]
54Leonard J. Schulman [62] [91] [115] [122]
55Srinivasan Seetharaman [120]
56Scott Shenker [84] [98]
57Saurabh Sinha [74]
58Daniel Stefankovic [102] [113]
59Larry J. Stockmeyer [2]
60Kunal Talwar [92] [93] [107]
61Éva Tardos [39]
62Clark D. Thomborson (Clark D. Thompson) [5] [19]
63Leslie G. Valiant [11] [15] [16]
64Umesh V. Vazirani [3] [4] [5] [6] [7] [8] [9] [10] [12] [13] [14] [17] [18] [19] [20] [23] [28] [97] [108]
65Santosh Vempala [49]
66Ramarathnam Venkatesan [74]
67Eric Vigoda [102] [103] [113] [117]
68Lei Wang [118]
69David P. Williamson [40] [52] [64] [75]
70Mihalis Yannakakis [22] [26] [37] [41] [43] [48] [54] [57] [87]
71Yinyu Ye [96]
72Changyuan Yu [118]
73Gideon Yuval [99]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)