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