| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Howard J. Karloff, Toniann Pitassi (eds.) |
Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012  |
STOC  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff |
Improved Approximation Algorithms for Label Cover Problems.  |
Algorithmica  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani |
An improved approximation algorithm for resource allocation.  |
ACM Transactions on Algorithms  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff, Flip Korn, Konstantin Makarychev, Yuval Rabani |
On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | MohammadHossein Bateni, Lukasz Golab, MohammadTaghi Hajiaghayi, Howard J. Karloff |
Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses.  |
Theory Comput. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Archer, MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Howard J. Karloff |
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP.  |
SIAM J. Comput.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Andrews, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Ankur Moitra |
Capacitated Metric Labeling.  |
SODA  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Lee Breslau, Ilias Diakonikolas, Nick G. Duffield, Yu Gu 0004, Mohammad Taghi Hajiaghayi, David S. Johnson, Howard J. Karloff, Mauricio G. C. Resende, Subhabrata Sen |
Disjoint-Path Facility Location: Theory and Practice.  |
ALENEX  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Gruia Calinescu, Howard J. Karloff |
Sequential Dependency Computation via Geometric Data Structures.  |
CCCG  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Howard J. Karloff, Flip Korn, Konstantin Makarychev, Yuval Rabani |
On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data.  |
STACS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao |
l22 Spreading Metrics for Vertex Ordering Problems.  |
Algorithmica  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukasz Golab, Howard J. Karloff, Flip Korn, Divesh Srivastava |
Data Auditor: Exploring Data Quality and Semantics using Pattern Tableaux.  |
PVLDB  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Howard J. Karloff, Siddharth Suri, Sergei Vassilvitskii |
A Model of Computation for MapReduce.  |
SODA  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Graham Cormode, Howard J. Karloff, Anthony Wirth |
Set cover algorithms for very large datasets.  |
CIKM  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukasz Golab, Howard J. Karloff, Flip Korn, Avishek Saha, Divesh Srivastava |
Sequential Dependencies.  |
PVLDB  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani |
On Earthmover Distance, Metric Labeling, and 0-Extension.  |
SIAM J. Comput.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff |
Improved Approximation Algorithms for Label Cover Problems.  |
ESA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | MohammadHossein Bateni, Lukasz Golab, Mohammad Taghi Hajiaghayi, Howard J. Karloff |
Scheduling to minimize staleness and stretch in real-time data warehouses.  |
SPAA  |
2009 |
DBLP DOI BibTeX RDF |
data warehouse maintenance, competitive analysis, on-line scheduling |
| 1 | Aaron Archer, MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Howard J. Karloff |
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP.  |
FOCS  |
2009 |
DBLP DOI BibTeX RDF |
prize-collecting, stroll, path-TSP, approximation algorithm, traveling salesman problem, Steiner tree |
| 1 | Joseph Cheriyan, Howard J. Karloff, Rohit Khandekar, Jochen Könemann |
On the integrality ratio for tree augmentation.  |
Oper. Res. Lett.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Lukasz Golab, Howard J. Karloff, Flip Korn, Divesh Srivastava, Bei Yu |
On generating near-optimal tableaux for conditional functional dependencies.  |
PVLDB  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Moses Charikar, Howard J. Karloff, Claire Mathieu, Joseph Naor, Michael E. Saks |
Online multicast with egalitarian cost sharing.  |
SPAA  |
2008 |
DBLP DOI BibTeX RDF |
best response, nash equilibrium, price of anarchy, shapley value |
| 1 | David Applegate, Gruia Calinescu, David S. Johnson, Howard J. Karloff, Katrina Ligett, Jia Wang |
Compressing rectilinear pictures and minimizing access control lists.  |
SODA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Michel X. Goemans, Howard J. Karloff |
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem.  |
Math. Oper. Res.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan |
Lower bounds for linear locally decodable codes and private information retrieval.  |
Computational Complexity  |
2006 |
DBLP DOI BibTeX RDF |
Subject classification, 68P30 |
| 1 | Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao |
l22 spreading metrics for vertex ordering problems.  |
SODA  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani |
On earthmover distance, metric labeling, and 0-extension.  |
STOC  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani |
On earthmover distance, metric labeling, and 0-extension  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2005 |
DBLP BibTeX RDF |
|
| 1 | Joseph Cheriyan, Howard J. Karloff, Yuval Rabani |
Approximating Directed Multicuts.  |
Combinatorica  |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C20, 90C27, 05C85, 68W25 |
| 1 | Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi |
Caching with Expiration Times for Internet Applications.  |
Internet Mathematics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Adrian Dumitrescu, Howard J. Karloff, Peng-Jun Wan |
Separating Points by Axis-parallel Lines.  |
Int. J. Comput. Geometry Appl.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Howard J. Karloff, Yuval Rabani |
Approximation Algorithms for the 0-Extension Problem.  |
SIAM J. Comput.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup |
OPT Versus LOAD in Dynamic Storage Allocation.  |
SIAM J. Comput.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff |
On the convergence time of a path-vector protocol.  |
SODA  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Michel X. Goemans, Howard J. Karloff |
On the Integrality Ratio for Asymmetric TSP.  |
FOCS  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Cristina G. Fernandes, Howard J. Karloff, Alexander Zelikovsky |
A New Approximation Algorithm for Finding Heavy Planar Subgraphs.  |
Algorithmica  |
2003 |
DBLP DOI BibTeX RDF |
Weighted planar graph, Approximation algorithm, Performance ratio |
| 1 | Anna C. Gilbert, Howard J. Karloff |
On the fractal behavior of TCP.  |
STOC  |
2003 |
DBLP DOI BibTeX RDF |
Internet, algorithm, TCP, network protocol, fractal |
| 1 | Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup |
OPT versus LOAD in dynamic storage allocation.  |
STOC  |
2003 |
DBLP DOI BibTeX RDF |
approximation algorithms, polynomial time approximation schemes, dynamic storage allocation |
| 1 | Richard J. Anderson, Sampath Kannan, Howard J. Karloff, Richard E. Ladner |
Thresholds and optimal binary comparison search trees.  |
J. Algorithms  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi |
Caching with expiration times.  |
SODA  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani |
Improved Approximation Algorithms for Resource Allocation.  |
IPCO  |
2002 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan |
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval. (PDF / PS)  |
IEEE Conference on Computational Complexity  |
2002 |
DBLP DOI BibTeX RDF |
Error Correcting Codes, Linear Codes, Private Information Retrieval |
| 1 | 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)  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Gruia Calinescu, Howard J. Karloff, Yuval Rabani |
Approximation algorithms for the 0-extension problem.  |
SODA  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph Cheriyan, Howard J. Karloff, Yuval Rabani |
Approximating Directed Multicuts.  |
FOCS  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard J. Anderson, Sampath Kannan, Howard J. Karloff, Richard E. Ladner |
Thresholds and Optimal Binary Comparison Search Trees.  |
FSTTCS  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | 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.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff |
Foreword.  |
J. Algorithms  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Howard J. Karloff, Yuval Rabani |
An Improved Approximation Algorithm for MULTIWAY CUT.  |
J. Comput. Syst. Sci.  |
2000 |
DBLP BibTeX RDF |
|
| 1 | 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.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff |
How Good is the Goemans-Williamson MAX CUT Algorithm?  |
SIAM J. Comput.  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Barun Chandra, Howard J. Karloff, Craig A. Tovey |
New Results on the Old k-opt Algorithm for the Traveling Salesman Problem.  |
SIAM J. Comput.  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff, Milena Mihail |
On the Complexity of the View-Selection Problem.  |
PODS  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff |
A Better Approximation Algorithm for Finding Planar Subgraphs.  |
J. Algorithms  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan |
Competitive Algorithms for Layered Graph Traversal.  |
SIAM J. Comput.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff (eds.) |
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 25-27 January 1998, San Francisco, California.  |
SODA  |
1998 |
DBLP BibTeX RDF |
|
| 1 | Gruia Calinescu, Howard J. Karloff, Yuval Rabani |
An Improved Approximation Algorithm for Multiway Cut.  |
STOC  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff, Yishay Mansour |
On Construction of k-Wise Independent Random Variables.  |
Combinatorica  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff, Uri Zwick |
A 7/8-Approximation Algorithm for MAX 3SAT?  |
FOCS  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks |
Randomized Robot Navigation Algorithms.  |
SODA  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff |
A Better Approximation Algorithm for Finding Planar Subgraphs.  |
SODA  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff |
How Good is the Goemans-Williamson MAX CUT Algorithm?  |
STOC  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra |
New Algorithms for an Ancient Scheduling Problem.  |
J. Comput. Syst. Sci.  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Bartal, Howard J. Karloff, Yuval Rabani |
A Better Lower Bound for On-Line Scheduling.  |
Inf. Process. Lett.  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff, Yuval Rabani, Yiftach Ravid |
Lower Bounds for Randomized k-Server and Motion-Planning Algorithms.  |
SIAM J. Comput.  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Barun Chandra, Howard J. Karloff, Craig A. Tovey |
New Results on the Old k-Opt Algorithm for the TSP.  |
SODA  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff |
Fast Algorithms for Approximately Counting Mismatches.  |
Inf. Process. Lett.  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff, Prabhakar Raghavan |
Randomized Algorithms and Pseudorandom Numbers.  |
J. ACM  |
1993 |
DBLP DOI BibTeX RDF |
routing, searching, sorting |
| 1 | Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber |
Fast Geometric Approximation Techniques and Geometric Embedding Problems.  |
Theor. Comput. Sci.  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan |
Algebraic Methods for Interactive Proof Systems.  |
J. ACM  |
1992 |
DBLP DOI BibTeX RDF |
interactive proof systems |
| 1 | Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks |
A Decomposition Theorem and Bounds for Randomized Server Problems  |
FOCS  |
1992 |
DBLP DOI BibTeX RDF |
randomized server problems, k-server problem, arbitrary metric spaces, lower bound, motion-planning, bounds, competitive ratio, decomposition theorem |
| 1 | Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra |
New Algorithms for an Ancient Scheduling Problem  |
STOC  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Howard J. Karloff, Tomasz Radzik |
Connectivity vs. Reachability  |
Inf. Comput.  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan |
New Results on Server Problems.  |
SIAM J. Discrete Math.  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan |
Competitive Algorithms for Layered Graph Traversal  |
FOCS  |
1991 |
DBLP DOI BibTeX RDF |
deterministic online algorithm, layered graph traversal, searcher, target vertex, lower bounds, upper bounds, weighted graph, competitive algorithms |
| 1 | Howard J. Karloff, Yuval Rabani, Yiftach Ravid |
Lower Bounds for Randomized k-Server and Motion Planning Algorithms  |
STOC  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan |
title=New Results on Server Problems.  |
SODA  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Howard J. Karloff, Gábor Tardos |
A Competitive 3-Server Algorithm.  |
SODA  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan |
Algebraic Methods for Interactive Proof Systems  |
FOCS  |
1990 |
DBLP DOI BibTeX RDF |
polynomial value verification, program self correction, algebraic technique, program verification, language, interactive proof systems, program checking, polynomial-time hierarchy, low-degree polynomial |
| 1 | Howard J. Karloff |
An NC Algorithm for Brooks' Theorem.  |
Theor. Comput. Sci.  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff, Walter L. Ruzzo |
The Iterated Mod Problem  |
Inf. Comput.  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff |
How Long can a Euclidean Traveling Salesman Tour Be?  |
SIAM J. Discrete Math.  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Howard J. Karloff |
A lower bound on the size of universal sets for planar graphs.  |
SIGACT News  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber |
Fast Geometric Approximation Techniques and Geometric Embedding Problems.  |
Symposium on Computational Geometry  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff, Ramamohan Paturi, Janos Simon |
Universal Traversal Sequences of Length n^O(log n) for Cliques.  |
Inf. Process. Lett.  |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff, Prabhakar Raghavan |
Randomized Algorithms and Pseudorandom Numbers  |
STOC  |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff, David B. Shmoys |
Efficient Parallel Algorithms for Edge Coloring Problems.  |
J. Algorithms  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Joan Boyar, Howard J. Karloff |
Coloring Planar Graphs in Parallel.  |
J. Algorithms  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Howard J. Karloff |
A Las Vegas RNC algorithm for maximum matching.  |
Combinatorica  |
1986 |
DBLP DOI BibTeX RDF |
|