Jiri Sgall - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part IILuca Aceto, Monika Henzinger, Jiri Sgall, editors, Volume 6756 of Lecture Notes in Computer Science, Springer, 2011. [doi]

Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part ILuca Aceto, Monika Henzinger, Jiri Sgall, editors, Volume 6755 of Lecture Notes in Computer Science, Springer, 2011. [doi]

Two-Bounded-Space Bin Packing RevisitedMarek Chrobak, Jiri Sgall, Gerhard J. Woeginger. esa 2011: 263-274 [doi]

Better Bounds for Incremental Frequency Allocation in Bipartite GraphsMarek Chrobak, Lukasz Jez, Jiri Sgall. esa 2011: 251-262 [doi]

Semi-Online Preemptive Scheduling: One Algorithm for All VariantsTomás Ebenlendr, Jiri Sgall. mst, 48(3):577-613, 2011. [doi]

2010

Three results on frequency assignment in linear cellular networksMarek Chrobak, Jiri Sgall. TCS, 411(1):131-137, 2010. [doi]

2009

Three Results on Frequency Assignment in Linear Cellular NetworksMarek Chrobak, Jiri Sgall. AAIM 2009: 129-139 [doi]

Algorithms for testing fault-tolerance of sequenced jobsMarek Chrobak, Mathilde Hurand, Jiri Sgall. scheduling, 12(5):501-515, 2009. [doi]

Semi-Online Preemptive Scheduling: One Algorithm for All VariantsTomás Ebenlendr, Jiri Sgall. STACS 2009: 349-360 [doi]

Preemptive Online Scheduling: Optimal Algorithms for All SpeedsTomás Ebenlendr, Wojciech Jawor, Jiri Sgall. algorithmica, 53(4):504-522, 2009. [doi]

Optimal and online preemptive scheduling on uniformly related machinesTomÃ¡s Ebenlendr, Jiri Sgall. scheduling, 12(5):517-527, 2009. [doi]

Periodic scheduling with obligatory vacationsJiri Sgall, Hadas Shachnai, Tami Tamir. TCS, 410(47-49):5112-5121, 2009. [doi]

Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the ThroughputOndrej Zajícek, Jiri Sgall, Tomás Ebenlendr. ppam 2010: 52-61 [doi]

2008

2007

Improved online algorithms for buffer management in QoS switchesMarek Chrobak, Wojciech Jawor, Jiri Sgall, Tomás Tichý. talg, 3(4), 2007. [doi]

Online Scheduling of Equal-Length Jobs: Randomization and Restarts HelpMarek Chrobak, Wojciech Jawor, Jiri Sgall, Tomás Tichý. siamcomp, 36(6):1709-1728, 2007. [doi]

Fast Algorithms for Testing Fault-Tolerance of Sequenced Jobs with DeadlinesMarek Chrobak, Mathilde Hurand, Jiri Sgall. rtss 2007: 139-148 [doi]

Online Scheduling of Equal-Length Jobs on Parallel MachinesJihuan Ding, Tomás Ebenlendr, Jiri Sgall, Guochuan Zhang. esa 2007: 427-438 [doi]

Paging with connections: FIFO strikes againLeah Epstein, Yanir Kleiman, Jiri Sgall, Rob van Stee. TCS, 377(1-3):55-64, 2007. [doi]

An Approximation Scheme For Cake Division With A Linear Number Of CutsJiri Sgall, Gerhard J. Woeginger. combinatorica, 27(2):205-211, 2007. [doi]

On the complexity of cake cuttingGerhard J. Woeginger, Jiri Sgall. disopt, 4(2):213-220, 2007. [doi]

2006

2005

2004

Online Competitive Algorithms for Maximizing Weighted Throughput of Unit JobsYair Bartal, Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Ron Lavi, Jiri Sgall, Tomás Tichý. STACS 2004: 187-198 [doi]

Improved Online Algorithms for Buffer Management in QoS SwitchesMarek Chrobak, Wojciech Jawor, Jiri Sgall, Tomás Tichý. esa 2004: 204-215 [doi]

Online Scheduling of Equal-Length Jobs: Randomization and Restarts HelpMarek Chrobak, Wojciech Jawor, Jiri Sgall, Tomás Tichý. icalp 2004: 358-370 [doi]

The weighted 2-server problemMarek Chrobak, Jiri Sgall. TCS, 324(2-3):289-312, 2004. [doi]

The Greedy Algorithm for the Minimum Common String Partition ProblemMarek Chrobak, Petr Kolman, Jiri Sgall. approx 2004: 84-95 [doi]

Errata to Analysis of the Harmonic Algorithm for Three ServersMarek Chrobak, Jiri Sgall. STACS 2004: 656 [doi]

Computer-Aided Complexity Classification of Dial-a-Ride ProblemsWillem de Paepe, Jan Karel Lenstra, Jiri Sgall, René A. Sitters, Leen Stougie. informs, 16(2):120-132, 2004. [doi]

Optimal and Online Preemptive Scheduling on Uniformly Related MachinesTomás Ebenlendr, Jiri Sgall. STACS 2004: 199-210 [doi]

Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel MachinesLeah Epstein, Jiri Sgall. algorithmica, 39(1):43-57, 2004. [doi]

Functions that have read-twice constant width branching programs are not necessarily testableEldar Fischer, Ilan Newman, Jiri Sgall. rsa, 24(2):175-193, 2004. [doi]

It is tough to be a plumberDaniel Král, Vladan Majerech, Jiri Sgall, Tomás Tichý, Gerhard J. Woeginger. TCS, 303(3):473-484, 2004. [doi]

2003

2002

Solution of a problem in DNA computingEric Anderson, Marek Chrobak, John Noga, Jiri Sgall, Gerhard J. Woeginger. TCS, 287(2):387-391, 2002.

Off-line temporary tasks assignmentYossi Azar, Oded Regev, Jiri Sgall, Gerhard J. Woeginger. TCS, 287(2):419-428, 2002.

Preemptive Scheduling in Overloaded SystemsMarek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania. icalp 2002: 800-811 [doi]

2001

Ancient and New Algorithms for Load Balancing in the ::::l::::::p:: NormAdi Avidor, Yossi Azar, Jiri Sgall. algorithmica, 29(3):422-441, 2001. [doi]

The Buffer Minimization Problem for Multiprocessor Scheduling with ConflictsMarek Chrobak, János Csirik, Csanád Imreh, John Noga, Jiri Sgall, Gerhard J. Woeginger. icalp 2001: 862-874 [doi]

Communication complexity towards lower bounds on circuit depthJeff Edmonds, Russell Impagliazzo, Steven Rudich, Jiri Sgall. cc, 10(3):210-246, 2001. [doi]

Solution of David Gale s lion and man problemJiri Sgall. TCS, 259(1-2):663-670, 2001. [doi]

Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, ProceedingsJiri Sgall, Ales Pultr, Petr Kolman, editors, Volume 2136 of Lecture Notes in Computer Science, Springer, 2001.

The complexity of coloring graphs without long induced pathsGerhard J. Woeginger, Jiri Sgall. actaC, 15(1):107, 2001. [doi]

2000

Multiprocessor Scheduling with RejectionYair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie. siamdm, 13(1):64-78, 2000. [doi]

Efficient dynamic traitor tracingOmer Berkman, Michal Parnas, Jiri Sgall. soda 2000: 586-595 [doi]

Efficient Dynamic Traitor TracingOmer Berkman, Michal Parnas, Jiri Sgall. siamcomp, 30(6):1802-1828, 2000. [doi]

The Weighted 2-Server ProblemMarek Chrobak, Jiri Sgall. STACS 2000: 593-604 [doi]

A simple analysis of the harmonic algorithm for two serversMarek Chrobak, Jiri Sgall. ipl, 75(1-2):75-77, 2000. [doi]

A lower bound for on-line scheduling on uniformly related machinesLeah Epstein, Jiri Sgall. orl, 26(1):17-22, 2000. [doi]

DNF tautologies with a limited number of occurrences of every variablePetr Savický, Jiri Sgall. TCS, 238(1-2):495-498, 2000. [doi]

Semi-online scheduling with decreasing job sizesSteven S. Seiden, Jiri Sgall, Gerhard J. Woeginger. orl, 27(5):215-221, 2000. [doi]

1999

1998

1997

1996

1995

Some Bounds on Multiparty Communication Complexity of Pointer JumpingCarsten Damm, Stasys Jukna, Jiri Sgall. eccc, 2(44), 1995. [doi]

An Upper Bound for a Communication Game Related to Time-Space TradeoffsPavel Pudlák, Jiri Sgall. eccc, 2(10), 1995. [doi]

Randomized On-Line Scheduling of Parallel JobsJiri Sgall. istcs 1995: 241-250

1994

Dynamic Scheduling on Parallel MachinesAnja Feldmann, Jiri Sgall, Shang-Hua Teng. TCS, 130(1):49-72, 1994.

On-Line Scheduling of Parallel JobsJiri Sgall. mfcs 1994: 159-176

1993

Optimal online scheduling of parallel jobs with dependenciesAnja Feldmann, Ming-Yang Kao, Jiri Sgall, Shang-Hua Teng. stoc 1993: 642-651 [doi]

1991

Communication Complexity Towards Lower Bounds on Circuit DepthJeff Edmonds, Steven Rudich, Russell Impagliazzo, Jiri Sgall. focs 1991: 249-257

Dynamic Scheduling on Parallel MachinesAnja Feldmann, Jiri Sgall, Shang-Hua Teng. focs 1991: 111-120

1990

Interactive Computations of Optimal SolutionsJan Krajícek, Pavel Pudlák, Jiri Sgall. mfcs 1990: 48-60