H-Index & Metrics Best Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science D-index 77 Citations 31,827 260 World Ranking 515 National Ranking 313

Research.com Recognitions

Awards & Achievements

2014 - ACM Fellow For contributions to coding theory, hashing algorithms and data structures, and networking algorithms.

2000 - Fellow of Alfred P. Sloan Foundation

Overview

What is he best known for?

The fields of study he is best known for:

  • Statistics
  • Algorithm
  • Computer network

His primary areas of investigation include Algorithm, Theoretical computer science, Distributed computing, Computer network and Bloom filter. His Algorithm research is multidisciplinary, incorporating elements of Binary erasure channel, Development and Random graph. His work investigates the relationship between Theoretical computer science and topics such as Low-density parity-check code that intersect with problems in Probabilistic analysis of algorithms, Channel capacity and Additive white Gaussian noise.

His Distributed computing study incorporates themes from Scalability, Queueing theory, Server and Graph. His research in Computer network intersects with topics in Throughput and Erasure code. His Bloom filter research incorporates themes from False positive paradox, Overhead and Filter.

His most cited work include:

  • Probability and Computing: Randomized Algorithms and Probabilistic Analysis (2017 citations)
  • Network Applications of Bloom Filters: A Survey (1753 citations)
  • Detecting Novel Associations in Large Data Sets (1437 citations)

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

The scientist’s investigation covers issues in Algorithm, Theoretical computer science, Combinatorics, Discrete mathematics and Hash function. His Algorithm research is mostly focused on the topic Bloom filter. His Combinatorics study frequently intersects with other fields, such as Upper and lower bounds.

In most of his Discrete mathematics studies, his work intersects topics such as Channel capacity. His Hash function research focuses on Hash table and Double hashing. Michael Mitzenmacher interconnects Consistent hashing, Linear hashing, 2-choice hashing and Universal hashing in the investigation of issues within Dynamic perfect hashing.

He most often published in these fields:

  • Algorithm (21.59%)
  • Theoretical computer science (18.18%)
  • Combinatorics (15.45%)

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

  • Algorithm (21.59%)
  • Combinatorics (15.45%)
  • Discrete mathematics (13.86%)

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

His primary scientific interests are in Algorithm, Combinatorics, Discrete mathematics, Hash function and Artificial intelligence. The concepts of his Algorithm study are interwoven with issues in Randomness, Traffic engineering and Filter. His studies deal with areas such as Pairwise comparison and Heuristics as well as Combinatorics.

His studies in Discrete mathematics integrate themes in fields like Invertible matrix and Theory of computation. As part of the same scientific family, Michael Mitzenmacher usually focuses on Artificial intelligence, concentrating on Machine learning and intersecting with Bloom filter and Variation. He has included themes like Theoretical computer science and Key in his Hash table study.

Between 2015 and 2021, his most popular works were:

  • Scalable Motif-aware Graph Clustering (67 citations)
  • A model for learned bloom filters, and optimizing by sandwiching (41 citations)
  • Measuring dependence powerfully and equitably (23 citations)

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

  • Statistics
  • Algorithm
  • Computer network

His scientific interests lie mostly in Algorithm, Hash function, Theoretical computer science, Bloom filter and Filter. His work on Quantization is typically connected to Marked graph as part of general Algorithm study, connecting several disciplines of science. He focuses mostly in the field of Hash function, narrowing it down to topics relating to Key and, in certain cases, Parallel computing, Markov chain and Open addressing.

His Theoretical computer science research integrates issues from Complement graph, Butterfly graph, Strength of a graph, Voltage graph and Graph. His Bloom filter study also includes fields such as

  • Structure which connect with Machine learning and Artificial intelligence,
  • Function that connect with fields like Linear network coding, Theory of computation, Invertible matrix, Discrete mathematics and Pairwise comparison. His studies examine the connections between Cuckoo hashing and genetics, as well as such issues in Intersection, with regards to Graph and Combinatorics.

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

Probability and Computing: Randomized Algorithms and Probabilistic Analysis

Michael Mitzenmacher;Eli Upfal.
(2005)

2491 Citations

Network Applications of Bloom Filters: A Survey

Andrei Z. Broder;Michael Mitzenmacher.
Internet Mathematics (2004)

2009 Citations

A Brief History of Generative Models for Power Law and Lognormal Distributions

Michael D. Mitzenmacher.
Internet Mathematics (2004)

1962 Citations

A digital fountain approach to reliable distribution of bulk data

John W. Byers;Michael Luby;Michael Mitzenmacher;Ashutosh Rege.
acm special interest group on data communication (1998)

1786 Citations

Detecting Novel Associations in Large Data Sets

David N. Reshef;David N. Reshef;David N. Reshef;Yakir A. Reshef;Yakir A. Reshef;Hilary K. Finucane;Sharon R. Grossman;Sharon R. Grossman.
Science (2011)

1633 Citations

Efficient erasure correcting codes

M.G. Luby;M. Mitzenmacher;M.A. Shokrollahi;D.A. Spielman.
IEEE Transactions on Information Theory (2001)

1296 Citations

Min-Wise Independent Permutations

Andrei Z Broder;Moses Charikar;Alan M Frieze;Michael Mitzenmacher.
symposium on the theory of computing (2000)

1255 Citations

The power of two choices in randomized load balancing

M. Mitzenmacher.
IEEE Transactions on Parallel and Distributed Systems (2001)

1212 Citations

Improved low-density parity-check codes using irregular graphs

M.G. Luby;M. Mitzenmacher;M.A. Shokrollahi;D.A. Spielman.
IEEE Transactions on Information Theory (2001)

1190 Citations

Privacy preserving keyword searches on remote encrypted data

Yan-Cheng Chang;Michael Mitzenmacher.
applied cryptography and network security (2005)

1185 Citations

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

Contact us

Best Scientists Citing Michael Mitzenmacher

Muriel Medard

Muriel Medard

MIT

Publications: 66

Eli Upfal

Eli Upfal

Brown University

Publications: 60

Gopal Pandurangan

Gopal Pandurangan

University of Houston

Publications: 52

Baochun Li

Baochun Li

University of Toronto

Publications: 49

Don Towsley

Don Towsley

University of Massachusetts Amherst

Publications: 48

Rudiger Urbanke

Rudiger Urbanke

École Polytechnique Fédérale de Lausanne

Publications: 48

Michael Luby

Michael Luby

BitRipple

Publications: 47

Henry D. Pfister

Henry D. Pfister

Duke University

Publications: 46

Elaine Shi

Elaine Shi

Carnegie Mellon University

Publications: 43

Ping Li

Ping Li

Baidu (United States)

Publications: 43

Andrea Montanari

Andrea Montanari

Stanford University

Publications: 41

Rasmus Pagh

Rasmus Pagh

University of Copenhagen

Publications: 36

Kannan Ramchandran

Kannan Ramchandran

University of California, Berkeley

Publications: 36

Marco Chiani

Marco Chiani

University of Bologna

Publications: 34

Mikkel Thorup

Mikkel Thorup

University of Copenhagen

Publications: 32

Tom Richardson

Tom Richardson

Qualcomm (United Kingdom)

Publications: 32

Something went wrong. Please try again later.