default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Joan Boyar
@article{DBLP:journals/algorithmica/BoyarFL24,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
title = {Online Unit Profit Knapsack with Predictions},
journal = {Algorithmica},
volume = {86},
number = {9},
pages = {2786--2821},
year = {2024},
url = {https://doi.org/10.1007/s00453-024-01239-y},
doi = {10.1007/S00453-024-01239-Y},
timestamp = {Tue, 10 Sep 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarFL24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoyarLP24,
author = {Joan Boyar and
Kim S. Larsen and
Denis Pankratov},
title = {Advice complexity of adaptive priority algorithms},
journal = {Theor. Comput. Sci.},
volume = {984},
pages = {114318},
year = {2024},
url = {https://doi.org/10.1016/j.tcs.2023.114318},
doi = {10.1016/J.TCS.2023.114318},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BoyarLP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoyarKLLLP24,
author = {Joan Boyar and
Shahin Kamali and
Kim S. Larsen and
Ali Mohammad Lavasani and
Yaqiao Li and
Denis Pankratov},
editor = {Hans L. Bodlaender},
title = {On the Online Weighted Non-Crossing Matching Problem},
booktitle = {19th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2024, June 12-14, 2024, Helsinki, Finland},
series = {LIPIcs},
volume = {294},
pages = {16:1--16:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2024.16},
doi = {10.4230/LIPICS.SWAT.2024.16},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoyarKLLLP24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2406-18265,
author = {Magnus Berg and
Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
title = {Complexity Classes for Online Problems with and without Predictions},
journal = {CoRR},
volume = {abs/2406.18265},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2406.18265},
doi = {10.48550/ARXIV.2406.18265},
eprinttype = {arXiv},
eprint = {2406.18265},
timestamp = {Mon, 22 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2406-18265.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/0001B0FHL0S23,
author = {Antonios Antoniadis and
Joan Boyar and
Marek Eli{\'{a}}s and
Lene Monrad Favrholdt and
Ruben Hoeksma and
Kim S. Larsen and
Adam Polak and
Bertrand Simon},
editor = {Andreas Krause and
Emma Brunskill and
Kyunghyun Cho and
Barbara Engelhardt and
Sivan Sabato and
Jonathan Scarlett},
title = {Paging with Succinct Predictions},
booktitle = {International Conference on Machine Learning, {ICML} 2023, 23-29 July
2023, Honolulu, Hawaii, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {202},
pages = {952--968},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v202/antoniadis23a.html},
timestamp = {Fri, 12 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icml/0001B0FHL0S23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latincrypt/BoyarELN23,
author = {Joan Boyar and
Simon Erfurth and
Kim S. Larsen and
Ruben Niederhagen},
editor = {Abdelrahaman Aly and
Mehdi Tibouchi},
title = {Quotable Signatures for Authenticating Shared Quotes},
booktitle = {Progress in Cryptology - {LATINCRYPT} 2023 - 8th International Conference
on Cryptology and Information Security in Latin America, {LATINCRYPT}
2023, Quito, Ecuador, October 3-6, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14168},
pages = {273--292},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-44469-2\_14},
doi = {10.1007/978-3-031-44469-2\_14},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latincrypt/BoyarELN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Boyar23,
author = {Joan Boyar},
editor = {J{\'{e}}r{\^{o}}me Leroux and
Sylvain Lombardy and
David Peleg},
title = {Online Algorithms with Predictions (Invited Talk)},
booktitle = {48th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2023, August 28 to September 1, 2023, Bordeaux, France},
series = {LIPIcs},
volume = {272},
pages = {2:1--2:2},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2023.2},
doi = {10.4230/LIPICS.MFCS.2023.2},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Boyar23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BergBFL23,
author = {Magnus Berg and
Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
editor = {Pat Morin and
Subhash Suri},
title = {Online Minimum Spanning Trees with Weight Predictions},
booktitle = {Algorithms and Data Structures - 18th International Symposium, {WADS}
2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14079},
pages = {136--148},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-38906-1\_10},
doi = {10.1007/978-3-031-38906-1\_10},
timestamp = {Sat, 05 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BergBFL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoyarFKL23,
author = {Joan Boyar and
Lene M. Favrholdt and
Shahin Kamali and
Kim S. Larsen},
editor = {Pat Morin and
Subhash Suri},
title = {Online Interval Scheduling with Predictions},
booktitle = {Algorithms and Data Structures - 18th International Symposium, {WADS}
2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14079},
pages = {193--207},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-38906-1\_14},
doi = {10.1007/978-3-031-38906-1\_14},
timestamp = {Sat, 05 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BoyarFKL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-12029,
author = {Magnus Berg and
Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
title = {Online Minimum Spanning Trees with Weight Predictions},
journal = {CoRR},
volume = {abs/2302.12029},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.12029},
doi = {10.48550/ARXIV.2302.12029},
eprinttype = {arXiv},
eprint = {2302.12029},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-12029.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-13701,
author = {Joan Boyar and
Lene M. Favrholdt and
Shahin Kamali and
Kim S. Larsen},
title = {Online Interval Scheduling with Predictions},
journal = {CoRR},
volume = {abs/2302.13701},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.13701},
doi = {10.48550/ARXIV.2302.13701},
eprinttype = {arXiv},
eprint = {2302.13701},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-13701.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoyarFKL22,
author = {Joan Boyar and
Lene M. Favrholdt and
Michal Kotrbc{\'{\i}}k and
Kim S. Larsen},
title = {Relaxing the Irrevocability Requirement for Online Graph Algorithms},
journal = {Algorithmica},
volume = {84},
number = {7},
pages = {1916--1951},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00944-w},
doi = {10.1007/S00453-022-00944-W},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarFKL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csur/BoyarFL21,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
title = {Relative Worst-order Analysis: {A} Survey},
journal = {{ACM} Comput. Surv.},
volume = {54},
number = {1},
pages = {8:1--8:21},
year = {2022},
url = {https://doi.org/10.1145/3425910},
doi = {10.1145/3425910},
timestamp = {Wed, 23 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/csur/BoyarFL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoyarFL22,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
editor = {Artur Czumaj and
Qin Xin},
title = {Online Unit Profit Knapsack with Untrusted Predictions},
booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2022, June 27-29, 2022, T{\'{o}}rshavn, Faroe Islands},
series = {LIPIcs},
volume = {227},
pages = {20:1--20:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2022.20},
doi = {10.4230/LIPICS.SWAT.2022.20},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoyarFL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-00285,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
title = {Online Unit Profit Knapsack with Untrusted Predictions},
journal = {CoRR},
volume = {abs/2203.00285},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.00285},
doi = {10.48550/ARXIV.2203.00285},
eprinttype = {arXiv},
eprint = {2203.00285},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-00285.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-02775,
author = {Antonios Antoniadis and
Joan Boyar and
Marek Eli{\'{a}}s and
Lene M. Favrholdt and
Ruben Hoeksma and
Kim S. Larsen and
Adam Polak and
Bertrand Simon},
title = {Paging with Succinct Predictions},
journal = {CoRR},
volume = {abs/2210.02775},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.02775},
doi = {10.48550/ARXIV.2210.02775},
eprinttype = {arXiv},
eprint = {2210.02775},
timestamp = {Fri, 12 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-02775.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-10963,
author = {Joan Boyar and
Simon Erfurth and
Kim S. Larsen and
Ruben Niederhagen},
title = {Quotable Signatures for Authenticating Shared Quotes},
journal = {CoRR},
volume = {abs/2212.10963},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.10963},
doi = {10.48550/ARXIV.2212.10963},
eprinttype = {arXiv},
eprint = {2212.10963},
timestamp = {Wed, 04 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-10963.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoyarFKL21,
author = {Joan Boyar and
Lene M. Favrholdt and
Shahin Kamali and
Kim S. Larsen},
title = {Online Bin Covering with Advice},
journal = {Algorithmica},
volume = {83},
number = {3},
pages = {795--821},
year = {2021},
url = {https://doi.org/10.1007/s00453-020-00728-0},
doi = {10.1007/S00453-020-00728-0},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarFKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BoyarEL20,
author = {Joan Boyar and
Faith Ellen and
Kim S. Larsen},
title = {Randomized distributed online algorithms against adaptive offline
adversaries},
journal = {Inf. Process. Lett.},
volume = {161},
pages = {105973},
year = {2020},
url = {https://doi.org/10.1016/j.ipl.2020.105973},
doi = {10.1016/J.IPL.2020.105973},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BoyarEL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BorodinBLP20,
author = {Allan Borodin and
Joan Boyar and
Kim S. Larsen and
Denis Pankratov},
title = {Advice Complexity of Priority Algorithms},
journal = {Theory Comput. Syst.},
volume = {64},
number = {4},
pages = {593--625},
year = {2020},
url = {https://doi.org/10.1007/s00224-019-09955-7},
doi = {10.1007/S00224-019-09955-7},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BorodinBLP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoyarEFKL19,
author = {Joan Boyar and
Stephan J. Eidenbenz and
Lene M. Favrholdt and
Michal Kotrbc{\'{\i}}k and
Kim S. Larsen},
title = {Online Dominating Set},
journal = {Algorithmica},
volume = {81},
number = {5},
pages = {1938--1964},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0519-1},
doi = {10.1007/S00453-018-0519-1},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarEFKL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ccds/BoyarFP19,
author = {Joan Boyar and
Magnus Gausdal Find and
Ren{\'{e}} Peralta},
title = {Small low-depth circuits for cryptographic applications},
journal = {Cryptogr. Commun.},
volume = {11},
number = {1},
pages = {109--127},
year = {2019},
url = {https://doi.org/10.1007/s12095-018-0296-3},
doi = {10.1007/S12095-018-0296-3},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ccds/BoyarFP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BoyarE19,
author = {Joan Boyar and
Faith Ellen},
title = {Tight Bounds for Restricted Grid Scheduling},
journal = {Int. J. Found. Comput. Sci.},
volume = {30},
number = {3},
pages = {375--405},
year = {2019},
url = {https://doi.org/10.1142/S0129054119500102},
doi = {10.1142/S0129054119500102},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BoyarE19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoyarFKL19,
author = {Joan Boyar and
Lene M. Favrholdt and
Shahin Kamali and
Kim S. Larsen},
editor = {Zachary Friggstad and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Mohammad R. Salavatipour},
title = {Online Bin Covering with Advice},
booktitle = {Algorithms and Data Structures - 16th International Symposium, {WADS}
2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11646},
pages = {225--238},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24766-9\_17},
doi = {10.1007/978-3-030-24766-9\_17},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BoyarFKL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-00066,
author = {Joan Boyar and
Lene M. Favrholdt and
Shahin Kamali and
Kim S. Larsen},
title = {Online Bin Covering with Advice},
journal = {CoRR},
volume = {abs/1905.00066},
year = {2019},
url = {http://arxiv.org/abs/1905.00066},
eprinttype = {arXiv},
eprint = {1905.00066},
timestamp = {Mon, 27 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-00066.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1910-00868,
author = {Joan Boyar and
Kim S. Larsen and
Denis Pankratov},
title = {Advice Complexity of Adaptive Priority Algorithms},
journal = {CoRR},
volume = {abs/1910.00868},
year = {2019},
url = {http://arxiv.org/abs/1910.00868},
eprinttype = {arXiv},
eprint = {1910.00868},
timestamp = {Fri, 04 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1910-00868.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoyarEFLL18,
author = {Joan Boyar and
Leah Epstein and
Lene M. Favrholdt and
Kim S. Larsen and
Asaf Levin},
title = {Batch Coloring of Graphs},
journal = {Algorithmica},
volume = {80},
number = {11},
pages = {3293--3315},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0386-1},
doi = {10.1007/S00453-017-0386-1},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarEFLL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BoyarK18,
author = {Joan Boyar and
Christian Kudahl},
title = {Adding isolated vertices makes some greedy online algorithms optimal},
journal = {Discret. Appl. Math.},
volume = {246},
pages = {12--21},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.02.025},
doi = {10.1016/J.DAM.2017.02.025},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BoyarK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BoyarFKM18,
author = {Joan Boyar and
Lene M. Favrholdt and
Christian Kudahl and
Jesper W. Mikkelsen},
title = {Weighted Online Problems with Advice},
journal = {Theory Comput. Syst.},
volume = {62},
number = {6},
pages = {1443--1469},
year = {2018},
url = {https://doi.org/10.1007/s00224-017-9806-5},
doi = {10.1007/S00224-017-9806-5},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/BoyarFKM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BoyarEFLL18,
author = {Joan Boyar and
Leah Epstein and
Lene M. Favrholdt and
Kim S. Larsen and
Asaf Levin},
title = {Online-bounded analysis},
journal = {J. Sched.},
volume = {21},
number = {4},
pages = {429--441},
year = {2018},
url = {https://doi.org/10.1007/s10951-017-0536-y},
doi = {10.1007/S10951-017-0536-Y},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BoyarEFLL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoyarF18,
author = {Joan Boyar and
Magnus Gausdal Find},
title = {Multiplicative complexity of vector valued Boolean functions},
journal = {Theor. Comput. Sci.},
volume = {720},
pages = {36--46},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2018.02.023},
doi = {10.1016/J.TCS.2018.02.023},
timestamp = {Tue, 20 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BoyarF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/BoyarFL18,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
editor = {Hans{-}Joachim B{\"{o}}ckenhauer and
Dennis Komm and
Walter Unger},
title = {Relative Worst-Order Analysis: {A} Survey},
booktitle = {Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated
to Juraj Hromkovi{\v{c}} on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {11011},
pages = {216--230},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-98355-4\_13},
doi = {10.1007/978-3-319-98355-4\_13},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/BoyarFL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BorodinBLP18,
author = {Allan Borodin and
Joan Boyar and
Kim S. Larsen and
Denis Pankratov},
editor = {Leah Epstein and
Thomas Erlebach},
title = {Advice Complexity of Priority Algorithms},
booktitle = {Approximation and Online Algorithms - 16th International Workshop,
{WAOA} 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {11312},
pages = {69--86},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-04693-4\_5},
doi = {10.1007/978-3-030-04693-4\_5},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BorodinBLP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-07080,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
title = {Relative Worst-Order Analysis: {A} Survey},
journal = {CoRR},
volume = {abs/1802.07080},
year = {2018},
url = {http://arxiv.org/abs/1802.07080},
eprinttype = {arXiv},
eprint = {1802.07080},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-07080.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-06223,
author = {Allan Borodin and
Joan Boyar and
Kim S. Larsen and
Denis Pankratov},
title = {Advice Complexity of Priority Algorithms},
journal = {CoRR},
volume = {abs/1806.06223},
year = {2018},
url = {http://arxiv.org/abs/1806.06223},
eprinttype = {arXiv},
eprint = {1806.06223},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-06223.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-06820,
author = {Joan Boyar and
Faith Ellen and
Kim S. Larsen},
title = {The Scheduler is Very Powerful in Competitive Analysis of Distributed
List Accessing},
journal = {CoRR},
volume = {abs/1807.06820},
year = {2018},
url = {http://arxiv.org/abs/1807.06820},
eprinttype = {arXiv},
eprint = {1807.06820},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-06820.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csur/BoyarFKLM17,
author = {Joan Boyar and
Lene M. Favrholdt and
Christian Kudahl and
Kim S. Larsen and
Jesper W. Mikkelsen},
title = {Online Algorithms with Advice: {A} Survey},
journal = {{ACM} Comput. Surv.},
volume = {50},
number = {2},
pages = {19:1--19:34},
year = {2017},
url = {https://doi.org/10.1145/3056461},
doi = {10.1145/3056461},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/csur/BoyarFKLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BoyarKLL17,
author = {Joan Boyar and
Shahin Kamali and
Kim S. Larsen and
Alejandro L{\'{o}}pez{-}Ortiz},
title = {On the list update problem with advice},
journal = {Inf. Comput.},
volume = {253},
pages = {411--423},
year = {2017},
url = {https://doi.org/10.1016/j.ic.2016.06.007},
doi = {10.1016/J.IC.2016.06.007},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/BoyarKLL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BoyarFKM17,
author = {Joan Boyar and
Lene M. Favrholdt and
Christian Kudahl and
Jesper W. Mikkelsen},
title = {The Advice Complexity of a Class of Hard Online Problems},
journal = {Theory Comput. Syst.},
volume = {61},
number = {4},
pages = {1128--1177},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9688-y},
doi = {10.1007/S00224-016-9688-Y},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BoyarFKM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoyarFKL17,
author = {Joan Boyar and
Lene M. Favrholdt and
Michal Kotrbc{\'{\i}}k and
Kim S. Larsen},
editor = {Faith Ellen and
Antonina Kolokolova and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Relaxing the Irrevocability Requirement for Online Graph Algorithms},
booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS}
2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10389},
pages = {217--228},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-62127-2\_19},
doi = {10.1007/978-3-319-62127-2\_19},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BoyarFKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyarFLK17,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen and
Michal Kotrbc{\'{\i}}k},
title = {Relaxing the Irrevocability Requirement for Online Graph Algorithms},
journal = {CoRR},
volume = {abs/1704.08835},
year = {2017},
url = {http://arxiv.org/abs/1704.08835},
eprinttype = {arXiv},
eprint = {1704.08835},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoyarFLK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoyarKLL16,
author = {Joan Boyar and
Shahin Kamali and
Kim S. Larsen and
Alejandro L{\'{o}}pez{-}Ortiz},
title = {Online Bin Packing with Advice},
journal = {Algorithmica},
volume = {74},
number = {1},
pages = {507--527},
year = {2016},
url = {https://doi.org/10.1007/s00453-014-9955-8},
doi = {10.1007/S00453-014-9955-8},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarKLL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ccds/BoyarFP16,
author = {Joan Boyar and
Magnus Gausdal Find and
Ren{\'{e}} Peralta},
title = {On various nonlinearity measures for boolean functions},
journal = {Cryptogr. Commun.},
volume = {8},
number = {3},
pages = {313--330},
year = {2016},
url = {https://doi.org/10.1007/s12095-015-0150-9},
doi = {10.1007/S12095-015-0150-9},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ccds/BoyarFP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/BoyarFKLM16,
author = {Joan Boyar and
Lene M. Favrholdt and
Christian Kudahl and
Kim S. Larsen and
Jesper W. Mikkelsen},
title = {Online Algorithms with Advice: {A} Survey},
journal = {{SIGACT} News},
volume = {47},
number = {3},
pages = {93--129},
year = {2016},
url = {https://doi.org/10.1145/2993749.2993766},
doi = {10.1145/2993749.2993766},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/BoyarFKLM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BoyarEFLL16,
author = {Joan Boyar and
Leah Epstein and
Lene M. Favrholdt and
Kim S. Larsen and
Asaf Levin},
editor = {Alexander S. Kulikov and
Gerhard J. Woeginger},
title = {Online Bounded Analysis},
booktitle = {Computer Science - Theory and Applications - 11th International Computer
Science Symposium in Russia, {CSR} 2016, St. Petersburg, Russia, June
9-13, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9691},
pages = {131--145},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-34171-2\_10},
doi = {10.1007/978-3-319-34171-2\_10},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/BoyarEFLL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BoyarFKM16,
author = {Joan Boyar and
Lene M. Favrholdt and
Christian Kudahl and
Jesper W. Mikkelsen},
editor = {Veli M{\"{a}}kinen and
Simon J. Puglisi and
Leena Salmela},
title = {Weighted Online Problems with Advice},
booktitle = {Combinatorial Algorithms - 27th International Workshop, {IWOCA} 2016,
Helsinki, Finland, August 17-19, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9843},
pages = {179--190},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-44543-4\_14},
doi = {10.1007/978-3-319-44543-4\_14},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/BoyarFKM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoyarEFKL16,
author = {Joan Boyar and
Stephan J. Eidenbenz and
Lene M. Favrholdt and
Michal Kotrbc{\'{\i}}k and
Kim S. Larsen},
editor = {Rasmus Pagh},
title = {Online Dominating Set},
booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2016, June 22-24, 2016, Reykjavik, Iceland},
series = {LIPIcs},
volume = {53},
pages = {21:1--21:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.21},
doi = {10.4230/LIPICS.SWAT.2016.21},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoyarEFKL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BoyarEFLL16,
author = {Joan Boyar and
Leah Epstein and
Lene M. Favrholdt and
Kim S. Larsen and
Asaf Levin},
editor = {Klaus Jansen and
Monaldo Mastrolilli},
title = {Batch Coloring of Graphs},
booktitle = {Approximation and Online Algorithms - 14th International Workshop,
{WAOA} 2016, Aarhus, Denmark, August 25-26, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {10138},
pages = {52--64},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-51741-4\_5},
doi = {10.1007/978-3-319-51741-4\_5},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BoyarEFLL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyarEFLL16,
author = {Joan Boyar and
Leah Epstein and
Lene M. Favrholdt and
Kim S. Larsen and
Asaf Levin},
title = {Online Bounded Analysis},
journal = {CoRR},
volume = {abs/1602.06708},
year = {2016},
url = {http://arxiv.org/abs/1602.06708},
eprinttype = {arXiv},
eprint = {1602.06708},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoyarEFLL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyarEFKL16,
author = {Joan Boyar and
Stephan J. Eidenbenz and
Lene M. Favrholdt and
Michal Kotrbc{\'{\i}}k and
Kim S. Larsen},
title = {Online Dominating Set},
journal = {CoRR},
volume = {abs/1604.05172},
year = {2016},
url = {http://arxiv.org/abs/1604.05172},
eprinttype = {arXiv},
eprint = {1604.05172},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoyarEFKL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyarFKM16,
author = {Joan Boyar and
Lene M. Favrholdt and
Christian Kudahl and
Jesper W. Mikkelsen},
title = {Weighted Online Problems with Advice},
journal = {CoRR},
volume = {abs/1606.05210},
year = {2016},
url = {http://arxiv.org/abs/1606.05210},
eprinttype = {arXiv},
eprint = {1606.05210},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoyarFKM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyarEFLL16a,
author = {Joan Boyar and
Leah Epstein and
Lene M. Favrholdt and
Kim S. Larsen and
Asaf Levin},
title = {Batch Coloring of Graphs},
journal = {CoRR},
volume = {abs/1610.02997},
year = {2016},
url = {http://arxiv.org/abs/1610.02997},
eprinttype = {arXiv},
eprint = {1610.02997},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoyarEFLL16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoyarIL15,
author = {Joan Boyar and
Sandy Irani and
Kim S. Larsen},
title = {A Comparison of Performance Measures for Online Algorithms},
journal = {Algorithmica},
volume = {72},
number = {4},
pages = {969--994},
year = {2015},
url = {https://doi.org/10.1007/s00453-014-9884-6},
doi = {10.1007/S00453-014-9884-6},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarIL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BoyarLM15,
author = {Joan Boyar and
Kim S. Larsen and
Abyayananda Maiti},
title = {The Frequent Items Problem in Online Streaming Under Various Performance
Measures},
journal = {Int. J. Found. Comput. Sci.},
volume = {26},
number = {4},
pages = {413--440},
year = {2015},
url = {https://doi.org/10.1142/S0129054115500239},
doi = {10.1142/S0129054115500239},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/BoyarLM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoyarGL15,
author = {Joan Boyar and
Sushmita Gupta and
Kim S. Larsen},
title = {Relative interval analysis of paging algorithms on access graphs},
journal = {Theor. Comput. Sci.},
volume = {568},
pages = {28--48},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2014.11.035},
doi = {10.1016/J.TCS.2014.11.035},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BoyarGL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoyarF15,
author = {Joan Boyar and
Magnus Gausdal Find},
title = {Cancellation-free circuits in unbounded and bounded depth},
journal = {Theor. Comput. Sci.},
volume = {590},
pages = {17--26},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2014.10.014},
doi = {10.1016/J.TCS.2014.10.014},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BoyarF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BoyarF15,
author = {Joan Boyar and
Magnus Gausdal Find},
editor = {Adrian Kosowski and
Igor Walukiewicz},
title = {Constructive Relationships Between Algebraic Thickness and Normality},
booktitle = {Fundamentals of Computation Theory - 20th International Symposium,
{FCT} 2015, Gda{\'{n}}sk, Poland, August 17-19, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9210},
pages = {106--117},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-22177-9\_9},
doi = {10.1007/978-3-319-22177-9\_9},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/BoyarF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BoyarK15,
author = {Joan Boyar and
Christian Kudahl},
editor = {Zsuzsanna Lipt{\'{a}}k and
William F. Smyth},
title = {Adding Isolated Vertices Makes Some Online Algorithms Optimal},
booktitle = {Combinatorial Algorithms - 26th International Workshop, {IWOCA} 2015,
Verona, Italy, October 5-7, 2015, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9538},
pages = {65--76},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-29516-9\_6},
doi = {10.1007/978-3-319-29516-9\_6},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/BoyarK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BoyarFKM15,
author = {Joan Boyar and
Lene M. Favrholdt and
Christian Kudahl and
Jesper W. Mikkelsen},
editor = {Ernst W. Mayr and
Nicolas Ollinger},
title = {Advice Complexity for a Class of Online Problems},
booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2015, March 4-7, 2015, Garching, Germany},
series = {LIPIcs},
volume = {30},
pages = {116--129},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.STACS.2015.116},
doi = {10.4230/LIPICS.STACS.2015.116},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BoyarFKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyarK15,
author = {Joan Boyar and
Christian Kudahl},
title = {Adding Isolated Vertices Makes some Online Algorithms Optimal},
journal = {CoRR},
volume = {abs/1506.08592},
year = {2015},
url = {http://arxiv.org/abs/1506.08592},
eprinttype = {arXiv},
eprint = {1506.08592},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoyarK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoyarLM14,
author = {Joan Boyar and
Kim S. Larsen and
Abyayananda Maiti},
title = {A comparison of performance measures via online search},
journal = {Theor. Comput. Sci.},
volume = {532},
pages = {2--13},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2013.07.022},
doi = {10.1016/J.TCS.2013.07.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BoyarLM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/BoyarKLL14,
author = {Joan Boyar and
Shahin Kamali and
Kim S. Larsen and
Alejandro L{\'{o}}pez{-}Ortiz},
editor = {Adrian{-}Horia Dediu and
Carlos Mart{\'{\i}}n{-}Vide and
Jos{\'{e}} Luis Sierra{-}Rodr{\'{\i}}guez and
Bianca Truthe},
title = {On the List Update Problem with Advice},
booktitle = {Language and Automata Theory and Applications - 8th International
Conference, {LATA} 2014, Madrid, Spain, March 10-14, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8370},
pages = {210--221},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-04921-2\_17},
doi = {10.1007/978-3-319-04921-2\_17},
timestamp = {Sun, 02 Oct 2022 16:11:11 +0200},
biburl = {https://dblp.org/rec/conf/lata/BoyarKLL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BoyarF14,
author = {Joan Boyar and
Magnus Gausdal Find},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {The Relationship between Multiplicative Complexity and Nonlinearity},
booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International
Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {8635},
pages = {130--140},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44465-8\_12},
doi = {10.1007/978-3-662-44465-8\_12},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BoyarF14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BoyarKLL14,
author = {Joan Boyar and
Shahin Kamali and
Kim S. Larsen and
Alejandro L{\'{o}}pez{-}Ortiz},
editor = {Ernst W. Mayr and
Natacha Portier},
title = {Online Bin Packing with Advice},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science
{(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France},
series = {LIPIcs},
volume = {25},
pages = {174--186},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.STACS.2014.174},
doi = {10.4230/LIPICS.STACS.2014.174},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BoyarKLL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyarE14,
author = {Joan Boyar and
Faith Ellen},
title = {Tight Bounds for an Online Bin Packing Problem},
journal = {CoRR},
volume = {abs/1404.7325},
year = {2014},
url = {http://arxiv.org/abs/1404.7325},
eprinttype = {arXiv},
eprint = {1404.7325},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoyarE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyarF14,
author = {Joan Boyar and
Magnus Gausdal Find},
title = {The Relationship Between Multiplicative Complexity and Nonlinearity},
journal = {CoRR},
volume = {abs/1407.6169},
year = {2014},
url = {http://arxiv.org/abs/1407.6169},
eprinttype = {arXiv},
eprint = {1407.6169},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoyarF14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyarFKM14,
author = {Joan Boyar and
Lene M. Favrholdt and
Christian Kudahl and
Jesper W. Mikkelsen},
title = {The Advice Complexity of a Class of Hard Online Problems},
journal = {CoRR},
volume = {abs/1408.7033},
year = {2014},
url = {http://arxiv.org/abs/1408.7033},
eprinttype = {arXiv},
eprint = {1408.7033},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoyarFKM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyarF14a,
author = {Joan Boyar and
Magnus Gausdal Find},
title = {Constructive Relationships Between Algebraic Thickness and Normality},
journal = {CoRR},
volume = {abs/1410.1318},
year = {2014},
url = {http://arxiv.org/abs/1410.1318},
eprinttype = {arXiv},
eprint = {1410.1318},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoyarF14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/BoyarMP13,
author = {Joan Boyar and
Philip Matthews and
Ren{\'{e}} Peralta},
title = {Logic Minimization Techniques with Applications to Cryptology},
journal = {J. Cryptol.},
volume = {26},
number = {2},
pages = {280--312},
year = {2013},
url = {https://doi.org/10.1007/s00145-012-9124-7},
doi = {10.1007/S00145-012-9124-7},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/joc/BoyarMP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/BoyarE13,
author = {Joan Boyar and
Faith Ellen},
editor = {Andrej Brodnik and
Alejandro L{\'{o}}pez{-}Ortiz and
Venkatesh Raman and
Alfredo Viola},
title = {Bounds for Scheduling Jobs on Grid Processors},
booktitle = {Space-Efficient Data Structures, Streams, and Algorithms - Papers
in Honor of J. Ian Munro on the Occasion of His 66th Birthday},
series = {Lecture Notes in Computer Science},
volume = {8066},
pages = {12--26},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40273-9\_2},
doi = {10.1007/978-3-642-40273-9\_2},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/birthday/BoyarE13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BoyarFP13,
author = {Joan Boyar and
Magnus Find and
Ren{\'{e}} Peralta},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Four Measures of Nonlinearity},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {61--72},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_6},
doi = {10.1007/978-3-642-38233-8\_6},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BoyarFP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BoyarLM13,
author = {Joan Boyar and
Kim S. Larsen and
Abyayananda Maiti},
editor = {Leszek Gasieniec and
Frank Wolter},
title = {The Frequent Items Problem in Online Streaming under Various Performance
Measures},
booktitle = {Fundamentals of Computation Theory - 19th International Symposium,
{FCT} 2013, Liverpool, UK, August 19-21, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8070},
pages = {60--71},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40164-0\_9},
doi = {10.1007/978-3-642-40164-0\_9},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/BoyarLM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BoyarF13,
author = {Joan Boyar and
Magnus Gausdal Find},
editor = {Leszek Gasieniec and
Frank Wolter},
title = {Cancellation-Free Circuits in Unbounded and Bounded Depth},
booktitle = {Fundamentals of Computation Theory - 19th International Symposium,
{FCT} 2013, Liverpool, UK, August 19-21, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8070},
pages = {159--170},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40164-0\_17},
doi = {10.1007/978-3-642-40164-0\_17},
timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/BoyarF13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoyarGL13,
author = {Joan Boyar and
Sushmita Gupta and
Kim S. Larsen},
editor = {Frank Dehne and
Roberto Solis{-}Oba and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Relative Interval Analysis of Paging Algorithms on Access Graphs},
booktitle = {Algorithms and Data Structures - 13th International Symposium, {WADS}
2013, London, ON, Canada, August 12-14, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8037},
pages = {195--206},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40104-6\_17},
doi = {10.1007/978-3-642-40104-6\_17},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BoyarGL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-0669,
author = {Joan Boyar and
Sushmita Gupta and
Kim S. Larsen},
title = {Relative Interval Analysis of Paging Algorithms on Access Graphs},
journal = {CoRR},
volume = {abs/1305.0669},
year = {2013},
url = {http://arxiv.org/abs/1305.0669},
eprinttype = {arXiv},
eprint = {1305.0669},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-0669.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-3041,
author = {Joan Boyar and
Magnus Find},
title = {Cancellation-Free Circuits in Unbounded and Bounded Depth},
journal = {CoRR},
volume = {abs/1305.3041},
year = {2013},
url = {http://arxiv.org/abs/1305.3041},
eprinttype = {arXiv},
eprint = {1305.3041},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-3041.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyarLM13,
author = {Joan Boyar and
Kim S. Larsen and
Abyayananda Maiti},
title = {The Frequent Items Problem in Online Streaming under Various Performance
Measures},
journal = {CoRR},
volume = {abs/1306.0771},
year = {2013},
url = {http://arxiv.org/abs/1306.0771},
eprinttype = {arXiv},
eprint = {1306.0771},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoyarLM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BoyarKLL13,
author = {Joan Boyar and
Shahin Kamali and
Kim S. Larsen and
Alejandro L{\'{o}}pez{-}Ortiz},
title = {On the List Update Problem with Advice},
journal = {CoRR},
volume = {abs/1311.7357},
year = {2013},
url = {http://arxiv.org/abs/1311.7357},
eprinttype = {arXiv},
eprint = {1311.7357},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BoyarKLL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BoyarFP13,
author = {Joan Boyar and
Magnus Find and
Ren{\'{e}} Peralta},
title = {Four Measures of Nonlinearity},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {633},
year = {2013},
url = {http://eprint.iacr.org/2013/633},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iacr/BoyarFP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BoyarDE12,
author = {Joan Boyar and
Gy{\"{o}}rgy D{\'{o}}sa and
Leah Epstein},
title = {On the absolute approximation ratio for First Fit and related results},
journal = {Discret. Appl. Math.},
volume = {160},
number = {13-14},
pages = {1914--1923},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2012.04.012},
doi = {10.1016/J.DAM.2012.04.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BoyarDE12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BoyarF12,
author = {Joan Boyar and
Lene M. Favrholdt},
title = {A new variable-sized bin packing problem},
journal = {J. Sched.},
volume = {15},
number = {3},
pages = {273--287},
year = {2012},
url = {https://doi.org/10.1007/s10951-010-0199-4},
doi = {10.1007/S10951-010-0199-4},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BoyarF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/BoyarLM12,
author = {Joan Boyar and
Kim S. Larsen and
Abyayananda Maiti},
editor = {Jack Snoeyink and
Pinyan Lu and
Kaile Su and
Lusheng Wang},
title = {A Comparison of Performance Measures via Online Search},
booktitle = {Frontiers in Algorithmics and Algorithmic Aspects in Information and
Management - Joint International Conference, {FAW-AAIM} 2012, Beijing,
China, May 14-16, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7285},
pages = {303--314},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29700-7\_28},
doi = {10.1007/978-3-642-29700-7\_28},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaim/BoyarLM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sec/BoyarP12,
author = {Joan Boyar and
Ren{\'{e}} Peralta},
editor = {Dimitris Gritzalis and
Steven Furnell and
Marianthi Theoharidou},
title = {A Small Depth-16 Circuit for the {AES} S-Box},
booktitle = {Information Security and Privacy Research - 27th {IFIP} {TC} 11 Information
Security and Privacy Conference, {SEC} 2012, Heraklion, Crete, Greece,
June 4-6, 2012. Proceedings},
series = {{IFIP} Advances in Information and Communication Technology},
volume = {376},
pages = {287--298},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30436-1\_24},
doi = {10.1007/978-3-642-30436-1\_24},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sec/BoyarP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoyarGL12,
author = {Joan Boyar and
Sushmita Gupta and
Kim S. Larsen},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Access Graphs Results for {LRU} versus {FIFO} under Relative Worst
Order Analysis},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {328--339},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_29},
doi = {10.1007/978-3-642-31155-0\_29},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoyarGL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-4047,
author = {Joan Boyar and
Sushmita Gupta and
Kim S. Larsen},
title = {Access Graphs Results for {LRU} versus {FIFO} under Relative Worst
Order Analysis},
journal = {CoRR},
volume = {abs/1204.4047},
year = {2012},
url = {http://arxiv.org/abs/1204.4047},
eprinttype = {arXiv},
eprint = {1204.4047},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-4047.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-5321,
author = {Joan Boyar and
Magnus Find},
title = {Cancellation-free circuits: An approach for proving superlinear lower
bounds for linear Boolean operators},
journal = {CoRR},
volume = {abs/1207.5321},
year = {2012},
url = {http://arxiv.org/abs/1207.5321},
eprinttype = {arXiv},
eprint = {1207.5321},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-5321.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-4016,
author = {Joan Boyar and
Shahin Kamali and
Kim S. Larsen and
Alejandro L{\'{o}}pez{-}Ortiz},
title = {Online Bin Packing with Advice},
journal = {CoRR},
volume = {abs/1212.4016},
year = {2012},
url = {http://arxiv.org/abs/1212.4016},
eprinttype = {arXiv},
eprint = {1212.4016},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1212-4016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1106-6136,
author = {Joan Boyar and
Kim S. Larsen and
Abyayananda Maiti},
title = {A Comparison of Performance Measures via Online Search},
journal = {CoRR},
volume = {abs/1106.6136},
year = {2011},
url = {http://arxiv.org/abs/1106.6136},
eprinttype = {arXiv},
eprint = {1106.6136},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1106-6136.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BoyarP11,
author = {Joan Boyar and
Ren{\'{e}} Peralta},
title = {A depth-16 circuit for the {AES} S-box},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {332},
year = {2011},
url = {http://eprint.iacr.org/2011/332},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iacr/BoyarP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/BoyarEKL10,
author = {Joan Boyar and
Martin R. Ehmsen and
Jens S. Kohrt and
Kim S. Larsen},
title = {A theoretical comparison of {LRU} and {LRU-K}},
journal = {Acta Informatica},
volume = {47},
number = {7-8},
pages = {359--374},
year = {2010},
url = {https://doi.org/10.1007/s00236-010-0123-6},
doi = {10.1007/S00236-010-0123-6},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/BoyarEKL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoyarF10,
author = {Joan Boyar and
Lene M. Favrholdt},
title = {Scheduling Jobs on Grid Processors},
journal = {Algorithmica},
volume = {57},
number = {4},
pages = {819--847},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9257-0},
doi = {10.1007/S00453-008-9257-0},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarF10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BorodinBLM10,
author = {Allan Borodin and
Joan Boyar and
Kim S. Larsen and
Nazanin Mirmohammadi},
title = {Priority algorithms for graph optimization problems},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {1},
pages = {239--258},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2009.09.033},
doi = {10.1016/J.TCS.2009.09.033},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BorodinBLM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoyarEL10,
author = {Joan Boyar and
Leah Epstein and
Asaf Levin},
title = {Tight results for Next Fit and Worst Fit with resource augmentation},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {26-28},
pages = {2572--2580},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2010.03.019},
doi = {10.1016/J.TCS.2010.03.019},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BoyarEL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/BoyarP10,
author = {Joan Boyar and
Ren{\'{e}} Peralta},
editor = {Paola Festa},
title = {A New Combinational Logic Minimization Technique with Applications
to Cryptology},
booktitle = {Experimental Algorithms, 9th International Symposium, {SEA} 2010,
Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6049},
pages = {178--189},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13193-6\_16},
doi = {10.1007/978-3-642-13193-6\_16},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wea/BoyarP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoyarIL09,
author = {Joan Boyar and
Sandy Irani and
Kim S. Larsen},
editor = {Frank K. H. A. Dehne and
Marina L. Gavrilova and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Csaba D. T{\'{o}}th},
title = {A Comparison of Performance Measures for Online Algorithms},
booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
pages = {119--130},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4\_11},
doi = {10.1007/978-3-642-03367-4\_11},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BoyarIL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BoyarP09,
author = {Joan Boyar and
Ren{\'{e}} Peralta},
title = {New logic minimization techniques with applications to cryptology},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {191},
year = {2009},
url = {http://eprint.iacr.org/2009/191},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iacr/BoyarP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BoyarM08,
author = {Joan Boyar and
Paul Medvedev},
title = {The relative worst order ratio applied to seat reservation},
journal = {{ACM} Trans. Algorithms},
volume = {4},
number = {4},
pages = {48:1--48:22},
year = {2008},
url = {https://doi.org/10.1145/1383369.1383379},
doi = {10.1145/1383369.1383379},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BoyarM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoyarP08,
author = {Joan Boyar and
Ren{\'{e}} Peralta},
title = {Tight bounds for the multiplicative complexity of symmetric functions},
journal = {Theor. Comput. Sci.},
volume = {396},
number = {1-3},
pages = {223--246},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2008.01.030},
doi = {10.1016/J.TCS.2008.01.030},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BoyarP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BoyarMP08,
author = {Joan Boyar and
Philip Matthews and
Ren{\'{e}} Peralta},
editor = {Edward Ochmanski and
Jerzy Tyszkiewicz},
title = {On the Shortest Linear Straight-Line Program for Computing Linear
Forms},
booktitle = {Mathematical Foundations of Computer Science 2008, 33rd International
Symposium, {MFCS} 2008, Torun, Poland, August 25-29, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5162},
pages = {168--179},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85238-4\_13},
doi = {10.1007/978-3-540-85238-4\_13},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/BoyarMP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0806-0983,
author = {Joan Boyar and
Sandy Irani and
Kim S. Larsen},
title = {A Comparison of Performance Measures for Online Algorithms},
journal = {CoRR},
volume = {abs/0806.0983},
year = {2008},
url = {http://arxiv.org/abs/0806.0983},
eprinttype = {arXiv},
eprint = {0806.0983},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0806-0983.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BoyarFL07,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
title = {The relative worst-order ratio applied to paging},
journal = {J. Comput. Syst. Sci.},
volume = {73},
number = {5},
pages = {818--843},
year = {2007},
url = {https://doi.org/10.1016/j.jcss.2007.03.001},
doi = {10.1016/J.JCSS.2007.03.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BoyarFL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BoyarF07,
author = {Joan Boyar and
Lene M. Favrholdt},
title = {The relative worst order ratio for online algorithms},
journal = {{ACM} Trans. Algorithms},
volume = {3},
number = {2},
pages = {22},
year = {2007},
url = {https://doi.org/10.1145/1240233.1240245},
doi = {10.1145/1240233.1240245},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/BoyarF07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoyarEFKLPW06,
author = {Joan Boyar and
Leah Epstein and
Lene M. Favrholdt and
Jens S. Kohrt and
Kim S. Larsen and
Morten Monrad Pedersen and
Sanne W{\o}hlk},
title = {The maximum resource bin packing problem},
journal = {Theor. Comput. Sci.},
volume = {362},
number = {1-3},
pages = {127--139},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.06.001},
doi = {10.1016/J.TCS.2006.06.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BoyarEFKLPW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BoyarP06,
author = {Joan Boyar and
Ren{\'{e}} Peralta},
editor = {Rastislav Kralovic and
Pawel Urzyczyn},
title = {Concrete Multiplicative Complexity of Symmetric Functions},
booktitle = {Mathematical Foundations of Computer Science 2006, 31st International
Symposium, {MFCS} 2006, Star{\'{a}} Lesn{\'{a}}, Slovakia,
August 28-September 1, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4162},
pages = {179--189},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11821069\_16},
doi = {10.1007/11821069\_16},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/BoyarP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoyarF06,
author = {Joan Boyar and
Lene M. Favrholdt},
editor = {Lars Arge and
Rusins Freivalds},
title = {Scheduling Jobs on Grid Processors},
booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm
Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4059},
pages = {17--28},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11785293\_5},
doi = {10.1007/11785293\_5},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoyarF06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BoyarEL06,
author = {Joan Boyar and
Martin R. Ehmsen and
Kim S. Larsen},
editor = {Thomas Erlebach and
Christos Kaklamanis},
title = {Theoretical Evidence for the Superiority of {LRU-2} over {LRU} for
the Paging Problem},
booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4368},
pages = {95--107},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11970125\_8},
doi = {10.1007/11970125\_8},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BoyarEL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BoyarEFKLPW05,
author = {Joan Boyar and
Leah Epstein and
Lene M. Favrholdt and
Jens S. Kohrt and
Kim S. Larsen and
Morten Monrad Pedersen and
Sanne W{\o}hlk},
editor = {Maciej Liskiewicz and
R{\"{u}}diger Reischuk},
title = {The Maximum Resource Bin Packing Problem},
booktitle = {Fundamentals of Computation Theory, 15th International Symposium,
{FCT} 2005, L{\"{u}}beck, Germany, August 17-20, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3623},
pages = {397--408},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11537311\_35},
doi = {10.1007/11537311\_35},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/BoyarEFKLPW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BoyarFL05,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen},
title = {The relative worst order ratio applied to paging},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {718--727},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070534},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BoyarFL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-049,
author = {Joan Boyar and
Ren{\'{e}} Peralta},
title = {The Exact Multiplicative Complexity of the Hamming Weight Function},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-049}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-049/index.html},
eprinttype = {ECCC},
eprint = {TR05-049},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-049.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BoyarKN04,
author = {Joan Boyar and
Susan Krarup and
Morten N. Nielsen},
title = {Seat reservation allowing seat changes},
journal = {J. Algorithms},
volume = {52},
number = {2},
pages = {169--192},
year = {2004},
url = {https://doi.org/10.1016/j.jalgor.2004.02.002},
doi = {10.1016/J.JALGOR.2004.02.002},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BoyarKN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoyarM04,
author = {Joan Boyar and
Paul Medvedev},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {The Relative Worst Order Ratio Applied to Seat Reservation},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {90--101},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_9},
doi = {10.1007/978-3-540-27810-8\_9},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoyarM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BorodinBL04,
author = {Allan Borodin and
Joan Boyar and
Kim S. Larsen},
editor = {Giuseppe Persiano and
Roberto Solis{-}Oba},
title = {Priority Algorithms for Graph Optimization Problems},
booktitle = {Approximation and Online Algorithms, Second International Workshop,
{WAOA} 2004, Bergen, Norway, September 14-16, 2004, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {3351},
pages = {126--139},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-31833-0\_12},
doi = {10.1007/978-3-540-31833-0\_12},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BorodinBL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/BoyarFLN03,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen and
Morten N. Nielsen},
title = {Extending the accommodating function},
journal = {Acta Informatica},
volume = {40},
number = {1},
pages = {3--35},
year = {2003},
url = {https://doi.org/10.1007/s00236-003-0124-9},
doi = {10.1007/S00236-003-0124-9},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/BoyarFLN03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BachBEFJLLS03,
author = {Eric Bach and
Joan Boyar and
Leah Epstein and
Lene M. Favrholdt and
Tao Jiang and
Kim S. Larsen and
Guo{-}Hui Lin and
Rob van Stee},
title = {Tight Bounds on the Competitive Ratio on Accommodating Sequences for
the Seat Reservation Problem},
journal = {J. Sched.},
volume = {6},
number = {2},
pages = {131--147},
year = {2003},
url = {https://doi.org/10.1023/A:1022985808959},
doi = {10.1023/A:1022985808959},
timestamp = {Wed, 01 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/BachBEFJLLS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BoyarF03,
author = {Joan Boyar and
Lene M. Favrholdt},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {The Relative Worst Order Ratio for On-Line Algorithms},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {58--69},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_13},
doi = {10.1007/3-540-44849-7\_13},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BoyarF03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AzarBFLNE02,
author = {Yossi Azar and
Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen and
Morten N. Nielsen and
Leah Epstein},
title = {Fair versus Unrestricted Bin Packing},
journal = {Algorithmica},
volume = {34},
number = {2},
pages = {181--196},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0965-6},
doi = {10.1007/S00453-002-0965-6},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AzarBFLNE02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BoyarFLN02,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen and
Morten N. Nielsen},
editor = {Oscar H. Ibarra and
Louxin Zhang},
title = {Extending the Accommodating Function},
booktitle = {Computing and Combinatorics, 8th Annual International Conference,
{COCOON} 2002, Singapore, August 15-17, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2387},
pages = {87--96},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45655-4\_11},
doi = {10.1007/3-540-45655-4\_11},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/BoyarFLN02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/BoyarFLN01,
author = {Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen and
Morten N. Nielsen},
title = {The Competitive Ratio for On-Line Dual Bin Packing with Restricted
Input Sequences},
journal = {Nord. J. Comput.},
volume = {8},
number = {4},
pages = {463--472},
year = {2001},
url = {http://www.cs.helsinki.fi/njc/References/boyar2001:463.html},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/BoyarFLN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BoyarLN01,
author = {Joan Boyar and
Kim S. Larsen and
Morten N. Nielsen},
title = {The Accommodating Function: {A} Generalization of the Competitive
Ratio},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {1},
pages = {233--258},
year = {2001},
url = {https://doi.org/10.1137/S0097539799361786},
doi = {10.1137/S0097539799361786},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BoyarLN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/BoyarKN01,
author = {Joan Boyar and
Susan Krarup and
Morten N. Nielsen},
editor = {Christos D. Zaroliagis},
title = {Seat Reservation Allowing Seat Changes},
booktitle = {Workshop on Algorithmic MeThods and Models for Optimization of RailwayS,
{ATMOS} 2001, Satellite Workshop of {ICALP} 2001, Crete, Greece, July
13, 2001},
series = {Electronic Notes in Theoretical Computer Science},
volume = {50},
number = {1},
pages = {24--38},
publisher = {Elsevier},
year = {2001},
url = {https://doi.org/10.1016/S1571-0661(04)00163-X},
doi = {10.1016/S1571-0661(04)00163-X},
timestamp = {Thu, 01 Dec 2022 11:30:20 +0100},
biburl = {https://dblp.org/rec/journals/entcs/BoyarKN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/BoyarDP00,
author = {Joan Boyar and
Ivan Damg{\aa}rd and
Ren{\'{e}} Peralta},
title = {Short Non-Interactive Cryptographic Proofs},
journal = {J. Cryptol.},
volume = {13},
number = {4},
pages = {449--472},
year = {2000},
url = {https://doi.org/10.1007/s001450010011},
doi = {10.1007/S001450010011},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/joc/BoyarDP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoyarPP00,
author = {Joan Boyar and
Ren{\'{e}} Peralta and
Denis Pochuev},
title = {On the multiplicative complexity of Boolean functions over the basis
(cap, +, 1)},
journal = {Theor. Comput. Sci.},
volume = {235},
number = {1},
pages = {43--57},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(99)00182-6},
doi = {10.1016/S0304-3975(99)00182-6},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BoyarPP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BachBJLL00,
author = {Eric Bach and
Joan Boyar and
Tao Jiang and
Kim S. Larsen and
Guo{-}Hui Lin},
editor = {Ding{-}Zhu Du and
Peter Eades and
Vladimir Estivill{-}Castro and
Xuemin Lin and
Arun Sharma},
title = {Better Bounds on the Accommodating Ratio for the Seat Reservation
Problem},
booktitle = {Computing and Combinatorics, 6th Annual International Conference,
{COCOON} 2000, Sydney, Australia, July 26-28, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1858},
pages = {221--231},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44968-X\_22},
doi = {10.1007/3-540-44968-X\_22},
timestamp = {Wed, 01 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/BachBJLL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AzarBFLN00,
author = {Yossi Azar and
Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen and
Morten N. Nielsen},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Fair versus Unrestricted Bin Packing},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {200--213},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_18},
doi = {10.1007/3-540-44985-X\_18},
timestamp = {Fri, 27 Mar 2020 08:50:36 +0100},
biburl = {https://dblp.org/rec/conf/swat/AzarBFLN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoyarL99,
author = {Joan Boyar and
Kim S. Larsen},
title = {The Seat Reservation Problem},
journal = {Algorithmica},
volume = {25},
number = {4},
pages = {403--417},
year = {1999},
url = {https://doi.org/10.1007/PL00009286},
doi = {10.1007/PL00009286},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoyarL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoyarLN99,
author = {Joan Boyar and
Kim S. Larsen and
Morten N. Nielsen},
editor = {Frank K. H. A. Dehne and
Arvind Gupta and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {The Accommodating Function - {A} Generalization of the Competitive
Ratio},
booktitle = {Algorithms and Data Structures, 6th International Workshop, {WADS}
'99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1663},
pages = {74--79},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48447-7\_9},
doi = {10.1007/3-540-48447-7\_9},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BoyarLN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BoyarFL97,
author = {Joan Boyar and
Rolf Fagerberg and
Kim S. Larsen},
title = {Amortization Results for Chromatic Search Trees, with an Application
to Priority Queues},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {3},
pages = {504--521},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1511},
doi = {10.1006/JCSS.1997.1511},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BoyarFL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocrypt/BoyarP96,
author = {Joan Boyar and
Ren{\'{e}} Peralta},
editor = {Ueli M. Maurer},
title = {Short Discrete Proofs},
booktitle = {Advances in Cryptology - {EUROCRYPT} '96, International Conference
on the Theory and Application of Cryptographic Techniques, Saragossa,
Spain, May 12-16, 1996, Proceeding},
series = {Lecture Notes in Computer Science},
volume = {1070},
pages = {131--142},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-68339-9\_12},
doi = {10.1007/3-540-68339-9\_12},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/eurocrypt/BoyarP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BoyarBP95,
author = {Joan Boyar and
Gilles Brassard and
Ren{\'{e}} Peralta},
title = {Subquadratic Zero-Knowledge},
journal = {J. {ACM}},
volume = {42},
number = {6},
pages = {1169--1193},
year = {1995},
url = {https://doi.org/10.1145/227683.227686},
doi = {10.1145/227683.227686},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BoyarBP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoyarFL95,
author = {Joan Boyar and
Rolf Fagerberg and
Kim S. Larsen},
editor = {Selim G. Akl and
Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
title = {Amortization Results for Chromatic Search Trees, with an Application
to Priority Queues},
booktitle = {Algorithms and Data Structures, 4th International Workshop, {WADS}
'95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {955},
pages = {270--281},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60220-8\_69},
doi = {10.1007/3-540-60220-8\_69},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BoyarFL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BoyarFL94,
author = {Joan Boyar and
Faith E. Fich and
Kim S. Larsen},
title = {Bounds on Certain Multiplications of Affine Combinations},
journal = {Discret. Appl. Math.},
volume = {52},
number = {2},
pages = {155--167},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90079-5},
doi = {10.1016/0166-218X(94)90079-5},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BoyarFL94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BoyarL94,
author = {Joan Boyar and
Kim S. Larsen},
title = {Efficient Rebalancing of Chromatic Search Trees},
journal = {J. Comput. Syst. Sci.},
volume = {49},
number = {3},
pages = {667--682},
year = {1994},
url = {https://doi.org/10.1016/S0022-0000(05)80075-3},
doi = {10.1016/S0022-0000(05)80075-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BoyarL94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/BoyarLP93,
author = {Joan Boyar and
Carsten Lund and
Ren{\'{e}} Peralta},
title = {On the Communication Complexity of Zero-Knowledge Proofs},
journal = {J. Cryptol.},
volume = {6},
number = {2},
pages = {65--85},
year = {1993},
url = {https://doi.org/10.1007/BF02620135},
doi = {10.1007/BF02620135},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/joc/BoyarLP93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BoyarFS92,
author = {Joan Boyar and
Gudmund Skovbjerg Frandsen and
Carl Sturtivant},
title = {An Arithmetic Model of Computation Equivalent to Threshold Circuits},
journal = {Theor. Comput. Sci.},
volume = {93},
number = {2},
pages = {303--319},
year = {1992},
url = {https://doi.org/10.1016/0304-3975(92)90335-D},
doi = {10.1016/0304-3975(92)90335-D},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BoyarFS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoyarL92,
author = {Joan Boyar and
Kim S. Larsen},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Efficient Rebalancing of Chromatic Search Trees},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {151--164},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_14},
doi = {10.1007/3-540-55706-7\_14},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoyarL92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/BoyarFL91,
author = {Joan Boyar and
Katalin Friedl and
Carsten Lund},
title = {Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies},
journal = {J. Cryptol.},
volume = {4},
number = {3},
pages = {185--206},
year = {1991},
url = {https://doi.org/10.1007/BF00196727},
doi = {10.1007/BF00196727},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/joc/BoyarFL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BoyarBP91,
author = {Joan Boyar and
Gilles Brassard and
Ren{\'{e}} Peralta},
title = {Subquadratic Zero-Knowledge},
booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 1-4 October 1991},
pages = {69--78},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/SFCS.1991.185350},
doi = {10.1109/SFCS.1991.185350},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BoyarBP91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/BoyarKK90,
author = {Joan Boyar and
Stuart A. Kurtz and
Mark W. Krentel},
title = {A Discrete Logarithm Implementation of Perfect Zero-Knowledge Blobs},
journal = {J. Cryptol.},
volume = {2},
number = {2},
pages = {63--76},
year = {1990},
url = {https://doi.org/10.1007/BF00204448},
doi = {10.1007/BF00204448},
timestamp = {Fri, 29 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/joc/BoyarKK90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BoyarCDP90,
author = {Joan Boyar and
David Chaum and
Ivan Damg{\aa}rd and
Torben P. Pedersen},
editor = {Alfred Menezes and
Scott A. Vanstone},
title = {Convertible Undeniable Signatures},
booktitle = {Advances in Cryptology - {CRYPTO} '90, 10th Annual International Cryptology
Conference, Santa Barbara, California, USA, August 11-15, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {537},
pages = {189--205},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-38424-3\_14},
doi = {10.1007/3-540-38424-3\_14},
timestamp = {Fri, 17 Jul 2020 16:12:45 +0200},
biburl = {https://dblp.org/rec/conf/crypto/BoyarCDP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Boyar89,
author = {Joan Boyar},
title = {Inferring sequences produced by pseudo-random number generators},
journal = {J. {ACM}},
volume = {36},
number = {1},
pages = {129--141},
year = {1989},
url = {https://doi.org/10.1145/58562.59305},
doi = {10.1145/58562.59305},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Boyar89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/Boyar89,
author = {Joan Boyar},
title = {Inferring Sequences Produced by a Linear Congruential Generator Missing
Low-Order Bits},
journal = {J. Cryptol.},
volume = {1},
number = {3},
pages = {177--184},
year = {1989},
url = {https://doi.org/10.1007/BF02252875},
doi = {10.1007/BF02252875},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/joc/Boyar89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BoyarP89,
author = {Joan Boyar and
Ren{\'{e}} Peralta},
editor = {Gilles Brassard},
title = {On the Concrete Complexity of Zero-Knowledge Proofs},
booktitle = {Advances in Cryptology - {CRYPTO} '89, 9th Annual International Cryptology
Conference, Santa Barbara, California, USA, August 20-24, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {435},
pages = {507--525},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/0-387-34805-0\_45},
doi = {10.1007/0-387-34805-0\_45},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/crypto/BoyarP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocrypt/BoyarFL89,
author = {Joan Boyar and
Katalin Friedl and
Carsten Lund},
editor = {Jean{-}Jacques Quisquater and
Joos Vandewalle},
title = {Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies},
booktitle = {Advances in Cryptology - {EUROCRYPT} '89, Workshop on the Theory and
Application of of Cryptographic Techniques, Houthalen, Belgium, April
10-13, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {434},
pages = {155--172},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-46885-4\_18},
doi = {10.1007/3-540-46885-4\_18},
timestamp = {Fri, 17 Jul 2020 16:12:46 +0200},
biburl = {https://dblp.org/rec/conf/eurocrypt/BoyarFL89.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}
}
@inproceedings{DBLP:conf/crypto/Plumstead82,
author = {Joan B. Plumstead},
editor = {David Chaum and
Ronald L. Rivest and
Alan T. Sherman},
title = {Inferring a Sequence Produced by a Linear Congruence},
booktitle = {Advances in Cryptology: Proceedings of {CRYPTO} '82, Santa Barbara,
California, USA, August 23-25, 1982},
pages = {317--319},
publisher = {Plenum Press, New York},
year = {1982},
url = {https://doi.org/10.1007/978-1-4757-0602-4\_32},
doi = {10.1007/978-1-4757-0602-4\_32},
timestamp = {Thu, 25 Jul 2019 12:26:02 +0200},
biburl = {https://dblp.org/rec/conf/crypto/Plumstead82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Plumstead82,
author = {Joan B. Plumstead},
title = {Inferring a Sequence Generated by a Linear Congruence},
booktitle = {23rd Annual Symposium on Foundations of Computer Science, Chicago,
Illinois, USA, 3-5 November 1982},
pages = {153--159},
publisher = {{IEEE} Computer Society},
year = {1982},
url = {https://doi.org/10.1109/SFCS.1982.73},
doi = {10.1109/SFCS.1982.73},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Plumstead82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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-09-12 03:25 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:
