Howard J. Karloff

According to our database, Howard J. Karloff authored at least 76 papers between 1986 and 2020.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2020

Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs.

David S. Johnson, Lee Breslau, Ilias Diakonikolas, Nick Duffield, Yu Gu, MohammadTaghi Hajiaghayi, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen

Oper. Res., 2020

2016

Online Sparse Linear Regression.

Dean P. Foster, Satyen Kale, Howard J. Karloff

Proceedings of the 29th Conference on Learning Theory, 2016

2015

Designing wireless metropolitan-area networks using mathematical optimization.

Howard J. Karloff, Ramesh Subbaraman

Proceedings of the 2015 Wireless Telecommunications Symposium, 2015

Variable Selection is Hard.

Dean P. Foster, Howard J. Karloff, Justin Thaler

Proceedings of The 28th Conference on Learning Theory, 2015

2014

Distributed data placement to minimize communication costs via graph partitioning.

Lukasz Golab, Marios Hadjieleftheriou, Howard J. Karloff, Barna Saha

Proceedings of the Conference on Scientific and Statistical Database Management, 2014

Fast Algorithms for Constructing Maximum Entropy Summary Trees.

Richard Cole, Howard J. Karloff

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Evolutionary algorithms for overlapping correlation clustering.

Carlos Eduardo de Andrade, Mauricio G. C. Resende, Howard J. Karloff, Flávio Keidi Miyazawa

Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2013

Distributed Data Placement via Graph Partitioning.

Lukasz Golab, Marios Hadjieleftheriou, Howard J. Karloff, Barna Saha

CoRR, 2013

Maximum Entropy Summary Trees.

Howard J. Karloff, Kenneth E. Shirley

Comput. Graph. Forum, 2013

2012

Discovering Conservation Rules.

Lukasz Golab, Howard J. Karloff, Flip Korn, Barna Saha, Divesh Srivastava

Proceedings of the IEEE 28th International Conference on Data Engineering (ICDE 2012), 2012

2011

An improved approximation algorithm for resource allocation.

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

ACM Trans. Algorithms, 2011

On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data.

Howard J. Karloff, Flip Korn, Konstantin Makarychev, Yuval Rabani

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Capacitated Metric Labeling.

Matthew Andrews, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Ankur Moitra

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Sequential Dependency Computation via Geometric Data Structures.

Gruia Calinescu, Howard J. Karloff

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Disjoint-Path Facility Location: Theory and Practice.

Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu, Mohammad Taghi Hajiaghayi, David S. Johnson, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen

Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

2010

Data Auditor: Exploring Data Quality and Semantics using Pattern Tableaux.

Lukasz Golab, Howard J. Karloff, Flip Korn, Divesh Srivastava

Proc. VLDB Endow., 2010

<i><i>l</i></i>₂² Spreading Metrics for Vertex Ordering Problems.

Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao

Algorithmica, 2010

A Model of Computation for MapReduce.

Howard J. Karloff, Siddharth Suri, Sergei Vassilvitskii

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Set cover algorithms for very large datasets.

Graham Cormode, Howard J. Karloff, Anthony Wirth

Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

2009

Sequential Dependencies.

Lukasz Golab, Howard J. Karloff, Flip Korn, Avishek Saha, Divesh Srivastava

Proc. VLDB Endow., 2009

Scheduling to minimize staleness and stretch in real-time data warehouses.

MohammadHossein Bateni, Lukasz Golab, Mohammad Taghi Hajiaghayi, Howard J. Karloff

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP.

Aaron Archer, MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Howard J. Karloff

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Improved Approximation Algorithms for Label Cover Problems.

Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff

Proceedings of the Algorithms, 2009

2008

On generating near-optimal tableaux for conditional functional dependencies.

Lukasz Golab, Howard J. Karloff, Flip Korn, Divesh Srivastava, Bei Yu

Proc. VLDB Endow., 2008

On the integrality ratio for tree augmentation.

Joseph Cheriyan, Howard J. Karloff, Rohit Khandekar, Jochen Könemann

Oper. Res. Lett., 2008

Online multicast with egalitarian cost sharing.

Moses Charikar, Howard J. Karloff, Claire Mathieu, Joseph Naor, Michael E. Saks

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

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

Radu Berinde, Anna C. Gilbert, Piotr Indyk, Howard J. Karloff, Martin J. Strauss

Proceedings of the 46th Annual Allerton Conference on Communication, 2008

2007

Compressing rectilinear pictures and minimizing access control lists.

David L. Applegate, Gruia Calinescu, David S. Johnson, Howard J. Karloff, Katrina Ligett, Jia Wang

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

On the Integrality Ratio for the Asymmetric Traveling Salesman Problem.

Moses Charikar, Michel X. Goemans, Howard J. Karloff

Math. Oper. Res., 2006

On earthmover distance, metric labeling, and 0-extension.

Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

<i>l</i>²₂ spreading metrics for vertex ordering problems.

Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Caching with Expiration Times for Internet Applications.

Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi

Internet Math., 2005

Separating Points by Axis-parallel Lines.

Gruia Calinescu, Adrian Dumitrescu, Howard J. Karloff, Peng-Jun Wan

Int. J. Comput. Geom. Appl., 2005

2004

On the convergence time of a path-vector protocol.

Howard J. Karloff

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

On the Integrality Ratio for Asymmetric TSP.

Moses Charikar, Michel X. Goemans, Howard J. Karloff

Proceedings of the 45th Symposium on Foundations of Computer Science, 2004

2003

A New Approximation Algorithm for Finding Heavy Planar Subgraphs.

Gruia Calinescu, Cristina G. Fernandes, Howard J. Karloff, Alexander Zelikovsky

Algorithmica, 2003

On the fractal behavior of TCP.

Anna C. Gilbert, Howard J. Karloff

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

OPT versus LOAD in dynamic storage allocation.

Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002

Caching with expiration times.

Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Improved Approximation Algorithms for Resource Allocation.

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

Proceedings of the Integer Programming and Combinatorial Optimization, 2002

Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval.

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

Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

2001

Approximation algorithms for the 0-extension problem.

Gruia Calinescu, Howard J. Karloff, Yuval Rabani

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Thresholds and Optimal Binary Comparison Search Trees.

Richard Anderson, Sampath Kannan, Howard J. Karloff, Richard E. Ladner

Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

Approximating Directed Multicuts.

Joseph Cheriyan, Howard J. Karloff, Yuval Rabani

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000

A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems.

Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks

SIAM J. Comput., 2000

Foreword.

Howard J. Karloff

J. Algorithms, 2000

A lower bound of 8/(7+(1/k)-1) on the integrality ratio of the Calinescu-Karloff-Rabani relaxation for multiway cut.

Ari Freund, Howard J. Karloff

Inf. Process. Lett., 2000

1999

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

Barun Chandra, Howard J. Karloff, Craig A. Tovey

SIAM J. Comput., 1999

On the Complexity of the View-Selection Problem.

Howard J. Karloff, Milena Mihail

Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31, 1999

1998

An Improved Approximation Algorithm for Multiway Cut.

Gruia Calinescu, Howard J. Karloff, Yuval Rabani

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

1997

On Construction of <i>k</i>-Wise Independent Random Variables.

Howard J. Karloff, Yishay Mansour

Comb., 1997

A 7/8-Approximation Algorithm for MAX 3SAT?

Howard J. Karloff, Uri Zwick

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

How Good is the Goemans-Williamson MAX CUT Algorithm?

Howard J. Karloff

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

A Better Approximation Algorithm for Finding Planar Subgraphs.

Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Randomized Robot Navigation Algorithms.

Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1994

A Better Lower Bound for On-Line Scheduling.

Yair Bartal, Howard J. Karloff, Yuval Rabani

Inf. Process. Lett., 1994

New Results on the Old k-Opt Algorithm for the TSP.

Barun Chandra, Howard J. Karloff, Craig A. Tovey

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993

Fast Algorithms for Approximately Counting Mismatches.

Howard J. Karloff

Inf. Process. Lett., 1993

1992

New Algorithms for an Ancient Scheduling Problem

Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

A Decomposition Theorem and Bounds for Randomized Server Problems

Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

Connectivity vs. Reachability

Marek Chrobak, Howard J. Karloff, Tomasz Radzik

Inf. Comput., April, 1991

Lower Bounds for Randomized k-Server and Motion Planning Algorithms

Howard J. Karloff, Yuval Rabani, Yiftach Ravid

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Competitive Algorithms for Layered Graph Traversal

Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

New Results on Server Problems.

Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

A Competitive 3-Server Algorithm.

Piotr Berman, Howard J. Karloff, Gábor Tardos

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

Algebraic Methods for Interactive Proof Systems

Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

The Iterated Mod Problem

Howard J. Karloff, Walter L. Ruzzo

Inf. Comput., March, 1989

An NC Algorithm for Brooks' Theorem.

Howard J. Karloff

Theor. Comput. Sci., 1989

A lower bound on the size of universal sets for planar graphs.

Marek Chrobak, Howard J. Karloff

SIGACT News, 1989

How Long can a Euclidean Traveling Salesman Tour Be?

Howard J. Karloff

SIAM J. Discret. Math., 1989

Fast Geometric Approximation Techniques and Geometric Embedding Problems.

Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber

Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988

Universal Traversal Sequences of Length n^O(log n) for Cliques.

Howard J. Karloff, Ramamohan Paturi, Janos Simon

Inf. Process. Lett., 1988

Randomized Algorithms and Pseudorandom Numbers

Howard J. Karloff, Prabhakar Raghavan

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1987

Efficient Parallel Algorithms for Edge Coloring Problems.

Howard J. Karloff, David B. Shmoys

J. Algorithms, 1987

Coloring Planar Graphs in Parallel.

Joan Boyar, Howard J. Karloff

J. Algorithms, 1987

1986

A Las Vegas RNC algorithm for maximum matching.

Howard J. Karloff

Comb., 1986