H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 31 Citations 3,980 102 World Ranking 7873 National Ranking 3658

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Combinatorics
  • Artificial intelligence

His primary scientific interests are in Combinatorics, Discrete mathematics, Binary logarithm, Theoretical computer science and Algorithm. His biological study spans a wide range of topics, including Computational complexity theory and Matching. His study looks at the relationship between Discrete mathematics and fields such as Decoding methods, as well as how they intersect with chemical problems.

His Binary logarithm study integrates concerns from other disciplines, such as Connected component, Certificate and Parallel algorithm. The study incorporates disciplines such as Scheduling, Job shop scheduling, Competitive analysis and Discrete geometry in addition to Theoretical computer science. His Algorithm research is multidisciplinary, incorporating elements of Computational economics and Game theory.

His most cited work include:

  • Hamsa: fast signature generation for zero-day polymorphic worms with provable attack resilience (280 citations)
  • A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry. (211 citations)
  • Complexities for Generalized Models of Self-Assembly (143 citations)

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

Ming-Yang Kao mostly deals with Combinatorics, Discrete mathematics, Time complexity, Algorithm and Mathematical optimization. His work is connected to Binary logarithm, Planar graph, Bipartite graph, Approximation algorithm and Vertex, as a part of Combinatorics. His Discrete mathematics research incorporates themes from Graph, Speedup and Adjacency list.

His study in Time complexity is interdisciplinary in nature, drawing from both Huffman coding, Graph theory and Hamming distance. In his study, Computational problem is inextricably linked to Theoretical computer science, which falls within the broad field of Algorithm. The concepts of his Mathematical optimization study are interwoven with issues in Investment strategy, Trading strategy and Portfolio.

He most often published in these fields:

  • Combinatorics (48.39%)
  • Discrete mathematics (29.49%)
  • Time complexity (26.73%)

What were the highlights of his more recent work (between 2006-2017)?

  • Algorithm (23.50%)
  • Combinatorics (48.39%)
  • Time complexity (26.73%)

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

His scientific interests lie mostly in Algorithm, Combinatorics, Time complexity, Discrete mathematics and Mathematical optimization. In general Algorithm, his work in Approximation algorithm and Randomized algorithm is often linked to Extrapolation linking many areas of study. His Combinatorics research is multidisciplinary, relying on both Sequence and Statistical model.

His Statistical model research is multidisciplinary, incorporating perspectives in Binary logarithm and Pattern recognition. As a part of the same scientific study, he usually deals with the Time complexity, concentrating on Hamming distance and frequently concerns with Coding theory, Enumeration, Linked list and Word. His study brings together the fields of Upper and lower bounds and Discrete mathematics.

Between 2006 and 2017, his most popular works were:

  • Encyclopedia of Algorithms (102 citations)
  • Reversible sketches: enabling monitoring and analysis over high-speed data streams (97 citations)
  • Randomized Self-assembly for Approximate Shapes (67 citations)

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

  • Algorithm
  • Combinatorics
  • Artificial intelligence

Ming-Yang Kao focuses on Algorithm, Discrete mathematics, Combinatorics, Time complexity and Approximation algorithm. His work on Computational geometry as part of general Algorithm study is frequently linked to Encyclopedia, bridging the gap between disciplines. His Discrete mathematics study integrates concerns from other disciplines, such as Upper and lower bounds and Theory of computation.

His research combines Bounded function and Combinatorics. The Time complexity study combines topics in areas such as Efficient algorithm and Reconstruction method. His Approximation algorithm research incorporates elements of Travelling salesman problem, Bottleneck traveling salesman problem, Similarity measure, Point and Similitude.

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.

Top Publications

Hamsa: fast signature generation for zero-day polymorphic worms with provable attack resilience

Zhichun Li;Manan Sanghi;Yan Chen;Ming-Yang Kao.
ieee symposium on security and privacy (2006)

430 Citations

A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry.

Ting Chen;Ming-Yang Kao;Matthew Tepel;John Rush.
Journal of Computational Biology (2001)

349 Citations

Complexities for Generalized Models of Self-Assembly

Gagan Aggarwal;Qi Cheng;Michael H. Goldwasser;Ming-Yang Kao.
SIAM Journal on Computing (2005)

224 Citations

Searching in an Unknown Environment

Ming-Yang Kao;John H. Reif;Stephen R. Tate.
Information & Computation (1996)

183 Citations

Encyclopedia of Algorithms

Ming Yang Kao.
(2008)

149 Citations

Load balancing in the L/sub p/ norm

B. Awerbuch;Y. Azar;E.F. Grove;Ming-Yang Kao.
foundations of computer science (1995)

148 Citations

Reducing tile complexity for self-assembly through temperature programming

Ming-Yang Kao;Robert Schweller.
symposium on discrete algorithms (2006)

138 Citations

Reversible sketches: enabling monitoring and analysis over high-speed data streams

Robert Schweller;Zhichun Li;Yan Chen;Yan Gao.
IEEE ACM Transactions on Networking (2007)

136 Citations

Parallel depth-first search in general directed graphs

Alok Aggarwal;Richard J. Anderson;Ming-Yang Kao.
symposium on the theory of computing (1989)

119 Citations

Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses

Richie Chih-Nan Chuang;Ashim Garg;Xin He;Ming-Yang Kao.
international colloquium on automata languages and programming (1998)

115 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Top Scientists Citing Ming-Yang Kao

Erik Winfree

Erik Winfree

California Institute of Technology

Publications: 18

Xiaohong Guan

Xiaohong Guan

Xi'an Jiaotong University

Publications: 16

Bin Ma

Bin Ma

University of Waterloo

Publications: 16

Pavel A. Pevzner

Pavel A. Pevzner

University of California, San Diego

Publications: 15

Wing-Kin Sung

Wing-Kin Sung

National University of Singapore

Publications: 14

Bhaskar DasGupta

Bhaskar DasGupta

University of Illinois at Chicago

Publications: 13

John H. Reif

John H. Reif

Duke University

Publications: 13

Evangelos Kranakis

Evangelos Kranakis

Carleton University

Publications: 12

Marek Chrobak

Marek Chrobak

University of California, Riverside

Publications: 11

Dawn Song

Dawn Song

University of California, Berkeley

Publications: 10

Wenke Lee

Wenke Lee

Georgia Institute of Technology

Publications: 10

Tandy Warnow

Tandy Warnow

University of Illinois at Urbana-Champaign

Publications: 10

Shigang Chen

Shigang Chen

University of Florida

Publications: 10

Xiang-Yang Li

Xiang-Yang Li

University of Science and Technology of China

Publications: 10

C. Seshadhri

C. Seshadhri

University of California, Santa Cruz

Publications: 9

Something went wrong. Please try again later.