 | 2012 |
| 90 |  | Howard J. Karloff,
Toniann Pitassi:
Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012
ACM 2012 |
| 2011 |
| 89 |  | 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: 60-74 |
| 88 |  | Gruia Calinescu,
Howard J. Karloff:
Sequential Dependency Computation via Geometric Data Structures.
CCCG 2011 |
| 87 |  | Matthew Andrews,
Mohammad Taghi Hajiaghayi,
Howard J. Karloff,
Ankur Moitra:
Capacitated Metric Labeling.
SODA 2011: 976-995 |
| 86 |  | Howard J. Karloff,
Flip Korn,
Konstantin Makarychev,
Yuval Rabani:
On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data.
STACS 2011: 332-343 |
| 85 |  | Gruia Calinescu,
Amit Chakrabarti,
Howard J. Karloff,
Yuval Rabani:
An improved approximation algorithm for resource allocation.
ACM Transactions on Algorithms 7(4): 48 (2011) |
| 84 |  | Moses Charikar,
MohammadTaghi Hajiaghayi,
Howard J. Karloff:
Improved Approximation Algorithms for Label Cover Problems.
Algorithmica 61(1): 190-206 (2011) |
| 83 |  | Howard J. Karloff,
Flip Korn,
Konstantin Makarychev,
Yuval Rabani:
On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data
CoRR abs/1101.1941: (2011) |
| 82 |  | Aaron Archer,
MohammadHossein Bateni,
MohammadTaghi Hajiaghayi,
Howard J. Karloff:
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP.
SIAM J. Comput. 40(2): 309-332 (2011) |
| 81 |  | 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): 757-780 (2011) |
| 2010 |
| 80 |  | Graham Cormode,
Howard J. Karloff,
Anthony Wirth:
Set cover algorithms for very large datasets.
CIKM 2010: 479-488 |
| 79 |  | Howard J. Karloff,
Siddharth Suri,
Sergei Vassilvitskii:
A Model of Computation for MapReduce.
SODA 2010: 938-948 |
| 78 |  | Moses Charikar,
Mohammad Taghi Hajiaghayi,
Howard J. Karloff,
Satish Rao:
l22 Spreading Metrics for Vertex Ordering Problems.
Algorithmica 56(4): 577-604 (2010) |
| 77 |  | Lukasz Golab,
Howard J. Karloff,
Flip Korn,
Divesh Srivastava:
Data Auditor: Exploring Data Quality and Semantics using Pattern Tableaux.
PVLDB 3(2): 1641-1644 (2010) |
| 2009 |
| 76 |  | Moses Charikar,
MohammadTaghi Hajiaghayi,
Howard J. Karloff:
Improved Approximation Algorithms for Label Cover Problems.
ESA 2009: 23-34 |
| 75 |  | Aaron Archer,
MohammadHossein Bateni,
Mohammad Taghi Hajiaghayi,
Howard J. Karloff:
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP.
FOCS 2009: 427-436 |
| 74 |  | MohammadHossein Bateni,
Lukasz Golab,
Mohammad Taghi Hajiaghayi,
Howard J. Karloff:
Scheduling to minimize staleness and stretch in real-time data warehouses.
SPAA 2009: 29-38 |
| 73 |  | Lukasz Golab,
Howard J. Karloff,
Flip Korn,
Avishek Saha,
Divesh Srivastava:
Sequential Dependencies.
PVLDB 2(1): 574-585 (2009) |
| 72 |  | Howard J. Karloff,
Subhash Khot,
Aranyak Mehta,
Yuval Rabani:
On Earthmover Distance, Metric Labeling, and 0-Extension.
SIAM J. Comput. 39(2): 371-387 (2009) |
| 2008 |
| 71 |  | Moses Charikar,
Howard J. Karloff,
Claire Mathieu,
Joseph Naor,
Michael E. Saks:
Online multicast with egalitarian cost sharing.
SPAA 2008: 70-76 |
| 70 |  | 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 abs/0804.4666: (2008) |
| 69 |  | Joseph Cheriyan,
Howard J. Karloff,
Rohit Khandekar,
Jochen Könemann:
On the integrality ratio for tree augmentation.
Oper. Res. Lett. 36(4): 399-401 (2008) |
| 68 |  | Lukasz Golab,
Howard J. Karloff,
Flip Korn,
Divesh Srivastava,
Bei Yu:
On generating near-optimal tableaux for conditional functional dependencies.
PVLDB 1(1): 376-390 (2008) |
| 2007 |
| 67 |  | David Applegate,
Gruia Calinescu,
David S. Johnson,
Howard J. Karloff,
Katrina Ligett,
Jia Wang:
Compressing rectilinear pictures and minimizing access control lists.
SODA 2007: 1066-1075 |
| 2006 |
| 66 |  | Moses Charikar,
Mohammad Taghi Hajiaghayi,
Howard J. Karloff,
Satish Rao:
l22 spreading metrics for vertex ordering problems.
SODA 2006: 1018-1027 |
| 65 |  | Howard J. Karloff,
Subhash Khot,
Aranyak Mehta,
Yuval Rabani:
On earthmover distance, metric labeling, and 0-extension.
STOC 2006: 547-556 |
| 64 |  | Oded Goldreich,
Howard J. Karloff,
Leonard J. Schulman,
Luca Trevisan:
Lower bounds for linear locally decodable codes and private information retrieval.
Computational Complexity 15(3): 263-296 (2006) |
| 63 |  | Moses Charikar,
Michel X. Goemans,
Howard J. Karloff:
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem.
Math. Oper. Res. 31(2): 245-252 (2006) |
| 2005 |
| 62 |  | Joseph Cheriyan,
Howard J. Karloff,
Yuval Rabani:
Approximating Directed Multicuts.
Combinatorica 25(3): 251-269 (2005) |
| 61 |  | Howard J. Karloff,
Subhash Khot,
Aranyak Mehta,
Yuval Rabani:
On earthmover distance, metric labeling, and 0-extension
Electronic Colloquium on Computational Complexity (ECCC)(064): (2005) |
| 60 |  | Gruia Calinescu,
Adrian Dumitrescu,
Howard J. Karloff,
Peng-Jun Wan:
Separating Points by Axis-parallel Lines.
Int. J. Comput. Geometry Appl. 15(6): 575-590 (2005) |
| 59 |  | Parikshit Gopalan,
Howard J. Karloff,
Aranyak Mehta,
Milena Mihail,
Nisheeth K. Vishnoi:
Caching with Expiration Times for Internet Applications.
Internet Mathematics 2(2): 165-184 (2005) |
| 2004 |
| 58 |  | Moses Charikar,
Michel X. Goemans,
Howard J. Karloff:
On the Integrality Ratio for Asymmetric TSP.
FOCS 2004: 101-107 |
| 57 |  | Howard J. Karloff:
On the convergence time of a path-vector protocol.
SODA 2004: 605-614 |
| 56 |  | Adam L. Buchsbaum,
Howard J. Karloff,
Claire Kenyon,
Nick Reingold,
Mikkel Thorup:
OPT Versus LOAD in Dynamic Storage Allocation.
SIAM J. Comput. 33(3): 632-646 (2004) |
| 55 |  | Gruia Calinescu,
Howard J. Karloff,
Yuval Rabani:
Approximation Algorithms for the 0-Extension Problem.
SIAM J. Comput. 34(2): 358-372 (2004) |
| 2003 |
| 54 |  | Anna C. Gilbert,
Howard J. Karloff:
On the fractal behavior of TCP.
STOC 2003: 297-306 |
| 53 |  | Adam L. Buchsbaum,
Howard J. Karloff,
Claire Kenyon,
Nick Reingold,
Mikkel Thorup:
OPT versus LOAD in dynamic storage allocation.
STOC 2003: 556-564 |
| 52 |  | Gruia Calinescu,
Cristina G. Fernandes,
Howard J. Karloff,
Alexander Zelikovsky:
A New Approximation Algorithm for Finding Heavy Planar Subgraphs.
Algorithmica 36(2): 179-205 (2003) |
| 2002 |
| 51 |  | Oded Goldreich,
Howard J. Karloff,
Leonard J. Schulman,
Luca Trevisan:
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval.
IEEE Conference on Computational Complexity 2002: 175-183 |
| 50 |  | Gruia Calinescu,
Amit Chakrabarti,
Howard J. Karloff,
Yuval Rabani:
Improved Approximation Algorithms for Resource Allocation.
IPCO 2002: 401-414 |
| 49 |  | Parikshit Gopalan,
Howard J. Karloff,
Aranyak Mehta,
Milena Mihail,
Nisheeth K. Vishnoi:
Caching with expiration times.
SODA 2002: 540-547 |
| 48 |  | Richard J. Anderson,
Sampath Kannan,
Howard J. Karloff,
Richard E. Ladner:
Thresholds and optimal binary comparison search trees.
J. Algorithms 44(2): 338-358 (2002) |
| 2001 |
| 47 |  | Joseph Cheriyan,
Howard J. Karloff,
Yuval Rabani:
Approximating Directed Multicuts.
FOCS 2001: 320-328 |
| 46 |  | Richard J. Anderson,
Sampath Kannan,
Howard J. Karloff,
Richard E. Ladner:
Thresholds and Optimal Binary Comparison Search Trees.
FSTTCS 2001: 83-95 |
| 45 |  | Gruia Calinescu,
Howard J. Karloff,
Yuval Rabani:
Approximation algorithms for the 0-extension problem.
SODA 2001: 8-16 |
| 44 |  | Oded Goldreich,
Howard J. Karloff,
Leonard J. Schulman,
Luca Trevisan:
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval
Electronic Colloquium on Computational Complexity (ECCC)(080): (2001) |
| 2000 |
| 43 |  | 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): 43-50 (2000) |
| 42 |  | Howard J. Karloff:
Foreword.
J. Algorithms 37(1): 1 (2000) |
| 41 |  | Gruia Calinescu,
Howard J. Karloff,
Yuval Rabani:
An Improved Approximation Algorithm for MULTIWAY CUT.
J. Comput. Syst. Sci. 60(3): 564-574 (2000) |
| 40 |  | 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): 1624-1661 (2000) |
| 1999 |
| 39 |  | Howard J. Karloff,
Milena Mihail:
On the Complexity of the View-Selection Problem.
PODS 1999: 167-173 |
| 38 |  | 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): 1998-2029 (1999) |
| 37 |  | Howard J. Karloff:
How Good is the Goemans-Williamson MAX CUT Algorithm?
SIAM J. Comput. 29(1): 336-350 (1999) |
| 1998 |
| 36 |  | Howard J. Karloff:
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 25-27 January 1998, San Francisco, California.
ACM/SIAM 1998 |
| 35 |  | Gruia Calinescu,
Howard J. Karloff,
Yuval Rabani:
An Improved Approximation Algorithm for Multiway Cut.
STOC 1998: 48-52 |
| 34 |  | Gruia Calinescu,
Cristina G. Fernandes,
Ulrich Finkler,
Howard J. Karloff:
A Better Approximation Algorithm for Finding Planar Subgraphs.
J. Algorithms 27(2): 269-302 (1998) |
| 33 |  | 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): 447-462 (1998) |
| 1997 |
| 32 |  | Howard J. Karloff,
Uri Zwick:
A 7/8-Approximation Algorithm for MAX 3SAT?
FOCS 1997: 406-415 |
| 31 |  | Howard J. Karloff,
Yishay Mansour:
On Construction of k-Wise Independent Random Variables.
Combinatorica 17(1): 91-107 (1997) |
| 1996 |
| 30 |  | Gruia Calinescu,
Cristina G. Fernandes,
Ulrich Finkler,
Howard J. Karloff:
A Better Approximation Algorithm for Finding Planar Subgraphs.
SODA 1996: 16-25 |
| 29 |  | Piotr Berman,
Avrim Blum,
Amos Fiat,
Howard J. Karloff,
Adi Rosén,
Michael E. Saks:
Randomized Robot Navigation Algorithms.
SODA 1996: 75-84 |
| 28 |  | Howard J. Karloff:
How Good is the Goemans-Williamson MAX CUT Algorithm?
STOC 1996: 427-434 |
| 1995 |
| 27 |  | Yair Bartal,
Amos Fiat,
Howard J. Karloff,
Rakesh Vohra:
New Algorithms for an Ancient Scheduling Problem.
J. Comput. Syst. Sci. 51(3): 359-366 (1995) |
| 1994 |
| 26 |  | Barun Chandra,
Howard J. Karloff,
Craig A. Tovey:
New Results on the Old k-Opt Algorithm for the TSP.
SODA 1994: 150-159 |
| 25 |  | Yair Bartal,
Howard J. Karloff,
Yuval Rabani:
A Better Lower Bound for On-Line Scheduling.
Inf. Process. Lett. 50(3): 113-116 (1994) |
| 24 |  | Howard J. Karloff,
Yuval Rabani,
Yiftach Ravid:
Lower Bounds for Randomized k-Server and Motion-Planning Algorithms.
SIAM J. Comput. 23(2): 293-312 (1994) |
| 1993 |
| 23 |  | Howard J. Karloff:
Fast Algorithms for Approximately Counting Mismatches.
Inf. Process. Lett. 48(2): 53-60 (1993) |
| 22 |  | Howard J. Karloff,
Prabhakar Raghavan:
Randomized Algorithms and Pseudorandom Numbers.
J. ACM 40(3): 454-476 (1993) |
| 1992 |
| 21 |  | Avrim Blum,
Howard J. Karloff,
Yuval Rabani,
Michael E. Saks:
A Decomposition Theorem and Bounds for Randomized Server Problems
FOCS 1992: 197-207 |
| 20 |  | Yair Bartal,
Amos Fiat,
Howard J. Karloff,
Rakesh Vohra:
New Algorithms for an Ancient Scheduling Problem
STOC 1992: 51-58 |
| 19 |  | Carsten Lund,
Lance Fortnow,
Howard J. Karloff,
Noam Nisan:
Algebraic Methods for Interactive Proof Systems.
J. ACM 39(4): 859-868 (1992) |
| 18 |  | Marshall W. Bern,
Howard J. Karloff,
Prabhakar Raghavan,
Baruch Schieber:
Fast Geometric Approximation Techniques and Geometric Embedding Problems.
Theor. Comput. Sci. 106(2): 265-281 (1992) |
| 1991 |
| 17 |  | Amos Fiat,
Dean P. Foster,
Howard J. Karloff,
Yuval Rabani,
Yiftach Ravid,
Sundar Vishwanathan:
Competitive Algorithms for Layered Graph Traversal
FOCS 1991: 288-297 |
| 16 |  | Howard J. Karloff,
Yuval Rabani,
Yiftach Ravid:
Lower Bounds for Randomized k-Server and Motion Planning Algorithms
STOC 1991: 278-288 |
| 15 |  | Marek Chrobak,
Howard J. Karloff,
Tomasz Radzik:
Connectivity vs. Reachability
Inf. Comput. 91(2): 177-188 (1991) |
| 14 |  | Marek Chrobak,
Howard J. Karloff,
T. H. Payne,
Sundar Vishwanathan:
New Results on Server Problems.
SIAM J. Discrete Math. 4(2): 172-181 (1991) |
| 1990 |
| 13 |  | Carsten Lund,
Lance Fortnow,
Howard J. Karloff,
Noam Nisan:
Algebraic Methods for Interactive Proof Systems
FOCS 1990: 2-10 |
| 12 |  | Piotr Berman,
Howard J. Karloff,
Gábor Tardos:
A Competitive 3-Server Algorithm.
SODA 1990: 280-290 |
| 11 |  | Marek Chrobak,
Howard J. Karloff,
T. H. Payne,
Sundar Vishwanathan:
title=New Results on Server Problems.
SODA 1990: 291-300 |
| 1989 |
| 10 |  | Marshall W. Bern,
Howard J. Karloff,
Prabhakar Raghavan,
Baruch Schieber:
Fast Geometric Approximation Techniques and Geometric Embedding Problems.
Symposium on Computational Geometry 1989: 292-301 |
| 9 |  | Howard J. Karloff,
Walter L. Ruzzo:
The Iterated Mod Problem
Inf. Comput. 80(3): 193-204 (1989) |
| 8 |  | Howard J. Karloff:
How Long can a Euclidean Traveling Salesman Tour Be?
SIAM J. Discrete Math. 2(1): 91-99 (1989) |
| 7 |  | Marek Chrobak,
Howard J. Karloff:
A lower bound on the size of universal sets for planar graphs.
SIGACT News 20(4): 83-86 (1989) |
| 6 |  | Howard J. Karloff:
An NC Algorithm for Brooks' Theorem.
Theor. Comput. Sci. 68(1): 89-103 (1989) |
| 1988 |
| 5 |  | Howard J. Karloff,
Prabhakar Raghavan:
Randomized Algorithms and Pseudorandom Numbers
STOC 1988: 310-321 |
| 4 |  | Howard J. Karloff,
Ramamohan Paturi,
Janos Simon:
Universal Traversal Sequences of Length n^O(log n) for Cliques.
Inf. Process. Lett. 28(5): 241-243 (1988) |
| 1987 |
| 3 |  | Howard J. Karloff,
David B. Shmoys:
Efficient Parallel Algorithms for Edge Coloring Problems.
J. Algorithms 8(1): 39-52 (1987) |
| 2 |  | Joan Boyar,
Howard J. Karloff:
Coloring Planar Graphs in Parallel.
J. Algorithms 8(4): 470-479 (1987) |
| 1986 |
| 1 |  | Howard J. Karloff:
A Las Vegas RNC algorithm for maximum matching.
Combinatorica 6(4): 387-391 (1986) |