This link is not broken, just under construction.


Contact Information:

webmaster@cc.gatech.edu
College of Computing
Georgia Institute of Technology
Atlanta, GA 30332-0280

Publications:

Sequential Dependencies
Lukasz Golab, Howard Karloff, Philip Korn, Divesh Srivastava, Avishek Saha
2009.  [PDF]  [BIB]

Improved Approximation Algorithms For Label Cover Problems
Howard Karloff, MohammadTaghi Hajiaghayi, Moses Charikar
2009.  [PDF]  [BIB]

Data Auditor: Analyzing Data Quality using Pattern Tableaux
Lukasz Golab, Howard Karloff, Philip Korn, Divesh Srivastava
2009.  [PDF]  [BIB]

l_2^2 Spreading Metrics for Vertex Ordering Problems
Howard Karloff, MohammadTaghi Hajiaghayi, Moses Charikar, Satish Rao
2008.  [PS]  [BIB]

On Generating Near-Optimal Tableaux for Conditional Functional Dependencies
Lukasz Golab, Howard Karloff, Philip Korn, Divesh Srivastava, Bei Yu
2008.  [PDF]  [BIB]

A Technique for Improving Approximation Algorithms for Prize-Collecting Problems
Aaron Archer, Howard Karloff, Mohammad Hajiaghayi, MohammadHossein Bateni
2008.  [PDF]  [BIB]

On Multicast Cost Sharing and Nash Equilibria
Howard Karloff, Moses Charikar, Claire Mathieu, Seffi Naor, Michael Saks
2007.  [PS]  [BIB]

On Linear-Time Comparison-Based Algorithms for Edit Distance
Howard Karloff, Rafail Ostrovsky, Yuval Rabani
2007.  [PS]  [BIB]

On the Integrality Ratio for Asymmetric TSP
Howard Karloff, Moses Charikar, Goemans Michel
2006.  [DOC]  [BIB]

http://www.research.att.com/resources/att/images/plus.gif

IEEE Copyright

Copyright (1992-2009) IEEE. The IEEE owns the copyright to material that is published by the IEEE. Personal use of this material is permitted. However, permission to reprint / republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Please read the full IEEE copyright policy.

On Earthmover Distance, Metric Labeling, and 0-Extension
Howard Karloff, Subhash Khot, Subhash Mehta, Yuval Rabani
2006.  [BIB]

Compressing Rectilinear Pictures and Minimizing Access Control LIsts
David Johnson, Howard Karloff, David Applegate, Jia Wang, Katrina Ligett, Gruia Calinescu
2006.  [PDF]  [BIB]

l_2^2 Spreading Metrics for Vertex Ordering Problems
Howard Karloff, Moses Charikar, Satish Rao
2005.  [FDF]  [BIB]

Caching With Expiration Times for Internet Applications
Howard Karloff, Milena Miihail, Nisheeth Vishnoi, Parikshit Gopalan, Aranyak Mehta
2005.  [BIB]

On the convergence time of a path-vector protocol
Howard Karloff, Timothy Griffin
2003.  [PS]  [BIB]

OPT versus LOAD in dynamic storage allocation
Adam Buchsbaum, Howard Karloff, Nicholas Reingold, Mikkel Thorup, Claire Kenyon
2003.  [PS]  [BIB]

New approximation algorithm for finding heavy planar sugraphs, A
Howard Karloff, Gruia Calinescu, Cristina Fernandes, Alex Zelikovsky
2003.  [PS]  [BIB]

http://www.research.att.com/resources/att/images/plus.gif

Springer-Verlag Copyright

The original publication is available at http://www.springerlink.com

New approximation algorithm for finding heavy planar subgraphs
Howard Karloff, Gruia Calinescu, Cristian Fernandes, Alexander Zelikovsky
2003.  [BIB]

On the fractal behavior of TCP
Anna Gilbert, Howard Karloff
2002.  [PS]  [BIB]

http://www.research.att.com/resources/att/images/plus.gif

ACM Copyright

ACM, (1994-2009). This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Digital Library http://doi.acm.org.

Lower bounds for linear locally decodable codes and PIR
Howard Karloff, Leonard Schulman, Oded Goldreich, Luca Trevisan
2001.  [BIB]

Improved approximation algorithms for RESOURCE ALLOCATION
Howard Karloff, Yuval Rabani, Gruia Calinescu, Amit Chakrabarti
2001.  [BIB]

http://www.research.att.com/resources/att/images/plus.gif

Springer-Verlag Copyright

The original publication is available at http://www.springerlink.com

Approximating directed multicuts
Howard Karloff, Joseph Cheriyan, Yuval Rabani
2001.  [PS]  [BIB]

http://www.research.att.com/resources/att/images/plus.gif

Bolyai Society- Springer Verlag Copyright

The original publication is available at http://www.springerlink.com

Thresholds and optimal binary comparison search trees
Howard Karloff, Sampath Kannan, Richard Anderson, Richard Ladner
2000.  [BIB]

Approximation algorithms for the 0-Extension problem
Howard Karloff, Gruia Calinescu, Yuval Rabani
2000.  [BIB]

 
PCST paper
Last Modified: Nov. 26, 1997