default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHoward J. Karloff
Person information
- affiliation: AT&T Inc
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j49]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): 896-926 (2020)
2010 – 2019
- 2016
- [c47]Dean P. Foster, Satyen Kale, Howard J. Karloff:
Online Sparse Linear Regression. COLT 2016: 960-970 - [i9]Dean P. Foster, Satyen Kale, Howard J. Karloff:
Online Sparse Linear Regression. CoRR abs/1603.02250 (2016) - [i8]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 abs/1611.01210 (2016) - 2015
- [c46]Dean P. Foster, Howard J. Karloff, Justin Thaler:
Variable Selection is Hard. COLT 2015: 696-709 - [c45]Howard J. Karloff, Ramesh Subbaraman:
Designing wireless metropolitan-area networks using mathematical optimization. WTS 2015: 1-8 - 2014
- [j48]Gruia Calinescu, Howard J. Karloff:
Sequential dependency computation via geometric data structures. Comput. Geom. 47(2): 141-148 (2014) - [j47]Lukasz Golab, Howard J. Karloff, Flip Korn, Barna Saha, Divesh Srivastava:
Discovering Conservation Rules. IEEE Trans. Knowl. Data Eng. 26(6): 1332-1348 (2014) - [c44]Carlos Eduardo de Andrade, Mauricio G. C. Resende, Howard J. Karloff, Flávio Keidi Miyazawa:
Evolutionary algorithms for overlapping correlation clustering. GECCO 2014: 405-412 - [c43]Richard Cole, Howard J. Karloff:
Fast Algorithms for Constructing Maximum Entropy Summary Trees. ICALP (1) 2014: 332-343 - [c42]Lukasz Golab, Marios Hadjieleftheriou, Howard J. Karloff, Barna Saha:
Distributed data placement to minimize communication costs via graph partitioning. SSDBM 2014: 20:1-20:12 - [i7]Richard Cole, Howard J. Karloff:
Fast Algorithms for Constructing Maximum Entropy Summary Trees. CoRR abs/1404.5660 (2014) - [i6]Dean P. Foster, Howard J. Karloff, Justin Thaler:
Variable Selection is Hard. CoRR abs/1412.4832 (2014) - 2013
- [j46]Howard J. Karloff, Kenneth E. Shirley:
Maximum Entropy Summary Trees. Comput. Graph. Forum 32(3): 71-80 (2013) - [i5]Lukasz Golab, Marios Hadjieleftheriou, Howard J. Karloff, Barna Saha:
Distributed Data Placement via Graph Partitioning. CoRR abs/1312.0285 (2013) - 2012
- [c41]Lukasz Golab, Howard J. Karloff, Flip Korn, Barna Saha, Divesh Srivastava:
Discovering Conservation Rules. ICDE 2012: 738-749 - [e2]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, ISBN 978-1-4503-1245-5 [contents] - 2011
- [j45]Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff:
Improved Approximation Algorithms for Label Cover Problems. Algorithmica 61(1): 190-206 (2011) - [j44]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) - [j43]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) - [j42]Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani:
An improved approximation algorithm for resource allocation. ACM Trans. Algorithms 7(4): 48:1-48:7 (2011) - [c40]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 - [c39]Gruia Calinescu, Howard J. Karloff:
Sequential Dependency Computation via Geometric Data Structures. CCCG 2011 - [c38]Matthew Andrews, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Ankur Moitra:
Capacitated Metric Labeling. SODA 2011: 976-995 - [c37]Howard J. Karloff, Flip Korn, Konstantin Makarychev, Yuval Rabani:
On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data. STACS 2011: 332-343 - [i4]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) - 2010
- [j41]Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao:
l22 Spreading Metrics for Vertex Ordering Problems. Algorithmica 56(4): 577-604 (2010) - [j40]Lukasz Golab, Howard J. Karloff, Flip Korn, Divesh Srivastava:
Data Auditor: Exploring Data Quality and Semantics using Pattern Tableaux. Proc. VLDB Endow. 3(2): 1641-1644 (2010) - [c36]Graham Cormode, Howard J. Karloff, Anthony Wirth:
Set cover algorithms for very large datasets. CIKM 2010: 479-488 - [c35]Howard J. Karloff, Siddharth Suri, Sergei Vassilvitskii:
A Model of Computation for MapReduce. SODA 2010: 938-948
2000 – 2009
- 2009
- [j39]Lukasz Golab, Howard J. Karloff, Flip Korn, Avishek Saha, Divesh Srivastava:
Sequential Dependencies. Proc. VLDB Endow. 2(1): 574-585 (2009) - [j38]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) - [c34]Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff:
Improved Approximation Algorithms for Label Cover Problems. ESA 2009: 23-34 - [c33]Aaron Archer, MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Howard J. Karloff:
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP. FOCS 2009: 427-436 - [c32]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 - 2008
- [j37]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) - [j36]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): 376-390 (2008) - [c31]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: 798-805 - [c30]Moses Charikar, Howard J. Karloff, Claire Mathieu, Joseph Naor, Michael E. Saks:
Online multicast with egalitarian cost sharing. SPAA 2008: 70-76 - [i3]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) - 2007
- [c29]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: 1066-1075 - 2006
- [j35]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): 263-296 (2006) - [j34]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) - [c28]Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao:
l22 spreading metrics for vertex ordering problems. SODA 2006: 1018-1027 - [c27]Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani:
On earthmover distance, metric labeling, and 0-extension. STOC 2006: 547-556 - 2005
- [j33]Joseph Cheriyan, Howard J. Karloff, Yuval Rabani:
Approximating Directed Multicuts. Comb. 25(3): 251-269 (2005) - [j32]Gruia Calinescu, Adrian Dumitrescu, Howard J. Karloff, Peng-Jun Wan:
Separating Points by Axis-parallel Lines. Int. J. Comput. Geom. Appl. 15(6): 575-590 (2005) - [j31]Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi:
Caching with Expiration Times for Internet Applications. Internet Math. 2(2): 165-184 (2005) - [i2]Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani:
On earthmover distance, metric labeling, and 0-extension. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j30]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) - [j29]Gruia Calinescu, Howard J. Karloff, Yuval Rabani:
Approximation Algorithms for the 0-Extension Problem. SIAM J. Comput. 34(2): 358-372 (2004) - [c26]Moses Charikar, Michel X. Goemans, Howard J. Karloff:
On the Integrality Ratio for Asymmetric TSP. FOCS 2004: 101-107 - [c25]Howard J. Karloff:
On the convergence time of a path-vector protocol. SODA 2004: 605-614 - 2003
- [j28]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) - [c24]Anna C. Gilbert, Howard J. Karloff:
On the fractal behavior of TCP. STOC 2003: 297-306 - [c23]Adam L. Buchsbaum, Howard J. Karloff, Claire Kenyon, Nick Reingold, Mikkel Thorup:
OPT versus LOAD in dynamic storage allocation. STOC 2003: 556-564 - 2002
- [j27]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) - [c22]Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, Luca Trevisan:
Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval. CCC 2002: 175-183 - [c21]Gruia Calinescu, Amit Chakrabarti, Howard J. Karloff, Yuval Rabani:
Improved Approximation Algorithms for Resource Allocation. IPCO 2002: 401-414 - [c20]Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi:
Caching with expiration times. SODA 2002: 540-547 - 2001
- [c19]Joseph Cheriyan, Howard J. Karloff, Yuval Rabani:
Approximating Directed Multicuts. FOCS 2001: 320-328 - [c18]Richard J. Anderson, Sampath Kannan, Howard J. Karloff, Richard E. Ladner:
Thresholds and Optimal Binary Comparison Search Trees. FSTTCS 2001: 83-95 - [c17]Gruia Calinescu, Howard J. Karloff, Yuval Rabani:
Approximation algorithms for the 0-extension problem. SODA 2001: 8-16 - [i1]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. TR01 (2001) - 2000
- [j26]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) - [j25]Howard J. Karloff:
Foreword. J. Algorithms 37(1): 1 (2000) - [j24]Gruia Calinescu, Howard J. Karloff, Yuval Rabani:
An Improved Approximation Algorithm for MULTIWAY CUT. J. Comput. Syst. Sci. 60(3): 564-574 (2000) - [j23]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)
1990 – 1999
- 1999
- [j22]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) - [j21]Howard J. Karloff:
How Good is the Goemans-Williamson MAX CUT Algorithm? SIAM J. Comput. 29(1): 336-350 (1999) - [c16]Howard J. Karloff, Milena Mihail:
On the Complexity of the View-Selection Problem. PODS 1999: 167-173 - 1998
- [j20]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) - [j19]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) - [c15]Gruia Calinescu, Howard J. Karloff, Yuval Rabani:
An Improved Approximation Algorithm for Multiway Cut. STOC 1998: 48-52 - [e1]Howard J. Karloff:
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 25-27 January 1998, San Francisco, California, USA. ACM/SIAM 1998, ISBN 0-89871-410-9 [contents] - 1997
- [j18]Howard J. Karloff, Yishay Mansour:
On Construction of k-Wise Independent Random Variables. Comb. 17(1): 91-107 (1997) - [c14]Howard J. Karloff, Uri Zwick:
A 7/8-Approximation Algorithm for MAX 3SAT? FOCS 1997: 406-415 - 1996
- [c13]Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff:
A Better Approximation Algorithm for Finding Planar Subgraphs. SODA 1996: 16-25 - [c12]Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks:
Randomized Robot Navigation Algorithms. SODA 1996: 75-84 - [c11]Howard J. Karloff:
How Good is the Goemans-Williamson MAX CUT Algorithm? STOC 1996: 427-434 - 1995
- [j17]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
- [j16]Yair Bartal, Howard J. Karloff, Yuval Rabani:
A Better Lower Bound for On-Line Scheduling. Inf. Process. Lett. 50(3): 113-116 (1994) - [j15]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) - [c10]Barun Chandra, Howard J. Karloff, Craig A. Tovey:
New Results on the Old k-Opt Algorithm for the TSP. SODA 1994: 150-159 - 1993
- [j14]Howard J. Karloff:
Fast Algorithms for Approximately Counting Mismatches. Inf. Process. Lett. 48(2): 53-60 (1993) - [j13]Howard J. Karloff, Prabhakar Raghavan:
Randomized Algorithms and Pseudorandom Numbers. J. ACM 40(3): 454-476 (1993) - 1992
- [j12]Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan:
Algebraic Methods for Interactive Proof Systems. J. ACM 39(4): 859-868 (1992) - [j11]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) - [c9]Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks:
A Decomposition Theorem and Bounds for Randomized Server Problems. FOCS 1992: 197-207 - [c8]Yair Bartal, Amos Fiat, Howard J. Karloff, Rakesh Vohra:
New Algorithms for an Ancient Scheduling Problem. STOC 1992: 51-58 - 1991
- [j10]Marek Chrobak, Howard J. Karloff, Tomasz Radzik:
Connectivity vs. Reachability. Inf. Comput. 91(2): 177-188 (1991) - [j9]Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan:
New Results on Server Problems. SIAM J. Discret. Math. 4(2): 172-181 (1991) - [c7]Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan:
Competitive Algorithms for Layered Graph Traversal. FOCS 1991: 288-297 - [c6]Howard J. Karloff, Yuval Rabani, Yiftach Ravid:
Lower Bounds for Randomized k-Server and Motion Planning Algorithms. STOC 1991: 278-288 - 1990
- [c5]Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan:
Algebraic Methods for Interactive Proof Systems. FOCS 1990: 2-10 - [c4]Piotr Berman, Howard J. Karloff, Gábor Tardos:
A Competitive 3-Server Algorithm. SODA 1990: 280-290 - [c3]Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan:
New Results on Server Problems. SODA 1990: 291-300
1980 – 1989
- 1989
- [j8]Howard J. Karloff, Walter L. Ruzzo:
The Iterated Mod Problem. Inf. Comput. 80(3): 193-204 (1989) - [j7]Howard J. Karloff:
How Long can a Euclidean Traveling Salesman Tour Be? SIAM J. Discret. Math. 2(1): 91-99 (1989) - [j6]Marek Chrobak, Howard J. Karloff:
A lower bound on the size of universal sets for planar graphs. SIGACT News 20(4): 83-86 (1989) - [j5]Howard J. Karloff:
An NC Algorithm for Brooks' Theorem. Theor. Comput. Sci. 68(1): 89-103 (1989) - [c2]Marshall W. Bern, Howard J. Karloff, Prabhakar Raghavan, Baruch Schieber:
Fast Geometric Approximation Techniques and Geometric Embedding Problems. SCG 1989: 292-301 - 1988
- [j4]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) - [c1]Howard J. Karloff, Prabhakar Raghavan:
Randomized Algorithms and Pseudorandom Numbers. STOC 1988: 310-321 - 1987
- [j3]Howard J. Karloff, David B. Shmoys:
Efficient Parallel Algorithms for Edge Coloring Problems. J. Algorithms 8(1): 39-52 (1987) - [j2]Joan Boyar, Howard J. Karloff:
Coloring Planar Graphs in Parallel. J. Algorithms 8(4): 470-479 (1987) - 1986
- [j1]Howard J. Karloff:
A Las Vegas RNC algorithm for maximum matching. Comb. 6(4): 387-391 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
