Howard J. Karloff

106 papers A* 33A 6B 4Journal 57Unranked 6

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