H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 36 Citations 6,937 81 World Ranking 5683 National Ranking 2738

Research.com Recognitions

Awards & Achievements

2011 - ACM Fellow For contributions to the design and analysis of algorithms.

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Artificial intelligence
  • Combinatorics

Howard Karloff mostly deals with Algorithm, Approximation algorithm, Combinatorics, Mathematical optimization and Discrete mathematics. The Algorithm study combines topics in areas such as Range and Competitive analysis. Howard Karloff combines subjects such as Maximum cut, Karloff–Zwick algorithm, Simple, Greedy randomized adaptive search procedure and Linear programming relaxation with his study of Approximation algorithm.

His studies in Combinatorics integrate themes in fields like Norm, Matrix, Sparse matrix and Sparse approximation. His work in the fields of Mathematical optimization, such as Traveling purchaser problem, 2-opt, Christofides algorithm and Local search, intersects with other areas such as Cross-entropy method. The concepts of his Discrete mathematics study are interwoven with issues in Linear programming, Constraint satisfaction, Semidefinite programming and Restricted isometry property.

His most cited work include:

  • Algebraic methods for interactive proof systems (537 citations)
  • A model of computation for MapReduce (453 citations)
  • Combining geometry and combinatorics: A unified approach to sparse signal recovery (315 citations)

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

His primary areas of study are Combinatorics, Approximation algorithm, Algorithm, Discrete mathematics and Upper and lower bounds. His Combinatorics research incorporates elements of Embedding, Polynomial, Semidefinite programming and Metric space. He has researched Approximation algorithm in several fields, including Maximum cut, Graph, Time complexity and Linear programming, Linear programming relaxation.

His research investigates the link between Algorithm and topics such as Mathematical optimization that cross with problems in Deterministic algorithm. His biological study spans a wide range of topics, including Graph theory, Code word, Code and Linear combination. In the subject of general Upper and lower bounds, his work in Competitive analysis is often linked to Omega, thereby combining diverse domains of study.

He most often published in these fields:

  • Combinatorics (50.45%)
  • Approximation algorithm (35.14%)
  • Algorithm (31.53%)

What were the highlights of his more recent work (between 2011-2020)?

  • Approximation algorithm (35.14%)
  • Combinatorics (50.45%)
  • Linear regression (3.60%)

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

The scientist’s investigation covers issues in Approximation algorithm, Combinatorics, Linear regression, Time complexity and Optimization problem. Approximation algorithm is a subfield of Algorithm that Howard Karloff explores. Howard Karloff interconnects Tree, Construct and Speedup in the investigation of issues within Algorithm.

His Combinatorics research is multidisciplinary, relying on both Discrete mathematics, Structure, Geometric data analysis and Sequential dependency. Howard Karloff has included themes like Dynamic programming, Sequence, Computation and Database theory in his Discrete mathematics study. His Linear regression research integrates issues from P-matrix, Feature selection, Polynomial and Sparse vector.

Between 2011 and 2020, his most popular works were:

  • Variable Selection is Hard (23 citations)
  • Maximum entropy summary trees (9 citations)
  • Discovering Conservation Rules (8 citations)

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

  • Algorithm
  • Artificial intelligence
  • Statistics

His main research concerns Linear regression, Combinatorics, Discrete mathematics, P-matrix and Sparse vector. The study incorporates disciplines such as Dimension, Time complexity, Open problem, Regret and Bounded function in addition to Linear regression. He combines Combinatorics and Tree rearrangement in his research.

His work deals with themes such as Interval tree, 2–3 tree, -tree, Square and Complement, which intersect with Discrete mathematics. His studies deal with areas such as Polynomial and Feature selection as well as P-matrix.

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

Algebraic methods for interactive proof systems

Carsten Lund;Lance Fortnow;Howard Karloff;Noam Nisan.
Journal of the ACM (1992)

911 Citations

A model of computation for MapReduce

Howard Karloff;Siddharth Suri;Sergei Vassilvitskii.
symposium on discrete algorithms (2010)

577 Citations

Combining geometry and combinatorics: A unified approach to sparse signal recovery

R. Berinde;A.C. Gilbert;P. Indyk;H. Karloff.
allerton conference on communication, control, and computing (2008)

374 Citations

New results on server problems

M. Chrobak;H. Karloff;T. Payne;S. Vishwanathan.
SIAM Journal on Discrete Mathematics (1991)

325 Citations

New algorithms for an ancient scheduling problem

Yair Bartal;Amos Fiat;Howard Karloff;Rakesh Vohra.
symposium on the theory of computing (1992)

300 Citations

An improved approximation algorithm for multiway cut

Gruia Călinescu;Howard Karloff;Yuval Rabani.
symposium on the theory of computing (1998)

280 Citations

A 7/8-approximation algorithm for MAX 3SAT?

H. Karloff;U. Zwick.
foundations of computer science (1997)

280 Citations

Approximation Algorithms for the 0-Extension Problem

Gruia Calinescu;Howard Karloff;Yuval Rabani.
SIAM Journal on Computing (2005)

176 Citations

On generating near-optimal tableaux for conditional functional dependencies

Lukasz Golab;Howard Karloff;Flip Korn;Divesh Srivastava.
very large data bases (2008)

161 Citations

Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP

Aaron Archer;MohammadHossein Bateni;MohammadTaghi Hajiaghayi;Howard Karloff.
SIAM Journal on Computing (2011)

125 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 Howard Karloff

Oded Goldreich

Oded Goldreich

Weizmann Institute of Science

Publications: 41

Piotr Indyk

Piotr Indyk

MIT

Publications: 37

Madhu Sudan

Madhu Sudan

Harvard University

Publications: 35

Lance Fortnow

Lance Fortnow

Illinois Institute of Technology

Publications: 35

Wenfei Fan

Wenfei Fan

University of Edinburgh

Publications: 33

MohammadTaghi Hajiaghayi

MohammadTaghi Hajiaghayi

University of Maryland, College Park

Publications: 32

Anupam Gupta

Anupam Gupta

Carnegie Mellon University

Publications: 32

Marek Chrobak

Marek Chrobak

University of California, Riverside

Publications: 30

Yair Bartal

Yair Bartal

Hebrew University of Jerusalem

Publications: 29

Joseph (Seffi) Naor

Joseph (Seffi) Naor

Technion – Israel Institute of Technology

Publications: 28

Sanjeev Arora

Sanjeev Arora

Princeton University

Publications: 28

Yossi Azar

Yossi Azar

Tel Aviv University

Publications: 27

Vahab Mirrokni

Vahab Mirrokni

Google (United States)

Publications: 26

Susanne Albers

Susanne Albers

Technical University of Munich

Publications: 26

Assaf Naor

Assaf Naor

Princeton University

Publications: 25

Something went wrong. Please try again later.