BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Greece
10 × USA
2 × Canada
Collaborated with:
L.J.Schulman V.V.Vazirani A.Ambainis D.Aharonov S.Rao S.Arora T.Vidick A.Ta-Shma E.Bernstein R.Khandekar Y.Rabani R.Ostrovsky S.Rajagopalan R.M.Karp K.Mulmuley I.Arad Z.Landau L.Orecchia N.K.Vishnoi J.Kempe M.Grigni M.Vazirani A.C.Yao A.Nayak
Talks about:
quantum (10) random (4) graph (4) partit (3) flow (3) algorithm (2) communic (2) problem (2) generat (2) complex (2)

Person: Umesh V. Vazirani

DBLP DBLP: Vazirani:Umesh_V=

Contributed to:

STOC 20122012
STOC 20092009
STOC 20082008
STOC 20062006
STOC 20042004
STOC 20012001
STOC 20002000
STOC 19991999
STOC 19941994
STOC 19931993
STOC 19901990
STOC 19871987
STOC 19851985

Wrote 19 papers:

STOC-2012-VaziraniV #generative #quantum #random
Certifiable quantum dice: or, true random number generation secure against quantum adversaries (UVV, TV), pp. 61–76.
STOC-2009-AharonovALV #detection #quantum
The detectability lemma and quantum gap amplification (DA, IA, ZL, UVV), pp. 417–426.
STOC-2008-OrecchiaSVV #clustering #graph #on the
On partitioning graphs via single commodity flows (LO, LJS, UVV, NKV), pp. 461–470.
STOC-2006-KhandekarRV #clustering #graph #using
Graph partitioning using single commodity flows (RK, SR, UVV), pp. 385–390.
STOC-2004-AroraRV #clustering #geometry #graph
Expander flows, geometric embeddings and graph partitioning (SA, SR, UVV), pp. 222–231.
STOC-2001-AmbainisKV #graph #quantum
Quantum walks on graphs (DA, AA, JK, UVV), pp. 50–59.
STOC-2001-GrigniSVV #algorithm #problem #quantum
Quantum mechanical algorithms for the nonabelian hidden subgroup problem (MG, LJS, MV, UVV), pp. 68–74.
STOC-2000-AharonovTVY #quantum
Quantum bit escrow (DA, ATS, UVV, ACCY), pp. 705–714.
Computing with highly mixed states (AA, LJS, UVV), pp. 697–704.
STOC-1999-AmbainisNTV #automaton #bound #quantum
Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata (AA, AN, ATS, UVV), pp. 376–383.
STOC-1999-SchulmanV99a #quantum #scalability
Molecular Scale Heat Engines and Scalable Quantum Computation (LJS, UVV), pp. 322–329.
STOC-1994-AroraRV #polynomial #simulation
Simulating quadratic dynamical systems is PSPACE-complete (SA, YR, UVV), pp. 459–467.
STOC-1994-OstrovskyRV #performance
Simple and efficient leader election in the full information model (RO, SR, UVV), pp. 234–242.
STOC-1993-BernsteinV #complexity #quantum
Quantum complexity theory (EB, UVV), pp. 11–20.
STOC-1990-KarpVV #algorithm #online
An Optimal Algorithm for On-line Bipartite Matching (RMK, UVV, VVV), pp. 352–358.
STOC-1987-MulmuleyVV #matrix
Matching Is as Easy as Matrix Inversion (KM, UVV, VVV), pp. 345–354.
STOC-1987-Vazirani #performance #using
Efficiency Considerations in Using Semi-random Sources (UVV), pp. 160–168.
STOC-1985-Vazirani #communication #complexity #generative #sequence #towards
Towards a Strong Communication Complexity Theory or Generating Quasi-Random Sequences from Two Communicating Slightly-random Sources (UVV), pp. 366–378.
STOC-1985-VaziraniV #problem #scheduling
The Two-Processor Scheduling Problem is in R-NC (UVV, VVV), pp. 11–21.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.