Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Howard J. Karloff
@article{DBLP:journals/ior/JohnsonBDDGHKRS20,
author = {David S. Johnson and
Lee Breslau and
Ilias Diakonikolas and
Nick Duffield and
Yu Gu and
MohammadTaghi Hajiaghayi and
Howard J. Karloff and
Mauricio G. C. Resende and
Subhabrata Sen},
title = {Near-Optimal Disjoint-Path Facility Location Through Set Cover by
Pairs},
journal = {Oper. Res.},
volume = {68},
number = {3},
pages = {896--926},
year = {2020},
url = {https://doi.org/10.1287/opre.2019.1956},
doi = {10.1287/OPRE.2019.1956},
timestamp = {Tue, 30 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/JohnsonBDDGHKRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/FosterKK16,
author = {Dean P. Foster and
Satyen Kale and
Howard J. Karloff},
editor = {Vitaly Feldman and
Alexander Rakhlin and
Ohad Shamir},
title = {Online Sparse Linear Regression},
booktitle = {Proceedings of the 29th Conference on Learning Theory, {COLT} 2016,
New York, USA, June 23-26, 2016},
series = {{JMLR} Workshop and Conference Proceedings},
volume = {49},
pages = {960--970},
publisher = {JMLR.org},
year = {2016},
url = {http://proceedings.mlr.press/v49/foster16.html},
timestamp = {Wed, 29 May 2019 08:41:47 +0200},
biburl = {https://dblp.org/rec/conf/colt/FosterKK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FosterKK16,
author = {Dean P. Foster and
Satyen Kale and
Howard J. Karloff},
title = {Online Sparse Linear Regression},
journal = {CoRR},
volume = {abs/1603.02250},
year = {2016},
url = {http://arxiv.org/abs/1603.02250},
eprinttype = {arXiv},
eprint = {1603.02250},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FosterKK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JohnsonBDD0HKRS16,
author = {David S. Johnson and
Lee Breslau and
Ilias Diakonikolas and
Nick G. Duffield and
Yu Gu and
MohammadTaghi Hajiaghayi and
Howard J. Karloff and
Mauricio G. C. Resende and
Subhabrata Sen},
title = {Near-Optimal Disjoint-Path Facility Location Through Set Cover by
Pairs},
journal = {CoRR},
volume = {abs/1611.01210},
year = {2016},
url = {http://arxiv.org/abs/1611.01210},
eprinttype = {arXiv},
eprint = {1611.01210},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JohnsonBDD0HKRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/FosterKT15,
author = {Dean P. Foster and
Howard J. Karloff and
Justin Thaler},
editor = {Peter Gr{\"{u}}nwald and
Elad Hazan and
Satyen Kale},
title = {Variable Selection is Hard},
booktitle = {Proceedings of The 28th Conference on Learning Theory, {COLT} 2015,
Paris, France, July 3-6, 2015},
series = {{JMLR} Workshop and Conference Proceedings},
volume = {40},
pages = {696--709},
publisher = {JMLR.org},
year = {2015},
url = {http://proceedings.mlr.press/v40/Foster15.html},
timestamp = {Wed, 29 May 2019 08:41:46 +0200},
biburl = {https://dblp.org/rec/conf/colt/FosterKT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wts/KarloffS15,
author = {Howard J. Karloff and
Ramesh Subbaraman},
title = {Designing wireless metropolitan-area networks using mathematical optimization},
booktitle = {2015 Wireless Telecommunications Symposium, {WTS} 2015, New York City,
NY, USA, April 15-17, 2015},
pages = {1--8},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/WTS.2015.7117253},
doi = {10.1109/WTS.2015.7117253},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/wts/KarloffS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/CalinescuK14,
author = {Gruia C{\u{a}}linescu and
Howard J. Karloff},
title = {Sequential dependency computation via geometric data structures},
journal = {Comput. Geom.},
volume = {47},
number = {2},
pages = {141--148},
year = {2014},
url = {https://doi.org/10.1016/j.comgeo.2013.08.009},
doi = {10.1016/J.COMGEO.2013.08.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/CalinescuK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tkde/GolabKKSS14,
author = {Lukasz Golab and
Howard J. Karloff and
Flip Korn and
Barna Saha and
Divesh Srivastava},
title = {Discovering Conservation Rules},
journal = {{IEEE} Trans. Knowl. Data Eng.},
volume = {26},
number = {6},
pages = {1332--1348},
year = {2014},
url = {https://doi.org/10.1109/TKDE.2012.171},
doi = {10.1109/TKDE.2012.171},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tkde/GolabKKSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/AndradeRKM14,
author = {Carlos Eduardo de Andrade and
Mauricio G. C. Resende and
Howard J. Karloff and
Fl{\'{a}}vio Keidi Miyazawa},
editor = {Dirk V. Arnold},
title = {Evolutionary algorithms for overlapping correlation clustering},
booktitle = {Genetic and Evolutionary Computation Conference, {GECCO} '14, Vancouver,
BC, Canada, July 12-16, 2014},
pages = {405--412},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2576768.2598284},
doi = {10.1145/2576768.2598284},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gecco/AndradeRKM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ColeK14,
author = {Richard Cole and
Howard J. Karloff},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {Fast Algorithms for Constructing Maximum Entropy Summary Trees},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8572},
pages = {332--343},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43948-7\_28},
doi = {10.1007/978-3-662-43948-7\_28},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ColeK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ssdbm/GolabHKS14,
author = {Lukasz Golab and
Marios Hadjieleftheriou and
Howard J. Karloff and
Barna Saha},
editor = {Christian S. Jensen and
Hua Lu and
Torben Bach Pedersen and
Christian Thomsen and
Kristian Torp},
title = {Distributed data placement to minimize communication costs via graph
partitioning},
booktitle = {Conference on Scientific and Statistical Database Management, {SSDBM}
'14, Aalborg, Denmark, June 30 - July 02, 2014},
pages = {20:1--20:12},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2618243.2618258},
doi = {10.1145/2618243.2618258},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ssdbm/GolabHKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ColeK14,
author = {Richard Cole and
Howard J. Karloff},
title = {Fast Algorithms for Constructing Maximum Entropy Summary Trees},
journal = {CoRR},
volume = {abs/1404.5660},
year = {2014},
url = {http://arxiv.org/abs/1404.5660},
eprinttype = {arXiv},
eprint = {1404.5660},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ColeK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FosterKT14,
author = {Dean P. Foster and
Howard J. Karloff and
Justin Thaler},
title = {Variable Selection is Hard},
journal = {CoRR},
volume = {abs/1412.4832},
year = {2014},
url = {http://arxiv.org/abs/1412.4832},
eprinttype = {arXiv},
eprint = {1412.4832},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FosterKT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cgf/KarloffS13,
author = {Howard J. Karloff and
Kenneth E. Shirley},
title = {Maximum Entropy Summary Trees},
journal = {Comput. Graph. Forum},
volume = {32},
number = {3},
pages = {71--80},
year = {2013},
url = {https://doi.org/10.1111/cgf.12094},
doi = {10.1111/CGF.12094},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cgf/KarloffS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GolabHKS13,
author = {Lukasz Golab and
Marios Hadjieleftheriou and
Howard J. Karloff and
Barna Saha},
title = {Distributed Data Placement via Graph Partitioning},
journal = {CoRR},
volume = {abs/1312.0285},
year = {2013},
url = {http://arxiv.org/abs/1312.0285},
eprinttype = {arXiv},
eprint = {1312.0285},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GolabHKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icde/GolabKKSS12,
author = {Lukasz Golab and
Howard J. Karloff and
Flip Korn and
Barna Saha and
Divesh Srivastava},
editor = {Anastasios Kementsietsidis and
Marcos Antonio Vaz Salles},
title = {Discovering Conservation Rules},
booktitle = {{IEEE} 28th International Conference on Data Engineering {(ICDE} 2012),
Washington, DC, {USA} (Arlington, Virginia), 1-5 April, 2012},
pages = {738--749},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/ICDE.2012.105},
doi = {10.1109/ICDE.2012.105},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icde/GolabKKSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2012,
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
publisher = {{ACM}},
year = {2012},
url = {http://dl.acm.org/citation.cfm?id=2213977},
isbn = {978-1-4503-1245-5},
timestamp = {Tue, 22 May 2012 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/2012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CharikarHK11,
author = {Moses Charikar and
MohammadTaghi Hajiaghayi and
Howard J. Karloff},
title = {Improved Approximation Algorithms for Label Cover Problems},
journal = {Algorithmica},
volume = {61},
number = {1},
pages = {190--206},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9464-3},
doi = {10.1007/S00453-010-9464-3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CharikarHK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BateniGHK11,
author = {MohammadHossein Bateni and
Lukasz Golab and
MohammadTaghi Hajiaghayi and
Howard J. Karloff},
title = {Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses},
journal = {Theory Comput. Syst.},
volume = {49},
number = {4},
pages = {757--780},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9347-2},
doi = {10.1007/S00224-011-9347-2},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BateniGHK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ArcherBHK11,
author = {Aaron Archer and
MohammadHossein Bateni and
MohammadTaghi Hajiaghayi and
Howard J. Karloff},
title = {Improved Approximation Algorithms for Prize-Collecting Steiner Tree
and {TSP}},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {2},
pages = {309--332},
year = {2011},
url = {https://doi.org/10.1137/090771429},
doi = {10.1137/090771429},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ArcherBHK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CalinescuCKR11,
author = {Gruia C{\u{a}}linescu and
Amit Chakrabarti and
Howard J. Karloff and
Yuval Rabani},
title = {An improved approximation algorithm for resource allocation},
journal = {{ACM} Trans. Algorithms},
volume = {7},
number = {4},
pages = {48:1--48:7},
year = {2011},
url = {https://doi.org/10.1145/2000807.2000816},
doi = {10.1145/2000807.2000816},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/CalinescuCKR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BreslauDDGHJKRS11,
author = {Lee Breslau and
Ilias Diakonikolas and
Nick G. Duffield and
Yu Gu and
Mohammad Taghi Hajiaghayi and
David S. Johnson and
Howard J. Karloff and
Mauricio G. C. Resende and
Subhabrata Sen},
editor = {Matthias M{\"{u}}ller{-}Hannemann and
Renato Fonseca F. Werneck},
title = {Disjoint-Path Facility Location: Theory and Practice},
booktitle = {Proceedings of the Thirteenth Workshop on Algorithm Engineering and
Experiments, {ALENEX} 2011, Holiday Inn San Francisco Golden Gateway,
San Francisco, California, USA, January 22, 2011},
pages = {60--74},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611972917.7},
doi = {10.1137/1.9781611972917.7},
timestamp = {Wed, 14 Nov 2018 10:52:08 +0100},
biburl = {https://dblp.org/rec/conf/alenex/BreslauDDGHJKRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/CalinescuK11,
author = {Gruia C{\u{a}}linescu and
Howard J. Karloff},
title = {Sequential Dependency Computation via Geometric Data Structures},
booktitle = {Proceedings of the 23rd Annual Canadian Conference on Computational
Geometry, Toronto, Ontario, Canada, August 10-12, 2011},
year = {2011},
url = {http://www.cccg.ca/proceedings/2011/papers/paper27.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/CalinescuK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AndrewsHKM11,
author = {Matthew Andrews and
Mohammad Taghi Hajiaghayi and
Howard J. Karloff and
Ankur Moitra},
editor = {Dana Randall},
title = {Capacitated Metric Labeling},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {976--995},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.76},
doi = {10.1137/1.9781611973082.76},
timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/AndrewsHKM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KarloffKMR11,
author = {Howard J. Karloff and
Flip Korn and
Konstantin Makarychev and
Yuval Rabani},
editor = {Thomas Schwentick and
Christoph D{\"{u}}rr},
title = {On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data},
booktitle = {28th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2011, March 10-12, 2011, Dortmund, Germany},
series = {LIPIcs},
volume = {9},
pages = {332--343},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.STACS.2011.332},
doi = {10.4230/LIPICS.STACS.2011.332},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/KarloffKMR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1101-1941,
author = {Howard J. Karloff and
Flip Korn and
Konstantin Makarychev and
Yuval Rabani},
title = {On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data},
journal = {CoRR},
volume = {abs/1101.1941},
year = {2011},
url = {http://arxiv.org/abs/1101.1941},
eprinttype = {arXiv},
eprint = {1101.1941},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1101-1941.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CharikarHKR10,
author = {Moses Charikar and
Mohammad Taghi Hajiaghayi and
Howard J. Karloff and
Satish Rao},
title = {\emph{\emph{l}}\({}_{\mbox{2}}\)\({}^{\mbox{2}}\) Spreading Metrics
for Vertex Ordering Problems},
journal = {Algorithmica},
volume = {56},
number = {4},
pages = {577--604},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9191-1},
doi = {10.1007/S00453-008-9191-1},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CharikarHKR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/GolabKKS10,
author = {Lukasz Golab and
Howard J. Karloff and
Flip Korn and
Divesh Srivastava},
title = {Data Auditor: Exploring Data Quality and Semantics using Pattern Tableaux},
journal = {Proc. {VLDB} Endow.},
volume = {3},
number = {2},
pages = {1641--1644},
year = {2010},
url = {http://www.vldb.org/pvldb/vldb2010/pvldb\_vol3/D32.pdf},
doi = {10.14778/1920841.1921060},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pvldb/GolabKKS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cikm/CormodeKW10,
author = {Graham Cormode and
Howard J. Karloff and
Anthony Wirth},
editor = {Jimmy X. Huang and
Nick Koudas and
Gareth J. F. Jones and
Xindong Wu and
Kevyn Collins{-}Thompson and
Aijun An},
title = {Set cover algorithms for very large datasets},
booktitle = {Proceedings of the 19th {ACM} Conference on Information and Knowledge
Management, {CIKM} 2010, Toronto, Ontario, Canada, October 26-30,
2010},
pages = {479--488},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1871437.1871501},
doi = {10.1145/1871437.1871501},
timestamp = {Wed, 03 Aug 2022 15:48:33 +0200},
biburl = {https://dblp.org/rec/conf/cikm/CormodeKW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KarloffSV10,
author = {Howard J. Karloff and
Siddharth Suri and
Sergei Vassilvitskii},
editor = {Moses Charikar},
title = {A Model of Computation for MapReduce},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {938--948},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.76},
doi = {10.1137/1.9781611973075.76},
timestamp = {Tue, 02 Feb 2021 17:07:39 +0100},
biburl = {https://dblp.org/rec/conf/soda/KarloffSV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/GolabKKSS09,
author = {Lukasz Golab and
Howard J. Karloff and
Flip Korn and
Avishek Saha and
Divesh Srivastava},
title = {Sequential Dependencies},
journal = {Proc. {VLDB} Endow.},
volume = {2},
number = {1},
pages = {574--585},
year = {2009},
url = {http://www.vldb.org/pvldb/vol2/vldb09-149.pdf},
doi = {10.14778/1687627.1687693},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pvldb/GolabKKSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KarloffKMR09,
author = {Howard J. Karloff and
Subhash Khot and
Aranyak Mehta and
Yuval Rabani},
title = {On Earthmover Distance, Metric Labeling, and 0-Extension},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {2},
pages = {371--387},
year = {2009},
url = {https://doi.org/10.1137/070685671},
doi = {10.1137/070685671},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KarloffKMR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CharikarHK09,
author = {Moses Charikar and
MohammadTaghi Hajiaghayi and
Howard J. Karloff},
editor = {Amos Fiat and
Peter Sanders},
title = {Improved Approximation Algorithms for Label Cover Problems},
booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
Denmark, September 7-9, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5757},
pages = {23--34},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04128-0\_3},
doi = {10.1007/978-3-642-04128-0\_3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/CharikarHK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ArcherBHK09,
author = {Aaron Archer and
MohammadHossein Bateni and
Mohammad Taghi Hajiaghayi and
Howard J. Karloff},
title = {Improved Approximation Algorithms for {PRIZE-COLLECTING} {STEINER}
{TREE} and {TSP}},
booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
pages = {427--436},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/FOCS.2009.39},
doi = {10.1109/FOCS.2009.39},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ArcherBHK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/BateniGHK09,
author = {MohammadHossein Bateni and
Lukasz Golab and
Mohammad Taghi Hajiaghayi and
Howard J. Karloff},
editor = {Friedhelm Meyer auf der Heide and
Michael A. Bender},
title = {Scheduling to minimize staleness and stretch in real-time data warehouses},
booktitle = {{SPAA} 2009: Proceedings of the 21st Annual {ACM} Symposium on Parallelism
in Algorithms and Architectures, Calgary, Alberta, Canada, August
11-13, 2009},
pages = {29--38},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1583991.1583998},
doi = {10.1145/1583991.1583998},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spaa/BateniGHK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/CheriyanKKK08,
author = {Joseph Cheriyan and
Howard J. Karloff and
Rohit Khandekar and
Jochen K{\"{o}}nemann},
title = {On the integrality ratio for tree augmentation},
journal = {Oper. Res. Lett.},
volume = {36},
number = {4},
pages = {399--401},
year = {2008},
url = {https://doi.org/10.1016/j.orl.2008.01.009},
doi = {10.1016/J.ORL.2008.01.009},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/CheriyanKKK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/GolabKKSY08,
author = {Lukasz Golab and
Howard J. Karloff and
Flip Korn and
Divesh Srivastava and
Bei Yu},
title = {On generating near-optimal tableaux for conditional functional dependencies},
journal = {Proc. {VLDB} Endow.},
volume = {1},
number = {1},
pages = {376--390},
year = {2008},
url = {http://www.vldb.org/pvldb/vol1/1453900.pdf},
doi = {10.14778/1453856.1453900},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pvldb/GolabKKSY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/allerton/BerindeGIKS08,
author = {Radu Berinde and
Anna C. Gilbert and
Piotr Indyk and
Howard J. Karloff and
Martin J. Strauss},
title = {Combining geometry and combinatorics: {A} unified approach to sparse
signal recovery},
booktitle = {46th Annual Allerton Conference on Communication, Control, and Computing,
Allerton 2008, Monticello, IL, USA, September 24-26, 2008},
pages = {798--805},
publisher = {{IEEE}},
year = {2008},
url = {https://doi.org/10.1109/ALLERTON.2008.4797639},
doi = {10.1109/ALLERTON.2008.4797639},
timestamp = {Wed, 22 Nov 2023 08:29:09 +0100},
biburl = {https://dblp.org/rec/conf/allerton/BerindeGIKS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/CharikarKMNS08,
author = {Moses Charikar and
Howard J. Karloff and
Claire Mathieu and
Joseph Naor and
Michael E. Saks},
editor = {Friedhelm Meyer auf der Heide and
Nir Shavit},
title = {Online multicast with egalitarian cost sharing},
booktitle = {{SPAA} 2008: Proceedings of the 20th Annual {ACM} Symposium on Parallelism
in Algorithms and Architectures, Munich, Germany, June 14-16, 2008},
pages = {70--76},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1378533.1378544},
doi = {10.1145/1378533.1378544},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/spaa/CharikarKMNS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0804-4666,
author = {Radu Berinde and
Anna C. Gilbert and
Piotr Indyk and
Howard J. Karloff and
Martin J. Strauss},
title = {Combining geometry and combinatorics: {A} unified approach to sparse
signal recovery},
journal = {CoRR},
volume = {abs/0804.4666},
year = {2008},
url = {http://arxiv.org/abs/0804.4666},
eprinttype = {arXiv},
eprint = {0804.4666},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0804-4666.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ApplegateCJKLW07,
author = {David L. Applegate and
Gruia C{\u{a}}linescu and
David S. Johnson and
Howard J. Karloff and
Katrina Ligett and
Jia Wang},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Compressing rectilinear pictures and minimizing access control lists},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {1066--1075},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283498},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/ApplegateCJKLW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoldreichKST06,
author = {Oded Goldreich and
Howard J. Karloff and
Leonard J. Schulman and
Luca Trevisan},
title = {Lower bounds for linear locally decodable codes and private information
retrieval},
journal = {Comput. Complex.},
volume = {15},
number = {3},
pages = {263--296},
year = {2006},
url = {https://doi.org/10.1007/s00037-006-0216-3},
doi = {10.1007/S00037-006-0216-3},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoldreichKST06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/CharikarGK06,
author = {Moses Charikar and
Michel X. Goemans and
Howard J. Karloff},
title = {On the Integrality Ratio for the Asymmetric Traveling Salesman Problem},
journal = {Math. Oper. Res.},
volume = {31},
number = {2},
pages = {245--252},
year = {2006},
url = {https://doi.org/10.1287/moor.1060.0191},
doi = {10.1287/MOOR.1060.0191},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/CharikarGK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CharikarHKR06,
author = {Moses Charikar and
Mohammad Taghi Hajiaghayi and
Howard J. Karloff and
Satish Rao},
title = {\emph{l}\({}^{\mbox{2}}\)\({}_{\mbox{2}}\) spreading metrics for vertex
ordering problems},
booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
pages = {1018--1027},
publisher = {{ACM} Press},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109670},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/CharikarHKR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KarloffKMR06,
author = {Howard J. Karloff and
Subhash Khot and
Aranyak Mehta and
Yuval Rabani},
editor = {Jon M. Kleinberg},
title = {On earthmover distance, metric labeling, and 0-extension},
booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing,
Seattle, WA, USA, May 21-23, 2006},
pages = {547--556},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1132516.1132595},
doi = {10.1145/1132516.1132595},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KarloffKMR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/CheriyanKR05,
author = {Joseph Cheriyan and
Howard J. Karloff and
Yuval Rabani},
title = {Approximating Directed Multicuts},
journal = {Comb.},
volume = {25},
number = {3},
pages = {251--269},
year = {2005},
url = {https://doi.org/10.1007/s00493-005-0015-5},
doi = {10.1007/S00493-005-0015-5},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/CheriyanKR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/CalinescuDKW05,
author = {Gruia C{\u{a}}linescu and
Adrian Dumitrescu and
Howard J. Karloff and
Peng{-}Jun Wan},
title = {Separating Points by Axis-parallel Lines},
journal = {Int. J. Comput. Geom. Appl.},
volume = {15},
number = {6},
pages = {575--590},
year = {2005},
url = {https://doi.org/10.1142/S0218195905001865},
doi = {10.1142/S0218195905001865},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/CalinescuDKW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/GopalanKMMV05,
author = {Parikshit Gopalan and
Howard J. Karloff and
Aranyak Mehta and
Milena Mihail and
Nisheeth K. Vishnoi},
title = {Caching with Expiration Times for Internet Applications},
journal = {Internet Math.},
volume = {2},
number = {2},
pages = {165--184},
year = {2005},
url = {https://doi.org/10.1080/15427951.2005.10129102},
doi = {10.1080/15427951.2005.10129102},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/im/GopalanKMMV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-064,
author = {Howard J. Karloff and
Subhash Khot and
Aranyak Mehta and
Yuval Rabani},
title = {On earthmover distance, metric labeling, and 0-extension},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-064}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-064/index.html},
eprinttype = {ECCC},
eprint = {TR05-064},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-064.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuchsbaumKKRT04,
author = {Adam L. Buchsbaum and
Howard J. Karloff and
Claire Kenyon and
Nick Reingold and
Mikkel Thorup},
title = {{OPT} Versus {LOAD} in Dynamic Storage Allocation},
journal = {{SIAM} J. Comput.},
volume = {33},
number = {3},
pages = {632--646},
year = {2004},
url = {https://doi.org/10.1137/S0097539703423941},
doi = {10.1137/S0097539703423941},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BuchsbaumKKRT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CalinescuKR04,
author = {Gruia C{\u{a}}linescu and
Howard J. Karloff and
Yuval Rabani},
title = {Approximation Algorithms for the 0-Extension Problem},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {2},
pages = {358--372},
year = {2004},
url = {https://doi.org/10.1137/S0097539701395978},
doi = {10.1137/S0097539701395978},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CalinescuKR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CharikarGK04,
author = {Moses Charikar and
Michel X. Goemans and
Howard J. Karloff},
title = {On the Integrality Ratio for Asymmetric {TSP}},
booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
October 2004, Rome, Italy, Proceedings},
pages = {101--107},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/FOCS.2004.45},
doi = {10.1109/FOCS.2004.45},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/CharikarGK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Karloff04,
author = {Howard J. Karloff},
editor = {J. Ian Munro},
title = {On the convergence time of a path-vector protocol},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {605--614},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982883},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/Karloff04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CalinescuFKZ03,
author = {Gruia C{\u{a}}linescu and
Cristina G. Fernandes and
Howard J. Karloff and
Alexander Zelikovsky},
title = {A New Approximation Algorithm for Finding Heavy Planar Subgraphs},
journal = {Algorithmica},
volume = {36},
number = {2},
pages = {179--205},
year = {2003},
url = {https://doi.org/10.1007/s00453-002-1020-3},
doi = {10.1007/S00453-002-1020-3},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/CalinescuFKZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GilbertK03,
author = {Anna C. Gilbert and
Howard J. Karloff},
editor = {Lawrence L. Larmore and
Michel X. Goemans},
title = {On the fractal behavior of {TCP}},
booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
June 9-11, 2003, San Diego, CA, {USA}},
pages = {297--306},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/780542.780588},
doi = {10.1145/780542.780588},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GilbertK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BuchsbaumKKRT03,
author = {Adam L. Buchsbaum and
Howard J. Karloff and
Claire Kenyon and
Nick Reingold and
Mikkel Thorup},
editor = {Lawrence L. Larmore and
Michel X. Goemans},
title = {{OPT} versus {LOAD} in dynamic storage allocation},
booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
June 9-11, 2003, San Diego, CA, {USA}},
pages = {556--564},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/780542.780624},
doi = {10.1145/780542.780624},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BuchsbaumKKRT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/AndersonKKL02,
author = {Richard J. Anderson and
Sampath Kannan and
Howard J. Karloff and
Richard E. Ladner},
title = {Thresholds and optimal binary comparison search trees},
journal = {J. Algorithms},
volume = {44},
number = {2},
pages = {338--358},
year = {2002},
url = {https://doi.org/10.1016/S0196-6774(02)00203-1},
doi = {10.1016/S0196-6774(02)00203-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/AndersonKKL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GoldreichKST02,
author = {Oded Goldreich and
Howard J. Karloff and
Leonard J. Schulman and
Luca Trevisan},
title = {Lower Bounds for Linear Locally Decodable Codes and Private Information
Retrieval},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {175--183},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004353},
doi = {10.1109/CCC.2002.1004353},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GoldreichKST02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/CalinescuCKR02,
author = {Gruia C{\u{a}}linescu and
Amit Chakrabarti and
Howard J. Karloff and
Yuval Rabani},
editor = {William J. Cook and
Andreas S. Schulz},
title = {Improved Approximation Algorithms for Resource Allocation},
booktitle = {Integer Programming and Combinatorial Optimization, 9th International
{IPCO} Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2337},
pages = {401--414},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-47867-1\_28},
doi = {10.1007/3-540-47867-1\_28},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/CalinescuCKR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GopalanKMMV02,
author = {Parikshit Gopalan and
Howard J. Karloff and
Aranyak Mehta and
Milena Mihail and
Nisheeth K. Vishnoi},
editor = {David Eppstein},
title = {Caching with expiration times},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {540--547},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545454},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/GopalanKMMV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CheriyanKR01,
author = {Joseph Cheriyan and
Howard J. Karloff and
Yuval Rabani},
title = {Approximating Directed Multicuts},
booktitle = {42nd Annual Symposium on Foundations of Computer Science, {FOCS} 2001,
14-17 October 2001, Las Vegas, Nevada, {USA}},
pages = {320--328},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/SFCS.2001.959906},
doi = {10.1109/SFCS.2001.959906},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CheriyanKR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AndersonKKL01,
author = {Richard J. Anderson and
Sampath Kannan and
Howard J. Karloff and
Richard E. Ladner},
editor = {Ramesh Hariharan and
Madhavan Mukund and
V. Vinay},
title = {Thresholds and Optimal Binary Comparison Search Trees},
booktitle = {{FST} {TCS} 2001: Foundations of Software Technology and Theoretical
Computer Science, 21st Conference, Bangalore, India, December 13-15,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2245},
pages = {83--95},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45294-X\_8},
doi = {10.1007/3-540-45294-X\_8},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/AndersonKKL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CalinescuKR01,
author = {Gruia C{\u{a}}linescu and
Howard J. Karloff and
Yuval Rabani},
editor = {S. Rao Kosaraju},
title = {Approximation algorithms for the 0-extension problem},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {8--16},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365413},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/CalinescuKR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-080,
author = {Oded Goldreich and
Howard J. Karloff and
Leonard J. Schulman and
Luca Trevisan},
title = {Lower Bounds for Linear Locally Decodable Codes and Private Information
Retrieval},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-080}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-080/index.html},
eprinttype = {ECCC},
eprint = {TR01-080},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-080.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FreundK00,
author = {Ari Freund and
Howard J. Karloff},
title = {A lower bound of 8/(7+(1/k)-1) on the integrality ratio of the Calinescu-Karloff-Rabani
relaxation for multiway cut},
journal = {Inf. Process. Lett.},
volume = {75},
number = {1-2},
pages = {43--50},
year = {2000},
url = {https://doi.org/10.1016/S0020-0190(00)00065-X},
doi = {10.1016/S0020-0190(00)00065-X},
timestamp = {Wed, 03 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/FreundK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Karloff00,
author = {Howard J. Karloff},
title = {Foreword},
journal = {J. Algorithms},
volume = {37},
number = {1},
pages = {1},
year = {2000},
url = {https://doi.org/10.1006/jagm.2000.1094},
doi = {10.1006/JAGM.2000.1094},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Karloff00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/CalinescuKR00,
author = {Gruia C{\u{a}}linescu and
Howard J. Karloff and
Yuval Rabani},
title = {An Improved Approximation Algorithm for {MULTIWAY} {CUT}},
journal = {J. Comput. Syst. Sci.},
volume = {60},
number = {3},
pages = {564--574},
year = {2000},
timestamp = {Thu, 20 Nov 2003 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/CalinescuKR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BlumKRS00,
author = {Avrim Blum and
Howard J. Karloff and
Yuval Rabani and
Michael E. Saks},
title = {A Decomposition Theorem for Task Systems and Bounds for Randomized
Server Problems},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {5},
pages = {1624--1661},
year = {2000},
url = {https://doi.org/10.1137/S0097539799351882},
doi = {10.1137/S0097539799351882},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BlumKRS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChandraKT99,
author = {Barun Chandra and
Howard J. Karloff and
Craig A. Tovey},
title = {New Results on the Old k-opt Algorithm for the Traveling Salesman
Problem},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {6},
pages = {1998--2029},
year = {1999},
url = {https://doi.org/10.1137/S0097539793251244},
doi = {10.1137/S0097539793251244},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChandraKT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Karloff99,
author = {Howard J. Karloff},
title = {How Good is the Goemans-Williamson {MAX} {CUT} Algorithm?},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {1},
pages = {336--350},
year = {1999},
url = {https://doi.org/10.1137/S0097539797321481},
doi = {10.1137/S0097539797321481},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Karloff99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/KarloffM99,
author = {Howard J. Karloff and
Milena Mihail},
editor = {Victor Vianu and
Christos H. Papadimitriou},
title = {On the Complexity of the View-Selection Problem},
booktitle = {Proceedings of the Eighteenth {ACM} {SIGACT-SIGMOD-SIGART} Symposium
on Principles of Database Systems, May 31 - June 2, 1999, Philadelphia,
Pennsylvania, {USA}},
pages = {167--173},
publisher = {{ACM} Press},
year = {1999},
url = {https://doi.org/10.1145/303976.303993},
doi = {10.1145/303976.303993},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/KarloffM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/CalinescuFFK98,
author = {Gruia C{\u{a}}linescu and
Cristina G. Fernandes and
Ulrich Finkler and
Howard J. Karloff},
title = {A Better Approximation Algorithm for Finding Planar Subgraphs},
journal = {J. Algorithms},
volume = {27},
number = {2},
pages = {269--302},
year = {1998},
url = {https://doi.org/10.1006/jagm.1997.0920},
doi = {10.1006/JAGM.1997.0920},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/CalinescuFFK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FiatFKRRV98,
author = {Amos Fiat and
Dean P. Foster and
Howard J. Karloff and
Yuval Rabani and
Yiftach Ravid and
Sundar Vishwanathan},
title = {Competitive Algorithms for Layered Graph Traversal},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {2},
pages = {447--462},
year = {1998},
url = {https://doi.org/10.1137/S0097539795279943},
doi = {10.1137/S0097539795279943},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FiatFKRRV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CalinescuKR98,
author = {Gruia C{\u{a}}linescu and
Howard J. Karloff and
Yuval Rabani},
editor = {Jeffrey Scott Vitter},
title = {An Improved Approximation Algorithm for Multiway Cut},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {48--52},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276711},
doi = {10.1145/276698.276711},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CalinescuKR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/1998,
editor = {Howard J. Karloff},
title = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613},
isbn = {0-89871-410-9},
timestamp = {Thu, 05 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/1998.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KarloffM97,
author = {Howard J. Karloff and
Yishay Mansour},
title = {On Construction of \emph{k}-Wise Independent Random Variables},
journal = {Comb.},
volume = {17},
number = {1},
pages = {91--107},
year = {1997},
url = {https://doi.org/10.1007/BF01196134},
doi = {10.1007/BF01196134},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/KarloffM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KarloffZ97,
author = {Howard J. Karloff and
Uri Zwick},
title = {A 7/8-Approximation Algorithm for {MAX} 3SAT?},
booktitle = {38th Annual Symposium on Foundations of Computer Science, {FOCS} '97,
Miami Beach, Florida, USA, October 19-22, 1997},
pages = {406--415},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/SFCS.1997.646129},
doi = {10.1109/SFCS.1997.646129},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KarloffZ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CalinescuFFK96,
author = {Gruia C{\u{a}}linescu and
Cristina G. Fernandes and
Ulrich Finkler and
Howard J. Karloff},
editor = {{\'{E}}va Tardos},
title = {A Better Approximation Algorithm for Finding Planar Subgraphs},
booktitle = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 28-30 January 1996, Atlanta, Georgia, {USA}},
pages = {16--25},
publisher = {{ACM/SIAM}},
year = {1996},
url = {http://dl.acm.org/citation.cfm?id=313852.313869},
timestamp = {Thu, 05 Jul 2018 07:29:31 +0200},
biburl = {https://dblp.org/rec/conf/soda/CalinescuFFK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BermanBFKRS96,
author = {Piotr Berman and
Avrim Blum and
Amos Fiat and
Howard J. Karloff and
Adi Ros{\'{e}}n and
Michael E. Saks},
editor = {{\'{E}}va Tardos},
title = {Randomized Robot Navigation Algorithms},
booktitle = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 28-30 January 1996, Atlanta, Georgia, {USA}},
pages = {75--84},
publisher = {{ACM/SIAM}},
year = {1996},
url = {http://dl.acm.org/citation.cfm?id=313852.313890},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BermanBFKRS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Karloff96,
author = {Howard J. Karloff},
editor = {Gary L. Miller},
title = {How Good is the Goemans-Williamson {MAX} {CUT} Algorithm?},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM} Symposium on the Theory
of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996},
pages = {427--434},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/237814.237990},
doi = {10.1145/237814.237990},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Karloff96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BartalFKV95,
author = {Yair Bartal and
Amos Fiat and
Howard J. Karloff and
Rakesh Vohra},
title = {New Algorithms for an Ancient Scheduling Problem},
journal = {J. Comput. Syst. Sci.},
volume = {51},
number = {3},
pages = {359--366},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1074},
doi = {10.1006/JCSS.1995.1074},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BartalFKV95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BartalKR94,
author = {Yair Bartal and
Howard J. Karloff and
Yuval Rabani},
title = {A Better Lower Bound for On-Line Scheduling},
journal = {Inf. Process. Lett.},
volume = {50},
number = {3},
pages = {113--116},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00026-3},
doi = {10.1016/0020-0190(94)00026-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BartalKR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KarloffRR94,
author = {Howard J. Karloff and
Yuval Rabani and
Yiftach Ravid},
title = {Lower Bounds for Randomized k-Server and Motion-Planning Algorithms},
journal = {{SIAM} J. Comput.},
volume = {23},
number = {2},
pages = {293--312},
year = {1994},
url = {https://doi.org/10.1137/S0097539792224838},
doi = {10.1137/S0097539792224838},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KarloffRR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChandraKT94,
author = {Barun Chandra and
Howard J. Karloff and
Craig A. Tovey},
editor = {Daniel Dominic Sleator},
title = {New Results on the Old k-Opt Algorithm for the {TSP}},
booktitle = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms.
23-25 January 1994, Arlington, Virginia, {USA}},
pages = {150--159},
publisher = {{ACM/SIAM}},
year = {1994},
url = {http://dl.acm.org/citation.cfm?id=314464.314489},
timestamp = {Thu, 05 Jul 2018 07:29:19 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChandraKT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Karloff93,
author = {Howard J. Karloff},
title = {Fast Algorithms for Approximately Counting Mismatches},
journal = {Inf. Process. Lett.},
volume = {48},
number = {2},
pages = {53--60},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90177-B},
doi = {10.1016/0020-0190(93)90177-B},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Karloff93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KarloffR93,
author = {Howard J. Karloff and
Prabhakar Raghavan},
title = {Randomized Algorithms and Pseudorandom Numbers},
journal = {J. {ACM}},
volume = {40},
number = {3},
pages = {454--476},
year = {1993},
url = {https://doi.org/10.1145/174130.174132},
doi = {10.1145/174130.174132},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KarloffR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LundFKN92,
author = {Carsten Lund and
Lance Fortnow and
Howard J. Karloff and
Noam Nisan},
title = {Algebraic Methods for Interactive Proof Systems},
journal = {J. {ACM}},
volume = {39},
number = {4},
pages = {859--868},
year = {1992},
url = {https://doi.org/10.1145/146585.146605},
doi = {10.1145/146585.146605},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LundFKN92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BernKRS92,
author = {Marshall W. Bern and
Howard J. Karloff and
Prabhakar Raghavan and
Baruch Schieber},
title = {Fast Geometric Approximation Techniques and Geometric Embedding Problems},
journal = {Theor. Comput. Sci.},
volume = {106},
number = {2},
pages = {265--281},
year = {1992},
url = {https://doi.org/10.1016/0304-3975(92)90252-B},
doi = {10.1016/0304-3975(92)90252-B},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BernKRS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlumKRS92,
author = {Avrim Blum and
Howard J. Karloff and
Yuval Rabani and
Michael E. Saks},
title = {A Decomposition Theorem and Bounds for Randomized Server Problems},
booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
Pennsylvania, USA, 24-27 October 1992},
pages = {197--207},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/SFCS.1992.267772},
doi = {10.1109/SFCS.1992.267772},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BlumKRS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BartalFKV92,
author = {Yair Bartal and
Amos Fiat and
Howard J. Karloff and
Rakesh Vohra},
editor = {S. Rao Kosaraju and
Mike Fellows and
Avi Wigderson and
John A. Ellis},
title = {New Algorithms for an Ancient Scheduling Problem},
booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
May 4-6, 1992, Victoria, British Columbia, Canada},
pages = {51--58},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/129712.129718},
doi = {10.1145/129712.129718},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BartalFKV92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/ChrobakKR91,
author = {Marek Chrobak and
Howard J. Karloff and
Tomasz Radzik},
title = {Connectivity vs. Reachability},
journal = {Inf. Comput.},
volume = {91},
number = {2},
pages = {177--188},
year = {1991},
url = {https://doi.org/10.1016/0890-5401(91)90065-A},
doi = {10.1016/0890-5401(91)90065-A},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/ChrobakKR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChrobakKPV91,
author = {Marek Chrobak and
Howard J. Karloff and
T. H. Payne and
Sundar Vishwanathan},
title = {New Results on Server Problems},
journal = {{SIAM} J. Discret. Math.},
volume = {4},
number = {2},
pages = {172--181},
year = {1991},
url = {https://doi.org/10.1137/0404017},
doi = {10.1137/0404017},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChrobakKPV91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FiatFKRRV91,
author = {Amos Fiat and
Dean P. Foster and
Howard J. Karloff and
Yuval Rabani and
Yiftach Ravid and
Sundar Vishwanathan},
title = {Competitive Algorithms for Layered Graph Traversal},
booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 1-4 October 1991},
pages = {288--297},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/SFCS.1991.185381},
doi = {10.1109/SFCS.1991.185381},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FiatFKRRV91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KarloffRR91,
author = {Howard J. Karloff and
Yuval Rabani and
Yiftach Ravid},
editor = {Cris Koutsougeras and
Jeffrey Scott Vitter},
title = {Lower Bounds for Randomized k-Server and Motion Planning Algorithms},
booktitle = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing,
May 5-8, 1991, New Orleans, Louisiana, {USA}},
pages = {278--288},
publisher = {{ACM}},
year = {1991},
url = {https://doi.org/10.1145/103418.103450},
doi = {10.1145/103418.103450},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KarloffRR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LundFKN90,
author = {Carsten Lund and
Lance Fortnow and
Howard J. Karloff and
Noam Nisan},
title = {Algebraic Methods for Interactive Proof Systems},
booktitle = {31st Annual Symposium on Foundations of Computer Science, St. Louis,
Missouri, USA, October 22-24, 1990, Volume {I}},
pages = {2--10},
publisher = {{IEEE} Computer Society},
year = {1990},
url = {https://doi.org/10.1109/FSCS.1990.89518},
doi = {10.1109/FSCS.1990.89518},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LundFKN90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BermanKT90,
author = {Piotr Berman and
Howard J. Karloff and
G{\'{a}}bor Tardos},
editor = {David S. Johnson},
title = {A Competitive 3-Server Algorithm},
booktitle = {Proceedings of the First Annual {ACM-SIAM} Symposium on Discrete Algorithms,
22-24 January 1990, San Francisco, California, {USA}},
pages = {280--290},
publisher = {{SIAM}},
year = {1990},
url = {http://dl.acm.org/citation.cfm?id=320176.320208},
timestamp = {Thu, 05 Jul 2018 07:28:50 +0200},
biburl = {https://dblp.org/rec/conf/soda/BermanKT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChrobakKPV90,
author = {Marek Chrobak and
Howard J. Karloff and
T. H. Payne and
Sundar Vishwanathan},
editor = {David S. Johnson},
title = {New Results on Server Problems},
booktitle = {Proceedings of the First Annual {ACM-SIAM} Symposium on Discrete Algorithms,
22-24 January 1990, San Francisco, California, {USA}},
pages = {291--300},
publisher = {{SIAM}},
year = {1990},
url = {http://dl.acm.org/citation.cfm?id=320176.320209},
timestamp = {Thu, 28 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChrobakKPV90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/RuzzoK89,
author = {Howard J. Karloff and
Walter L. Ruzzo},
title = {The Iterated Mod Problem},
journal = {Inf. Comput.},
volume = {80},
number = {3},
pages = {193--204},
year = {1989},
url = {https://doi.org/10.1016/0890-5401(89)90008-4},
doi = {10.1016/0890-5401(89)90008-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/RuzzoK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Karloff89,
author = {Howard J. Karloff},
title = {How Long can a Euclidean Traveling Salesman Tour Be?},
journal = {{SIAM} J. Discret. Math.},
volume = {2},
number = {1},
pages = {91--99},
year = {1989},
url = {https://doi.org/10.1137/0402010},
doi = {10.1137/0402010},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Karloff89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/ChrobakK89,
author = {Marek Chrobak and
Howard J. Karloff},
title = {A lower bound on the size of universal sets for planar graphs},
journal = {{SIGACT} News},
volume = {20},
number = {4},
pages = {83--86},
year = {1989},
url = {https://doi.org/10.1145/74074.74088},
doi = {10.1145/74074.74088},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/ChrobakK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Karloff89,
author = {Howard J. Karloff},
title = {An {NC} Algorithm for Brooks' Theorem},
journal = {Theor. Comput. Sci.},
volume = {68},
number = {1},
pages = {89--103},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90121-7},
doi = {10.1016/0304-3975(89)90121-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Karloff89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BernKRS89,
author = {Marshall W. Bern and
Howard J. Karloff and
Prabhakar Raghavan and
Baruch Schieber},
editor = {Kurt Mehlhorn},
title = {Fast Geometric Approximation Techniques and Geometric Embedding Problems},
booktitle = {Proceedings of the Fifth Annual Symposium on Computational Geometry,
Saarbr{\"{u}}cken, Germany, June 5-7, 1989},
pages = {292--301},
publisher = {{ACM}},
year = {1989},
url = {https://doi.org/10.1145/73833.73866},
doi = {10.1145/73833.73866},
timestamp = {Mon, 14 Jun 2021 16:25:09 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BernKRS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KarloffPS88,
author = {Howard J. Karloff and
Ramamohan Paturi and
Janos Simon},
title = {Universal Traversal Sequences of Length n{\^{}}O(log n) for Cliques},
journal = {Inf. Process. Lett.},
volume = {28},
number = {5},
pages = {241--243},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90197-4},
doi = {10.1016/0020-0190(88)90197-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/KarloffPS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KarloffR88,
author = {Howard J. Karloff and
Prabhakar Raghavan},
editor = {Janos Simon},
title = {Randomized Algorithms and Pseudorandom Numbers},
booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing,
May 2-4, 1988, Chicago, Illinois, {USA}},
pages = {310--321},
publisher = {{ACM}},
year = {1988},
url = {https://doi.org/10.1145/62212.62242},
doi = {10.1145/62212.62242},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KarloffR88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KarloffS87,
author = {Howard J. Karloff and
David B. Shmoys},
title = {Efficient Parallel Algorithms for Edge Coloring Problems},
journal = {J. Algorithms},
volume = {8},
number = {1},
pages = {39--52},
year = {1987},
url = {https://doi.org/10.1016/0196-6774(87)90026-5},
doi = {10.1016/0196-6774(87)90026-5},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/KarloffS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BoyarK87,
author = {Joan Boyar and
Howard J. Karloff},
title = {Coloring Planar Graphs in Parallel},
journal = {J. Algorithms},
volume = {8},
number = {4},
pages = {470--479},
year = {1987},
url = {https://doi.org/10.1016/0196-6774(87)90046-0},
doi = {10.1016/0196-6774(87)90046-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BoyarK87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Karloff86,
author = {Howard J. Karloff},
title = {A Las Vegas {RNC} algorithm for maximum matching},
journal = {Comb.},
volume = {6},
number = {4},
pages = {387--391},
year = {1986},
url = {https://doi.org/10.1007/BF02579264},
doi = {10.1007/BF02579264},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Karloff86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-21 16:50 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:
