Leonard J. Schulman mainly focuses on Theoretical computer science, Algorithm, Discrete mathematics, Combinatorics and Information theory. His Theoretical computer science research is multidisciplinary, relying on both Asymptotically optimal algorithm and Shannon–Hartley theorem. His research integrates issues of Dimension, Artificial intelligence and Pattern recognition in his study of Algorithm.
His study explores the link between Pattern recognition and topics such as Probabilistic analysis of algorithms that cross with problems in Simple. He combines subjects such as Tree network, Computation, Group and Bounded function with his study of Discrete mathematics. Leonard J. Schulman specializes in Combinatorics, namely Time complexity.
His primary areas of study are Combinatorics, Discrete mathematics, Algorithm, Mathematical optimization and Upper and lower bounds. His work deals with themes such as Binary number, Exponential function and Regular polygon, which intersect with Combinatorics. The concepts of his Discrete mathematics study are interwoven with issues in Function, Quantum algorithm and Bounded function.
Within one scientific family, he focuses on topics pertaining to Quantum computer under Quantum algorithm, and may sometimes address concerns connected to Computation. His Algorithm research includes elements of Rate of convergence, Norm and Numerical linear algebra. His research in Mathematical optimization intersects with topics in Stackelberg competition, Latency and Special case.
His primary areas of investigation include Combinatorics, Discrete mathematics, Mathematical economics, Constant and Nash equilibrium. A large part of his Combinatorics studies is devoted to Binary logarithm. His Discrete mathematics study incorporates themes from Computational complexity theory, Measure, Zero-sum game, Decoding methods and Exponential growth.
His work in Computational complexity theory covers topics such as Symbolic integration which are related to areas like Simple. His Mathematical economics research incorporates themes from Convergence, Mathematical optimization and Algebraic connectivity. The Constant study combines topics in areas such as Tree, Core, Binary tree and Arity.
Discrete mathematics, Binary logarithm, Combinatorics, Mathematical optimization and Constant are his primary areas of study. Leonard J. Schulman works in the field of Discrete mathematics, focusing on Directed graph in particular. The various areas that Leonard J. Schulman examines in his Binary logarithm study include Matching, Current, Logarithm and Limit.
His work carried out in the field of Combinatorics brings together such families of science as Unsupervised learning and Distribution. His Mathematical optimization research incorporates elements of Simple and Incentive compatibility. His biological study spans a wide range of topics, including Tree, Exponential growth, Binary tree and Arity.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
The effectiveness of lloyd-type methods for the k-means problem
Rafail Ostrovsky;Yuval Rabani;Leonard J. Schulman;Chaitanya Swamy.
Journal of the ACM (2013)
Splitters and near-optimal derandomization
M. Naor;L.J. Schulman;A. Srinivasan.
foundations of computer science (1995)
Coding for interactive communication
international symposium on information theory (1995)
Broadcasting on trees and the Ising model
William Evans;Claire Kenyon;Yuval Peres;Leonard J. Schulman.
Annals of Applied Probability (2000)
A Two-Round Variant of EM for Gaussian Mixtures
Sanjoy Dasgupta;Leonard J. Schulman.
uncertainty in artificial intelligence (2000)
A Probabilistic Analysis of EM for Mixtures of Separated, Spherical Gaussians
Sanjoy Dasgupta;Leonard Schulman.
Journal of Machine Learning Research (2007)
Quantum mechanical algorithms for the nonabelian hidden subgroup problem
Michelangelo Grigni;Leonard Schulman;Monica Vazirani;Umesh Vazirani.
symposium on the theory of computing (2001)
Asymptotically good codes correcting insertions, deletions, and transpositions
L.J. Schulman;D. Zuckerman.
IEEE Transactions on Information Theory (1999)
A random walk model of wave propagation
M. Franceschetti;J. Bruck;L.J. Schulman.
IEEE Transactions on Antennas and Propagation (2004)
Communication on noisy channels: a coding theorem for computation
foundations of computer science (1992)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: