The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jiri Sgall: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Marek Chrobak, Petr Kolman, Jiri Sgall
    The Greedy Algorithm for the Minimum Common String Partition Problem. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:84-95 [Conf]
  2. Jiri Sgall
    Online Scheduling. [Citation Graph (0, 0)][DBLP]
    Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
  3. Jiri Sgall
    On-line Scheduling. [Citation Graph (0, 0)][DBLP]
    Online Algorithms, 1996, pp:196-231 [Conf]
  4. Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tomás Tichý
    Improved Online Algorithms for Buffer Management in QoS Switches. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:204-215 [Conf]
  5. Tomás Ebenlendr, Wojciech Jawor, Jiri Sgall
    Preemptive Online Scheduling: Optimal Algorithms for All Speeds. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:327-339 [Conf]
  6. Leah Epstein, Jiri Sgall
    Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:151-162 [Conf]
  7. Jiri Sgall, Hadas Shachnai, Tami Tamir
    Fairness-Free Periodic Scheduling with Vacations. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:592-603 [Conf]
  8. Jiri Sgall, Gerhard J. Woeginger
    A Lower Bound for Cake Cutting. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:459-469 [Conf]
  9. Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jiri Sgall
    Communication Complexity Towards Lower Bounds on Circuit Depth [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:249-257 [Conf]
  10. Anja Feldmann, Jiri Sgall, Shang-Hua Teng
    Dynamic Scheduling on Parallel Machines [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:111-120 [Conf]
  11. Marek Chrobak, János Csirik, Csanád Imreh, John Noga, Jiri Sgall, Gerhard J. Woeginger
    The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:862-874 [Conf]
  12. Marek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
    Preemptive Scheduling in Overloaded Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:800-811 [Conf]
  13. Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tomás Tichý
    Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:358-370 [Conf]
  14. Jiri Sgall
    Randomized On-Line Scheduling of Parallel Jobs. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:241-250 [Conf]
  15. Jan Krajícek, Pavel Pudlák, Jiri Sgall
    Interactive Computations of Optimal Solutions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:48-60 [Conf]
  16. Jiri Sgall
    On-Line Scheduling of Parallel Jobs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:159-176 [Conf]
  17. Adi Avidor, Yossi Azar, Jiri Sgall
    Ancient and New Algorithms for Load Balancing in the Lp Norm. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:426-435 [Conf]
  18. Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie
    Multiprocessor Scheduling with Rejection. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:95-103 [Conf]
  19. Omer Berkman, Michal Parnas, Jiri Sgall
    Efficient dynamic traitor tracing. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:586-595 [Conf]
  20. Leah Epstein, John Noga, Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger
    Randomized Online Scheduling on Two Uniform Machines. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:317-326 [Conf]
  21. Tomás Feder, Pavol Hell, Daniel Král, Jiri Sgall
    Two algorithms for general list matrix partitions. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:870-876 [Conf]
  22. 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. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:187-198 [Conf]
  23. Marek Chrobak, Jiri Sgall
    The Weighted 2-Server Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:593-604 [Conf]
  24. Marek Chrobak, Jiri Sgall
    Analysis of the Harmonic Algorithm for Three Servers. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:247-259 [Conf]
  25. Marek Chrobak, Jiri Sgall
    Errata to Analysis of the Harmonic Algorithm for Three Servers. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:656- [Conf]
  26. Carsten Damm, Stasys Jukna, Jiri Sgall
    Some Bounds on Multiparty Communication Complexity of Pointer Jumping. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:643-654 [Conf]
  27. Tomás Ebenlendr, Jiri Sgall
    Optimal and Online Preemptive Scheduling on Uniformly Related Machines. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:199-210 [Conf]
  28. Anja Feldmann, Ming-Yang Kao, Jiri Sgall, Shang-Hua Teng
    Optimal online scheduling of parallel jobs with dependencies. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:642-651 [Conf]
  29. Tomás Ebenlendr, John Noga, Jiri Sgall, Gerhard J. Woeginger
    A Note on Semi-online Machine Covering. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:110-118 [Conf]
  30. Gerhard J. Woeginger, Jiri Sgall
    The complexity of coloring graphs without long induced paths. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 2001, v:15, n:1, pp:107-0 [Journal]
  31. Adi Avidor, Yossi Azar, Jiri Sgall
    Ancient and New Algorithms for Load Balancing in the lp Norm. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:3, pp:422-441 [Journal]
  32. Leah Epstein, Jiri Sgall
    Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:39, n:1, pp:43-57 [Journal]
  33. 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. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:3, pp:256-298 [Journal]
  34. Carsten Damm, Stasys Jukna, Jiri Sgall
    Some Bounds on Multiparty Communication Complexity of Pointer Jumping. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:2, pp:109-127 [Journal]
  35. Jeff Edmonds, Russell Impagliazzo, Steven Rudich, Jiri Sgall
    Communication complexity towards lower bounds on circuit depth. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:3, pp:210-246 [Journal]
  36. Russell Impagliazzo, Pavel Pudlák, Jiri Sgall
    Lower Bounds for the Polynomial Calculus and the Gröbner Basis Algorithm. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1999, v:8, n:2, pp:127-144 [Journal]
  37. Jiri Sgall
    Bounds on Pairs of Families with Restricted Intersections. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:4, pp:555-566 [Journal]
  38. Dan Boneh, Christopher Dunworth, Richard J. Lipton, Jiri Sgall
    On the Computational Power of DNA. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:71, n:1-3, pp:79-94 [Journal]
  39. Pavel Pudlák, Jiri Sgall
    An Upper Bound for a Communication Game Related to Time-Space Tradeoffs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:10, pp:- [Journal]
  40. Carsten Damm, Stasys Jukna, Jiri Sgall
    Some Bounds on Multiparty Communication Complexity of Pointer Jumping [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:44, pp:- [Journal]
  41. Russell Impagliazzo, Pavel Pudlák, Jiri Sgall
    Lower Bounds for the Polynomial Calculus and the Groebner Basis Algorithm [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:42, pp:- [Journal]
  42. Jiri Sgall
    Bounds on Pairs of Families with Restricted Intersections [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:44, pp:- [Journal]
  43. Willem de Paepe, Jan Karel Lenstra, Jiri Sgall, René A. Sitters, Leen Stougie
    Computer-Aided Complexity Classification of Dial-a-Ride Problems. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2004, v:16, n:2, pp:120-132 [Journal]
  44. Marek Chrobak, Jiri Sgall
    A simple analysis of the harmonic algorithm for two servers. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:75, n:1-2, pp:75-77 [Journal]
  45. Jiri Sgall
    A Lower Bound for Randomized On-Line Multiprocessor Scheduling. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:1, pp:51-55 [Journal]
  46. Jiri Sgall
    Randomized On-Line Scheduling of Parallel Jobs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:1, pp:149-175 [Journal]
  47. Anja Feldmann, Ming-Yang Kao, Jiri Sgall, Shang-Hua Teng
    Optimal On-Line Scheduling of Parallel Jobs with Dependencies. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 1998, v:1, n:4, pp:393-411 [Journal]
  48. Marek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
    Preemptive scheduling in overloaded systems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:1, pp:183-197 [Journal]
  49. 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. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:2, pp:255-276 [Journal]
  50. Markus Bläser, Bodo Manthey, Jiri Sgall
    An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:4, pp:623-632 [Journal]
  51. Jirí Síma, Jiri Sgall
    On the Nonlearnability of a Single Spiking Neuron. [Citation Graph (0, 0)][DBLP]
    Neural Computation, 2005, v:17, n:12, pp:2635-2647 [Journal]
  52. Leah Epstein, Jiri Sgall
    A lower bound for on-line scheduling on uniformly related machines. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:26, n:1, pp:17-22 [Journal]
  53. Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger
    Semi-online scheduling with decreasing job sizes. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:27, n:5, pp:215-221 [Journal]
  54. Eldar Fischer, Ilan Newman, Jiri Sgall
    Functions that have read-twice constant width branching programs are not necessarily testable. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:24, n:2, pp:175-193 [Journal]
  55. Omer Berkman, Michal Parnas, Jiri Sgall
    Efficient Dynamic Traitor Tracing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:6, pp:1802-1828 [Journal]
  56. Pavel Pudlák, Vojtech Rödl, Jiri Sgall
    Boolean Circuits, Tensor Ranks, and Communication Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:3, pp:605-633 [Journal]
  57. Marek Chrobak, Wojciech Jawor, Jiri Sgall, Tomás Tichý
    Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:6, pp:1709-1728 [Journal]
  58. Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie
    Multiprocessor Scheduling with Rejection. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:1, pp:64-78 [Journal]
  59. Marek Chrobak, Petr Kolman, Jiri Sgall
    The greedy algorithm for the minimum common string partition problem. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2005, v:1, n:2, pp:350-366 [Journal]
  60. Eric Anderson, Marek Chrobak, John Noga, Jiri Sgall, Gerhard J. Woeginger
    Solution of a problem in DNA computing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:387-391 [Journal]
  61. Yossi Azar, Oded Regev, Jiri Sgall, Gerhard J. Woeginger
    Off-line temporary tasks assignment. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:419-428 [Journal]
  62. Marek Chrobak, Jiri Sgall
    The weighted 2-server problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:324, n:2-3, pp:289-312 [Journal]
  63. Anja Feldmann, Jiri Sgall, Shang-Hua Teng
    Dynamic Scheduling on Parallel Machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:130, n:1, pp:49-72 [Journal]
  64. Daniel Král, Vladan Majerech, Jiri Sgall, Tomás Tichý, Gerhard J. Woeginger
    It is tough to be a plumber. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:473-484 [Journal]
  65. Petr Savický, Jiri Sgall
    DNF tautologies with a limited number of occurrences of every variable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:238, n:1-2, pp:495-498 [Journal]
  66. Jiri Sgall
    Solution of David Gale's lion and man problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:663-670 [Journal]
  67. Leah Epstein, Yanir Kleiman, Jiri Sgall, Rob van Stee
    Paging with connections: FIFO strikes again. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:377, n:1-3, pp:55-64 [Journal]
  68. Daniel Král, Jiri Sgall
    Coloring graphs from lists with bounded size of their union. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:49, n:3, pp:177-186 [Journal]
  69. Jihuan Ding, Tomás Ebenlendr, Jiri Sgall, Guochuan Zhang
    Online Scheduling of Equal-Length Jobs on Parallel Machines. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:427-438 [Conf]
  70. Jiri Sgall, Gerhard J. Woeginger
    An Approximation Scheme For Cake Division With A Linear Number Of Cuts. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2007, v:27, n:2, pp:205-211 [Journal]

  71. Three Results on Frequency Assignment in Linear Cellular Networks. [Citation Graph (, )][DBLP]


  72. Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput. [Citation Graph (, )][DBLP]


  73. Fast Algorithms for Testing Fault-Tolerance of Sequenced Jobs with Deadlines. [Citation Graph (, )][DBLP]


  74. Graph balancing: a special case of scheduling unrelated parallel machines. [Citation Graph (, )][DBLP]


  75. Semi-Online Preemptive Scheduling: One Algorithm for All Variants. [Citation Graph (, )][DBLP]


  76. A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines. [Citation Graph (, )][DBLP]


  77. Preemptive Online Scheduling: Optimal Algorithms for All Speeds. [Citation Graph (, )][DBLP]


  78. Randomized strategies for the plurality problem. [Citation Graph (, )][DBLP]


Search in 0.128secs, Finished in 0.133secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002