default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLukasz Jez
Person information
- affiliation: University of Wroclaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c27]Marcin Bienkowski, Jaroslaw Byrka, Lukasz Jez:
Online Disjoint Set Covers: Randomization Is Not Necessary. STACS 2025: 18:1-18:16- 2024
- [i22]Marcin Bienkowski, Jaroslaw Byrka, Lukasz Jez:
Online Disjoint Set Covers: Randomization is not Necessary. CoRR abs/2404.15554 (2024) - 2022
- [j22]Pavel Veselý
, Marek Chrobak, Lukasz Jez, Jirí Sgall:
A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines. SIAM J. Comput. 51(5): 1626-1691 (2022) - [c26]János Balogh, György Dósa, Leah Epstein, Lukasz Jez:
Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems. IWOCA 2022: 101-113 - [i21]János Balogh, György Dósa, Leah Epstein, Lukasz Jez:
Lower bounds on the performance of online algorithms for relaxed packing problems. CoRR abs/2201.05999 (2022) - 2021
- [j21]Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý:
On packet scheduling with adversarial jamming and speedup. Ann. Oper. Res. 298(1): 7-42 (2021) - [j20]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
New results on multi-level aggregation. Theor. Comput. Sci. 861: 133-143 (2021) - 2020
- [j19]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multilevel Aggregation. Oper. Res. 68(1): 214-232 (2020) - [c25]Marcin Bienkowski, Jaroslaw Byrka, Christian Coester, Lukasz Jez:
Unbounded lower bound for k-server against weak adversaries. STOC 2020: 1165-1169
2010 – 2019
- 2019
- [j18]Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos:
The (h, k)-Server Problem on Bounded Depth Trees. ACM Trans. Algorithms 15(2): 28:1-28:26 (2019) - [j17]Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý:
Online packet scheduling with bounded delay and lookahead. Theor. Comput. Sci. 776: 95-113 (2019) - [c24]Ilan Reuven Cohen, Alon Eden, Amos Fiat, Lukasz Jez:
Dynamic Pricing of Servers on Trees. APPROX-RANDOM 2019: 10:1-10:22 - [c23]Marcin Bienkowski, Lukasz Jez, Pawel Schmidt:
Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics. ISAAC 2019: 14:1-14:14 - [c22]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Christian Coester, Lukasz Jez, Elias Koutsoupias:
Better Bounds for Online Line Chasing. MFCS 2019: 8:1-8:13 - [c21]Pavel Veselý, Marek Chrobak, Lukasz Jez, Jirí Sgall:
A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines. SODA 2019: 123-142 - [i20]Marcin Bienkowski, Jaroslaw Byrka, Christian Coester, Lukasz Jez:
Unbounded lower bound for k-server against weak adversaries. CoRR abs/1911.01592 (2019) - 2018
- [j16]Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos, Kirk Pruhs:
Tight Bounds for Double Coverage Against Weak Adversaries. Theory Comput. Syst. 62(2): 349-365 (2018) - [j15]Marcin Bienkowski, Martin Böhm, Lukasz Jez, Pawel Laskos-Grabowski, Jan Marcinkowski, Jirí Sgall, Aleksandra Spyra, Pavel Veselý:
Logarithmic price of buffer downscaling on line metrics. Theor. Comput. Sci. 707: 89-93 (2018) - [i19]Christoph Dürr, Lukasz Jez, Óscar C. Vásquez:
Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption. CoRR abs/1805.11297 (2018) - [i18]Pavel Veselý, Marek Chrobak, Lukasz Jez, Jirí Sgall:
A φ-Competitive Algorithm for Scheduling Packets with Deadlines. CoRR abs/1807.07177 (2018) - [i17]Marcin Bienkowski, Lukasz Jez, Pawel Schmidt:
Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics. CoRR abs/1810.00580 (2018) - [i16]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Christian Coester, Lukasz Jez, Elias Koutsoupias:
Better Bounds for Online Line Chasing. CoRR abs/1811.09233 (2018) - 2017
- [j14]Lukasz Jez, Yishay Mansour, Boaz Patt-Shamir:
Scheduling multipacket frames with frame deadlines. J. Sched. 20(6): 623-634 (2017) - [j13]Christoph Dürr, Lukasz Jez, Óscar C. Vásquez:
Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling. Theor. Comput. Sci. 695: 28-41 (2017) - [c20]Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos:
The (h, k)-Server Problem on Bounded Depth Trees. SODA 2017: 1022-1037 - [c19]Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý:
On Packet Scheduling with Adversarial Jamming and Speedup. WAOA 2017: 190-206 - [i15]Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý:
On Packet Scheduling with Adversarial Jamming and Speedup. CoRR abs/1705.07018 (2017) - 2016
- [j12]Leah Epstein, Lukasz Jez, Jirí Sgall, Rob van Stee:
Online Scheduling of Jobs with Fixed Start Times on Related Machines. Algorithmica 74(1): 156-176 (2016) - [j11]Marek Cygan, Lukasz Jez, Jirí Sgall:
Online Knapsack Revisited. Theory Comput. Syst. 58(1): 153-190 (2016) - [c18]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jiri Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multi-Level Aggregation. ESA 2016: 12:1-12:17 - [c17]Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý:
Online Packet Scheduling with Bounded Delay and Lookahead. ISAAC 2016: 21:1-21:13 - [c16]Yossi Azar, Amir Epstein, Lukasz Jez, Adi Vardi:
Make-to-Order Integrated Scheduling and Distribution. SODA 2016: 140-154 - [i14]Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý:
Online Packet Scheduling with Bounded Delay and Lookahead. CoRR abs/1606.09395 (2016) - [i13]Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos:
New Bounds for the $(h, k)$-Server Problem. CoRR abs/1608.08527 (2016) - [i12]Marcin Bienkowski, Martin Böhm, Lukasz Jez, Pawel Laskos-Grabowski, Jan Marcinkowski, Jirí Sgall, Aleksandra Spyra, Pavel Veselý:
Logarithmic price of buffer downscaling on line metrics. CoRR abs/1610.04915 (2016) - 2015
- [j10]Christoph Dürr, Lukasz Jez, Oscar C. Vásquez:
Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption. Discret. Appl. Math. 196: 20-27 (2015) - [c15]Lukasz Jez, Yishay Mansour, Boaz Patt-Shamir:
Scheduling Multipacket Frames with Frame Deadlines. SIROCCO 2015: 76-90 - [c14]Ilan Reuven Cohen, Alon Eden, Amos Fiat, Lukasz Jez:
Pricing Online Decisions: Beyond Auctions. SODA 2015: 73-91 - [c13]Nikhil Bansal, Marek Eliás, Lukasz Jez, Grigorios Koumoutsos, Kirk Pruhs:
Tight Bounds for Double Coverage Against Weak Adversaries. WAOA 2015: 47-58 - [i11]Ilan Reuven Cohen, Alon Eden, Amos Fiat, Lukasz Jez:
Pricing Online Decisions: Beyond Auctions. CoRR abs/1504.01093 (2015) - [i10]Christoph Dürr, Lukasz Jez, Óscar C. Vásquez:
Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling. CoRR abs/1504.03586 (2015) - [i9]Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý:
Online Algorithms for Multi-Level Aggregation. CoRR abs/1507.02378 (2015) - 2014
- [j9]Pawel Gawrychowski, Artur Jez, Lukasz Jez:
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online. Theory Comput. Syst. 54(2): 337-372 (2014) - [c12]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Dorian Nogneng, Jirí Sgall:
Better Approximation Bounds for the Joint Replenishment Problem. SODA 2014: 42-54 - 2013
- [j8]Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak:
Collecting Weighted Items from a Dynamic Queue. Algorithmica 65(1): 60-94 (2013) - [j7]Lukasz Jez:
A Universal Randomized Packet Scheduling Algorithm. Algorithmica 67(4): 498-515 (2013) - [j6]Lukasz Jez, Jarett Schwartz, Jirí Sgall, József Békési:
Lower bounds for online makespan minimization on a small number of related machines. J. Sched. 16(5): 539-547 (2013) - [j5]Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak:
A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue. Theor. Comput. Sci. 475: 92-102 (2013) - [j4]Marek Chrobak, Lukasz Jez, Jirí Sgall:
Better bounds for incremental frequency allocation in bipartite graphs. Theor. Comput. Sci. 514: 75-83 (2013) - [c11]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Jirí Sgall, Grzegorz Stachowiak:
Online Control Message Aggregation in Chain Networks. WADS 2013: 133-145 - [c10]Marek Cygan, Lukasz Jez:
Online Knapsack Revisited. WAOA 2013: 144-155 - [c9]Christoph Dürr, Lukasz Jez, Óscar C. Vásquez:
Mechanism Design for Aggregating Energy Consumption and Quality of Service in Speed Scaling Scheduling. WINE 2013: 134-145 - [i8]Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Jirí Sgall:
Better Approximation Bounds for the Joint Replenishment Problem. CoRR abs/1307.2531 (2013) - 2012
- [j3]Christoph Dürr, Lukasz Jez, Kim Thang Nguyen:
Online scheduling of bounded length jobs to maximize throughput. J. Sched. 15(5): 653-664 (2012) - [j2]Lukasz Jez, Fei Li, Jay Sethuraman, Clifford Stein:
Online scheduling of packets with agreeable deadlines. ACM Trans. Algorithms 9(1): 5:1-5:11 (2012) - [c8]Leah Epstein, Lukasz Jez, Jirí Sgall, Rob van Stee:
Online Scheduling of Jobs with Fixed Start Times on Related Machines. APPROX-RANDOM 2012: 134-145 - 2011
- [j1]Marcin Bienkowski, Marek Chrobak, Lukasz Jez:
Randomized competitive algorithms for online buffer management in the adaptive adversary model. Theor. Comput. Sci. 412(39): 5121-5131 (2011) - [c7]Lukasz Jez:
One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay. ESA 2011: 239-250 - [c6]Marek Chrobak, Lukasz Jez, Jirí Sgall:
Better Bounds for Incremental Frequency Allocation in Bipartite Graphs. ESA 2011: 251-262 - [i7]Lukasz Jez:
One to Rule Them All: a General Randomized Algorithm for Buffer Management with Bounded Delay. CoRR abs/1102.1273 (2011) - [i6]Marek Chrobak, Lukasz Jez, Jirí Sgall:
Better Bounds for Incremental Frequency Allocation in Bipartite Graphs. CoRR abs/1102.3393 (2011) - 2010
- [c5]Pawel Gawrychowski, Artur Jez, Lukasz Jez:
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online. CSR 2010: 132-143 - [c4]Lukasz Jez:
Randomized Algorithm for Agreeable Deadlines Packet Scheduling. STACS 2010: 489-500
2000 – 2009
- 2009
- [c3]Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Grzegorz Stachowiak:
Collecting weighted items from a dynamic queue. SODA 2009: 1126-1135 - [c2]Christoph Dürr, Lukasz Jez, Kim Thang Nguyen:
Online Scheduling of Bounded Length Jobs to Maximize Throughput. WAOA 2009: 116-127 - [i5]Pawel Gawrychowski, Artur Jez, Lukasz Jez:
Optimal, online validation of the pi and pi' failure functions. CoRR abs/0901.2897 (2009) - [i4]Christoph Dürr, Lukasz Jez, Kim Thang Nguyen:
Online Scheduling of Bounded Length Jobs to Maximize Throughput. CoRR abs/0902.2209 (2009) - [i3]Lukasz Jez:
A 4/3-competitive randomised algorithm for online packet scheduling with agreeable deadlines. CoRR abs/0905.4068 (2009) - [i2]Lukasz Jez:
Randomised Buffer Management with Bounded Delay against Adaptive Adversary. CoRR abs/0907.2050 (2009) - 2008
- [c1]Marcin Bienkowski, Marek Chrobak, Lukasz Jez:
Randomized Algorithms for Buffer Management with 2-Bounded Delay. WAOA 2008: 92-104 - [i1]Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jez, Lukasz Jez, Jakub Lopuszanski, Grzegorz Stachowiak:
Generalized Whac-a-Mole. CoRR abs/0802.1685 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-26 21:48 CET 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:
