Vazirani - PDFSEARCH.IO - Document Search Engine

Vazirani
Results: 40

#	Item
31	--- Efficient and Secure Pseudo-Random Number Generation. (Extended Abstract) Umesh V. Vazirani * Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2005-06-09 20:48:30 Binary arithmetic Cryptographically secure pseudorandom number generator Parity bit RSA Boolean algebra FO XTR Blum Blum Shub Blum–Goldwasser cryptosystem Cryptography Pseudorandom number generators Electronic commerce
32	A Markovian Extension of Valiant’s Learning Model (Extended Abstract) Umesh Vazirani t U.C.Berkeley David Aldous * Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2005-06-09 20:48:35 Stochastic processes Markov chain Random walk SL Randomized algorithm Loop-erased random walk Theoretical computer science Graph theory Mathematics
33	C:/Users/thomas/Documents/work/articles/randomness_expansion/STOC/234-vazirani.dvi Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2012-08-10 11:12:20 Randomness Information theory Quantum measurement Computational complexity theory Randomness extractor Quantum information science Quantum nonlocality Entropy Min-entropy Theoretical computer science Physics Applied mathematics
34	Matching is as Easy as Matrix Inversion Ketan Mulmuley ’ Computer Science Department University of California, Berkeley Umesh V. Vazirani 2 Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2004-09-11 21:07:28 NP-complete problems Matching Clique problem Independent set Minimum spanning tree Computing the permanent Interval graph Factor-critical graph Bipartite graph Graph theory Mathematics Theoretical computer science
35	An Optimal Algorithm for On-line Bipartite Matching Richard M. Karp University of California at Berkeley & International Computer Science Institute Umesh V. Vazirani University of California at Berkeley Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2004-09-11 21:06:21 Combinatorial optimization Matching Randomized algorithm Rank Matrix Hungarian algorithm Disjunct matrix Mathematics Theoretical computer science Algebra
36	Institute for Quantum Information Activities – [removed]Personnel The primary goal of the Institute for Quantum Information (IQI) is to carry out and facilitate research in Quantum Information Science (QIS). The IQI i Add to Reading List Source URL: www.iqi.caltech.edu Language: English - Date: 2003-10-23 06:12:34 Quantum information science Quantum information Umesh Vazirani Dorit Aharonov Hideo Mabuchi Patrick Hayden Alexei Kitaev California Institute of Technology Andris Ambainis MacArthur Fellows Year of birth missing John Preskill
37	DIMACS Research and Education Institute (DREI): DREI'98 Report Add to Reading List Source URL: dimacs.rutgers.edu Language: English - Date: 2005-12-22 15:08:00 Medicine Vijay Vazirani Computer science National Institutes of Health Mathematics Combinatorics DIMACS
38	From SIAM News, Volume 38, Number 3, April[removed]Computer Scientists Optimize Innovative Ad Auction By Sara Robinson As one of the few Internet companies to make a mathematical idea pay off, Google has long been a darlin Add to Reading List Source URL: www.cc.gatech.edu Language: English - Date: 2005-04-11 14:39:12 Computer science Theoretical computer science Online algorithm Competitive analysis Umesh Vazirani Vijay Vazirani Google Search Algorithm Sindhi people Applied mathematics Mathematics
39	Algorithms Copyright c 2006 S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani July 18, 2006 Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2006-10-03 05:00:50 Operations research Mathematical optimization Quantum information science Algorithms Quantum algorithm Shortest path problem Divide and conquer algorithm Fast Fourier transform NP-complete Theoretical computer science Mathematics Applied mathematics
40	PDF Document Add to Reading List Source URL: www.cc.gatech.edu Language: English - Date: 2007-06-05 19:27:43 Complexity classes Mathematical optimization Combinatorial optimization Analysis of algorithms Approximation algorithm Algorithm NP-complete Optimization problem Vijay Vazirani Theoretical computer science Computational complexity theory Applied mathematics

UPDATE