D-Index & Metrics Best Publications

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 35 Citations 5,860 122 World Ranking 7603 National Ranking 3571

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Mathematical analysis
  • Algebra

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 most cited work include:

  • Splitters and near-optimal derandomization (269 citations)
  • Broadcasting on trees and the Ising model (246 citations)
  • The Effectiveness of Lloyd-Type Methods for the k-Means Problem (236 citations)

What are the main themes of his work throughout his whole career to date?

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.

He most often published in these fields:

  • Combinatorics (37.42%)
  • Discrete mathematics (34.97%)
  • Algorithm (12.88%)

What were the highlights of his more recent work (between 2014-2021)?

  • Combinatorics (37.42%)
  • Discrete mathematics (34.97%)
  • Mathematical economics (5.52%)

In recent papers he was focusing on the following fields of study:

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.

Between 2014 and 2021, his most popular works were:

  • Optimal Coding for Streaming Authentication and Interactive Communication (46 citations)
  • The adversarial noise threshold for distributed protocols (14 citations)
  • Extractors for Near Logarithmic Min-Entropy (13 citations)

In his most recent research, the most cited papers focused on:

  • Quantum mechanics
  • Algorithm
  • Mathematical analysis

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.

Best Publications

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)

899 Citations

Splitters and near-optimal derandomization

M. Naor;L.J. Schulman;A. Srinivasan.
foundations of computer science (1995)

360 Citations

Coding for interactive communication

L.J. Schulman.
international symposium on information theory (1995)

283 Citations

Broadcasting on trees and the Ising model

William Evans;Claire Kenyon;Yuval Peres;Leonard J. Schulman.
Annals of Applied Probability (2000)

267 Citations

A Two-Round Variant of EM for Gaussian Mixtures

Sanjoy Dasgupta;Leonard J. Schulman.
uncertainty in artificial intelligence (2000)

209 Citations

A Probabilistic Analysis of EM for Mixtures of Separated, Spherical Gaussians

Sanjoy Dasgupta;Leonard Schulman.
Journal of Machine Learning Research (2007)

207 Citations

Quantum mechanical algorithms for the nonabelian hidden subgroup problem

Michelangelo Grigni;Leonard Schulman;Monica Vazirani;Umesh Vazirani.
symposium on the theory of computing (2001)

194 Citations

Asymptotically good codes correcting insertions, deletions, and transpositions

L.J. Schulman;D. Zuckerman.
IEEE Transactions on Information Theory (1999)

154 Citations

A random walk model of wave propagation

M. Franceschetti;J. Bruck;L.J. Schulman.
IEEE Transactions on Antennas and Propagation (2004)

153 Citations

Communication on noisy channels: a coding theorem for computation

L.J. Schulman.
foundations of computer science (1992)

147 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

Best Scientists Citing Leonard J. Schulman

Elchanan Mossel

Elchanan Mossel

MIT

Publications: 48

Saket Saurabh

Saket Saurabh

Institute of Mathematical Sciences

Publications: 46

Fedor V. Fomin

Fedor V. Fomin

University of Bergen

Publications: 36

Daniel Lokshtanov

Daniel Lokshtanov

University of California, Santa Barbara

Publications: 33

Cristopher Moore

Cristopher Moore

Santa Fe Institute

Publications: 32

Alexander Russell

Alexander Russell

University of Connecticut

Publications: 31

Rafail Ostrovsky

Rafail Ostrovsky

University of California, Los Angeles

Publications: 27

Massimo Franceschetti

Massimo Franceschetti

University of California, San Diego

Publications: 27

Mike Steel

Mike Steel

University of Canterbury

Publications: 22

Avrim Blum

Avrim Blum

Toyota Technological Institute at Chicago

Publications: 20

Santosh Vempala

Santosh Vempala

Georgia Institute of Technology

Publications: 20

Allan Sly

Allan Sly

Princeton University

Publications: 19

Sham M. Kakade

Sham M. Kakade

Harvard University

Publications: 19

Christian Sohler

Christian Sohler

University of Cologne

Publications: 18

Maria-Florina Balcan

Maria-Florina Balcan

Carnegie Mellon University

Publications: 18

Ankur Moitra

Ankur Moitra

MIT

Publications: 17

Trending Scientists

Marco C. Campi

Marco C. Campi

University of Brescia

Riccardo Casalini

Riccardo Casalini

United States Naval Research Laboratory

Andreas Züttel

Andreas Züttel

École Polytechnique Fédérale de Lausanne

Wen Zeng

Wen Zeng

Chongqing University

Jianyu Yuan

Jianyu Yuan

Soochow University

Oleg Georgiev

Oleg Georgiev

University of Zurich

Christopher Baum

Christopher Baum

Charité - University Medicine Berlin

Henry R. Mahler

Henry R. Mahler

Indiana University

Juan Jofre

Juan Jofre

University of Barcelona

Franco Biondi

Franco Biondi

University of Nevada, Reno

Penelope A. Lewis

Penelope A. Lewis

Cardiff University

Renato C. Monteiro

Renato C. Monteiro

Université Paris Cité

Sergio M. Pellis

Sergio M. Pellis

University of Lethbridge

Mary Rudner

Mary Rudner

Linköping University

James L. Mohler

James L. Mohler

Roswell Park Cancer Institute

Harvey I. Pass

Harvey I. Pass

New York University

Something went wrong. Please try again later.