- Periodic Scheduling with Obligatory Vacations Jiri Sgall
- JIRI SGALL Curriculum Vitae Address: Department of Applied Mathematics, Faculty of Mathematics and physics, Charles
- doc. RNDr. Ji Sgall, DrSc. odborn zivotopis Osobn daje
- Better Bounds for Incremental Frequency Allocation in Bipartite Graphs
- Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput
- NDMI025 Pravdpodobnostn algoritmy LS 2011 Ji Sgall
- Bounds on Pairs of Families with Restricted Intersections
- A Lower Bound for Randomized OnLine Multiprocessor Scheduling Jir'i Sgall \Lambda
- A note on semionline machine covering Tomas Ebenlendr 1 , John Noga 2 , Jir Sgall 1 , and Gerhard Woeginger 3
- Algebraic models of computation and interpolation for algebraic proof systems
- Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines
- The complexity of coloring graphs without long induced paths
- A SubConstant ErrorProbability PCP Characterization of NP
- Three Results on Frequency Assignment in Linear Cellular Networks
- Solution of David Gale's Lion and Man Problem Ji r Sgall
- The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts
- Preemptive Online Scheduling: Optimal Algorithms for All Speeds
- An Upper Bound for a Communication Game Related to TimeSpace Tradeoffs
- Grupa S3 a nkter jej podgrupy Nosn mnozina m prvky
- Algorithms for Testing Fault-Tolerance of Sequenced Jobs
- The Greedy Algorithm for the Minimum Common String Partition Problem
- Randomized Strategies for the Plurality Daniel Kral' a,1 Jir Sgall b,2 Tomas Tichy b,2
- COMMUNICATION COMPLEXITY TOWARDS LOWER BOUNDS
- Probabilistic Proofs and NP-completeness (A Course on the PCP Theorem and its Consequences)
- It is tough to be a plumber Daniel Kr al' a Vladan Majerech b;2 Ji r Sgall a;c;3
- A lower bound for cake cutting Jir Sgall and Gerhard J. Woeginger
- ONLINE SCHEDULING OF EQUALLENGTH JOBS: RANDOMIZATION AND RESTARTS HELP
- Solution of a Problem in DNA Computing Eric Anderson Marek Chrobak y John Noga z Ji r Sgall x
- Ancient and new algorithms for load balancing in the ` p norm \Lambda Adi Avidor y Yossi Azar z Jir'i Sgall x
- EFFICIENT DYNAMIC TRAITOR TRACING OMER BERKMAN \Lambda , MICHAL PARNAS y , AND JI
- Coloring graphs from lists with bounded size of their
- DNF tautologies with a limited number of occurrences of every P. Savick'y \Lambda Jir'i Sgall y
- Multiprocessor Scheduling with Rejection \Lambda Yair Bartal y Stefano Leonardi z Alberto MarchettiSpaccamela y
- Dynamic scheduling on parallel machines \Lambda Anja Feldmann y Jir'i Sgall z ShangHua Teng x
- Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines
- Semionline scheduling with decreasing job sizes Steve Seiden \Lambda Jir'i Sgall y Gerhard Woeginger z
- BOOLEAN CIRCUITS, TENSOR RANKS, AND COMMUNICATION PAVEL PUDL '
- Competitive Analysis of Call Admission Algorithms that Allow Delay Anja Feldmann 1 Bruce Maggs 1 Jir'i Sgall 2 Daniel D. Sleator 1 Andrew Tomkins 1
- On the NonLearnability of a Single Spiking Neuron
- An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality
- On The Computational Power of DNA Dan Boneh Christopher Dunworth Richard J. Lipton \Lambda
- OnLine Scheduling ---A Survey Jir'i Sgall
- A lower bound for scheduling of unit jobs with immediate decision on parallel machines
- Semi-Online Preemptive Scheduling: One Algorithm for All Variants
- Algorithms for Testing Fault-Tolerance of Sequenced Jobs Marek Chrobak
- Paging with connections: FIFO strikes again Leah Epstein a
- THEORY OF COMPUTING http://theoryofcomputing.org
- A Simple Analysis of the Harmonic Algorithm for Two Servers
- Science/Mathematics Approximation
- PROOF COMPLEXITY IN ALGEBRAIC SYSTEMS AND BOUNDED DEPTH FREGE
- Improved Online Algorithms for Bu#er Management in QoS Switches
- Randomized OnLine Scheduling of Parallel Jobs Jir'i Sgall \Lambda
- On the Complexity of Cake Cutting Gerhard J. Woeginger Ji r Sgall y
- A SubConstant ErrorProbability PCP Characterization of NP
- LOWER BOUNDS FOR THE POLYNOMIAL CALCULUS AND THE
- SOME BOUNDS ON MULTIPARTY COMMUNICATION COMPLEXITY OF
- Making DNA computers error resistant Dan Boneh Christopher Dunworth Richard J. Lipton \Lambda
- Optimal Online Scheduling of Parallel Jobs with Dependencies
- Jir'i Sgall* MATHEMATICAL INSTITUTE, AV
- A Simple Combinatorial Proof of Duality of Multiroute Flows and Cuts
- O -line Temporary Tasks Assignment Yossi Azar y Oded Regev z Ji r Sgall x
- Two Algorithms for General List Matrix Partitions Toms Feder Pavol Hell y Daniel Krl' z Ji# Sgall x
- Randomized Online Scheduling on Two Uniform Leah Epstein \Lambda John Noga y Steve Seiden z Jir'i Sgall x
- The Weighted 2Server Problem Marek Chrobak y Ji# Sgall zy
- ComputerAided Complexity Classification of DialaRide Problems
- Online scheduling of equallength jobs on parallel machines
- Optimal and Online Preemptive Scheduling on Uniformly Rrelated Machines
- Two Algorithms for General List Matrix Partitions Toms Feder Pavol Hell y Daniel Krl' z Ji# Sgall x
- COMMUNICATION COMPLEXITY TOWARDS LOWER BOUNDS
- Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines
- A Simple Combinatorial Proof of Duality of Multiroute Flows and Cuts
- The complexity of coloring graphs without long induced paths
- Dynamic scheduling on parallel machines \Lambda Anja Feldmann y Jir'i Sgall z ShangHua Teng x
- SOME BOUNDS ON MULTIPARTY COMMUNICATION COMPLEXITY OF
- A lower bound for cake cutting Jir Sgall and Gerhard J. Woeginger
- Optimal and Online Preemptive Scheduling on Uniformly Rrelated Machines
- Competitive Analysis of Call Admission Algorithms that Allow Delay Anja Feldmann 1 Bruce Maggs 1 Jir'i Sgall 2 Daniel D. Sleator 1 Andrew Tomkins 1
- The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts
- Jir'i Sgall* MATHEMATICAL INSTITUTE, AV
- Randomized Online Scheduling on Two Uniform Leah Epstein \Lambda John Noga y Steve Seiden z Jir'i Sgall x
- Functions that have read-twice constant width branching programs are not necessarily testable
- On The Computational Power of DNA Dan Boneh Christopher Dunworth Richard J. Lipton \Lambda
- OnLine Scheduling ---A Survey Jir'i Sgall
- Optimal Online Scheduling of Parallel Jobs with Dependencies
- Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines
- A Lower Bound for Randomized OnLine Multiprocessor Scheduling Jir'i Sgall \Lambda
- BOOLEAN CIRCUITS, TENSOR RANKS, AND COMMUNICATION PAVEL PUDL '
- Solution of David Gale's Lion and Man Problem Ji r Sgall
- Bounds on Pairs of Families with Restricted Intersections
- On the NonLearnability of a Single Spiking Neuron
- A Simple Analysis of the Harmonic Algorithm for Two Servers
- Preemptive Online Scheduling: Optimal Algorithms for All Speeds
- Randomized OnLine Scheduling of Parallel Jobs Jir'i Sgall \Lambda
- Algebraic models of computation and interpolation for algebraic proof systems
- It is tough to be a plumber Daniel Kr al' a Vladan Majerech b;2 Ji r Sgall a;c;3
- DNF tautologies with a limited number of occurrences of every P. Savick'y \Lambda Jir'i Sgall y
- An Improved Approximation Algorithm for the Asymmetric TSP with Strengthened Triangle Inequality
- A note on semionline machine covering Tomas Ebenlendr 1 , John Noga 2 , Jir Sgall 1 , and Gerhard Woeginger 3
- Semionline scheduling with decreasing job sizes Steve Seiden \Lambda Jir'i Sgall y Gerhard Woeginger z
- Preemptive Scheduling in Overloaded Marek Chrobak a;1;4 , Leah Epstein b;2 , John Noga c ,
- Ancient and new algorithms for load balancing in the ` p norm \Lambda Adi Avidor y Yossi Azar z Jir'i Sgall x
- Online Competitive Algorithms for Maximizing Weighted Throughput of Unit
- Making DNA computers error resistant Dan Boneh Christopher Dunworth Richard J. Lipton \Lambda
- PROOF COMPLEXITY IN ALGEBRAIC SYSTEMS AND BOUNDED DEPTH FREGE
- On the Complexity of Cake Cutting Gerhard J. Woeginger Ji r Sgall y
- Multiprocessor Scheduling with Rejection \Lambda Yair Bartal y Stefano Leonardi z Alberto MarchettiSpaccamela y
- Online scheduling of equallength jobs on parallel machines
- The Greedy Algorithm for the Minimum Common String Partition Problem
- Coloring graphs from lists with bounded size of their
- An Upper Bound for a Communication Game Related to TimeSpace Tradeoffs
- A Lower Bound for OnLine Scheduling on Uniformly Related Machines
- ONLINE SCHEDULING OF EQUALLENGTH JOBS: RANDOMIZATION AND RESTARTS HELP
- ComputerAided Complexity Classification of DialaRide Problems
- A lower bound for scheduling of unit jobs with immediate decision on parallel machines
- Algorithms for Testing Fault-Tolerance of Sequenced Jobs
- Solution of a Problem in DNA Computing Eric Anderson Marek Chrobak y John Noga z Ji r Sgall x
- The Weighted 2Server Problem Marek Chrobak y Ji# Sgall zy
- Improved Online Algorithms for Bu#er Management in QoS Switches
- Randomized Strategies for the Plurality Daniel Kral' a,1 Jir Sgall b,2 Tomas Tichy b,2
- O -line Temporary Tasks Assignment Yossi Azar y Oded Regev z Ji r Sgall x
- EFFICIENT DYNAMIC TRAITOR TRACING OMER BERKMAN \Lambda , MICHAL PARNAS y , AND JI
- LOWER BOUNDS FOR THE POLYNOMIAL CALCULUS AND THE
- Probabilistic Proofs and NP-completeness (A Course on the PCP Theorem and its Consequences)
- THEORY OF COMPUTING http://theoryofcomputing.org
- Better Bounds for Incremental Frequency Allocation in Bipartite Graphs
- Periodic Scheduling with Obligatory Vacations Jiri Sgall
- Semi-Online Preemptive Scheduling: One Algorithm for All Variants
- Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput
- Paging with connections: FIFO strikes again Leah Epstein a
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption
- doc. RNDr. Ji Sgall, DrSc. odborn zivotopis Osobn daje
- Three Results on Frequency Assignment in Linear Cellular Networks
- Algorithms for Testing Fault-Tolerance of Sequenced Jobs Marek Chrobak
- JIRI SGALL Curriculum Vitae Address: Department of Applied Mathematics, Faculty of Mathematics and physics, Charles
