Leonard Schulman | Academic Influence

Leonard Schulman's AcademicInfluence.com Rankings

Leonard Schulman

Computer Science

#3600

World Rank

#3782

Historical Rank

#1341

USA Rank

Database

#8288

World Rank

#8656

Historical Rank

#1086

USA Rank

computer-science Degrees

Download Badge

Computer Science

Leonard Schulman's Degrees

PhD Computer Science University of California, Berkeley

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is Leonard Schulman Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Leonard J. Y. Schulman is professor of computer science in the Computing and Mathematical Sciences Department at the California Institute of Technology. He is known for work on algorithms, information theory, coding theory, and quantum computation.

(See a Problem?)

Leonard Schulman's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

The Effectiveness of Lloyd-Type Methods for the k-Means Problem (2006) (477)
Splitters and near-optimal derandomization (1995) (311)
Broadcasting on trees and the Ising model (2000) (272)
Coding for interactive communication (1995) (206)
A Two-Round Variant of EM for Gaussian Mixtures (2000) (164)
A Probabilistic Analysis of EM for Mixtures of Separated, Spherical Gaussians (2007) (161)
Quantum mechanical algorithms for the nonabelian hidden subgroup problem (2001) (144)
Lower bounds for linear locally decodable codes and private information retrieval (2002) (132)
A random walk model of wave propagation (2004) (131)
Communication on noisy channels: a coding theorem for computation (1992) (117)
Asymptotically good codes correcting insertions, deletions, and transpositions (1997) (116)
Deterministic coding for interactive communication (1993) (113)
Universal ε-approximators for integrals (2010) (109)
The quantum communication complexity of sampling (1998) (107)
A coding theorem for distributed computation (1994) (96)
Molecular scale heat engines and scalable quantum computation (1999) (95)
Signal propagation and noisy circuits (1999) (85)
Quantum Algorithms for Hidden Nonlinear Structures (2007) (82)
On partitioning graphs via single commodity flows (2008) (82)
Clustering for Edge-Cost Minimization (1999) (80)
The symmetric group defies strong Fourier sampling (2005) (78)
Physical Limits of Heat-Bath Algorithmic Cooling (2005) (78)
Reconstruction from subsequences (2003) (74)
Pattern matching for spatial point sets (1998) (69)
Data reduction for weighted and outlier-resistant clustering (2012) (67)
Optimal Coding for Streaming Authentication and Interactive Communication (2013) (66)
The power of basis selection in fourier sampling: hidden subgroup problems in affine groups (2004) (66)
Crossing families (1991) (61)
Scalable NMR Quantum Computation (1998) (58)
On the maximum tolerable noise of k-input gates for reliable computation by formulas (2003) (55)
Error-correcting codes for automatic control (2005) (52)
Clustering for edge-cost minimization (extended abstract) (2000) (50)
Fairness in scheduling (1995) (50)
The Vector Partition Problem for Convex Objective Functions (2001) (50)
Universal epsilon-approximators for Integrals (2010) (48)
Computing with highly mixed states (2000) (42)
Allocation of Divisible Goods Under Lexicographic Preferences (2012) (40)
Information theory and noisy computation (1995) (36)
Tree codes and a conjecture on exponential sums (2013) (35)
Optimal randomized algorithms for local sorting and set-maxima (1990) (35)
Learning mixtures of arbitrary distributions over large discrete domains (2012) (34)
Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions (2014) (34)
Dimensionality reduction: beyond the Johnson-Lindenstrauss bound (2011) (34)
Sample spaces uniform on neighborhoods (1992) (33)
Extractors for Near Logarithmic Min-Entropy (2016) (31)
Improved Expansion of Random Cayley Graphs (2004) (31)
Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem (2004) (31)
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010 (2010) (29)
The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts (2005) (28)
Signal propagation, with application to a lower bound on the depth of noisy formulas (1993) (27)
Deterministic clustering with data nets (2004) (24)
Learning Dynamics and the Co-Evolution of Competing Sexual Species (2017) (21)
Microcellular systems, random walks, and wave propagation (2002) (21)
The Adversarial Noise Threshold for Distributed Protocols (2014) (20)
On matrix factorization and scheduling for finite-time average-consensus (2010) (19)
Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph (1996) (19)
Learning Arbitrary Statistical Mixtures of Discrete Distributions (2015) (17)
Proceedings of the forty-second ACM symposium on Theory of computing (2010) (17)
Verification of Identities (2000) (16)
Fair and efficient router congestion control (2004) (16)
Solvency Games (2008) (16)
Analysis of Incomplete Data and an Intrinsic-Dimension Helly Theorem (2006) (16)
The Hidden Subgroup Problem in Affine Groups: Basis Selectio n in Fourier Sampling (2002) (16)
The maintenance of common data in a distributed system (1991) (15)
Contraction and Expansion of Convex Sets (2009) (14)
Communication in the presence of noise (1992) (14)
Explicit binary tree codes with polylogarithmic size alphabet (2018) (13)
Clustering Affine Subspaces: Hardness and Algorithms (2013) (12)
Quasi-regular sequences and optimal schedules for security games (2016) (12)
Dimension-Free L2 Maximal Inequality for Spherical Means in the Hypercube (2012) (12)
Analysis of a Classical Matrix Preconditioning Algorithm (2015) (11)
Computing with highly mixed states (extended abstract) (2000) (10)
Clustering lines in high-dimensional space: Classification of incomplete data (2010) (10)
Sorting on a Ring of Processors (1990) (10)
Imaging geometry through dynamics: the observable representation (2006) (10)
Source Identification for Mixtures of Product Distributions (2020) (9)
Rapid near-optimal VQ design with a deterministic data net (2004) (9)
Stability of Causal Inference (2016) (9)
Error-Correcting Codes for Automatic Control (2009) (9)
Cryptography from tensor problems (2012) (7)
Verifying identities (1996) (7)
The Duality Gap for Two-Team Zero-Sum Games (2019) (7)
On Scalar LQG Control with Communication Cost (2005) (7)
An equipartition of planar sets (1993) (6)
A Refined Approximation for Euclidean k-Means (2021) (6)
Symbolic Integration and the Complexity of Computing Averages (2015) (5)
Wave-packet scattering without kinematic entanglement: convergence of expectation values (2005) (5)
Minimally Distant Sets of Lattice Points (1993) (5)
The Computational Worldview and the Sciences : a Report on Two Workshops (2007) (4)
Hadamard Extensions and the Identification of Mixtures of Product Distributions (2021) (4)
Approximation algorithms for labeling hierarchical taxonomies (2008) (4)
Convergence of Incentive-Driven Dynamics in Fisher Markets (2017) (4)
The Sparse Hausdorff Moment Problem, with Application to Topic Models (2020) (4)
The Network Improvement Problem for Equilibrium Routing (2013) (4)
Majorizing estimators and the approximation of #P-complete problems (1999) (4)
Identifying Mixtures of Bayesian Network Distributions (2021) (3)
One-Shot Bargaining Mechanisms (2016) (3)
A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution (2005) (3)
Quantum computing: A bit chilly (2005) (3)
A Nash-type Dimensionality Reduction for Discrete Subsets of L 2 (2008) (3)
Volume in General Metric Spaces (2010) (2)
Analysis of a Classical Matrix Preconditioning Algorithm (2015) (2)
Quasi-random multilinear polynomials (2018) (2)
Muirhead-Rado inequality for compact groups (2009) (2)
Network improvement for equilibrium routing (2014) (2)
Convergence of matrices under random conjugation: wave packet scattering without kinematic entanglement (2006) (1)
Probability and Algorithms (2011) (1)
Condition number bounds for causal inference (2021) (1)
Feedback control for router congestion resolution (2005) (1)
Inference from Sparse Sampling ( Extended Abstract ) (2008) (1)
Edge Expansion and Spectral Gap of Nonnegative Matrices (2019) (1)
Average Case Complexity Theory (2007) (1)
On LQG control with communication power constraint (2007) (1)
Verifying Identities (extended abstract) (1996) (1)
On a capacitated multivehicle routing problem (2008) (1)
Coding for distributed computation (1995) (1)
Coding for distributed computation (1994) (0)
The invisible hand of Laplace: The role of market structure in price convergence and oscillation (2016) (0)
Session details: Session 2A (2003) (0)
Session details: Session 5B (2010) (0)
SURF-2011 Linear Programming and Clustering (2011) (0)
A random stacking process (2002) (0)
Session details: Session 5A (2003) (0)
Quasi-random multilinear polynomials (2019) (0)
Solved and Unsolved in Elementary Algorithms CS 101 a , Fall 2011-12 (2011) (0)
Universal Immersion Spaces for Edge-Colored Graphs and Nearest-Neighbor Metrics (2009) (0)
Session details: Session 9 (2010) (0)
A Product Theorem for Intersection Families (1994) (0)
Causal Inference Despite Limited Global Confounding via Mixture Models (2021) (0)
Institute for Quantum Information Quantum Algorithms and Quantum Complexity Efficient Quantum Circuits for Schur and Clebsch-gordon Transforms. Optimal Measurements for the Dihedral Hidden Subgroup Problem. Dave Bacon and the Symmetric Group Defies Strong Fourier Sampling. Quantum Computation via Tr (0)
Quantum Computation (2020) (0)
Random Cayley Graphs and the Second Eigenvalue Problem (2004) (0)
Research on Quantum Algorithms at the Institute for Quantum Information (2009) (0)
An MQ/Code Cyptosystem Proposal (2013) (0)
An MQ/Code Cryptosystem Proposal (2013) (0)
Online Codes for Analog Signals (2017) (0)
The Quantifier Semigroup for Bipartite Graphs (2011) (0)
Stochastic Construction of Expander Graphs (2003) (0)
Cryptography from tensor problems ( draft ) (2012) (0)
Variation on a theorem by Carathéodory (2010) (0)
Hadamard Powers and the Identification of Mixtures of Products (2021) (0)
Market Dynamics of Best-Response with Lookahead (2016) (0)
Pareto Efficient Nash Implementation Via Approval Voting (2015) (0)
A Three-Party Communication Problem (1998) (0)
A Quantum Algorithm for the Ferromagnetic Ising Model (Manuscript in preparation) (2008) (0)
Quantum algorithms for algebraic problems (2007) (0)
Volume in General Metric Spaces (2014) (0)
Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010) (2013) (0)
Real-time coding for multiple access channels (2005) (0)
2005 R. W. P. King Award (2005) (0)
Quantum computation and physical law (2006) (0)
Research Note - Quantum Algorithms: A Test for the Laws of Physics Submerged Circuits of Floating DNA (2010) (0)

This paper list is powered by the following services:

Other Resources About Leonard Schulman

en.wikipedia.org

What Schools Are Affiliated With Leonard Schulman?

Leonard Schulman is affiliated with the following schools: