Jirí Sgall

162 papers A* 15A 22B 16C 2Misc 2Journal 91Unranked 9
YearRankTypeTitle / Venue / Authors
2026 J jnl
No tiling of the 70 × 70 square with consecutive squares.
Theor. Comput. Sci.
Jirí Sgall, János Balogh, József Békési, György Dósa, Lars Magnus Hvattum, Zsolt Tuza
2026 J jnl
Two Complexity Results on Spanning-Tree Congestion Problems.
CoRR
Sunny Atalig, Marek Chrobak, Christoph Dürr, Petr Kolman, Huong Luu, Jirí Sgall, Gregory Zhu
2025 A conf
A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs.
ESA
Mateusz Basiak, Marcin Bienkowski, Martin Böhm, Marek Chrobak, Lukasz Jez, Jirí Sgall, Agnieszka Tatarczuk
2025 J jnl
A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs.
CoRR
Mateusz Basiak, Marcin Bienkowski, Martin Böhm, Marek Chrobak, Lukasz Jez, Jirí Sgall, Agnieszka Tatarczuk
2024 A conf
Improved Online Load Balancing with Known Makespan.
APPROX/RANDOM
Martin Böhm, Matej Lieskovský, Sören Schmitt, Jirí Sgall, Rob van Stee
2024 J jnl
Improved online load balancing with known makespan.
CoRR
Martin Böhm, Matej Lieskovský, Sören Schmitt, Jirí Sgall, Rob van Stee
2024 Misc conf
No Tiling of the 70 × 70 Square with Consecutive Squares.
FUN
Jirí Sgall, János Balogh, József Békési, György Dósa, Lars Magnus Hvattum, Zsolt Tuza
2024 A conf
Speed-Robust Scheduling Revisited.
APPROX/RANDOM
Josef Minarík, Jirí Sgall
2024 J jnl
Speed-robust scheduling revisited.
CoRR
Josef Minarík, Jirí Sgall
2023 A conf
Approximation Algorithms and Lower Bounds for Graph Burning.
APPROX/RANDOM
Matej Lieskovský, Jirí Sgall, Andreas Emil Feldmann
2023 J jnl
Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms.
Oper. Res. Lett.
Jirí Sgall, Gerhard J. Woeginger
2022 J jnl
A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines.
SIAM J. Comput.
Pavel Veselý, Marek Chrobak, Lukasz Jez, Jirí Sgall
2022 B conf
Graph Burning and Non-uniform k-centers for Small Treewidth.
WAOA
Matej Lieskovský, Jirí Sgall
2021 B conf
Improved Analysis of Online Balanced Clustering.
WAOA
Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý
2021 J jnl
Improved Analysis of Online Balanced Clustering.
CoRR
Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý
2021 J jnl
New results on multi-level aggregation.
Theor. Comput. Sci.
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý
2021 J jnl
On packet scheduling with adversarial jamming and speedup.
Ann. Oper. Res.
Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý
2020 J jnl
Online Algorithms for Multilevel Aggregation.
Oper. Res.
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý
2019 A* conf
A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines.
SODA
Pavel Veselý, Marek Chrobak, Lukasz Jez, Jirí Sgall
2019 J jnl
Online packet scheduling with bounded delay and lookahead.
Theor. Comput. Sci.
Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý
2019 J jnl
The optimal absolute ratio for online bin packing.
J. Comput. Syst. Sci.
János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee
2018 J jnl
A φ-Competitive Algorithm for Scheduling Packets with Deadlines.
CoRR
Pavel Veselý, Marek Chrobak, Lukasz Jez, Jirí Sgall
2018 J jnl
Colored Bin Packing: Online Algorithms and Lower Bounds.
Algorithmica
Martin Böhm, György Dósa, Leah Epstein, Jirí Sgall, Pavel Veselý
2018 J jnl
Logarithmic price of buffer downscaling on line metrics.
Theor. Comput. Sci.
Marcin Bienkowski, Martin Böhm, Lukasz Jez, Pawel Laskos-Grabowski, Jan Marcinkowski, Jirí Sgall, Aleksandra Spyra, Pavel Veselý
2018 J jnl
Scheduling shared continuous resources on many-cores.
J. Sched.
Ernst Althaus, André Brinkmann, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel, Sören Riechers, Jirí Sgall, Tim Süß
2017 J jnl
A two-phase algorithm for bin stretching with stretching factor 1.5.
J. Comb. Optim.
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
2017 J jnl
Erratum to: A two-phase algorithm for bin stretching with stretching factor 1.5.
J. Comb. Optim.
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
2017 J jnl
General Caching Is Hard: Even with Small Pages.
Algorithmica
Lukás Folwarczný, Jirí Sgall
2017 B conf
On Packet Scheduling with Adversarial Jamming and Speedup.
WAOA
Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý
2017 J jnl
On Packet Scheduling with Adversarial Jamming and Speedup.
CoRR
Martin Böhm, Lukasz Jez, Jirí Sgall, Pavel Veselý
2017 J jnl
Online bin stretching with three bins.
J. Sched.
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
2017 — ed.
Topics in Theoretical Computer Science - Second IFIP WG 1.8 International Conference, TTCS 2017, Tehran, Iran, September 12-14, 2017, Proceedings
TTCS
Mohammad Reza Mousavi, Jirí Sgall
2016 J jnl
Logarithmic price of buffer downscaling on line metrics.
CoRR
Marcin Bienkowski, Martin Böhm, Lukasz Jez, Pawel Laskos-Grabowski, Jan Marcinkowski, Jirí Sgall, Aleksandra Spyra, Pavel Veselý
2016 J jnl
Online Knapsack Revisited.
Theory Comput. Syst.
Marek Cygan, Lukasz Jez, Jirí Sgall
2016 B conf
Online Packet Scheduling with Bounded Delay and Lookahead.
ISAAC
Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý
2016 J jnl
Online Packet Scheduling with Bounded Delay and Lookahead.
CoRR
Martin Böhm, Marek Chrobak, Lukasz Jez, Fei Li, Jirí Sgall, Pavel Veselý
2016 J jnl
Online Scheduling of Jobs with Fixed Start Times on Related Machines.
Algorithmica
Leah Epstein, Lukasz Jez, Jirí Sgall, Rob van Stee
2016 J jnl
The Best Two-Phase Algorithm for Bin Stretching.
CoRR
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
2015 J jnl
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption.
Theory Comput. Syst.
Tomás Ebenlendr, Jirí Sgall
2015 B conf
General Caching Is Hard: Even with Small Pages.
ISAAC
Lukás Folwarczný, Jirí Sgall
2015 J jnl
General Caching Is Hard: Even with Small Pages.
CoRR
Lukás Folwarczný, Jirí Sgall
2015 J jnl
Online Algorithms for Multi-Level Aggregation.
CoRR
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, Lukás Folwarczný, Lukasz Jez, Jirí Sgall, Kim Thang Nguyen, Pavel Veselý
2015 J jnl
Special Issue for the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, Klosterneuburg, Austria.
Inf. Comput.
Krishnendu Chatterjee, Jirí Sgall
2015 A* conf
The optimal absolute ratio for online bin packing.
SODA
János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee
2014 B conf
Better Algorithms for Online Bin Stretching.
WAOA
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
2014 J jnl
Better Algorithms for Online Bin Stretching.
CoRR
Martin Böhm, Jirí Sgall, Rob van Stee, Pavel Veselý
2014 A* conf
Better Approximation Bounds for the Joint Replenishment Problem.
SODA
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Dorian Nogneng, Jirí Sgall
2014 J jnl
Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines.
Algorithmica
Tomás Ebenlendr, Marek Krcál, Jirí Sgall
2014 B conf
Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms.
WAOA
Jirí Sgall, Gerhard J. Woeginger
2014 C conf
Online Bin Packing: Old Algorithms and New Results.
CiE
Jirí Sgall
2014 B conf
Online Colored Bin Packing.
WAOA
Martin Böhm, Jirí Sgall, Pavel Veselý
2014 J jnl
Online Colored Bin Packing.
CoRR
Martin Böhm, Jirí Sgall, Pavel Veselý
2014 — conf
Optimal Analysis of Best Fit Bin Packing.
ICALP (1)
György Dósa, Jirí Sgall
2013 J jnl
38th International Colloquium on Automata, Languages and Programming.
Inf. Comput.
Luca Aceto, Monika Henzinger, Jirí Sgall
2013 — ch.
An Upper Bound for a Communication Game Related to Time-Space Tradeoffs.
The Mathematics of Paul Erdős I
Pavel Pudlák, Jirí Sgall
2013 J jnl
Better Approximation Bounds for the Joint Replenishment Problem.
CoRR
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Jirí Sgall
2013 J jnl
Better bounds for incremental frequency allocation in bipartite graphs.
Theor. Comput. Sci.
Marek Chrobak, Lukasz Jez, Jirí Sgall
2013 A conf
First Fit bin packing: A tight analysis.
STACS
György Dósa, Jirí Sgall
2013 J jnl
Lower bounds for online makespan minimization on a small number of related machines.
J. Sched.
Lukasz Jez, Jarett Schwartz, Jirí Sgall, József Békési
2013 B ed.
Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings
MFCS
Krishnendu Chatterjee, Jirí Sgall
2013 B conf
Online Control Message Aggregation in Chain Networks.
WADS
Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Jirí Sgall, Grzegorz Stachowiak
2012 Misc conf
A New Analysis of Best Fit Bin Packing.
FUN
Jirí Sgall
2012 — conf
Online Scheduling of Jobs with Fixed Start Times on Related Machines.
APPROX-RANDOM
Leah Epstein, Lukasz Jez, Jirí Sgall, Rob van Stee
2012 A conf
Open Problems in Throughput Scheduling.
ESA
Jirí Sgall
2011 B conf
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption.
WAOA
Tomás Ebenlendr, Jirí Sgall
2011 — ed.
Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I
ICALP (1)
Luca Aceto, Monika Henzinger, Jirí Sgall
2011 — ed.
Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part II
ICALP (2)
Luca Aceto, Monika Henzinger, Jirí Sgall
2011 J jnl
Better Bounds for Incremental Frequency Allocation in Bipartite Graphs
CoRR
Marek Chrobak, Lukasz Jez, Jirí Sgall
2011 A conf
Better Bounds for Incremental Frequency Allocation in Bipartite Graphs.
ESA
Marek Chrobak, Lukasz Jez, Jirí Sgall
2011 J jnl
Semi-Online Preemptive Scheduling: One Algorithm for All Variants.
Theory Comput. Syst.
Tomás Ebenlendr, Jirí Sgall
2011 A conf
Two-Bounded-Space Bin Packing Revisited.
ESA
Marek Chrobak, Jirí Sgall, Gerhard J. Woeginger
2010 J jnl
Three results on frequency assignment in linear cellular networks.
Theor. Comput. Sci.
Marek Chrobak, Jirí Sgall
2009 J jnl
Algorithms for testing fault-tolerance of sequenced jobs.
J. Sched.
Marek Chrobak, Mathilde Hurand, Jirí Sgall
2009 — conf
Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput.
PPAM (2)
Ondrej Zajícek, Jirí Sgall, Tomás Ebenlendr
2009 J jnl
Optimal and online preemptive scheduling on uniformly related machines.
J. Sched.
Tomás Ebenlendr, Jirí Sgall
2009 J jnl
Periodic scheduling with obligatory vacations.
Theor. Comput. Sci.
Jirí Sgall, Hadas Shachnai, Tami Tamir
2009 J jnl
Preemptive Online Scheduling: Optimal Algorithms for All Speeds.
Algorithmica
Tomás Ebenlendr, Wojciech Jawor, Jirí Sgall
2009 A conf
Semi-Online Preemptive Scheduling: One Algorithm for All Variants.
STACS
Tomás Ebenlendr, Jirí Sgall
2009 C conf
Three Results on Frequency Assignment in Linear Cellular Networks.
AAIM
Marek Chrobak, Jirí Sgall
2008 B conf
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines.
WAOA
Tomás Ebenlendr, Jirí Sgall
2008 A* conf
Graph balancing: a special case of scheduling unrelated parallel machines.
SODA
Tomás Ebenlendr, Marek Krcál, Jirí Sgall
2008 J jnl
Randomized strategies for the plurality problem.
Discret. Appl. Math.
Daniel Král, Jirí Sgall, Tomás Tichý
2008 J jnl
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks.
Theory Comput.
Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman, Jirí Sgall
2007 J jnl
An Approximation Scheme For Cake Division With A Linear Number Of Cuts.
Comb.
Jirí Sgall, Gerhard J. Woeginger
2007 A conf
Fast Algorithms for Testing Fault-Tolerance of Sequenced Jobs with Deadlines.
RTSS
Marek Chrobak, Mathilde Hurand, Jirí Sgall
2007 J jnl
Improved online algorithms for buffer management in QoS switches.
ACM Trans. Algorithms
Marek Chrobak, Wojciech Jawor, Jirí Sgall, Tomás Tichý
2007 J jnl
On the complexity of cake cutting.
Discret. Optim.
Gerhard J. Woeginger, Jirí Sgall
2007 A conf
Online Scheduling of Equal-Length Jobs on Parallel Machines.
ESA
Jihuan Ding, Tomás Ebenlendr, Jirí Sgall, Guochuan Zhang
2007 J jnl
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help.
SIAM J. Comput.
Marek Chrobak, Wojciech Jawor, Jirí Sgall, Tomás Tichý
2007 J jnl
Paging with connections: FIFO strikes again.
Theor. Comput. Sci.
Leah Epstein, Yanir Kleiman, Jirí Sgall, Rob van Stee
2006 J jnl
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality.
J. Discrete Algorithms
Markus Bläser, Bodo Manthey, Jirí Sgall
2006 J jnl
Online competitive algorithms for maximizing weighted throughput of unit jobs.
J. Discrete Algorithms
Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Jirí Sgall, Tomás Tichý
2006 A conf
Preemptive Online Scheduling: Optimal Algorithms for All Speeds.
ESA
Tomás Ebenlendr, Wojciech Jawor, Jirí Sgall
2005 B conf
A Note on Semi-online Machine Covering.
WAOA
Tomás Ebenlendr, John Noga, Jirí Sgall, Gerhard J. Woeginger
2005 J jnl
Coloring graphs from lists with bounded size of their union.
J. Graph Theory
Daniel Král, Jirí Sgall
2005 A conf
Fairness-Free Periodic Scheduling with Vacations.
ESA
Jirí Sgall, Hadas Shachnai, Tami Tamir
2005 J jnl
On the Nonlearnability of a Single Spiking Neuron.
Neural Comput.
Jirí Síma, Jirí Sgall
2005 — conf
Online Scheduling.
Algorithms for Optimization with Incomplete Information
Jirí Sgall
2005 J jnl
The greedy algorithm for the minimum common string partition problem.
ACM Trans. Algorithms
Marek Chrobak, Petr Kolman, Jirí Sgall
2005 A* conf
Two algorithms for general list matrix partitions.
SODA
Tomás Feder, Pavol Hell, Daniel Král, Jirí Sgall
2004 J jnl
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines.
Algorithmica
Leah Epstein, Jirí Sgall
2004 J jnl
Computer-Aided Complexity Classification of Dial-a-Ride Problems.
INFORMS J. Comput.
Willem de Paepe, Jan Karel Lenstra, Jirí Sgall, René A. Sitters, Leen Stougie
2004 A conf
Errata to Analysis of the Harmonic Algorithm for Three Servers.
STACS
Marek Chrobak, Jirí Sgall
2004 J jnl
Functions that have read-twice constant width branching programs are not necessarily testable.
Random Struct. Algorithms
Eldar Fischer, Ilan Newman, Jirí Sgall
2004 A conf
Improved Online Algorithms for Buffer Management in QoS Switches.
ESA
Marek Chrobak, Wojciech Jawor, Jirí Sgall, Tomás Tichý
2004 J jnl
It is tough to be a plumber.
Theor. Comput. Sci.
Daniel Král, Vladan Majerech, Jirí Sgall, Tomás Tichý, Gerhard J. Woeginger
2004 A conf
Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs.
STACS
Yair Bartal, Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Ron Lavi, Jirí Sgall, Tomás Tichý
2004 A* conf
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help.
ICALP
Marek Chrobak, Wojciech Jawor, Jirí Sgall, Tomás Tichý
2004 — ch.
Online Scheduling.
Handbook of Scheduling
Kirk Pruhs, Jirí Sgall, Eric Torng
2004 A conf
Optimal and Online Preemptive Scheduling on Uniformly Related Machines.
STACS
Tomás Ebenlendr, Jirí Sgall
2004 — conf
The Greedy Algorithm for the Minimum Common String Partition Problem.
APPROX-RANDOM
Marek Chrobak, Petr Kolman, Jirí Sgall
2004 J jnl
The weighted 2-server problem.
Theor. Comput. Sci.
Marek Chrobak, Jirí Sgall
2003 A conf
A Lower Bound for Cake Cutting.
ESA
Jirí Sgall, Gerhard J. Woeginger
2003 A conf
Analysis of the Harmonic Algorithm for Three Servers.
STACS
Marek Chrobak, Jirí Sgall
2003 J jnl
Preemptive scheduling in overloaded systems.
J. Comput. Syst. Sci.
Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
2002 J jnl
Off-line temporary tasks assignment.
Theor. Comput. Sci.
Yossi Azar, Oded Regev, Jirí Sgall, Gerhard J. Woeginger
2002 A* conf
Preemptive Scheduling in Overloaded Systems.
ICALP
Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
2002 J jnl
Solution of a problem in DNA computing.
Theor. Comput. Sci.
Eric Anderson, Marek Chrobak, John Noga, Jirí Sgall, Gerhard J. Woeginger
2001 J jnl
Ancient and New Algorithms for Load Balancing in the
Algorithmica
Adi Avidor, Yossi Azar, Jirí Sgall
2001 J jnl
Communication complexity towards lower bounds on circuit depth.
Comput. Complex.
Jeff Edmonds, Russell Impagliazzo, Steven Rudich, Jirí Sgall
2001 B ed.
Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings
MFCS
Jirí Sgall, Ales Pultr, Petr Kolman
2001 J jnl
Solution of David Gale's lion and man problem.
Theor. Comput. Sci.
Jirí Sgall
2001 A* conf
The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts.
ICALP
Marek Chrobak, János Csirik, Csanád Imreh, John Noga, Jirí Sgall, Gerhard J. Woeginger
2001 J jnl
The complexity of coloring graphs without long induced paths.
Acta Cybern.
Gerhard J. Woeginger, Jirí Sgall
2000 J jnl
A lower bound for on-line scheduling on uniformly related machines.
Oper. Res. Lett.
Leah Epstein, Jirí Sgall
2000 J jnl
A simple analysis of the harmonic algorithm for two servers.
Inf. Process. Lett.
Marek Chrobak, Jirí Sgall
2000 J jnl
DNF tautologies with a limited number of occurrences of every variable.
Theor. Comput. Sci.
Petr Savický, Jirí Sgall
2000 J jnl
Efficient Dynamic Traitor Tracing.
SIAM J. Comput.
Omer Berkman, Michal Parnas, Jirí Sgall
2000 A* conf
Efficient dynamic traitor tracing.
SODA
Omer Berkman, Michal Parnas, Jirí Sgall
2000 J jnl
Multiprocessor Scheduling with Rejection.
SIAM J. Discret. Math.
Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jirí Sgall, Leen Stougie
2000 J jnl
Semi-online scheduling with decreasing job sizes.
Oper. Res. Lett.
Steven S. Seiden, Jirí Sgall, Gerhard J. Woeginger
2000 A conf
The Weighted 2-Server Problem.
STACS
Marek Chrobak, Jirí Sgall
1999 A conf
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines.
ESA
Leah Epstein, Jirí Sgall
1999 J jnl
Bounds on Pairs of Families with Restricted Intersections.
Comb.
Jirí Sgall
1999 J jnl
Lower Bounds for the Polynomial Calculus and the Gröbner Basis Algorithm.
Comput. Complex.
Russell Impagliazzo, Pavel Pudlák, Jirí Sgall
1999 A* conf
Randomized Online Scheduling on Two Uniform Machines.
SODA
Leah Epstein, John Noga, Steven S. Seiden, Jirí Sgall, Gerhard J. Woeginger
1998 A* conf
Ancient and New Algorithms for Load Balancing in the L
SODA
Adi Avidor, Yossi Azar, Jirí Sgall
1998 J jnl
Bounds on Pairs of Families with Restricted Intersections
Electron. Colloquium Comput. Complex.
Jirí Sgall
1998 J jnl
Optimal On-Line Scheduling of Parallel Jobs with Dependencies.
J. Comb. Optim.
Anja Feldmann, Ming-Yang Kao, Jirí Sgall, Shang-Hua Teng
1998 J jnl
Some Bounds on Multiparty Communication Complexity of Pointer Jumping.
Comput. Complex.
Carsten Damm, Stasys Jukna, Jirí Sgall
1997 J jnl
A Lower Bound for Randomized On-Line Multiprocessor Scheduling.
Inf. Process. Lett.
Jirí Sgall
1997 J jnl
Boolean Circuits, Tensor Ranks, and Communication Complexity.
SIAM J. Comput.
Pavel Pudlák, Vojtech Rödl, Jirí Sgall
1997 J jnl
Lower Bounds for the Polynomial Calculus and the Groebner Basis Algorithm
Electron. Colloquium Comput. Complex.
Russell Impagliazzo, Pavel Pudlák, Jirí Sgall
1997 J jnl
Proof Complexity in Algebraic Systems and Bounded Depth Frege Systems with Modular Counting.
Comput. Complex.
Samuel R. Buss, Russell Impagliazzo, Jan Krajícek, Pavel Pudlák, Alexander A. Razborov, Jirí Sgall
1996 — conf
Algebraic models of computation and interpolation for algebraic proof systems.
Proof Complexity and Feasible Arithmetics
Pavel Pudlák, Jirí Sgall
1996 — conf
Making DNA computers error resistant.
DNA Based Computers
Dan Boneh, Christopher Dunworth, Richard J. Lipton, Jirí Sgall
1996 A* conf
Multiprocessor Scheduling with Rejection.
SODA
Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jirí Sgall, Leen Stougie
1996 J jnl
On the Computational Power of DNA.
Discret. Appl. Math.
Dan Boneh, Christopher Dunworth, Richard J. Lipton, Jirí Sgall
1996 — conf
On-line Scheduling.
Online Algorithms
Jirí Sgall
1996 J jnl
Randomized On-Line Scheduling of Parallel Jobs.
J. Algorithms
Jirí Sgall
1996 J jnl
Solution of a covering problem related to labelled tournaments.
J. Graph Theory
Jirí Sgall
1996 A conf
Some Bounds on Multiparty Communication Complexity of Pointer Jumping.
STACS
Carsten Damm, Stasys Jukna, Jirí Sgall
1995 J jnl
An Upper Bound for a Communication Game Related to Time-Space Tradeoffs
Electron. Colloquium Comput. Complex.
Pavel Pudlák, Jirí Sgall
1995 — conf
Randomized On-Line Scheduling of Parallel Jobs.
ISTCS
Jirí Sgall
1995 J jnl
Some Bounds on Multiparty Communication Complexity of Pointer Jumping
Electron. Colloquium Comput. Complex.
Carsten Damm, Stasys Jukna, Jirí Sgall
1995 J jnl
Some Bounds on Multiparty Communication Complexity of Pointer Jumping
Universität Trier, Mathematik/Informatik, Forschungsbericht
Carsten Damm, Stasys Jukna, Jirí Sgall
1994 J jnl
Dynamic Scheduling on Parallel Machines.
Theor. Comput. Sci.
Anja Feldmann, Jirí Sgall, Shang-Hua Teng
1994 B conf
On-Line Scheduling of Parallel Jobs.
MFCS
Jirí Sgall
1993 A* conf
Optimal online scheduling of parallel jobs with dependencies.
STOC
Anja Feldmann, Ming-Yang Kao, Jirí Sgall, Shang-Hua Teng
1991 A* conf
Communication Complexity Towards Lower Bounds on Circuit Depth
FOCS
Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jirí Sgall
1991 A* conf
Dynamic Scheduling on Parallel Machines
FOCS
Anja Feldmann, Jirí Sgall, Shang-Hua Teng
1990 B conf
Interactive Computations of Optimal Solutions.
MFCS
Jan Krajícek, Pavel Pudlák, Jirí Sgall