Howard J. Karloff

ORCID

Publication Activity (10 Years)

Years Active: 1986-2020
Publications (10 Years): 4

Top Venues

Publications

David S. Johnson, Lee Breslau, Ilias Diakonikolas, Nick Duffield, Yu Gu, MohammadTaghi Hajiaghayi, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen
Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs. Oper. Res. 68 (3) (2020)
Dean P. Foster, Satyen Kale, Howard J. Karloff
Online Sparse Linear Regression. COLT (2016)
David S. Johnson, Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu, MohammadTaghi Hajiaghayi, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen
Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs. CoRR (2016)
Dean P. Foster, Satyen Kale, Howard J. Karloff
Online Sparse Linear Regression. CoRR (2016)
Howard J. Karloff, Ramesh Subbaraman
Designing wireless metropolitan-area networks using mathematical optimization. WTS (2015)
Dean P. Foster, Howard J. Karloff, Justin Thaler
Variable Selection is Hard. COLT (2015)
Lukasz Golab, Marios Hadjieleftheriou, Howard J. Karloff, Barna Saha
Distributed data placement to minimize communication costs via graph partitioning. SSDBM (2014)
Gruia Calinescu, Howard J. Karloff
Sequential dependency computation via geometric data structures. Comput. Geom. 47 (2) (2014)
Carlos Eduardo de Andrade, Mauricio G. C. Resende, Howard J. Karloff, Flávio Keidi Miyazawa
Evolutionary algorithms for overlapping correlation clustering. GECCO (2014)
Dean P. Foster, Howard J. Karloff, Justin Thaler
Variable Selection is Hard. CoRR (2014)
Lukasz Golab, Howard J. Karloff, Flip Korn, Barna Saha, Divesh Srivastava
Discovering Conservation Rules. IEEE Trans. Knowl. Data Eng. 26 (6) (2014)
Richard Cole, Howard J. Karloff
Fast Algorithms for Constructing Maximum Entropy Summary Trees. ICALP (1) (2014)
Richard Cole, Howard J. Karloff
Fast Algorithms for Constructing Maximum Entropy Summary Trees. CoRR (2014)
Lukasz Golab, Marios Hadjieleftheriou, Howard J. Karloff, Barna Saha
Distributed Data Placement via Graph Partitioning. CoRR (2013)
Howard J. Karloff, Kenneth E. Shirley
Maximum Entropy Summary Trees. Comput. Graph. Forum 32 (3) (2013)
Lukasz Golab, Howard J. Karloff, Flip Korn, Barna Saha, Divesh Srivastava
Discovering Conservation Rules. ICDE (2012)
Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu, Mohammad Taghi Hajiaghayi, David S. Johnson, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen
Disjoint-Path Facility Location: Theory and Practice. ALENEX (2011)
Howard J. Karloff, Flip Korn, Konstantin Makarychev, Yuval Rabani
On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data CoRR (2011)
Aaron Archer, MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Howard J. Karloff
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP. SIAM J. Comput. 40 (2) (2011)
MohammadHossein Bateni, Lukasz Golab, MohammadTaghi Hajiaghayi, Howard J. Karloff
Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses. Theory Comput. Syst. 49 (4) (2011)
Gruia Calinescu, Howard J. Karloff
Sequential Dependency Computation via Geometric Data Structures. CCCG (2011)
Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani
An improved approximation algorithm for resource allocation. ACM Trans. Algorithms 7 (4) (2011)
Matthew Andrews, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Ankur Moitra
Capacitated Metric Labeling. SODA (2011)
Howard J. Karloff, Flip Korn, Konstantin Makarychev, Yuval Rabani
On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data. STACS (2011)
Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff
Improved Approximation Algorithms for Label Cover Problems. Algorithmica 61 (1) (2011)
Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao
Spreading Metrics for Vertex Ordering Problems. Algorithmica 56 (4) (2010)
Graham Cormode, Howard J. Karloff, Anthony Wirth
Set cover algorithms for very large datasets. CIKM (2010)
Howard J. Karloff, Siddharth Suri, Sergei Vassilvitskii
A Model of Computation for MapReduce. SODA (2010)
Lukasz Golab, Howard J. Karloff, Flip Korn, Divesh Srivastava
Data Auditor: Exploring Data Quality and Semantics using Pattern Tableaux. Proc. VLDB Endow. 3 (2) (2010)
Lukasz Golab, Howard J. Karloff, Flip Korn, Avishek Saha, Divesh Srivastava
Sequential Dependencies. Proc. VLDB Endow. 2 (1) (2009)
Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff
Improved Approximation Algorithms for Label Cover Problems. ESA (2009)
MohammadHossein Bateni, Lukasz Golab, Mohammad Taghi Hajiaghayi, Howard J. Karloff
Scheduling to minimize staleness and stretch in real-time data warehouses. SPAA (2009)
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani
On Earthmover Distance, Metric Labeling, and 0-Extension. SIAM J. Comput. 39 (2) (2009)
Aaron Archer, MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Howard J. Karloff
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP. FOCS (2009)
Moses Charikar, Howard J. Karloff, Claire Mathieu, Joseph Naor, Michael E. Saks
Online multicast with egalitarian cost sharing. SPAA (2008)
Lukasz Golab, Howard J. Karloff, Flip Korn, Divesh Srivastava, Bei Yu
On generating near-optimal tableaux for conditional functional dependencies. Proc. VLDB Endow. 1 (1) (2008)
Joseph Cheriyan, Howard J. Karloff, Rohit Khandekar, Jochen Könemann
On the integrality ratio for tree augmentation. Oper. Res. Lett. 36 (4) (2008)
Radu Berinde, Anna C. Gilbert, Piotr Indyk, Howard J. Karloff, Martin J. Strauss
Combining geometry and combinatorics: A unified approach to sparse signal recovery. Allerton (2008)
Radu Berinde, Anna C. Gilbert, Piotr Indyk, Howard J. Karloff, Martin J. Strauss
Combining geometry and combinatorics: A unified approach to sparse signal recovery CoRR (2008)
David L. Applegate, Gruia Calinescu, David S. Johnson, Howard J. Karloff, Katrina Ligett, Jia Wang
Compressing rectilinear pictures and minimizing access control lists. SODA (2007)
Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan
Lower bounds for linear locally decodable codes and private information retrieval. Comput. Complex. 15 (3) (2006)
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani
On earthmover distance, metric labeling, and 0-extension. STOC (2006)
Moses Charikar, Michel X. Goemans, Howard J. Karloff
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem. Math. Oper. Res. 31 (2) (2006)
Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao
spreading metrics for vertex ordering problems. SODA (2006)
Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi
Caching with Expiration Times for Internet Applications. Internet Math. 2 (2) (2005)
Gruia Calinescu, Adrian Dumitrescu, Howard J. Karloff, Peng-Jun Wan
Separating Points by Axis-parallel Lines. Int. J. Comput. Geom. Appl. 15 (6) (2005)
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani
On earthmover distance, metric labeling, and 0-extension Electron. Colloquium Comput. Complex. (064) (2005)
Joseph Cheriyan, Howard J. Karloff, Yuval Rabani
Approximating Directed Multicuts. Comb. 25 (3) (2005)
Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup
OPT Versus LOAD in Dynamic Storage Allocation. SIAM J. Comput. 33 (3) (2004)
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
Approximation Algorithms for the 0-Extension Problem. SIAM J. Comput. 34 (2) (2004)
Moses Charikar, Michel X. Goemans, Howard J. Karloff
On the Integrality Ratio for Asymmetric TSP. FOCS (2004)
Howard J. Karloff
On the convergence time of a path-vector protocol. SODA (2004)
Gruia Calinescu, Cristina G. Fernandes, Howard J. Karloff, Alexander Zelikovsky
A New Approximation Algorithm for Finding Heavy Planar Subgraphs. Algorithmica 36 (2) (2003)
Anna C. Gilbert, Howard J. Karloff
On the fractal behavior of TCP. STOC (2003)
Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup
OPT versus LOAD in dynamic storage allocation. STOC (2003)
Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani
Improved Approximation Algorithms for Resource Allocation. IPCO (2002)
Richard J. Anderson, Sampath Kannan, Howard J. Karloff, Richard E. Ladner
Thresholds and optimal binary comparison search trees. J. Algorithms 44 (2) (2002)
Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval. Computational Complexity Conference (2002)
Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi
Caching with expiration times. SODA (2002)
Joseph Cheriyan, Howard J. Karloff, Yuval Rabani
Approximating Directed Multicuts. FOCS (2001)
Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval Electron. Colloquium Comput. Complex. (080) (2001)
Richard J. Anderson, Sampath Kannan, Howard J. Karloff, Richard E. Ladner
Thresholds and Optimal Binary Comparison Search Trees. FSTTCS (2001)
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
Approximation algorithms for the 0-extension problem. SODA (2001)
Ari Freund, Howard J. Karloff
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. 75 (1-2) (2000)
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
An Improved Approximation Algorithm for MULTIWAY CUT. J. Comput. Syst. Sci. 60 (3) (2000)
Howard J. Karloff
Foreword. J. Algorithms 37 (1) (2000)
Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks
A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems. SIAM J. Comput. 30 (5) (2000)
Barun Chandra, Howard J. Karloff, Craig A. Tovey
New Results on the Old k-opt Algorithm for the Traveling Salesman Problem. SIAM J. Comput. 28 (6) (1999)
Howard J. Karloff, Milena Mihail
On the Complexity of the View-Selection Problem. PODS (1999)
Howard J. Karloff
How Good is the Goemans-Williamson MAX CUT Algorithm? SIAM J. Comput. 29 (1) (1999)
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
An Improved Approximation Algorithm for Multiway Cut. STOC (1998)
Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan
Competitive Algorithms for Layered Graph Traversal. SIAM J. Comput. 28 (2) (1998)
Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff
A Better Approximation Algorithm for Finding Planar Subgraphs. J. Algorithms 27 (2) (1998)
Howard J. Karloff, Yishay Mansour
-Wise Independent Random Variables. Comb. 17 (1) (1997)
Howard J. Karloff, Uri Zwick
A 7/8-Approximation Algorithm for MAX 3SAT? FOCS (1997)
Howard J. Karloff
How Good is the Goemans-Williamson MAX CUT Algorithm? STOC (1996)
Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff
A Better Approximation Algorithm for Finding Planar Subgraphs. SODA (1996)
Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks
Randomized Robot Navigation Algorithms. SODA (1996)
Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra
New Algorithms for an Ancient Scheduling Problem. J. Comput. Syst. Sci. 51 (3) (1995)
Howard J. Karloff, Yuval Rabani, Yiftach Ravid
Lower Bounds for Randomized k-Server and Motion-Planning Algorithms. SIAM J. Comput. 23 (2) (1994)
Yair Bartal, Howard J. Karloff, Yuval Rabani
A Better Lower Bound for On-Line Scheduling. Inf. Process. Lett. 50 (3) (1994)
Barun Chandra, Howard J. Karloff, Craig A. Tovey
New Results on the Old k-Opt Algorithm for the TSP. SODA (1994)
Howard J. Karloff, Prabhakar Raghavan
Randomized Algorithms and Pseudorandom Numbers. J. ACM 40 (3) (1993)
Howard J. Karloff
Fast Algorithms for Approximately Counting Mismatches. Inf. Process. Lett. 48 (2) (1993)
Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan
Algebraic Methods for Interactive Proof Systems. J. ACM 39 (4) (1992)
Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra
New Algorithms for an Ancient Scheduling Problem STOC (1992)
Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber
Fast Geometric Approximation Techniques and Geometric Embedding Problems. Theor. Comput. Sci. 106 (2) (1992)
Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks
A Decomposition Theorem and Bounds for Randomized Server Problems FOCS (1992)
Marek Chrobak, Howard J. Karloff, Tomasz Radzik
Connectivity vs. Reachability Inf. Comput. 91 (2) (1991)
Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan
Competitive Algorithms for Layered Graph Traversal FOCS (1991)
Howard J. Karloff, Yuval Rabani, Yiftach Ravid
Lower Bounds for Randomized k-Server and Motion Planning Algorithms STOC (1991)
Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan
New Results on Server Problems. SIAM J. Discret. Math. 4 (2) (1991)
Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan
New Results on Server Problems. SODA (1990)
Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan
Algebraic Methods for Interactive Proof Systems FOCS (1990)
Piotr Berman, Howard J. Karloff, Gábor Tardos
A Competitive 3-Server Algorithm. SODA (1990)
Howard J. Karloff
An NC Algorithm for Brooks' Theorem. Theor. Comput. Sci. 68 (1) (1989)
Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber
Fast Geometric Approximation Techniques and Geometric Embedding Problems. SCG (1989)
Marek Chrobak, Howard J. Karloff
A lower bound on the size of universal sets for planar graphs. SIGACT News 20 (4) (1989)
Howard J. Karloff
How Long can a Euclidean Traveling Salesman Tour Be? SIAM J. Discret. Math. 2 (1) (1989)
Howard J. Karloff, Walter L. Ruzzo
The Iterated Mod Problem Inf. Comput. 80 (3) (1989)

Howard J. Karloff.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Howard J. Karloff