Vazirani, Umesh Virkumar
Overview
Works:  19 works in 68 publications in 4 languages and 1,831 library holdings 

Genres:  Textbooks Conference papers and proceedings 
Roles:  Author 
Classifications:  Q325.5, 519.2 
Publication Timeline
.
Most widely held works by
Umesh Virkumar Vazirani
An introduction to computational learning theory by
Michael J Kearns(
Book
)
21 editions published between 1994 and 1997 in English and held by 399 WorldCat member libraries worldwide
Emphasizing issues of computational efficiency, Michael Kearns and Umesh Vazirani introduce a number of central topics in computational learning theory for researchers and students in artificial intelligence, neural networks, theoretical computer science, and statistics.Computational learning theory is a new and rapidly expanding area of research that examines formal models of induction with the goals of discovering the common methods underlying efficient learning algorithms and identifying the computational impediments to learning. Each topic in the book has been chosen to elucidate a general principle, which is explored in a precise formal setting. Intuition has been emphasized in the presentation to make the material accessible to the nontheoretician while still providing precise arguments for the specialist. This balance is the result of new proofs of established theorems, and new presentations of the standard proofs. The topics covered include the motivation, definitions, and fundamental results, both positive and negative, for the widely studied L.G. Valiant model of Probably Approximately Correct Learning; Occam's Razor, which formalizes a relationship between learning and data compression; the VapnikChervonenkis dimension; the equivalence of weak and strong learning; efficient learning in the presence of noise by the method of statistical queries; relationships between learning and cryptography, and the resulting computational limitations on efficient learning; reducibility between learning problems; and algorithms for learning finite automata from active experimentation
21 editions published between 1994 and 1997 in English and held by 399 WorldCat member libraries worldwide
Emphasizing issues of computational efficiency, Michael Kearns and Umesh Vazirani introduce a number of central topics in computational learning theory for researchers and students in artificial intelligence, neural networks, theoretical computer science, and statistics.Computational learning theory is a new and rapidly expanding area of research that examines formal models of induction with the goals of discovering the common methods underlying efficient learning algorithms and identifying the computational impediments to learning. Each topic in the book has been chosen to elucidate a general principle, which is explored in a precise formal setting. Intuition has been emphasized in the presentation to make the material accessible to the nontheoretician while still providing precise arguments for the specialist. This balance is the result of new proofs of established theorems, and new presentations of the standard proofs. The topics covered include the motivation, definitions, and fundamental results, both positive and negative, for the widely studied L.G. Valiant model of Probably Approximately Correct Learning; Occam's Razor, which formalizes a relationship between learning and data compression; the VapnikChervonenkis dimension; the equivalence of weak and strong learning; efficient learning in the presence of noise by the method of statistical queries; relationships between learning and cryptography, and the resulting computational limitations on efficient learning; reducibility between learning problems; and algorithms for learning finite automata from active experimentation
Algorithms by
Sanjoy Dasgupta(
Book
)
16 editions published between 2007 and 2012 in English and Polish and held by 282 WorldCat member libraries worldwide
16 editions published between 2007 and 2012 in English and Polish and held by 282 WorldCat member libraries worldwide
A mildly exponential approximation algorithm for the permanent by
Mark Jerrum(
Book
)
4 editions published in 1991 in English and held by 11 WorldCat member libraries worldwide
Abstract: "A new approximation algorithm for the permanent of an n x n 0,1matrix is presented. The algorithm is shown to have worstcase time complexity exp(O(n[superscript 1/2] log²n)). Asymptotically, this represents a considerable improvement over the best existing algorithm, which has worstcase time complexity of the form e[superscipt theta(n)]."
4 editions published in 1991 in English and held by 11 WorldCat member libraries worldwide
Abstract: "A new approximation algorithm for the permanent of an n x n 0,1matrix is presented. The algorithm is shown to have worstcase time complexity exp(O(n[superscript 1/2] log²n)). Asymptotically, this represents a considerable improvement over the best existing algorithm, which has worstcase time complexity of the form e[superscipt theta(n)]."
Randomness, adversaries and computation by
Umesh Virkumar Vazirani(
)
3 editions published between 1986 and 1989 in English and Undetermined and held by 6 WorldCat member libraries worldwide
3 editions published between 1986 and 1989 in English and Undetermined and held by 6 WorldCat member libraries worldwide
Simple and efficient leader election in the full information model by
Rafail Ostrovsky(
Book
)
2 editions published in 1994 in English and held by 5 WorldCat member libraries worldwide
2 editions published in 1994 in English and held by 5 WorldCat member libraries worldwide
The twoprocessor scheduling problem is in random NC by
Umesh Virkumar Vazirani(
Book
)
2 editions published in 1989 in English and held by 4 WorldCat member libraries worldwide
Abstract: "An efficient parallel algorithm (RNC[superscript 2]) for the twoprocessor scheduling problem is presented. An interesting feature of this algorithm is that it finds a highest level first schedule: such a schedule defines a lexicographically first solution to this problem in a natural way. A key ingredient of the algorithm is a generalization of a theorem of Tutte which establishes a onetoone correspondence between the bases of the Tutte matrix of a graph and the sets of matched nodes in maximum matchings in the graph."
2 editions published in 1989 in English and held by 4 WorldCat member libraries worldwide
Abstract: "An efficient parallel algorithm (RNC[superscript 2]) for the twoprocessor scheduling problem is presented. An interesting feature of this algorithm is that it finds a highest level first schedule: such a schedule defines a lexicographically first solution to this problem in a natural way. A key ingredient of the algorithm is a generalization of a theorem of Tutte which establishes a onetoone correspondence between the bases of the Tutte matrix of a graph and the sets of matched nodes in maximum matchings in the graph."
Random polynomial time is equal to semirandom polynomial time by
Umesh Virkumar Vazirani(
Book
)
2 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
We prove that any onesided error random polynomial time (RP) algorithm can be simulated with a semirandom source at no more than polynomial factor loss in efficiency. i.e. RP=SRP. This contrasts with the fact that a semirandom source is too weak to simulate fair coin flips [SV]
2 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
We prove that any onesided error random polynomial time (RP) algorithm can be simulated with a semirandom source at no more than polynomial factor loss in efficiency. i.e. RP=SRP. This contrasts with the fact that a semirandom source is too weak to simulate fair coin flips [SV]
On the magnification of 01 polytopes by Milena Mihail(
Book
)
2 editions published between 1988 and 1989 in English and held by 3 WorldCat member libraries worldwide
2 editions published between 1988 and 1989 in English and held by 3 WorldCat member libraries worldwide
Conductance and convergence of Markov chains by Milena Mihail(
Book
)
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
Abstract: "Let P be an irreducible and strongly aperiodic (i.e. p[subscript ii] [greater than or equal to] 1/2 [for all] i) stochastic matrix. We obtain nonasymptotic bounds for the convergence rate of a Markov chain with transition matrix P in terms of the conductance of P. These results have been so far obtained only for timereversible Markov chains via partially linear algebraic arguments [Al86][A87][SJ87]. Our proofs eliminate the linear algebra and therefore naturally extend to general Markov chains. The key new idea is to view the action of a strongly aperiodic stochastic matrix as a weighted averaging along the edges of the underlying graph of P. Our results suggest that the conductance (rather than the second largest eigenvalue) best quantifies the rate of convergence of stongly aperiodic Markov chains."
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
Abstract: "Let P be an irreducible and strongly aperiodic (i.e. p[subscript ii] [greater than or equal to] 1/2 [for all] i) stochastic matrix. We obtain nonasymptotic bounds for the convergence rate of a Markov chain with transition matrix P in terms of the conductance of P. These results have been so far obtained only for timereversible Markov chains via partially linear algebraic arguments [Al86][A87][SJ87]. Our proofs eliminate the linear algebra and therefore naturally extend to general Markov chains. The key new idea is to view the action of a strongly aperiodic stochastic matrix as a weighted averaging along the edges of the underlying graph of P. Our results suggest that the conductance (rather than the second largest eigenvalue) best quantifies the rate of convergence of stongly aperiodic Markov chains."
NC algorithms for comparability graphs, interval graphs, and unique perfect matchings by
Dexter Kozen(
Book
)
3 editions published in 1986 in English and Undetermined and held by 3 WorldCat member libraries worldwide
3 editions published in 1986 in English and Undetermined and held by 3 WorldCat member libraries worldwide
Suan fa gai lun by
Sanjoy Dasgupta(
Book
)
1 edition published in 2008 in Chinese and held by 2 WorldCat member libraries worldwide
1 edition published in 2008 in Chinese and held by 2 WorldCat member libraries worldwide
An optimal algorithm for online bipartite matching by
Richard M Karp(
Book
)
1 edition published in 1991 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1991 in English and held by 2 WorldCat member libraries worldwide
Matching is as easy as matrix inversion by
Ketan Mulmuley(
Book
)
2 editions published in 1986 in English and held by 1 WorldCat member library worldwide
2 editions published in 1986 in English and held by 1 WorldCat member library worldwide
Algoritmos by
Sanjoy Dasgupta(
Book
)
2 editions published between 2009 and 2010 in Portuguese and held by 1 WorldCat member library worldwide
2 editions published between 2009 and 2010 in Portuguese and held by 1 WorldCat member library worldwide
Scalability, Complexity and Reliability in Quantum Information Processing(
)
1 edition published in 2007 in English and held by 0 WorldCat member libraries worldwide
This program was a theoretical/experimental collaboration focusing on the fundamental need for scalability in the development of quantum information processing. Theory and experiment were connected and interleaved at several levels. The theoretical objectives were as follows: (1) to develop new theoretical tools to enable the implementation of reliable quantum information processing in scalable systems; and (2) to characterize the relations between quantum algorithms and architectures, fault tolerance and architectures, and quantum and classical complexity classes; and (3) to develop secure primitives for quantum cryptography. The experimental objectives were to develop a scalable quantum component technology based on gas phase systems using atoms and light fields. Specific experimental goals were scalable implementation of universal quantum logic in optical lattices and the achievement of deterministic control in atom/cavity systems
1 edition published in 2007 in English and held by 0 WorldCat member libraries worldwide
This program was a theoretical/experimental collaboration focusing on the fundamental need for scalability in the development of quantum information processing. Theory and experiment were connected and interleaved at several levels. The theoretical objectives were as follows: (1) to develop new theoretical tools to enable the implementation of reliable quantum information processing in scalable systems; and (2) to characterize the relations between quantum algorithms and architectures, fault tolerance and architectures, and quantum and classical complexity classes; and (3) to develop secure primitives for quantum cryptography. The experimental objectives were to develop a scalable quantum component technology based on gas phase systems using atoms and light fields. Specific experimental goals were scalable implementation of universal quantum logic in optical lattices and the achievement of deterministic control in atom/cavity systems
Randomized algorithms : 10.  14.6.1991 (9124)(
Book
)
1 edition published in 1991 in English and held by 0 WorldCat member libraries worldwide
1 edition published in 1991 in English and held by 0 WorldCat member libraries worldwide
Quantum Information Processing(
)
1 edition published in 2004 in English and held by 0 WorldCat member libraries worldwide
This effort supported a Quantum Information Workshop at the University of California, Berkeley. After a cut in funding, the remaining unspent funding was used to support: (I) research related to the internet involving the interplay between mechanism design and computational complexity, (2) improved understanding of the connections between phase transitions in statistical mechanics and mixing times of Markov chain Monte Carlo algorithms, and (3) an investigation of the logic of transcriptional control of various model organisms, with emphasis on characterizing the binding sites of key transcription factors via stochastic models
1 edition published in 2004 in English and held by 0 WorldCat member libraries worldwide
This effort supported a Quantum Information Workshop at the University of California, Berkeley. After a cut in funding, the remaining unspent funding was used to support: (I) research related to the internet involving the interplay between mechanism design and computational complexity, (2) improved understanding of the connections between phase transitions in statistical mechanics and mixing times of Markov chain Monte Carlo algorithms, and (3) an investigation of the logic of transcriptional control of various model organisms, with emphasis on characterizing the binding sites of key transcription factors via stochastic models
Probabilistic combinatorics and its applications by Bela Bollobas(
)
1 edition published in 1991 in English and held by 0 WorldCat member libraries worldwide
1 edition published in 1991 in English and held by 0 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links
Associated Subjects
Algorithms Approximation theory Artificial intelligence Combinatorial probabilities Computational complexity Computational learning theory Computer algorithms Computer science Convex polytopes Distributed parameter systems Graph theory Machine learning Markov processes Mathematical statistics Mathematics Neural networks (Computer science) Operations research Parallel processing (Electronic computers) Probability learning Production scheduling Random graphs Stochastic matrices
Alternative Names
Umesh Vazirani Amerikaans hoogleraar
Umesh Vazirani indischUSamerikanischer Informatiker
Vazirani, Umesh.
Vazirani, Umesh V.
Vazirani, Umesh Virkumar.
اومش وزیرانی
바지라니, 우메쉬
바지라니, 우메시
ウメーシュ・ヴァジラーニ
Languages
Covers