PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Vazirani, Vijay V."

Author of the publication

copydeleteadd this publication to your clipboard
Randomized Parallel Algorithms for Matroid Union and Intersection, With Applications to Arboresences and Edge-Disjoint Spanning Trees.

, , and . SIAM J. Comput., 23 (2): 387-397 (1994)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ponraj Vijayan University of Stuttgart

V. Vaikuntanathan

V. Zaverkin

Michael P. Voigt Universität Stuttgart

Wolfgang Vogel

 

Other publications of authors with the same name

A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(sqrtV E) General Graph Maximum Matching Algorithm.. Combinatorica, 14 (1): 71-109 (1994)A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution., and . Combinatorica, 25 (4): 465-486 (2005)Submodularity Helps in Nash and Nonsymmetric Bargaining Games., , , , and . SIAM J. Discrete Math., 28 (1): 99-115 (2014)Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs., and . SIAM J. Comput., 28 (2): 525-540 (1998)An auction-based market equilibrium algorithm for a production model., , and . Theor. Comput. Sci., 378 (2): 153-164 (2007)A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property., , , and . Theor. Comput. Sci., 378 (2): 143-152 (2007)Efficient and Secure Pseudo-Random Number Generation (Extended Abstract), and . FOCS, page 458-463. IEEE Computer Society, (1984)On the Bidirected Cut Relaxation for the Metric Steiner Tree Problem., and . SODA, page 742-751. ACM/SIAM, (1999)The 'Art of Trellis Decoding' Is Computationally Hardi - For Large Fields., , and . IEEE Trans. Information Theory, 44 (3): 1211-1214 (1998)An efficient algorithm for constructing minimal trellises for codes over finite abelian groups., , and . IEEE Trans. Information Theory, 42 (6): 1839-1854 (1996)