Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Lukasz Jez
@article{DBLP:journals/siamcomp/VeselyCJS22,
author = {Pavel Vesel{\'{y}} and
Marek Chrobak and
Lukasz Jez and
Jir{\'{\i}} Sgall},
title = {A {\textbackslash}({\textbackslash}boldsymbol\{{\textbackslash}phi
\}{\textbackslash}) -Competitive Algorithm for Scheduling Packets
with Deadlines},
journal = {{SIAM} J. Comput.},
volume = {51},
number = {5},
pages = {1626--1691},
year = {2022},
url = {https://doi.org/10.1137/21m1469753},
doi = {10.1137/21M1469753},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/VeselyCJS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BaloghDEJ22,
author = {J{\'{a}}nos Balogh and
Gy{\"{o}}rgy D{\'{o}}sa and
Leah Epstein and
Lukasz Jez},
editor = {Cristina Bazgan and
Henning Fernau},
title = {Lower Bounds on the Performance of Online Algorithms for Relaxed Packing
Problems},
booktitle = {Combinatorial Algorithms - 33rd International Workshop, {IWOCA} 2022,
Trier, Germany, June 7-9, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13270},
pages = {101--113},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-06678-8\_8},
doi = {10.1007/978-3-031-06678-8\_8},
timestamp = {Wed, 01 Jun 2022 15:43:39 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/BaloghDEJ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-05999,
author = {J{\'{a}}nos Balogh and
Gy{\"{o}}rgy D{\'{o}}sa and
Leah Epstein and
Lukasz Jez},
title = {Lower bounds on the performance of online algorithms for relaxed packing
problems},
journal = {CoRR},
volume = {abs/2201.05999},
year = {2022},
url = {https://arxiv.org/abs/2201.05999},
eprinttype = {arXiv},
eprint = {2201.05999},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-05999.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/BohmJSV21,
author = {Martin B{\"{o}}hm and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Pavel Vesel{\'{y}}},
title = {On packet scheduling with adversarial jamming and speedup},
journal = {Ann. Oper. Res.},
volume = {298},
number = {1},
pages = {7--42},
year = {2021},
url = {https://doi.org/10.1007/s10479-019-03153-x},
doi = {10.1007/S10479-019-03153-X},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/anor/BohmJSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BienkowskiBBCDF21,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Jaroslaw Byrka and
Marek Chrobak and
Christoph D{\"{u}}rr and
Luk\'a\v{s} Folwarczn\'y and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Kim Thang Nguyen and
Pavel Vesel{\'{y}}},
title = {New results on multi-level aggregation},
journal = {Theor. Comput. Sci.},
volume = {861},
pages = {133--143},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.02.016},
doi = {10.1016/J.TCS.2021.02.016},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BienkowskiBBCDF21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/BienkowskiBBCDF20,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Jaroslaw Byrka and
Marek Chrobak and
Christoph D{\"{u}}rr and
Luk\'a\v{s} Folwarczn\'y and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Kim Thang Nguyen and
Pavel Vesel{\'{y}}},
title = {Online Algorithms for Multilevel Aggregation},
journal = {Oper. Res.},
volume = {68},
number = {1},
pages = {214--232},
year = {2020},
url = {https://doi.org/10.1287/opre.2019.1847},
doi = {10.1287/OPRE.2019.1847},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ior/BienkowskiBBCDF20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BienkowskiBCJ20,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Christian Coester and
Lukasz Jez},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Unbounded lower bound for k-server against weak adversaries},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1165--1169},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384306},
doi = {10.1145/3357713.3384306},
timestamp = {Mon, 18 Dec 2023 07:33:37 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BienkowskiBCJ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BansalEJK19,
author = {Nikhil Bansal and
Marek Eli{\'{a}}s and
Lukasz Jez and
Grigorios Koumoutsos},
title = {The (\emph{h, k})-Server Problem on Bounded Depth Trees},
journal = {{ACM} Trans. Algorithms},
volume = {15},
number = {2},
pages = {28:1--28:26},
year = {2019},
url = {https://doi.org/10.1145/3301314},
doi = {10.1145/3301314},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/BansalEJK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BohmCJLSV19,
author = {Martin B{\"{o}}hm and
Marek Chrobak and
Lukasz Jez and
Fei Li and
Jir{\'{\i}} Sgall and
Pavel Vesel{\'{y}}},
title = {Online packet scheduling with bounded delay and lookahead},
journal = {Theor. Comput. Sci.},
volume = {776},
pages = {95--113},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.01.013},
doi = {10.1016/J.TCS.2019.01.013},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BohmCJLSV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CohenEFJ19,
author = {Ilan Reuven Cohen and
Alon Eden and
Amos Fiat and
Lukasz Jez},
editor = {Dimitris Achlioptas and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {Dynamic Pricing of Servers on Trees},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2019, September 20-22, 2019, Massachusetts
Institute of Technology, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {145},
pages = {10:1--10:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.10},
doi = {10.4230/LIPICS.APPROX-RANDOM.2019.10},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/CohenEFJ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BienkowskiJS19,
author = {Marcin Bienkowski and
Lukasz Jez and
Pawel Schmidt},
editor = {Pinyan Lu and
Guochuan Zhang},
title = {Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform
Metrics},
booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC}
2019, December 8-11, 2019, Shanghai University of Finance and Economics,
Shanghai, China},
series = {LIPIcs},
volume = {149},
pages = {14:1--14:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.14},
doi = {10.4230/LIPICS.ISAAC.2019.14},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BienkowskiJS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BienkowskiBCCJK19,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Marek Chrobak and
Christian Coester and
Lukasz Jez and
Elias Koutsoupias},
editor = {Peter Rossmanith and
Pinar Heggernes and
Joost{-}Pieter Katoen},
title = {Better Bounds for Online Line Chasing},
booktitle = {44th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
series = {LIPIcs},
volume = {138},
pages = {8:1--8:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2019.8},
doi = {10.4230/LIPICS.MFCS.2019.8},
timestamp = {Thu, 05 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BienkowskiBCCJK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/VeselyCJS19,
author = {Pavel Vesel{\'{y}} and
Marek Chrobak and
Lukasz Jez and
Jir{\'{\i}} Sgall},
editor = {Timothy M. Chan},
title = {A {\(\phi\)}-Competitive Algorithm for Scheduling Packets with Deadlines},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {123--142},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.9},
doi = {10.1137/1.9781611975482.9},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/VeselyCJS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-01592,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Christian Coester and
Lukasz Jez},
title = {Unbounded lower bound for k-server against weak adversaries},
journal = {CoRR},
volume = {abs/1911.01592},
year = {2019},
url = {http://arxiv.org/abs/1911.01592},
eprinttype = {arXiv},
eprint = {1911.01592},
timestamp = {Mon, 11 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-01592.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BansalEJKP18,
author = {Nikhil Bansal and
Marek Eli{\'{a}}s and
Lukasz Jez and
Grigorios Koumoutsos and
Kirk Pruhs},
title = {Tight Bounds for Double Coverage Against Weak Adversaries},
journal = {Theory Comput. Syst.},
volume = {62},
number = {2},
pages = {349--365},
year = {2018},
url = {https://doi.org/10.1007/s00224-016-9703-3},
doi = {10.1007/S00224-016-9703-3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BansalEJKP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BienkowskiBJLMS18,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Lukasz Jez and
Pawel Laskos{-}Grabowski and
Jan Marcinkowski and
Jir{\'{\i}} Sgall and
Aleksandra Spyra and
Pavel Vesel{\'{y}}},
title = {Logarithmic price of buffer downscaling on line metrics},
journal = {Theor. Comput. Sci.},
volume = {707},
pages = {89--93},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.10.008},
doi = {10.1016/J.TCS.2017.10.008},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BienkowskiBJLMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-11297,
author = {Christoph D{\"{u}}rr and
Lukasz Jez and
{\'{O}}scar C. V{\'{a}}squez},
title = {Scheduling under dynamic speed-scaling for minimizing weighted completion
time and energy consumption},
journal = {CoRR},
volume = {abs/1805.11297},
year = {2018},
url = {http://arxiv.org/abs/1805.11297},
eprinttype = {arXiv},
eprint = {1805.11297},
timestamp = {Thu, 30 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-11297.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-07177,
author = {Pavel Vesel{\'{y}} and
Marek Chrobak and
Lukasz Jez and
Jir{\'{\i}} Sgall},
title = {A {\(\varphi\)}-Competitive Algorithm for Scheduling Packets with
Deadlines},
journal = {CoRR},
volume = {abs/1807.07177},
year = {2018},
url = {http://arxiv.org/abs/1807.07177},
eprinttype = {arXiv},
eprint = {1807.07177},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-07177.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-00580,
author = {Marcin Bienkowski and
Lukasz Jez and
Pawel Schmidt},
title = {Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform
Metrics},
journal = {CoRR},
volume = {abs/1810.00580},
year = {2018},
url = {http://arxiv.org/abs/1810.00580},
eprinttype = {arXiv},
eprint = {1810.00580},
timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-00580.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-09233,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Marek Chrobak and
Christian Coester and
Lukasz Jez and
Elias Koutsoupias},
title = {Better Bounds for Online Line Chasing},
journal = {CoRR},
volume = {abs/1811.09233},
year = {2018},
url = {http://arxiv.org/abs/1811.09233},
eprinttype = {arXiv},
eprint = {1811.09233},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-09233.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/JezMP17,
author = {Lukasz Jez and
Yishay Mansour and
Boaz Patt{-}Shamir},
title = {Scheduling multipacket frames with frame deadlines},
journal = {J. Sched.},
volume = {20},
number = {6},
pages = {623--634},
year = {2017},
url = {https://doi.org/10.1007/s10951-017-0522-4},
doi = {10.1007/S10951-017-0522-4},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/JezMP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DurrJV17,
author = {Christoph D{\"{u}}rr and
Lukasz Jez and
{\'{O}}scar C. V{\'{a}}squez},
title = {Mechanism design for aggregating energy consumption and quality of
service in speed scaling scheduling},
journal = {Theor. Comput. Sci.},
volume = {695},
pages = {28--41},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.07.020},
doi = {10.1016/J.TCS.2017.07.020},
timestamp = {Thu, 30 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DurrJV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BansalEJK17,
author = {Nikhil Bansal and
Marek Eli{\'{a}}s and
Lukasz Jez and
Grigorios Koumoutsos},
editor = {Philip N. Klein},
title = {The (\emph{h}, \emph{k})-Server Problem on Bounded Depth Trees},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {1022--1037},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.65},
doi = {10.1137/1.9781611974782.65},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BansalEJK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BohmJSV17,
author = {Martin B{\"{o}}hm and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Pavel Vesel{\'{y}}},
editor = {Roberto Solis{-}Oba and
Rudolf Fleischer},
title = {On Packet Scheduling with Adversarial Jamming and Speedup},
booktitle = {Approximation and Online Algorithms - 15th International Workshop,
{WAOA} 2017, Vienna, Austria, September 7-8, 2017, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {10787},
pages = {190--206},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-89441-6\_15},
doi = {10.1007/978-3-319-89441-6\_15},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/BohmJSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BohmJSV17,
author = {Martin B{\"{o}}hm and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Pavel Vesel{\'{y}}},
title = {On Packet Scheduling with Adversarial Jamming and Speedup},
journal = {CoRR},
volume = {abs/1705.07018},
year = {2017},
url = {http://arxiv.org/abs/1705.07018},
eprinttype = {arXiv},
eprint = {1705.07018},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/BohmJSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EpsteinJSS16,
author = {Leah Epstein and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Rob van Stee},
title = {Online Scheduling of Jobs with Fixed Start Times on Related Machines},
journal = {Algorithmica},
volume = {74},
number = {1},
pages = {156--176},
year = {2016},
url = {https://doi.org/10.1007/s00453-014-9940-2},
doi = {10.1007/S00453-014-9940-2},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EpsteinJSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CyganJS16,
author = {Marek Cygan and
Lukasz Jez and
Jir{\'{\i}} Sgall},
title = {Online Knapsack Revisited},
journal = {Theory Comput. Syst.},
volume = {58},
number = {1},
pages = {153--190},
year = {2016},
url = {https://doi.org/10.1007/s00224-014-9566-4},
doi = {10.1007/S00224-014-9566-4},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CyganJS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BienkowskiBBCDF16,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Jaroslaw Byrka and
Marek Chrobak and
Christoph D{\"{u}}rr and
Luk\'a\v{s} Folwarczn\'y and
Lukasz Jez and
Jiri Sgall and
Kim Thang Nguyen and
Pavel Vesel{\'{y}}},
editor = {Piotr Sankowski and
Christos D. Zaroliagis},
title = {Online Algorithms for Multi-Level Aggregation},
booktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,
2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {57},
pages = {12:1--12:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ESA.2016.12},
doi = {10.4230/LIPICS.ESA.2016.12},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/BienkowskiBBCDF16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BohmCJLSV16,
author = {Martin B{\"{o}}hm and
Marek Chrobak and
Lukasz Jez and
Fei Li and
Jir{\'{\i}} Sgall and
Pavel Vesel{\'{y}}},
editor = {Seok{-}Hee Hong},
title = {Online Packet Scheduling with Bounded Delay and Lookahead},
booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC}
2016, December 12-14, 2016, Sydney, Australia},
series = {LIPIcs},
volume = {64},
pages = {21:1--21:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.21},
doi = {10.4230/LIPICS.ISAAC.2016.21},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BohmCJLSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AzarEJV16,
author = {Yossi Azar and
Amir Epstein and
Lukasz Jez and
Adi Vardi},
editor = {Robert Krauthgamer},
title = {Make-to-Order Integrated Scheduling and Distribution},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {140--154},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch11},
doi = {10.1137/1.9781611974331.CH11},
timestamp = {Tue, 02 Feb 2021 17:07:56 +0100},
biburl = {https://dblp.org/rec/conf/soda/AzarEJV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BohmCJLSV16,
author = {Martin B{\"{o}}hm and
Marek Chrobak and
Lukasz Jez and
Fei Li and
Jir{\'{\i}} Sgall and
Pavel Vesel{\'{y}}},
title = {Online Packet Scheduling with Bounded Delay and Lookahead},
journal = {CoRR},
volume = {abs/1606.09395},
year = {2016},
url = {http://arxiv.org/abs/1606.09395},
eprinttype = {arXiv},
eprint = {1606.09395},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/BohmCJLSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BansalEJK16,
author = {Nikhil Bansal and
Marek Eli{\'{a}}s and
Lukasz Jez and
Grigorios Koumoutsos},
title = {New Bounds for the {\textdollar}(h, k){\textdollar}-Server Problem},
journal = {CoRR},
volume = {abs/1608.08527},
year = {2016},
url = {http://arxiv.org/abs/1608.08527},
eprinttype = {arXiv},
eprint = {1608.08527},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/BansalEJK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BienkowskiBJLMS16,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Lukasz Jez and
Pawel Laskos{-}Grabowski and
Jan Marcinkowski and
Jir{\'{\i}} Sgall and
Aleksandra Spyra and
Pavel Vesel{\'{y}}},
title = {Logarithmic price of buffer downscaling on line metrics},
journal = {CoRR},
volume = {abs/1610.04915},
year = {2016},
url = {http://arxiv.org/abs/1610.04915},
eprinttype = {arXiv},
eprint = {1610.04915},
timestamp = {Tue, 29 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/BienkowskiBJLMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DurrJV15,
author = {Christoph D{\"{u}}rr and
Lukasz Jez and
Oscar C. V{\'{a}}squez},
title = {Scheduling under dynamic speed-scaling for minimizing weighted completion
time and energy consumption},
journal = {Discret. Appl. Math.},
volume = {196},
pages = {20--27},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2014.08.001},
doi = {10.1016/J.DAM.2014.08.001},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/DurrJV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/JezMP15,
author = {Lukasz Jez and
Yishay Mansour and
Boaz Patt{-}Shamir},
editor = {Christian Scheideler},
title = {Scheduling Multipacket Frames with Frame Deadlines},
booktitle = {Structural Information and Communication Complexity - 22nd International
Colloquium, {SIROCCO} 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9439},
pages = {76--90},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-25258-2\_6},
doi = {10.1007/978-3-319-25258-2\_6},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/JezMP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CohenEFJ15,
author = {Ilan Reuven Cohen and
Alon Eden and
Amos Fiat and
Lukasz Jez},
editor = {Piotr Indyk},
title = {Pricing Online Decisions: Beyond Auctions},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {73--91},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.7},
doi = {10.1137/1.9781611973730.7},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/CohenEFJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BansalEJKP15,
author = {Nikhil Bansal and
Marek Eli{\'{a}}s and
Lukasz Jez and
Grigorios Koumoutsos and
Kirk Pruhs},
editor = {Laura Sanit{\`{a}} and
Martin Skutella},
title = {Tight Bounds for Double Coverage Against Weak Adversaries},
booktitle = {Approximation and Online Algorithms - 13th International Workshop,
{WAOA} 2015, Patras, Greece, September 17-18, 2015. Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9499},
pages = {47--58},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-28684-6\_5},
doi = {10.1007/978-3-319-28684-6\_5},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BansalEJKP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CohenEFJ15,
author = {Ilan Reuven Cohen and
Alon Eden and
Amos Fiat and
Lukasz Jez},
title = {Pricing Online Decisions: Beyond Auctions},
journal = {CoRR},
volume = {abs/1504.01093},
year = {2015},
url = {http://arxiv.org/abs/1504.01093},
eprinttype = {arXiv},
eprint = {1504.01093},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CohenEFJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DurrJV15,
author = {Christoph D{\"{u}}rr and
Lukasz Jez and
{\'{O}}scar C. V{\'{a}}squez},
title = {Mechanism design for aggregating energy consumption and quality of
service in speed scaling scheduling},
journal = {CoRR},
volume = {abs/1504.03586},
year = {2015},
url = {http://arxiv.org/abs/1504.03586},
eprinttype = {arXiv},
eprint = {1504.03586},
timestamp = {Thu, 30 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DurrJV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BienkowskiBBCDF15,
author = {Marcin Bienkowski and
Martin B{\"{o}}hm and
Jaroslaw Byrka and
Marek Chrobak and
Christoph D{\"{u}}rr and
Luk\'a\v{s} Folwarczn\'y and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Kim Thang Nguyen and
Pavel Vesel{\'{y}}},
title = {Online Algorithms for Multi-Level Aggregation},
journal = {CoRR},
volume = {abs/1507.02378},
year = {2015},
url = {http://arxiv.org/abs/1507.02378},
eprinttype = {arXiv},
eprint = {1507.02378},
timestamp = {Wed, 24 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/BienkowskiBBCDF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GawrychowskiJJ14,
author = {Pawel Gawrychowski and
Artur Jez and
Lukasz Jez},
title = {Validating the Knuth-Morris-Pratt Failure Function, Fast and Online},
journal = {Theory Comput. Syst.},
volume = {54},
number = {2},
pages = {337--372},
year = {2014},
url = {https://doi.org/10.1007/s00224-013-9522-8},
doi = {10.1007/S00224-013-9522-8},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GawrychowskiJJ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BienkowskiBCJNS14,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Marek Chrobak and
Lukasz Jez and
Dorian Nogneng and
Jir{\'{\i}} Sgall},
editor = {Chandra Chekuri},
title = {Better Approximation Bounds for the Joint Replenishment Problem},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {42--54},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.4},
doi = {10.1137/1.9781611973402.4},
timestamp = {Tue, 02 Feb 2021 17:07:40 +0100},
biburl = {https://dblp.org/rec/conf/soda/BienkowskiBCJNS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BienkowskiCDHJJS13,
author = {Marcin Bienkowski and
Marek Chrobak and
Christoph D{\"{u}}rr and
Mathilde Hurand and
Artur Jez and
Lukasz Jez and
Grzegorz Stachowiak},
title = {Collecting Weighted Items from a Dynamic Queue},
journal = {Algorithmica},
volume = {65},
number = {1},
pages = {60--94},
year = {2013},
url = {https://doi.org/10.1007/s00453-011-9574-6},
doi = {10.1007/S00453-011-9574-6},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BienkowskiCDHJJS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Jez13,
author = {Lukasz Jez},
title = {A Universal Randomized Packet Scheduling Algorithm},
journal = {Algorithmica},
volume = {67},
number = {4},
pages = {498--515},
year = {2013},
url = {https://doi.org/10.1007/s00453-012-9700-0},
doi = {10.1007/S00453-012-9700-0},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Jez13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/JezSSB13,
author = {Lukasz Jez and
Jarett Schwartz and
Jir{\'{\i}} Sgall and
J{\'{o}}zsef B{\'{e}}k{\'{e}}si},
title = {Lower bounds for online makespan minimization on a small number of
related machines},
journal = {J. Sched.},
volume = {16},
number = {5},
pages = {539--547},
year = {2013},
url = {https://doi.org/10.1007/s10951-012-0288-7},
doi = {10.1007/S10951-012-0288-7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/JezSSB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BienkowskiCDHJJS13,
author = {Marcin Bienkowski and
Marek Chrobak and
Christoph D{\"{u}}rr and
Mathilde Hurand and
Artur Jez and
Lukasz Jez and
Grzegorz Stachowiak},
title = {A \emph{{\(\phi\)}}-competitive algorithm for collecting items with
increasing weights from a dynamic queue},
journal = {Theor. Comput. Sci.},
volume = {475},
pages = {92--102},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.12.046},
doi = {10.1016/J.TCS.2012.12.046},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BienkowskiCDHJJS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChrobakJS13,
author = {Marek Chrobak and
Lukasz Jez and
Jir{\'{\i}} Sgall},
title = {Better bounds for incremental frequency allocation in bipartite graphs},
journal = {Theor. Comput. Sci.},
volume = {514},
pages = {75--83},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.05.020},
doi = {10.1016/J.TCS.2012.05.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChrobakJS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BienkowskiBCJSS13,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Marek Chrobak and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Grzegorz Stachowiak},
editor = {Frank Dehne and
Roberto Solis{-}Oba and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Online Control Message Aggregation in Chain Networks},
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 = {133--145},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40104-6\_12},
doi = {10.1007/978-3-642-40104-6\_12},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/BienkowskiBCJSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/CyganJ13,
author = {Marek Cygan and
Lukasz Jez},
editor = {Christos Kaklamanis and
Kirk Pruhs},
title = {Online Knapsack Revisited},
booktitle = {Approximation and Online Algorithms - 11th International Workshop,
{WAOA} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8447},
pages = {144--155},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-08001-7\_13},
doi = {10.1007/978-3-319-08001-7\_13},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/CyganJ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/DurrJV13,
author = {Christoph D{\"{u}}rr and
Lukasz Jez and
{\'{O}}scar C. V{\'{a}}squez},
editor = {Yiling Chen and
Nicole Immorlica},
title = {Mechanism Design for Aggregating Energy Consumption and Quality of
Service in Speed Scaling Scheduling},
booktitle = {Web and Internet Economics - 9th International Conference, {WINE}
2013, Cambridge, MA, USA, December 11-14, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8289},
pages = {134--145},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45046-4\_12},
doi = {10.1007/978-3-642-45046-4\_12},
timestamp = {Thu, 12 Aug 2021 18:47:48 +0200},
biburl = {https://dblp.org/rec/conf/wine/DurrJV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BienkowskiBCJS13,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Marek Chrobak and
Lukasz Jez and
Jir{\'{\i}} Sgall},
title = {Better Approximation Bounds for the Joint Replenishment Problem},
journal = {CoRR},
volume = {abs/1307.2531},
year = {2013},
url = {http://arxiv.org/abs/1307.2531},
eprinttype = {arXiv},
eprint = {1307.2531},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BienkowskiBCJS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/DurrJT12,
author = {Christoph D{\"{u}}rr and
Lukasz Jez and
Kim Thang Nguyen},
title = {Online scheduling of bounded length jobs to maximize throughput},
journal = {J. Sched.},
volume = {15},
number = {5},
pages = {653--664},
year = {2012},
url = {https://doi.org/10.1007/s10951-011-0233-1},
doi = {10.1007/S10951-011-0233-1},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/DurrJT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/JezLSS12,
author = {Lukasz Jez and
Fei Li and
Jay Sethuraman and
Clifford Stein},
title = {Online scheduling of packets with agreeable deadlines},
journal = {{ACM} Trans. Algorithms},
volume = {9},
number = {1},
pages = {5:1--5:11},
year = {2012},
url = {https://doi.org/10.1145/2390176.2390181},
doi = {10.1145/2390176.2390181},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/JezLSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/EpsteinJSS12,
author = {Leah Epstein and
Lukasz Jez and
Jir{\'{\i}} Sgall and
Rob van Stee},
editor = {Anupam Gupta and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Rocco A. Servedio},
title = {Online Scheduling of Jobs with Fixed Start Times on Related Machines},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 15th International Workshop, {APPROX} 2012, and 16th
International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August
15-17, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7408},
pages = {134--145},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32512-0\_12},
doi = {10.1007/978-3-642-32512-0\_12},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/EpsteinJSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BienkowskiCJ11,
author = {Marcin Bienkowski and
Marek Chrobak and
Lukasz Jez},
title = {Randomized competitive algorithms for online buffer management in
the adaptive adversary model},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5121--5131},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.015},
doi = {10.1016/J.TCS.2011.05.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BienkowskiCJ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/Jez11,
author = {Lukasz Jez},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {One to Rule Them All: {A} General Randomized Algorithm for Buffer
Management with Bounded Delay},
booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-9, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6942},
pages = {239--250},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_21},
doi = {10.1007/978-3-642-23719-5\_21},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/Jez11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ChrobakJS11,
author = {Marek Chrobak and
Lukasz Jez and
Jir{\'{\i}} Sgall},
editor = {Camil Demetrescu and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Better Bounds for Incremental Frequency Allocation in Bipartite Graphs},
booktitle = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
Germany, September 5-9, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6942},
pages = {251--262},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-23719-5\_22},
doi = {10.1007/978-3-642-23719-5\_22},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/ChrobakJS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-1273,
author = {Lukasz Jez},
title = {One to Rule Them All: a General Randomized Algorithm for Buffer Management
with Bounded Delay},
journal = {CoRR},
volume = {abs/1102.1273},
year = {2011},
url = {http://arxiv.org/abs/1102.1273},
eprinttype = {arXiv},
eprint = {1102.1273},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-1273.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-3393,
author = {Marek Chrobak and
Lukasz Jez and
Jir{\'{\i}} Sgall},
title = {Better Bounds for Incremental Frequency Allocation in Bipartite Graphs},
journal = {CoRR},
volume = {abs/1102.3393},
year = {2011},
url = {http://arxiv.org/abs/1102.3393},
eprinttype = {arXiv},
eprint = {1102.3393},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-3393.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/GawrychowskiJJ10,
author = {Pawel Gawrychowski and
Artur Jez and
Lukasz Jez},
editor = {Farid M. Ablayev and
Ernst W. Mayr},
title = {Validating the Knuth-Morris-Pratt Failure Function, Fast and Online},
booktitle = {Computer Science - Theory and Applications, 5th International Computer
Science Symposium in Russia, {CSR} 2010, Kazan, Russia, June 16-20,
2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6072},
pages = {132--143},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13182-0\_13},
doi = {10.1007/978-3-642-13182-0\_13},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/GawrychowskiJJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Jez10,
author = {Lukasz Jez},
editor = {Jean{-}Yves Marion and
Thomas Schwentick},
title = {Randomized Algorithm for Agreeable Deadlines Packet Scheduling},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2010, March 4-6, 2010, Nancy, France},
series = {LIPIcs},
volume = {5},
pages = {489--500},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.STACS.2010.2479},
doi = {10.4230/LIPICS.STACS.2010.2479},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/Jez10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BienkowskiCDHJJS09,
author = {Marcin Bienkowski and
Marek Chrobak and
Christoph D{\"{u}}rr and
Mathilde Hurand and
Artur Jez and
Lukasz Jez and
Grzegorz Stachowiak},
editor = {Claire Mathieu},
title = {Collecting weighted items from a dynamic queue},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {1126--1135},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.122},
doi = {10.1137/1.9781611973068.122},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BienkowskiCDHJJS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/DurrJT09,
author = {Christoph D{\"{u}}rr and
Lukasz Jez and
Kim Thang Nguyen},
editor = {Evripidis Bampis and
Klaus Jansen},
title = {Online Scheduling of Bounded Length Jobs to Maximize Throughput},
booktitle = {Approximation and Online Algorithms, 7th International Workshop, {WAOA}
2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5893},
pages = {116--127},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-12450-1\_11},
doi = {10.1007/978-3-642-12450-1\_11},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/waoa/DurrJT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0901-2897,
author = {Pawel Gawrychowski and
Artur Jez and
Lukasz Jez},
title = {Optimal, online validation of the pi and pi' failure functions},
journal = {CoRR},
volume = {abs/0901.2897},
year = {2009},
url = {http://arxiv.org/abs/0901.2897},
eprinttype = {arXiv},
eprint = {0901.2897},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0901-2897.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0902-2209,
author = {Christoph D{\"{u}}rr and
Lukasz Jez and
Kim Thang Nguyen},
title = {Online Scheduling of Bounded Length Jobs to Maximize Throughput},
journal = {CoRR},
volume = {abs/0902.2209},
year = {2009},
url = {http://arxiv.org/abs/0902.2209},
eprinttype = {arXiv},
eprint = {0902.2209},
timestamp = {Tue, 01 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-0902-2209.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0905-4068,
author = {Lukasz Jez},
title = {A 4/3-competitive randomised algorithm for online packet scheduling
with agreeable deadlines},
journal = {CoRR},
volume = {abs/0905.4068},
year = {2009},
url = {http://arxiv.org/abs/0905.4068},
eprinttype = {arXiv},
eprint = {0905.4068},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0905-4068.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0907-2050,
author = {Lukasz Jez},
title = {Randomised Buffer Management with Bounded Delay against Adaptive Adversary},
journal = {CoRR},
volume = {abs/0907.2050},
year = {2009},
url = {http://arxiv.org/abs/0907.2050},
eprinttype = {arXiv},
eprint = {0907.2050},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0907-2050.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/BienkowskiCJ08,
author = {Marcin Bienkowski and
Marek Chrobak and
Lukasz Jez},
editor = {Evripidis Bampis and
Martin Skutella},
title = {Randomized Algorithms for Buffer Management with 2-Bounded Delay},
booktitle = {Approximation and Online Algorithms, 6th International Workshop, {WAOA}
2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5426},
pages = {92--104},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-93980-1\_8},
doi = {10.1007/978-3-540-93980-1\_8},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BienkowskiCJ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-1685,
author = {Marcin Bienkowski and
Marek Chrobak and
Christoph D{\"{u}}rr and
Mathilde Hurand and
Artur Jez and
Lukasz Jez and
Jakub Lopuszanski and
Grzegorz Stachowiak},
title = {Generalized Whac-a-Mole},
journal = {CoRR},
volume = {abs/0802.1685},
year = {2008},
url = {http://arxiv.org/abs/0802.1685},
eprinttype = {arXiv},
eprint = {0802.1685},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0802-1685.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-25 02:39 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:
