• Publications
  • Influence
The Effectiveness of Lloyd-Type Methods for the k-Means Problem
TLDR
This work investigates variants of Lloyd's heuristic for clustering high dimensional data in an attempt to explain its popularity (a half century after its introduction) among practitioners, and proposes and justifies a clusterability criterion for data sets. Expand
Coding for interactive communication
  • L. Schulman
  • Computer Science
  • IEEE Trans. Inf. Theory
  • 17 September 1995
TLDR
A deterministic method for simulating noiseless-channel protocols on noisy channels, with only a constant slowdown is described, an analog for general, interactive protocols of Shannon's coding theorem, which deals only with data transmission, i.e., one-way protocols. Expand
Splitters and near-optimal derandomization
TLDR
A fairly general method for finding deterministic constructions obeying k-restrictions, which yields structures of size not much larger than the probabilistic bound and imply the very efficient derandomization of algorithms in learning, of fixed-subgraph finding algorithms, and of near optimal /spl Sigma/II/Spl Sigma/ threshold formulae. Expand
Broadcasting on trees and the Ising model
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology andExpand
Communication on noisy channels: a coding theorem for computation
  • L. Schulman
  • Computer Science
  • Proceedings., 33rd Annual Symposium on…
  • 24 October 1992
TLDR
The author relates the noisy channel and the standard (noise less channel) complexities of a communication problem by establishing a 'two-way' or interactive analogue of Shanon's coding theorem, which involves simulating the original protocol while implementing a hierarchical system of progress checks which ensure that errors of any magnitude in the simulation are, with high probability, rapidly eliminated. Expand
A coding theorem for distributed computation
TLDR
It is shown that any distributed protocol which runs on a noiseless network in time T, can be simulated on an identical noisy network with a slow-down factor proportional to log(d + 1), where d is the maximum degree in the network, and with exponentially small probability of error. Expand
Deterministic coding for interactive communication
  • L. Schulman
  • Mathematics, Computer Science
  • STOC '93
  • 1 June 1993
TLDR
A deterministic method for simulating noiseless-channel protocols on noisy channels, with only a constant slow-down is described, an analog for general interactive protocols of Shannon's coding theorem, which dealt only with data transmission, i.e. one-way protocols. Expand
Quantum mechanical algorithms for the nonabelian hidden subgroup problem
We provide positive and negative results concerning the “standard method” of identifying a hidden subgroup of a nonabelian group using a quantum computer.
Universal ε-approximators for integrals
Let <i>X</i> be a space and <i>F</i> a family of 0, 1-valued functions on <i>X</i>. Vapnik and Chervonenkis showed that if <i>F</i> is "simple" (finite VC dimension), then for every probabilityExpand
Signal propagation and noisy circuits
TLDR
The information carried by a signal decays when the signal is corrupted by random noise is studied and a tight bound is obtained on the rate at which information decreases as a signal crosses a noisy channel to obtain depth lower bounds in the noisy circuit model of computation defined by von Neumann. Expand
...
1
2
3
4
5
...