The following pages link to Leonard J. Schulman (Q464740):
Displaying 50 items.
- Volume in general metric spaces (Q464741) (← links)
- (Q547780) (redirect page) (← links)
- The quantifier semigroup for bipartite graphs (Q547781) (← links)
- Muirhead-Rado inequality for compact groups (Q839535) (← links)
- Lower bounds for linear locally decodable codes and private information retrieval (Q862344) (← links)
- Contraction and expansion of convex sets (Q1042459) (← links)
- An equipartition of planar sets (Q1207796) (← links)
- Minimally distant sets of lattice points (Q1260773) (← links)
- A three-party communication problem (Q1278045) (← links)
- (Q1330787) (redirect page) (← links)
- Crossing families (Q1330788) (← links)
- A product theorem for intersection families (Q1340116) (← links)
- Reconstruction from subsequences. (Q1406745) (← links)
- A random stacking process (Q1850032) (← links)
- Broadcasting on trees and the Ising model. (Q1884823) (← links)
- The invisible hand of Laplace: the role of market structure in price convergence and oscillation (Q2050989) (← links)
- A refined approximation for Euclidean \(k\)-means (Q2122798) (← links)
- Convergence of incentive-driven dynamics in Fisher markets (Q2155906) (← links)
- Achieving target equilibria in network routing games without knowing the latency functions (Q2278946) (← links)
- The duality gap for two-team zero-sum games (Q2416652) (← links)
- Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph (Q2563513) (← links)
- A computationally motivated definition of parametric estimation and its applications to the Gaussian distribution (Q2568500) (← links)
- Quasi-random multilinear polynomials (Q2631886) (← links)
- The Vector Partition Problem for Convex Objective Functions (Q2757683) (← links)
- A coding theorem for distributed computation (Q2817675) (← links)
- Majorizing estimators and the approximation of #P-complete problems (Q2819556) (← links)
- Molecular scale heat engines and scalable quantum computation (Q2819561) (← links)
- On a capacitated multivehicle routing problem (Q2934342) (← links)
- Learning Arbitrary Statistical Mixtures of Discrete Distributions (Q2941569) (← links)
- Analysis of a Classical Matrix Preconditioning Algorithm (Q2941580) (← links)
- Tree codes and a conjecture on exponential sums (Q2988874) (← links)
- Learning mixtures of arbitrary distributions over large discrete domains (Q2988881) (← links)
- Coding for interactive communication (Q3129462) (← links)
- (Q3165947) (← links)
- (Q3174072) (← links)
- Dimension-free L2 maximal inequality for spherical means in the hypercube (Q3191610) (← links)
- Clustering for edge-cost minimization (extended abstract) (Q3192024) (← links)
- Computing with highly mixed states (extended abstract) (Q3192044) (← links)
- Convergence of matrices under random conjugation: wave packet scattering without kinematic entanglement (Q3379343) (← links)
- VARIATION ON A THEOREM BY CARATHÉODORY (Q3406663) (← links)
- The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts (Q3507527) (← links)
- Computing with highly mixed states (Q3546320) (← links)
- On the maximum tolerable noise of k-input gates for reliable computation by formulas (Q3546857) (← links)
- The Symmetric Group Defies Strong Fourier Sampling (Q3549325) (← links)
- (Q3549733) (← links)
- Universal Immersion Spaces for Edge-Colored Graphs and Nearest-Neighbor Metrics (Q3563963) (← links)
- (Q3579377) (← links)
- Volume in General Metric Spaces (Q3586386) (← links)
- Optimal Randomized Algorithms for Local Sorting and Set-Maxima (Q4032937) (← links)
- Fairness in Scheduling (Q4225867) (← links)
