D-Index & Metrics Best Publications

D-Index & Metrics

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 38 Citations 10,653 119 World Ranking 4914 National Ranking 2421

Research.com Recognitions

Awards & Achievements

2019 - Fellow of the American Association for the Advancement of Science (AAAS)

2013 - ACM Fellow For contributions to algorithmic approaches to program reliability, bioinformatics, and for service to the computer science research community.

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Programming language
  • Artificial intelligence

His primary areas of investigation include Combinatorics, Correctness, Theoretical computer science, Discrete mathematics and Programming language. The concepts of his Combinatorics study are interwoven with issues in Algorithm and Streaming algorithm. His Correctness study combines topics in areas such as Sorting, Probabilistic analysis of algorithms and Formal specification.

His Theoretical computer science research includes elements of Cryptography, Hash function, Queue, Sequence and Data structure. His research in Discrete mathematics intersects with topics in Optimization problem, Upper and lower bounds and Polynomial. His Programming language research is multidisciplinary, relying on both Probabilistic logic and System requirements.

His most cited work include:

  • Secure data interchange (1802 citations)
  • On graph problems in a semi-streaming model (370 citations)
  • Designing programs that check their work (366 citations)

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

The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Algorithm, Theoretical computer science and Mathematical optimization. His Combinatorics study combines topics from a wide range of disciplines, such as Upper and lower bounds and Set. In his articles, Sampath Kannan combines various disciplines, including Discrete mathematics and Context.

His work deals with themes such as Process, Data stream mining and Permutation, which intersect with Algorithm. His Theoretical computer science research is multidisciplinary, incorporating perspectives in Correctness and Encryption. His Correctness research integrates issues from Java, Formal methods and Formal specification.

He most often published in these fields:

  • Combinatorics (27.60%)
  • Discrete mathematics (21.35%)
  • Algorithm (15.62%)

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

  • Mathematical optimization (9.90%)
  • Combinatorics (27.60%)
  • Discrete mathematics (21.35%)

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

Sampath Kannan mostly deals with Mathematical optimization, Combinatorics, Discrete mathematics, Differential privacy and Upper and lower bounds. His Mathematical optimization research includes themes of Markov decision process, Regret, Optimal decision and Constant. He combines subjects such as Travelling salesman problem and Metric with his study of Combinatorics.

In his study, Boolean function is strongly linked to Distribution, which falls under the umbrella field of Discrete mathematics. His Upper and lower bounds study also includes

  • Reflection symmetry together with Space model, Binary logarithm, Edge and Line,
  • Exponential function and related Function and Graph. His Distance matrix research focuses on subjects like Bipartite graph, which are linked to Streaming algorithm.

Between 2013 and 2021, his most popular works were:

  • DASHR: database of small human noncoding RNAs (54 citations)
  • A Smoothed Analysis of the Greedy Algorithm for the Linear Contextual Bandit Problem (46 citations)
  • Downstream Effects of Affirmative Action (33 citations)

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

  • Algorithm
  • Programming language
  • Artificial intelligence

Sampath Kannan spends much of his time researching Mathematical optimization, Mechanism design, Greedy algorithm, Operations research and Total cost. The study incorporates disciplines such as Ball, Differential privacy and Metric space in addition to Mathematical optimization. His studies in Differential privacy integrate themes in fields like Theoretical computer science, Many to one and Strategic dominance.

His Greedy algorithm study incorporates themes from Smoothed analysis, Regret, Optimal decision and Constant. His Operations research research incorporates themes from Computational complexity theory, Optimization problem and Budget constraint. He has included themes like Bounding overwatch and Principal in his Total cost study.

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

Secure data interchange

Frederick S. M. Herz;Walter Paul Labys;David C. Parkes;Sampath Kannan.
(2000)

2375 Citations

Designing programs that check their work

Manuel Blum;Sampath Kannan.
Journal of the ACM (1995)

863 Citations

On graph problems in a semi-streaming model

Joan Feigenbaum;Sampath Kannan;Andrew McGregor;Siddharth Suri.
international colloquium on automata, languages and programming (2005)

423 Citations

Checking the correctness of memories

M. Blum;W. Evans;P. Gemmell;S. Kannan.
Algorithmica (1994)

395 Citations

An Approximate L 1 -Difference Algorithm for Massive Data Streams

Joan Feigenbaum;Sampath Kannan;Martin J. Strauss;Mahesh Viswanathan.
SIAM Journal on Computing (2003)

325 Citations

Java-MaC: A Run-Time Assurance Approach for Java Programs

Moonzoo Kim;Mahesh Viswanathan;Sampath Kannan;Insup Lee.
formal methods (2004)

301 Citations

Implicit representation of graphs

Sampath Kannan;Moni Naor;Steven Rudich.
SIAM Journal on Discrete Mathematics (1992)

269 Citations

An approximate L/sup 1/-difference algorithm for massive data streams

J. Feigenbaum;S. Kannan;M. Strauss;M. Viswanathan.
foundations of computer science (1999)

265 Citations

Java-MaC: A Run-time Assurance Tool for Java Programs

Moonjoo Kim;Sampath Kannan;Insup Lee;Oleg Sokolsky.
runtime verification (2001)

252 Citations

Runtime Assurance Based On Formal Specifications

Insup Lee;Sampath Kannan;Moonjoo Kim;Oleg Sokolsky.
parallel and distributed processing techniques and applications (1999)

241 Citations

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

Contact us

Best Scientists Citing Sampath Kannan

Irwin Gerszberg

Irwin Gerszberg

AT&T (United States)

Publications: 116

Paul Shala Henry

Paul Shala Henry

AT&T (United States)

Publications: 115

Robert Bennett

Robert Bennett

AT&T (United States)

Publications: 113

Farhad Barzegar

Farhad Barzegar

AT&T (United States)

Publications: 69

Andrew McGregor

Andrew McGregor

University of Massachusetts Amherst

Publications: 41

Graham Cormode

Graham Cormode

University of Warwick

Publications: 39

Grigore Rosu

Grigore Rosu

University of Illinois at Urbana-Champaign

Publications: 37

Sudipto Guha

Sudipto Guha

University of Pennsylvania

Publications: 36

Klaus Havelund

Klaus Havelund

Jet Propulsion Lab

Publications: 33

Michael T. Goodrich

Michael T. Goodrich

University of California, Irvine

Publications: 31

Tandy Warnow

Tandy Warnow

University of Illinois at Urbana-Champaign

Publications: 31

Adam Soroca

Adam Soroca

Millennial Media LLC

Publications: 31

Dennis Doughty

Dennis Doughty

Lola Travel Company Inc

Publications: 30

Jorey Ramer

Jorey Ramer

Super Home Inc.

Publications: 30

Insup Lee

Insup Lee

University of Pennsylvania

Publications: 29

Volkan Isler

Volkan Isler

Samsung (South Korea)

Publications: 27

Something went wrong. Please try again later.