Leonard J. Schulman

From MaRDI portal
Person:464740

Available identifiers

zbMath Open schulman.leonard-jDBLP53/4745WikidataQ18012457 ScholiaQ18012457MaRDI QIDQ464740

List of research outcomes





PublicationDate of PublicationType
Identifiability of Product of Experts Models2023-10-13Paper
Convergence of incentive-driven dynamics in Fisher markets2022-07-15Paper
Hadamard Extensions and the Identification of Mixtures of Product Distributions2022-07-13Paper
A refined approximation for Euclidean \(k\)-means2022-04-07Paper
The invisible hand of Laplace: the role of market structure in price convergence and oscillation2021-09-01Paper
https://portal.mardi4nfdi.de/entity/Q49933292021-06-15Paper
Edge Expansion and Spectral Gap of Nonnegative Matrices2021-02-02Paper
Online Codes for Analog Signals2020-01-28Paper
Achieving target equilibria in network routing games without knowing the latency functions2019-12-12Paper
Explicit binary tree codes with polylogarithmic size alphabet2019-08-22Paper
The duality gap for two-team zero-sum games2019-05-24Paper
Quasi-random multilinear polynomials2019-05-16Paper
Clustering Affine Subspaces: Hardness and Algorithms2019-05-15Paper
https://portal.mardi4nfdi.de/entity/Q57434812019-05-10Paper
Convergence of Incentive-Driven Dynamics in Fisher Markets2018-07-16Paper
The Adversarial Noise Threshold for Distributed Protocols2018-07-16Paper
Analysis of a Classical Matrix Preconditioning Algorithm2018-05-17Paper
https://portal.mardi4nfdi.de/entity/Q46381112018-05-03Paper
https://portal.mardi4nfdi.de/entity/Q46079952018-03-15Paper
https://portal.mardi4nfdi.de/entity/Q53650872017-09-29Paper
Error-Correcting Codes for Automatic Control2017-08-08Paper
https://portal.mardi4nfdi.de/entity/Q52753952017-07-13Paper
Tree codes and a conjecture on exponential sums2017-05-19Paper
Learning mixtures of arbitrary distributions over large discrete domains2017-05-19Paper
Optimal Coding for Streaming Authentication and Interactive Communication2017-04-28Paper
Molecular scale heat engines and scalable quantum computation2016-09-29Paper
Majorizing estimators and the approximation of \#P-complete problems2016-09-29Paper
A coding theorem for distributed computation2016-09-01Paper
Learning Arbitrary Statistical Mixtures of Discrete Distributions2015-08-21Paper
Analysis of a Classical Matrix Preconditioning Algorithm2015-08-21Paper
https://portal.mardi4nfdi.de/entity/Q55018462015-08-14Paper
https://portal.mardi4nfdi.de/entity/Q55013762015-08-03Paper
Deterministic coding for interactive communication2015-05-07Paper
Feedback control for router congestion resolution2015-03-10Paper
Quantum mechanical algorithms for the nonabelian hidden subgroup problem2015-02-27Paper
On a capacitated multivehicle routing problem2014-12-12Paper
Volume in general metric spaces2014-10-29Paper
Dimension-free L2 maximal inequality for spherical means in the hypercube2014-10-06Paper
Clustering for edge-cost minimization (extended abstract)2014-09-26Paper
Computing with highly mixed states (extended abstract)2014-09-26Paper
Network Improvement for Equilibrium Routing2014-06-02Paper
https://portal.mardi4nfdi.de/entity/Q54176512014-05-22Paper
The effectiveness of lloyd-type methods for the k-means problem2014-02-17Paper
Optimal Coding for Streaming Authentication and Interactive Communication2013-09-17Paper
https://portal.mardi4nfdi.de/entity/Q31659472012-10-19Paper
https://portal.mardi4nfdi.de/entity/Q31740722011-10-12Paper
The quantifier semigroup for bipartite graphs2011-06-24Paper
Volume in General Metric Spaces2010-09-06Paper
https://portal.mardi4nfdi.de/entity/Q35793772010-08-06Paper
Universal Immersion Spaces for Edge-Colored Graphs and Nearest-Neighbor Metrics2010-06-01Paper
VARIATION ON A THEOREM BY CARATHÉODORY2010-02-19Paper
Contraction and expansion of convex sets2009-12-14Paper
Muirhead-Rado inequality for compact groups2009-09-02Paper
https://portal.mardi4nfdi.de/entity/Q35497332009-01-05Paper
The Symmetric Group Defies Strong Fourier Sampling2008-12-22Paper
Computing with highly mixed states2008-12-21Paper
On the maximum tolerable noise of k-input gates for reliable computation by formulas2008-12-21Paper
The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts2008-06-19Paper
Physical Limits of Heat‐Bath Algorithmic Cooling2008-01-03Paper
Lower bounds for linear locally decodable codes and private information retrieval2007-01-24Paper
Imaging geometry through dynamics: the observable representation2006-08-30Paper
A computationally motivated definition of parametric estimation and its applications to the Gaussian distribution2006-06-27Paper
Convergence of matrices under random conjugation: wave packet scattering without kinematic entanglement2006-04-06Paper
https://portal.mardi4nfdi.de/entity/Q46676222005-04-20Paper
Broadcasting on trees and the Ising model.2004-10-27Paper
The Quantum Communication Complexity of Sampling2004-01-08Paper
Reconstruction from subsequences.2003-09-07Paper
A random stacking process2002-12-02Paper
The vector partition problem for convex objective functions.2001-11-26Paper
Signal propagation and noisy circuits2000-09-07Paper
Asymptotically good codes correcting insertions, deletions, and transpositions2000-09-07Paper
https://portal.mardi4nfdi.de/entity/Q42319232000-04-26Paper
Verification of Identities2000-03-19Paper
https://portal.mardi4nfdi.de/entity/Q42284471999-12-02Paper
A three-party communication problem1999-02-21Paper
Fairness in Scheduling1999-01-17Paper
The maintenance of common data in a distributed system1998-01-22Paper
Coding for interactive communication1997-10-20Paper
Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph1997-05-04Paper
https://portal.mardi4nfdi.de/entity/Q48860811996-07-28Paper
A product theorem for intersection families1995-10-08Paper
Crossing families1994-08-11Paper
Minimally distant sets of lattice points1993-08-25Paper
Optimal Randomized Algorithms for Local Sorting and Set-Maxima1993-05-17Paper
An equipartition of planar sets1993-05-16Paper
Sorting on a ring of processors1990-01-01Paper

Research outcomes over time

This page was built for person: Leonard J. Schulman