Howard J. Karloff

According to our database1, Howard J. Karloff authored at least 80 papers between 1986 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Awards

ACM Fellow

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2016
Online Sparse Linear Regression.
Proceedings of the 29th Conference on Learning Theory, 2016

2015
Designing wireless metropolitan-area networks using mathematical optimization.
Proceedings of the 2015 Wireless Telecommunications Symposium, 2015

Variable Selection is Hard.
Proceedings of The 28th Conference on Learning Theory, 2015

2014
Distributed data placement to minimize communication costs via graph partitioning.
Proceedings of the Conference on Scientific and Statistical Database Management, 2014

Fast Algorithms for Constructing Maximum Entropy Summary Trees.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Evolutionary algorithms for overlapping correlation clustering.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2013
Maximum Entropy Summary Trees.
Comput. Graph. Forum, 2013

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

2011
An improved approximation algorithm for resource allocation.
ACM Trans. Algorithms, 2011

On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Capacitated Metric Labeling.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Sequential Dependency Computation via Geometric Data Structures.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Disjoint-Path Facility Location: Theory and Practice.
Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

2010
Data Auditor: Exploring Data Quality and Semantics using Pattern Tableaux.
PVLDB, 2010

l22 Spreading Metrics for Vertex Ordering Problems.
Algorithmica, 2010

A Model of Computation for MapReduce.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Set cover algorithms for very large datasets.
Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

2009
Sequential Dependencies.
PVLDB, 2009

Scheduling to minimize staleness and stretch in real-time data warehouses.
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.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Improved Approximation Algorithms for Label Cover Problems.
Proceedings of the Algorithms, 2009

2008
On generating near-optimal tableaux for conditional functional dependencies.
PVLDB, 2008

On the integrality ratio for tree augmentation.
Oper. Res. Lett., 2008

Online multicast with egalitarian cost sharing.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

2007
Compressing rectilinear pictures and minimizing access control lists.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem.
Math. Oper. Res., 2006

On earthmover distance, metric labeling, and 0-extension.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

l22 spreading metrics for vertex ordering problems.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
Caching with Expiration Times for Internet Applications.
Internet Mathematics, 2005

Separating Points by Axis-parallel Lines.
Int. J. Comput. Geometry Appl., 2005

On earthmover distance, metric labeling, and 0-extension
Electronic Colloquium on Computational Complexity (ECCC), 2005

2004
On the convergence time of a path-vector protocol.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

On the Integrality Ratio for Asymmetric TSP.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003
A New Approximation Algorithm for Finding Heavy Planar Subgraphs.
Algorithmica, 2003

On the fractal behavior of TCP.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

OPT versus LOAD in dynamic storage allocation.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002
Caching with expiration times.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Improved Approximation Algorithms for Resource Allocation.
Proceedings of the Integer Programming and Combinatorial Optimization, 2002

Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval.
Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

2001
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval
Electronic Colloquium on Computational Complexity (ECCC), 2001

Approximation algorithms for the 0-extension problem.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Thresholds and Optimal Binary Comparison Search Trees.
Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

Approximating Directed Multicuts.
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.
SIAM J. Comput., 2000

Foreword.
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.
Inf. Process. Lett., 2000

1999
New Results on the Old k-opt Algorithm for the Traveling Salesman Problem.
SIAM J. Comput., 1999

On the Complexity of the View-Selection Problem.
Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31, 1999

1998
Competitive Algorithms for Layered Graph Traversal.
SIAM J. Comput., 1998

An Improved Approximation Algorithm for Multiway Cut.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

1997
On Construction of k-Wise Independent Random Variables.
Combinatorica, 1997

A 7/8-Approximation Algorithm for MAX 3SAT?
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996
How Good is the Goemans-Williamson MAX CUT Algorithm?
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

A Better Approximation Algorithm for Finding Planar Subgraphs.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Randomized Robot Navigation Algorithms.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995
New Algorithms for an Ancient Scheduling Problem.
J. Comput. Syst. Sci., 1995

1994
Lower Bounds for Randomized k-Server and Motion-Planning Algorithms.
SIAM J. Comput., 1994

A Better Lower Bound for On-Line Scheduling.
Inf. Process. Lett., 1994

New Results on the Old k-Opt Algorithm for the TSP.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

1993
Randomized Algorithms and Pseudorandom Numbers.
J. ACM, 1993

Fast Algorithms for Approximately Counting Mismatches.
Inf. Process. Lett., 1993

1992
Algebraic Methods for Interactive Proof Systems.
J. ACM, 1992

New Algorithms for an Ancient Scheduling Problem
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

A Decomposition Theorem and Bounds for Randomized Server Problems
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
Connectivity vs. Reachability
Inf. Comput., April, 1991

Lower Bounds for Randomized k-Server and Motion Planning Algorithms
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Competitive Algorithms for Layered Graph Traversal
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
New Results on Server Problems.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

A Competitive 3-Server Algorithm.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

Algebraic Methods for Interactive Proof Systems
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
The Iterated Mod Problem
Inf. Comput., March, 1989

An NC Algorithm for Brooks' Theorem.
Theor. Comput. Sci., 1989

A lower bound on the size of universal sets for planar graphs.
SIGACT News, 1989

How Long can a Euclidean Traveling Salesman Tour Be?
SIAM J. Discrete Math., 1989

Fast Geometric Approximation Techniques and Geometric Embedding Problems.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988
Universal Traversal Sequences of Length n^O(log n) for Cliques.
Inf. Process. Lett., 1988

Randomized Algorithms and Pseudorandom Numbers
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1987
Efficient Parallel Algorithms for Edge Coloring Problems.
J. Algorithms, 1987

Coloring Planar Graphs in Parallel.
J. Algorithms, 1987

1986
A Las Vegas RNC algorithm for maximum matching.
Combinatorica, 1986


  Loading...