Travelled to:
1 × Greece
3 × Canada
5 × USA
Collaborated with:
∅ U.V.Vazirani A.Sinclair V.V.Vazirani S.Rajagopalan A.Ambainis W.Goddard V.King J.Li Y.Rabani C.Swamy L.Orecchia N.K.Vishnoi M.Grigni M.Vazirani
Talks about:
algorithm (3) comput (3) distribut (2) quantum (2) problem (2) code (2) neighborhood (1) determinist (1) nonabelian (1) precondit (1)
Person: Leonard J. Schulman
DBLP: Schulman:Leonard_J=
Facilitated 1 volumes:
Contributed to:
Wrote 12 papers:
- STOC-2015-LiRSS #learning #statistics
- Learning Arbitrary Statistical Mixtures of Discrete Distributions (JL, YR, LJS, CS), pp. 743–752.
- STOC-2015-SchulmanS #algorithm #analysis #matrix
- Analysis of a Classical Matrix Preconditioning Algorithm (LJS, AS), pp. 831–840.
- STOC-2008-OrecchiaSVV #clustering #graph #on the
- On partitioning graphs via single commodity flows (LO, LJS, UVV, NKV), pp. 461–470.
- STOC-2001-GrigniSVV #algorithm #problem #quantum
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem (MG, LJS, MV, UVV), pp. 68–74.
- STOC-2000-AmbainisSV
- Computing with highly mixed states (AA, LJS, UVV), pp. 697–704.
- STOC-2000-Schulman #clustering
- Clustering for edge-cost minimization (LJS), pp. 547–555.
- STOC-1999-SchulmanV #approximate #problem
- Majorizing Estimators and the Approximation of #P-Complete Problems (LJS, VVV), pp. 288–294.
- STOC-1999-SchulmanV99a #quantum #scalability
- Molecular Scale Heat Engines and Scalable Quantum Computation (LJS, UVV), pp. 322–329.
- STOC-1994-RajagopalanS #distributed #theorem
- A coding theorem for distributed computation (SR, LJS), pp. 790–799.
- STOC-1993-Schulman #communication #interactive
- Deterministic coding for interactive communication (LJS), pp. 747–756.
- STOC-1992-Schulman
- Sample Spaces Uniform on Neighborhoods (LJS), pp. 17–25.
- STOC-1990-GoddardKS #algorithm #random #sorting
- Optimal Randomized Algorithms for Local Sorting and Set-Maxima (WG, VK, LJS), pp. 45–53.