| 2008 |
|---|
| 123 | EE | Vijay V. Vazirani:
Nash Bargaining Via Flexible Budget Markets.
AAIM 2008: 2 |
| 122 | EE | Noam Berger,
Nevin Kapur,
Leonard J. Schulman,
Vijay V. Vazirani:
Solvency Games.
FSTTCS 2008 |
| 121 | EE | Deeparnab Chakrabarty,
Nikhil R. Devanur,
Vijay V. Vazirani:
New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem.
IPCO 2008: 344-358 |
| 120 | EE | Anirudh Ramachandran,
Srinivasan Seetharaman,
Nick Feamster,
Vijay V. Vazirani:
Fast monitoring of traffic subpopulations.
Internet Measurement Comference 2008: 257-270 |
| 119 | EE | Vijay V. Vazirani:
Nash Bargaining Via Flexible Budget Markets.
SWAT 2008: 4 |
| 118 | EE | Deeparnab Chakrabarty,
Gagan Goel,
Vijay V. Vazirani,
Lei Wang,
Changyuan Yu:
Efficiency, Fairness and Competitiveness in Nash Bargaining Games.
WINE 2008: 498-505 |
| 117 | EE | Nayantara Bhatnagar,
Dana Randall,
Vijay V. Vazirani,
Eric Vigoda:
Random Bichromatic Matchings.
Algorithmica 50(4): 418-445 (2008) |
| 116 | EE | Vijay 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) |
| 115 | EE | Noam Berger,
Nevin Kapur,
Leonard J. Schulman,
Vijay V. Vazirani:
Solvency Games.
Electronic Colloquium on Computational Complexity (ECCC) 15(089): (2008) |
| 114 | EE | Nikhil 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) |
| 113 | EE | Ivona 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) |
| 112 | EE | Kamal Jain,
Vijay V. Vazirani:
Equitable Cost Allocations via Primal--Dual-Type Algorithms.
SIAM J. Comput. 38(1): 241-256 (2008) |
| 2007 |
|---|
| 111 | EE | Kamal Jain,
Vijay V. Vazirani:
Eisenberg-Gale markets: algorithms and structural properties.
STOC 2007: 364-373 |
| 110 | EE | Nimrod Megiddo,
Vijay V. Vazirani:
Continuity Properties of Equilibrium Prices and Allocations in Linear Fisher Markets.
WINE 2007: 362-367 |
| 109 | EE | Vijay V. Vazirani:
Markets and the Primal-Dual Paradigm.
WINE 2007: 4 |
| 108 | EE | Aranyak Mehta,
Amin Saberi,
Umesh V. Vazirani,
Vijay V. Vazirani:
AdWords and generalized online matching.
J. ACM 54(5): (2007) |
| 107 | EE | Dinesh 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) |
| 106 | EE | Sanjiv 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 |
|---|
| 105 | EE | Deeparnab Chakrabarty,
Aranyak Mehta,
Vijay V. Vazirani:
Design Is as Easy as Optimization.
ICALP (1) 2006: 477-488 |
| 104 | EE | Mohammad 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 |
| 103 | EE | Nayantara Bhatnagar,
Dana Randall,
Vijay V. Vazirani,
Eric Vigoda:
Random Bichromatic Matchings.
LATIN 2006: 190-201 |
| 102 | EE | Ivona Bezáková,
Daniel Stefankovic,
Vijay V. Vazirani,
Eric Vigoda:
Accelerating simulated annealing for the permanent and combinatorial counting problems.
SODA 2006: 900-907 |
| 101 | EE | Deeparnab Chakrabarty,
Nikhil R. Devanur,
Vijay V. Vazirani:
New Results on Rationality and Strongly Polynomial Time Solvability in Eisenberg-Gale Markets.
WINE 2006: 239-250 |
| 100 | EE | Deeparnab 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) |
| 99 | EE | Kamal 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) |
| 98 | EE | Aranyak Mehta,
Scott Shenker,
Vijay V. Vazirani:
Posted price profit maximization for multicast by approximating fixed points.
J. Algorithms 58(2): 150-164 (2006) |
| 2005 |
|---|
| 97 | EE | Aranyak Mehta,
Amin Saberi,
Umesh V. Vazirani,
Vijay V. Vazirani:
AdWords and Generalized On-line Matching.
FOCS 2005: 264-273 |
| 96 | EE | Kamal Jain,
Vijay V. Vazirani,
Yinyu Ye:
Market equilibria for homothetic, quasi-concave utilities and economies of scale in production.
SODA 2005: 63-71 |
| 95 | EE | Sanjiv Kapoor,
Aranyak Mehta,
Vijay V. Vazirani:
An Auction-Based Market Equilibrium Algorithm for a Production Model.
WINE 2005: 102-111 |
| 94 | EE | Nikhil 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 |
| 93 | EE | Kamal Jain,
Aranyak Mehta,
Kunal Talwar,
Vijay V. Vazirani:
A Simple Characterization for Truth-Revealing Single-Item Auctions.
WINE 2005: 122-128 |
| 92 | EE | Dinesh 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 |
| 91 | EE | Leonard 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) |
| 90 | EE | Nikhil 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 |
|---|
| 89 | EE | Aranyak Mehta,
Vijay V. Vazirani:
Randomized truthful auctions of digital goods are randomizations over truthful auctions.
ACM Conference on Electronic Commerce 2004: 120-124 |
| 88 | EE | Rahul Garg,
Sanjiv Kapoor,
Vijay V. Vazirani:
An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case.
APPROX-RANDOM 2004: 128-138 |
| 87 | EE | Naveen Garg,
Vijay V. Vazirani,
Mihalis Yannakakis:
Multiway cuts in node weighted graphs.
J. Algorithms 50(1): 49-61 (2004) |
| 2003 |
|---|
| 86 | EE | Nikhil 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 |
| 85 | EE | Nikhil 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 |
| 84 | EE | Aranyak Mehta,
Scott Shenker,
Vijay V. Vazirani:
Profit-maximizing multicast pricing by approximating fixed points.
ACM Conference on Electronic Commerce 2003: 218-219 |
| 83 | EE | Nikhil R. Devanur,
Vijay V. Vazirani:
An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case.
FSTTCS 2003: 149-155 |
| 82 | EE | Micah 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 |
| 81 | EE | Kamal Jain,
Vijay V. Vazirani:
An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem.
Algorithmica 38(3): 433-439 (2003) |
| 80 | EE | Kamal 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 |
| 78 | EE | Nikhil R. Devanur,
Christos H. Papadimitriou,
Amin Saberi,
Vijay V. Vazirani:
Market Equilibrium via a Primal-Dual-Type Algorithm.
FOCS 2002: 389-395 |
| 77 | EE | Kamal Jain,
Vijay V. Vazirani:
Equitable cost allocations via primal-dual-type algorithms.
STOC 2002: 313-321 |
| 76 | EE | Kamal 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) |
| 75 | EE | Kamal 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 |
|---|
| 74 | EE | Ramarathnam Venkatesan,
Vijay V. Vazirani,
Saurabh Sinha:
A Graph Theoretic Approach to Software Watermarking.
Information Hiding 2001: 157-168 |
| 73 | EE | Mohammad Mahdian,
Evangelos Markakis,
Amin Saberi,
Vijay V. Vazirani:
A Greedy Facility Location Algorithm Analyzed Using Dual Fitting.
RANDOM-APPROX 2001: 127-137 |
| 72 | EE | Kamal Jain,
Vijay V. Vazirani:
Applications of approximation algorithms to cooperative games.
STOC 2001: 364-372 |
| 71 | EE | Kamal 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 |
|---|
| 70 | EE | Kamal Jain,
Vijay V. Vazirani:
An approximation algorithm for the fault tolerant metric facility location problem.
APPROX 2000: 177-183 |
| 69 | EE | Vijay V. Vazirani:
Primal-Dual Schema Based Approximation Algorithms.
Theoretical Aspects of Computer Science 2000: 198-207 |
| 68 | EE | Ion 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) |
| 67 | EE | Vijay V. Vazirani:
Recent results on approximating the Steiner tree problem and its generalizations.
Theor. Comput. Sci. 235(1): 205-216 (2000) |
| 1999 |
|---|
| 66 | EE | Kamal Jain,
Vijay V. Vazirani:
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems.
FOCS 1999: 2-13 |
| 65 | EE | Ion I. Mandoiu,
Vijay V. Vazirani,
Joseph L. Ganley:
A new heuristic for rectilinear Steiner trees.
ICCAD 1999: 157-162 |
| 64 | EE | Kamal 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 |
| 63 | EE | Sridhar Rajagopalan,
Vijay V. Vazirani:
On the Bidirected Cut Relaxation for the Metric Steiner Tree Problem.
SODA 1999: 742-751 |
| 62 | EE | Leonard 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 |
|---|
| 60 | EE | Vijay 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 |
| 41 | EE | Naveen Garg,
Vijay V. Vazirani,
Mihalis Yannakakis:
Approximate max-flow min-(multi)cut theorems and their applications.
STOC 1993: 698-707 |
| 40 | EE | David 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 |
| 36 | EE | H. 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 |
| 26 | EE | Vijay 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 |
|---|
| 10 | EE | Umesh 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 |
