World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
45
Citations
8010
World Ranking
7218
National Ranking
3152

Research.com Recognitions

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

Overview

Howard Karloff is affiliated with Amazon in the United States. Their research spans multiple fields, predominantly in computer science and mathematics, focusing on areas such as theoretical computer science and computational theory and mathematics.

The scientist's main fields of study include:

  • Computer Science
  • Mathematics

The subfields within these broader disciplines include:

  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Computer Graphics and Computer-Aided Design
  • Geometry and Topology

Karloff's key topics of work cover:

  • History and Theory of Mathematics
  • Complexity and Algorithms in Graphs
  • Optimization and Search Problems
  • Computational Geometry and Mesh Generation
  • Mathematics and Applications

They have contributed to both journal articles and book publications. Among their recent papers is "Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs", published in Operations Research in 2020.

The frequent co-authors associated with Howard Karloff include:

  • David Johnson
  • Lee Breslau
  • Ilias Diakonikolas
  • Nick Duffield
  • Yu Gu

Howard Karloff's publications have appeared notably in the venue Operations Research.

In addition to journal articles, Karloff has authored books published by Springer International Publishing. A notable book is Mathematical Thinking, released in 2023.

Recognition includes the distinction of ACM Fellow awarded in 2011 for contributions to the design and analysis of algorithms.

Best Publications

  • Algebraic methods for interactive proof systems

    Carsten Lund;Lance Fortnow;Howard Karloff;Noam Nisan

  • A model of computation for MapReduce

    Howard Karloff;Siddharth Suri;Sergei Vassilvitskii

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

    R. Berinde;A.C. Gilbert;P. Indyk;H. Karloff

  • New results on server problems

    M. Chrobak;H. Karloff;T. Payne;S. Vishwanathan

  • New algorithms for an ancient scheduling problem

    Yair Bartal;Amos Fiat;Howard Karloff;Rakesh Vohra

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

    H. Karloff;U. Zwick

  • An improved approximation algorithm for multiway cut

    Gruia Călinescu;Howard Karloff;Yuval Rabani

  • Algebraic methods for interactive proof systems

    C. Lund;L. Fortnow;H. Karloff;N. Nisan

  • Approximation Algorithms for the 0-Extension Problem

    Gruia Calinescu;Howard Karloff;Yuval Rabani

  • On generating near-optimal tableaux for conditional functional dependencies

    Lukasz Golab;Howard Karloff;Flip Korn;Divesh Srivastava

  • Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP

    Aaron Archer;MohammadHossein Bateni;MohammadTaghi Hajiaghayi;Howard Karloff

  • Sequential dependencies

    Lukasz Golab;Howard Karloff;Flip Korn;Avishek Saha

  • New Results on the Old k -opt Algorithm for the Traveling Salesman Problem

    Barun Chandra;Howard Karloff;Craig Tovey

  • How Good is the Goemans--Williamson MAX CUT Algorithm?

    Howard Karloff

  • On the complexity of the view-selection problem

    Howard Karloff;Milena Mihail

  • Approximation algorithms for the 0-extension problem

    Gruia Calinescu;Howard Karloff;Yuval Rabani

  • A better lower bound for on-line scheduling

    Yair Bartal;Howard Karloff;Yuval Rabani

  • Fast algorithms for approximately counting mismatches

    Howard Karloff

  • Lower bounds for linear locally decodable codes and private information retrieval

    O. Goldreich;H. Karloff;L.J. Schulman;L. Trevisan

  • Improved Approximation Algorithms for Resource Allocation

    Gruia Calinescu;Amit Chakrabarti;Howard J. Karloff;Yuval Rabani

  • Lower bounds for linear locally decodable codes and private information retrieval

    Oded Goldreich;Howard Karloff;Leonard J. Schulman;Luca Trevisan

Frequent Co-Authors

Yuval Rabani
Yuval Rabani Hebrew University of Jerusalem
MohammadTaghi Hajiaghayi
MohammadTaghi Hajiaghayi University of Maryland, College Park
Lukasz Golab
Lukasz Golab University of Waterloo
Dean P. Foster
Dean P. Foster Amazon (United States)
Divesh Srivastava
Divesh Srivastava AT&T (United States)
Moses Charikar
Moses Charikar Stanford University
Flip Korn
Flip Korn Google (United States)
Amos Fiat
Amos Fiat Tel Aviv University
Marek Chrobak
Marek Chrobak University of California, Riverside
Michael Saks
Michael Saks Rutgers, The State University of New Jersey

External Links

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

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science in the USA can open doors to a wide range of online degrees and career pathways. For professionals seeking to combine technical expertise with leadership, pursuing the cheapest executive mba can provide advanced business skills at an affordable price.

For those interested in information management and research-related careers, an mlis online (Master of Library and Information Science) offers specialized training that can complement a background in computer science—especially in digital libraries or data organization.

Graduate education can be costly, but there are many options for inexpensive masters degrees online. These programs make it possible to boost your credentials without a significant financial burden.

For those aiming for executive or academic leadership, consider the best online doctorate in organizational leadership. This pathway can be ideal for technologists ready to lead teams or organizations in the evolving tech landscape.

Best Scientists Citing Howard Karloff

Trending Scientists

Recently Published Articles