Lukasz Jez

Orcid: 0000-0002-7375-0641

Affiliations:

University of Wroclaw, Poland

According to our database¹, Lukasz Jez authored at least 44 papers between 2008 and 2022.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2022

A $\boldsymbol{\phi }$ -Competitive Algorithm for Scheduling Packets with Deadlines.

[BibT_eX]

[DOI]

SIAM J. Comput., 2022

Lower Bounds on the Performance of Online Algorithms for Relaxed Packing Problems.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2021

New results on multi-level aggregation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

On packet scheduling with adversarial jamming and speedup.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2021

2020

Online Algorithms for Multilevel Aggregation.

[BibT_eX]

[DOI]

Oper. Res., 2020

Unbounded lower bound for k-server against weak adversaries.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019

Online packet scheduling with bounded delay and lookahead.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

The (h, k)-Server Problem on Bounded Depth Trees.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Better Bounds for Online Line Chasing.

[BibT_eX]

[DOI]

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics.

[BibT_eX]

[DOI]

Marcin Bienkowski

Lukasz Jez

Pawel Schmidt

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Dynamic Pricing of Servers on Trees.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2019

2018

Logarithmic price of buffer downscaling on line metrics.

[BibT_eX]

[DOI]

Marcin Bienkowski

Martin Böhm

Lukasz Jez

Pawel Laskos-Grabowski

Theor. Comput. Sci., 2018

Tight Bounds for Double Coverage Against Weak Adversaries.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

2017

Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling.

[BibT_eX]

[DOI]

Christoph Dürr

Lukasz Jez

Óscar C. Vásquez

Theor. Comput. Sci., 2017

Scheduling multipacket frames with frame deadlines.

[BibT_eX]

[DOI]

Lukasz Jez

Yishay Mansour

Boaz Patt-Shamir

J. Sched., 2017

The (h, k)-Server Problem on Bounded Depth Trees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Online Knapsack Revisited.

[BibT_eX]

[DOI]

Marek Cygan

Lukasz Jez

Jirí Sgall

Theory Comput. Syst., 2016

New Bounds for the $(h, k)$-Server Problem.

[BibT_eX]

[DOI]

CoRR, 2016

Online Scheduling of Jobs with Fixed Start Times on Related Machines.

[BibT_eX]

[DOI]

Algorithmica, 2016

Make-to-Order Integrated Scheduling and Distribution.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Online Algorithms for Multi-Level Aggregation.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption.

[BibT_eX]

[DOI]

Christoph Dürr

Lukasz Jez

Oscar C. Vásquez

Discret. Appl. Math., 2015

Pricing Online Decisions: Beyond Auctions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Validating the Knuth-Morris-Pratt Failure Function, Fast and Online.

[BibT_eX]

[DOI]

Pawel Gawrychowski

Artur Jez

Lukasz Jez

Theory Comput. Syst., 2014

Better Approximation Bounds for the Joint Replenishment Problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

Better bounds for incremental frequency allocation in bipartite graphs.

[BibT_eX]

[DOI]

Marek Chrobak

Lukasz Jez

Jirí Sgall

Theor. Comput. Sci., 2013

A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Lower bounds for online makespan minimization on a small number of related machines.

[BibT_eX]

[DOI]

J. Sched., 2013

Better Approximation Bounds for the Joint Replenishment Problem.

[BibT_eX]

[DOI]

CoRR, 2013

A Universal Randomized Packet Scheduling Algorithm.

[BibT_eX]

[DOI]

Lukasz Jez

Algorithmica, 2013

Collecting Weighted Items from a Dynamic Queue.

[BibT_eX]

[DOI]

Algorithmica, 2013

Online Knapsack Revisited.

[BibT_eX]

[DOI]

Marek Cygan

Lukasz Jez

Proceedings of the Approximation and Online Algorithms - 11th International Workshop, 2013

Online Control Message Aggregation in Chain Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

2012

Online scheduling of packets with agreeable deadlines.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

Online scheduling of bounded length jobs to maximize throughput.

[BibT_eX]

[DOI]

Christoph Dürr

Lukasz Jez

Kim Thang Nguyen

J. Sched., 2012

2011

Randomized competitive algorithms for online buffer management in the adaptive adversary model.

[BibT_eX]

[DOI]

Marcin Bienkowski

Marek Chrobak

Lukasz Jez

Theor. Comput. Sci., 2011

One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay.

[BibT_eX]

[DOI]

Lukasz Jez

Proceedings of the Algorithms - ESA 2011, 2011

2010

Randomized Algorithm for Agreeable Deadlines Packet Scheduling.

[BibT_eX]

[DOI]

Lukasz Jez

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

2009

Randomised Buffer Management with Bounded Delay against Adaptive Adversary

[BibT_eX]

[DOI]

Lukasz Jez

CoRR, 2009

A 4/3-competitive randomised algorithm for online packet scheduling with agreeable deadlines

[BibT_eX]

[DOI]

Lukasz Jez

CoRR, 2009

Optimal, online validation of the pi and pi' failure functions

[BibT_eX]

[DOI]

Pawel Gawrychowski

Artur Jez

Lukasz Jez

CoRR, 2009

2008

Generalized Whac-a-Mole

[BibT_eX]

[DOI]

CoRR, 2008

Randomized Algorithms for Buffer Management with 2-Bounded Delay.

[BibT_eX]

[DOI]

Marcin Bienkowski

Marek Chrobak

Lukasz Jez

Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Lukasz Jez

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...