E-LIB Suche - Ergebnisse für: Sgall, J.

1

Communication complexity towards lower bounds on circuit de..:

Edmonds, J. ; Impagliazzo, R. ; Rudich, S..
Computational Complexity. 10 (2001) 3 - p. 210-246 , 2001

Link: https://doi.org/10.1007/..

2

Ancient and New Algorithms for Load Balancing in the l p No..:

Avidor, A. ; Azar, Y. ; Sgall, J.
Algorithmica. 29 (2001) 3 - p. 422-441 , 2001

Link: https://doi.org/10.1007/..

3

Lower bounds for the polynomial calculus and the Gröbner ba..:

Impagliazzo, R. ; Pudlák, P. ; Sgall, J.
Computational Complexity. 8 (1999) 2 - p. 127-144 , 1999

Link: https://doi.org/10.1007/..

4

Proof complexity in algebraic systems and bounded depth Fre..:

Buss, S. ; Impagliazzo, R. ; Krajíček, J....
Computational Complexity. 6 (1996) 3 - p. 256-298 , 1996

Link: https://doi.org/10.1007/..

5

Multiprocessor jobs, preemptive schedules, and one-competit..:

Sgall, Jiří ; Woeginger, Gerhard J.
Operations Research Letters. 51 (2023) 6 - p. 583-590 , 2023

Link: https://doi.org/10.1016/..

6

A \(\boldsymbol{\phi }\)-Competitive Algorithm for Scheduli..:

Veselý, Pavel ; Chrobak, Marek ; Jeż, Łukasz.
SIAM Journal on Computing. 51 (2022) 5 - p. 1626-1691 , 2022

Link: https://doi.org/10.1137/..

7

Graph Burning and Non-uniform k-centers for Small Treewidth:

, In: Approximation and Online Algorithms; Lecture Notes in Computer Science,

Lieskovský, Matej ; Sgall, Jiří - p. 20-35 , 2022

Link: https://doi.org/10.1007/..

8

Improved Analysis of Online Balanced Clustering:

, In: Approximation and Online Algorithms; Lecture Notes in Computer Science,

Bienkowski, Marcin ; Böhm, Martin ; Koutecký, Martin... - p. 224-233 , 2021

Link: https://doi.org/10.1007/..

9

New results on multi-level aggregation:

Bienkowski, Marcin ; Böhm, Martin ; Byrka, Jaroslaw...
Theoretical Computer Science. 861 (2021) - p. 133-143 , 2021

Link: https://doi.org/10.1016/..

10

On packet scheduling with adversarial jamming and speedup:

Böhm, Martin ; Jeż, Łukasz ; Sgall, Jiří.
Annals of Operations Research. 298 (2019) 1-2 - p. 7-42 , 2019

Link: https://doi.org/10.1007/..

11

Online packet scheduling with bounded delay and lookahead:

Böhm, Martin ; Chrobak, Marek ; Jeż, Łukasz...
Theoretical Computer Science. 776 (2019) - p. 95-113 , 2019

Link: https://doi.org/10.1016/..

12

A ϕ-competitive algorithm for scheduling packets with deadl..:

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

Veselý, Pavel ; Chrobak, Marek ; Jeż, Łukasz. - p. 123-142 , 2019

Link: https://dl.acm.org/doi/1..

13

The optimal absolute ratio for online bin packing:

Balogh, János ; Békési, József ; Dósa, György..
Journal of Computer and System Sciences. 102 (2019) - p. 1-17 , 2019

Link: https://doi.org/10.1016/..

14

Logarithmic price of buffer downscaling on line metrics:

Bienkowski, Marcin ; Böhm, Martin ; Jeż, Łukasz...
Theoretical Computer Science. 707 (2018) - p. 89-93 , 2018

Link: https://doi.org/10.1016/..

15

Topics in Theoretical Computer Science

Second IFIP WG 1.8 International Conference, TTCS 2017, Teh... Lecture Notes in Computer Science ; 10608;SpringerLink, Bücher;Springer eBook Collection, Computer Science

Sgall, Jiří ; Mousavi, Mohammad Reza , 2017

Link: https://doi.org/10.1007/..