| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Marek Chrobak, Lukasz Jez, Jiri Sgall |
Better Bounds for Incremental Frequency Allocation in Bipartite Graphs  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Tomás Ebenlendr, Jiri Sgall |
Semi-Online Preemptive Scheduling: One Algorithm for All Variants. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Jiri Sgall, Gerhard J. Woeginger |
Two-Bounded-Space Bin Packing Revisited. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Lukasz Jez, Jiri Sgall |
Better Bounds for Incremental Frequency Allocation in Bipartite Graphs. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Aceto, Monika Henzinger, Jiri Sgall (eds.) |
Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Aceto, Monika Henzinger, Jiri Sgall (eds.) |
Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part II |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Ebenlendr, Jiri Sgall |
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption. |
WAOA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Jiri Sgall |
Three results on frequency assignment in linear cellular networks. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiri Sgall, Hadas Shachnai, Tami Tamir |
Periodic scheduling with obligatory vacations. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Ebenlendr, Wojciech Jawor, Jiri Sgall |
Preemptive Online Scheduling: Optimal Algorithms for All Speeds. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Scheduling, Online algorithms, Makespan |
| 1 | Marek Chrobak, Mathilde Hurand, Jiri Sgall |
Algorithms for testing fault-tolerance of sequenced jobs. |
J. Scheduling |
2009 |
DBLP DOI BibTeX RDF |
Scheduling, Fault-tolerance, Real-time systems, Algorithms |
| 1 | Tomás Ebenlendr, Jiri Sgall |
Optimal and online preemptive scheduling on uniformly related machines. |
J. Scheduling |
2009 |
DBLP DOI BibTeX RDF |
Uniformly related machines, Preemption, Online scheduling |
| 1 | Ondrej Zajícek, Jiri Sgall, Tomás Ebenlendr |
Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput. |
PPAM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Jiri Sgall |
Three Results on Frequency Assignment in Linear Cellular Networks. |
AAIM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Ebenlendr, Jiri Sgall |
Semi-Online Preemptive Scheduling: One Algorithm for All Variants. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Bruhn, Jakub Cerný, Alexander Hall, Petr Kolman, Jiri Sgall |
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks. |
Theory of Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Král, Jiri Sgall, Tomás Tichý |
Randomized strategies for the plurality problem. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Ebenlendr, Marek Krcál, Jiri Sgall |
Graph balancing: a special case of scheduling unrelated parallel machines. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Ebenlendr, Jiri Sgall |
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines. |
WAOA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard J. Woeginger, Jiri Sgall |
On the complexity of cake cutting. |
Discrete Optimization |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Yanir Kleiman, Jiri Sgall, Rob van Stee |
Paging with connections: FIFO strikes again. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tomás Tichý |
Improved online algorithms for buffer management in QoS switches. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
scheduling, Online algorithms |
| 1 | Jiri Sgall, Gerhard J. Woeginger |
An Approximation Scheme For Cake Division With A Linear Number Of Cuts. |
Combinatorica |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 68W25, 90C27 |
| 1 | Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tomás Tichý |
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jihuan Ding, Tomás Ebenlendr, Jiri Sgall, Guochuan Zhang |
Online Scheduling of Equal-Length Jobs on Parallel Machines. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Mathilde Hurand, Jiri Sgall |
Fast Algorithms for Testing Fault-Tolerance of Sequenced Jobs with Deadlines. |
RTSS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Jiri Sgall, Tomás Tichý |
Online competitive algorithms for maximizing weighted throughput of unit jobs. |
J. Discrete Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Bodo Manthey, Jiri Sgall |
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. |
J. Discrete Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Ebenlendr, Wojciech Jawor, Jiri Sgall |
Preemptive Online Scheduling: Optimal Algorithms for All Speeds. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Petr Kolman, Jiri Sgall |
The greedy algorithm for the minimum common string partition problem. |
ACM Transactions on Algorithms |
2005 |
DBLP DOI BibTeX RDF |
approximation algorithms, String algorithms |
| 1 | Jirí Síma, Jiri Sgall |
On the Nonlearnability of a Single Spiking Neuron. |
Neural Computation |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Král, Jiri Sgall |
Coloring graphs from lists with bounded size of their union. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiri Sgall, Hadas Shachnai, Tami Tamir |
Fairness-Free Periodic Scheduling with Vacations. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Pavol Hell, Daniel Král, Jiri Sgall |
Two algorithms for general list matrix partitions. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiri Sgall |
Online Scheduling. |
Algorithms for Optimization with Incomplete Information |
2005 |
DBLP BibTeX RDF |
|
| 1 | Tomás Ebenlendr, John Noga, Jiri Sgall, Gerhard J. Woeginger |
A Note on Semi-online Machine Covering. |
WAOA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Jiri Sgall |
The weighted 2-server problem. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Král, Vladan Majerech, Jiri Sgall, Tomás Tichý, Gerhard J. Woeginger |
It is tough to be a plumber. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Jiri Sgall |
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Machine completion time, Scheduling, Approximation algorithms, Parallel machines, Polynomial time approximation scheme |
| 1 | Eldar Fischer, Ilan Newman, Jiri Sgall |
Functions that have read-twice constant width branching programs are not necessarily testable. |
Random Struct. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Willem de Paepe, Jan Karel Lenstra, Jiri Sgall, René A. Sitters, Leen Stougie |
Computer-Aided Complexity Classification of Dial-a-Ride Problems. |
INFORMS Journal on Computing |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tomás Tichý |
Improved Online Algorithms for Buffer Management in QoS Switches. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tomás Tichý |
Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Bartal, Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Ron Lavi, Jiri Sgall, Tomás Tichý |
Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs. |
STACS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Jiri Sgall |
Errata to Analysis of the Harmonic Algorithm for Three Servers. |
STACS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Ebenlendr, Jiri Sgall |
Optimal and Online Preemptive Scheduling on Uniformly Related Machines. |
STACS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Petr Kolman, Jiri Sgall |
The Greedy Algorithm for the Minimum Common String Partition Problem. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania |
Preemptive scheduling in overloaded systems. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiri Sgall, Gerhard J. Woeginger |
A Lower Bound for Cake Cutting. |
ESA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Jiri Sgall |
Analysis of the Harmonic Algorithm for Three Servers. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Anderson, Marek Chrobak, John Noga, Jiri Sgall, Gerhard J. Woeginger |
Solution of a problem in DNA computing. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Yossi Azar, Oded Regev, Jiri Sgall, Gerhard J. Woeginger |
Off-line temporary tasks assignment. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania |
Preemptive Scheduling in Overloaded Systems. |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard J. Woeginger, Jiri Sgall |
The complexity of coloring graphs without long induced paths. |
Acta Cybern. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Jiri Sgall |
Solution of David Gale's lion and man problem. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Adi Avidor, Yossi Azar, Jiri Sgall |
Ancient and New Algorithms for Load Balancing in the lp Norm. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeff Edmonds, Russell Impagliazzo, Steven Rudich, Jiri Sgall |
Communication complexity towards lower bounds on circuit depth. |
Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, János Csirik, Csanád Imreh, John Noga, Jiri Sgall, Gerhard J. Woeginger |
The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. |
ICALP |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiri Sgall, Ales Pultr, Petr Kolman (eds.) |
Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings |
MFCS |
2001 |
DBLP BibTeX RDF |
|
| 1 | Leah Epstein, Jiri Sgall |
A lower bound for on-line scheduling on uniformly related machines. |
Oper. Res. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger |
Semi-online scheduling with decreasing job sizes. |
Oper. Res. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Jiri Sgall |
A simple analysis of the harmonic algorithm for two servers. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Savický, Jiri Sgall |
DNF tautologies with a limited number of occurrences of every variable. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie |
Multiprocessor Scheduling with Rejection. |
SIAM J. Discrete Math. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Berkman, Michal Parnas, Jiri Sgall |
Efficient Dynamic Traitor Tracing. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Berkman, Michal Parnas, Jiri Sgall |
Efficient dynamic traitor tracing. |
SODA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Chrobak, Jiri Sgall |
The Weighted 2-Server Problem. |
STACS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiri Sgall |
Bounds on Pairs of Families with Restricted Intersections. |
Combinatorica |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05D05, 68R05 |
| 1 | Russell Impagliazzo, Pavel Pudlák, Jiri Sgall |
Lower Bounds for the Polynomial Calculus and the Gröbner Basis Algorithm. |
Computational Complexity |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Jiri Sgall |
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines. |
ESA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, John Noga, Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger |
Randomized Online Scheduling on Two Uniform Machines. |
SODA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Anja Feldmann, Ming-Yang Kao, Jiri Sgall, Shang-Hua Teng |
Optimal On-Line Scheduling of Parallel Jobs with Dependencies. |
J. Comb. Optim. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiri Sgall |
Bounds on Pairs of Families with Restricted Intersections |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Carsten Damm, Stasys Jukna, Jiri Sgall |
Some Bounds on Multiparty Communication Complexity of Pointer Jumping. |
Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Adi Avidor, Yossi Azar, Jiri Sgall |
Ancient and New Algorithms for Load Balancing in the Lp Norm. |
SODA |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiri Sgall |
A Lower Bound for Randomized On-Line Multiprocessor Scheduling. |
Inf. Process. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Russell Impagliazzo, Pavel Pudlák, Jiri Sgall |
Lower Bounds for the Polynomial Calculus and the Groebner Basis Algorithm |
Electronic Colloquium on Computational Complexity (ECCC) |
1997 |
DBLP BibTeX RDF |
|
| 1 | Samuel R. Buss, Russell Impagliazzo, Jan Krajícek, Pavel Pudlák, Alexander A. Razborov, Jiri Sgall |
Proof Complexity in Algebraic Systems and Bounded Depth Frege Systems with Modular Counting. |
Computational Complexity |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Pudlák, Vojtech Rödl, Jiri Sgall |
Boolean Circuits, Tensor Ranks, and Communication Complexity. |
SIAM J. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiri Sgall |
Randomized On-Line Scheduling of Parallel Jobs. |
J. Algorithms |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Boneh, Christopher Dunworth, Richard J. Lipton, Jiri Sgall |
On the Computational Power of DNA. |
Discrete Applied Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie |
Multiprocessor Scheduling with Rejection. |
SODA |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Stasys Jukna, Jiri Sgall |
Some Bounds on Multiparty Communication Complexity of Pointer Jumping. |
STACS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiri Sgall |
On-line Scheduling. |
Online Algorithms |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Stasys Jukna, Jiri Sgall |
Some Bounds on Multiparty Communication Complexity of Pointer Jumping |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1995 |
RDF |
|
| 1 | Pavel Pudlák, Jiri Sgall |
An Upper Bound for a Communication Game Related to Time-Space Tradeoffs |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | Carsten Damm, Stasys Jukna, Jiri Sgall |
Some Bounds on Multiparty Communication Complexity of Pointer Jumping |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | Jiri Sgall |
Randomized On-Line Scheduling of Parallel Jobs. |
ISTCS |
1995 |
DBLP BibTeX RDF |
|
| 1 | Anja Feldmann, Jiri Sgall, Shang-Hua Teng |
Dynamic Scheduling on Parallel Machines. |
Theor. Comput. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiri Sgall |
On-Line Scheduling of Parallel Jobs. |
MFCS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Anja Feldmann, Ming-Yang Kao, Jiri Sgall, Shang-Hua Teng |
Optimal online scheduling of parallel jobs with dependencies. |
STOC |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Anja Feldmann, Jiri Sgall, Shang-Hua Teng |
Dynamic Scheduling on Parallel Machines |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
fixed-dimensional meshes, online job scheduling, lower bound proof, parallel architectures, parallel machines, upper bound, dynamic scheduling |
| 1 | Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jiri Sgall |
Communication Complexity Towards Lower Bounds on Circuit Depth |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
almost optimal lower bound, circuit depth, circuit depth complexity, n-bit Boolean function, communication game characterization, universal composition relation, lower bounds |
| 1 | Jan Krajícek, Pavel Pudlák, Jiri Sgall |
Interactive Computations of Optimal Solutions. |
MFCS |
1990 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")