The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Marek Chrobak: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lan Gao, Jun Yang, Marek Chrobak, Youtao Zhang, San Nguyen, Hsien-Hsin S. Lee
    A low-cost memory remapping scheme for address bus protection. [Citation Graph (0, 0)][DBLP]
    PACT, 2006, pp:74-83 [Conf]
  2. Q. Fu, E. Bent, James Borneman, Marek Chrobak, N. Young
    Algorithmic Approaches to Selecting Control Clones in DNA Array Hybridization Experiments. [Citation Graph (0, 0)][DBLP]
    APBC, 2007, pp:17-26 [Conf]
  3. 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]
  4. Marek Chrobak, Moti Yung
    Fast Parallel and Sequential Algorithms for Edge-Coloring Planar Graphs. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:11-23 [Conf]
  5. Marek Chrobak, Leszek Gasieniec, Wojciech Rytter
    A Randomized Algorithm for Gossiping in Radio Networks. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:483-492 [Conf]
  6. Marek Chrobak, Claire Kenyon, Neal E. Young
    The Reverse Greedy Algorithm for the Metric K-Median Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:654-660 [Conf]
  7. Marek Chrobak, Michael T. Goodrich, Roberto Tamassia
    Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:319-328 [Conf]
  8. Marek Chrobak, Lawrence L. Larmore
    Metrical Task Systems, the Server Problem and the Work Function Algorithm. [Citation Graph (0, 0)][DBLP]
    Online Algorithms, 1996, pp:74-96 [Conf]
  9. Marek Chrobak, John Noga
    Bibliography on Competitive Algorithms. [Citation Graph (0, 0)][DBLP]
    Online Algorithms, 1996, pp:395-436 [Conf]
  10. Dimitris Achlioptas, Marek Chrobak, John Noga
    Competive Analysis of Randomized Paging Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:419-430 [Conf]
  11. Yair Bartal, Marek Chrobak, Lawrence L. Larmore
    A Randomized Algorithm for Two Servers on the Line (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:247-258 [Conf]
  12. Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore
    The 3-Server Problem in the Plane. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:301-312 [Conf]
  13. 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]
  14. Bogdan S. Chlebus, Marek Chrobak, Krzysztof Diks
    Saturating Flows in Networks. [Citation Graph (0, 0)][DBLP]
    FCT, 1987, pp:82-91 [Conf]
  15. Marek Chrobak, Leszek Gasieniec, Wojciech Rytter
    Fast Broadcasting and Gossiping in Radio Networks. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:575-581 [Conf]
  16. Marek Chrobak, Ming Li
    k+1 Heads Are Better than k for PDA's [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:361-367 [Conf]
  17. Marek Chrobak, Shin-Ichi Nakano
    Minimum-Width Grid Drawings of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:104-110 [Conf]
  18. Marek Chrobak
    Hierarchies of One-Way Multihead Automata Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:101-110 [Conf]
  19. 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]
  20. 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]
  21. 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]
  22. Torben Hagerup, Marek Chrobak, Krzysztof Diks
    Parallel 5-Colouring of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:304-313 [Conf]
  23. Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery Westbrook
    Page Migration Algorithms Using Work Functions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:406-415 [Conf]
  24. James Borneman, Marek Chrobak, Gianluca Della Vedova, Andres Figueroa, Tao Jiang
    Probe selection algorithms with applications in the analysis of microbial communities. [Citation Graph (0, 0)][DBLP]
    ISMB (Supplement of Bioinformatics), 2001, pp:39-48 [Conf]
  25. Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
    Oblivious Medians Via Online Bidding. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:311-322 [Conf]
  26. Wojciech Jawor, Marek Chrobak, Christoph Dürr
    Competitive Analysis of Scheduling Algorithms for Aggregated Links. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:617-628 [Conf]
  27. Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
    Faster Algorithms for k-Medians in Trees. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:218-227 [Conf]
  28. Marek Chrobak
    Nondeterminism Is Essential for Two-Way Counter Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:240-244 [Conf]
  29. Marek Chrobak, Christoph Dürr
    Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:185-193 [Conf]
  30. Marek Chrobak, Lawrence L. Larmore
    On Fast Algorithms for Two Servers. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:202-208 [Conf]
  31. Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter
    The k-Median Problem for Directed Trees. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:260-271 [Conf]
  32. Marek Chrobak, Wojciech Rytter
    Unique Deciperability for Partially Commutative Alphabet (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:256-263 [Conf]
  33. Vaishnavi Krishnamurthy, Michalis Faloutsos, Marek Chrobak, Li Lao, Jun-Hong Cui, Allon G. Percus
    Reducing Large Internet Topologies for Faster Simulations. [Citation Graph (0, 0)][DBLP]
    NETWORKING, 2005, pp:328-341 [Conf]
  34. Marek Chrobak, David Eppstein, Giuseppe F. Italiano, Moti Yung
    Efficient Sequential and Parallel Algorithms for Computing Recovery Points in Trees and Paths. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:158-167 [Conf]
  35. Marek Chrobak, Leszek Gasieniec, Dariusz R. Kowalski
    The wake-up problem in multi-hop radio networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:992-1000 [Conf]
  36. Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan
    title=New Results on Server Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:291-300 [Conf]
  37. Marek Chrobak, Lawrence L. Larmore
    Generosity Helps, or an 11-Competitive Algorithm for Three Servers. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:196-202 [Conf]
  38. Marek Chrobak, John Noga
    LRU is Better than FIFO. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:78-81 [Conf]
  39. Marek Chrobak, John Noga
    Competive Algorithms for Multilevel Caching and Relaxed List Update (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:87-96 [Conf]
  40. Marek Chrobak, Joseph Naor
    An Efficient Parallel Algorithm for Computing a Large Independent Set in a Plan Graph. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:379-387 [Conf]
  41. 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]
  42. Marek Chrobak, Jiri Sgall
    The Weighted 2-Server Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:593-604 [Conf]
  43. Marek Chrobak, Jiri Sgall
    Analysis of the Harmonic Algorithm for Three Servers. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:247-259 [Conf]
  44. Marek Chrobak, Jiri Sgall
    Errata to Analysis of the Harmonic Algorithm for Three Servers. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:656- [Conf]
  45. Marek Chrobak, Joseph Naor, Mark B. Novick
    Using Bounded Degree Spanning Trees in the Design of Efficient Algorihtms on Claw-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:147-162 [Conf]
  46. Marek Chrobak, Joseph Naor
    An Efficient Parallel Algorithm for Computing a Large Independent Set in Planar Graph. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:6, pp:801-815 [Journal]
  47. Marek Chrobak, John Noga
    LRU Is Better than FIFO. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:23, n:2, pp:180-185 [Journal]
  48. Qi Cheng, Marek Chrobak, Gopalakrishnan Sundaram
    Computing simple paths among obstacles. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:4, pp:223-233 [Journal]
  49. Marek Chrobak, Shin-Ichi Nakano
    Minimum-width grid drawings of plane graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:11, n:1, pp:29-54 [Journal]
  50. Marek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger
    A Note on Tiling under Tomographic Constraints [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  51. Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania
    Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  52. Marek Chrobak, Christoph Dürr, Wojciech Jawor, Lukasz Kowalik, Maciej Kurowski
    A Note on Scheduling Equal-Length Jobs to Maximize Throughput [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  53. Christoph Dürr, Marek Chrobak
    Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  54. Christoph Dürr, Marek Chrobak
    Reconstructing hv-Convex Polyominoes from Orthogonal Projections [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  55. Yair Bartal, Marek Chrobak, Lawrence L. Larmore
    A Randomized Algorithm for Two Servers on the Line. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:158, n:1, pp:53-69 [Journal]
  56. Marek Chrobak, Howard J. Karloff, Tomasz Radzik
    Connectivity vs. Reachability [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:91, n:2, pp:177-188 [Journal]
  57. Marek Chrobak, Goos Kant
    Convex Grid Drawings of 3-Connected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:3, pp:211-223 [Journal]
  58. Yair Bartal, Marek Chrobak, John Noga, Prabhakar Raghavan
    More on random walks, electrical networks, and the harmonic k-server algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:5, pp:271-276 [Journal]
  59. Marek Chrobak
    A Note on Bounded-Reversal Multipushdown Machines. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:4, pp:179-180 [Journal]
  60. Marek Chrobak, Bogdan S. Chlebus
    Probabilistic Turing Machines and Recursively Enumerable Dedekind Cuts. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:4, pp:167-171 [Journal]
  61. Marek Chrobak, Christoph Dürr
    Reconstructing hv-Convex Polyominoes from Orthogonal Projections. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:6, pp:283-289 [Journal]
  62. Marek Chrobak, Richard Harter
    A Note on Random Sampling. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:29, n:5, pp:255-256 [Journal]
  63. Marek Chrobak, Claire Kenyon, Neal E. Young
    The reverse greedy algorithm for the metric k-median problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:2, pp:68-72 [Journal]
  64. Marek Chrobak, Lawrence L. Larmore
    A Note on the Server Problem and a Benevolent Adversary. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:38, n:4, pp:173-175 [Journal]
  65. Marek Chrobak, Lawrence L. Larmore, Carsten Lund, Nick Reingold
    A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:2, pp:79-83 [Journal]
  66. Marek Chrobak, T. H. Payne
    A Linear-Time Algorithm for Drawing a Planar Graph on a Grid. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:4, pp:241-246 [Journal]
  67. Marek Chrobak, Wojciech Rytter
    Remarks on String-Matching and One-Way Multihead Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:325-329 [Journal]
  68. 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]
  69. Marek Chrobak, Maciej Slusarek
    On Some Packing Problem Related to Dynamic Storage Allocation. [Citation Graph (0, 0)][DBLP]
    ITA, 1988, v:22, n:4, pp:487-499 [Journal]
  70. Marek Chrobak, Leszek Gasieniec, Wojciech Rytter
    Fast broadcasting and gossiping in radio networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:43, n:2, pp:177-189 [Journal]
  71. Marek Chrobak, Lawrence L. Larmore
    On Fast Algorithms for Two Servers. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:4, pp:607-614 [Journal]
  72. Marek Chrobak, Lawrence L. Larmore
    Generosity Helps or an 11-Competitive Algorithm for Three Servers. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:16, n:2, pp:234-263 [Journal]
  73. Marek Chrobak, Lawrence L. Larmore, Nick Reingold, Jeffery Westbrook
    Page Migration Algorithms Using Work Functions. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:24, n:1, pp:124-157 [Journal]
  74. Marek Chrobak, John Noga
    Competitive Algorithms for Relaxed List Update and Multilevel Caching. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:2, pp:282-308 [Journal]
  75. Marek Chrobak, Takao Nishizeki
    Improved Edge-Coloring Algorithms for Planar Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1990, v:11, n:1, pp:102-116 [Journal]
  76. Marek Chrobak, Moti Yung
    Fast Algorithms for Edge-Coloring Planar Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:1, pp:35-51 [Journal]
  77. Marek Chrobak
    Variations on the Technique of Duris and Galil. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:30, n:1, pp:77-85 [Journal]
  78. 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]
  79. Marek Chrobak, Ming Li
    k+1 Heads Are Better than k for PDAs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:37, n:2, pp:144-155 [Journal]
  80. 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]
  81. Marek Chrobak, Leszek Gasieniec, Wojciech Rytter
    A randomized algorithm for gossiping in radio networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:43, n:2, pp:119-124 [Journal]
  82. Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania
    Preemptive scheduling of equal-length jobs to maximize weighted throughput. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:3, pp:258-264 [Journal]
  83. Marek Chrobak, Christoph Dürr, Wojciech Jawor, Lukasz Kowalik, Maciej Kurowski
    A Note on Scheduling Equal-Length Jobs to Maximize Throughput. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2006, v:9, n:1, pp:71-73 [Journal]
  84. Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd
    The complexity of mean flow time scheduling problems with release times. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2007, v:10, n:2, pp:139-146 [Journal]
  85. Marek Chrobak, Lawrence L. Larmore
    An Optimal On-Line Algorithm for k-Servers on Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:1, pp:144-148 [Journal]
  86. Torben Hagerup, Marek Chrobak, Krzysztof Diks
    Optimal Parallel 5-Colouring of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:288-300 [Journal]
  87. Marek Chrobak, Leszek Gasieniec, Dariusz R. Kowalski
    The Wake-Up Problem in MultiHop Radio Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1453-1471 [Journal]
  88. 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]
  89. Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan
    New Results on Server Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:2, pp:172-181 [Journal]
  90. Marek Chrobak, Lawrence L. Larmore
    A New Approach to the Server Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:3, pp:323-328 [Journal]
  91. 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]
  92. Dimitris Achlioptas, Marek Chrobak, John Noga
    Competitive analysis of randomized paging algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:234, n:1-2, pp:203-218 [Journal]
  93. 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]
  94. Wolfgang W. Bein, Marek Chrobak, Lawrence L. Larmore
    The 3-server problem in the plane. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:335-354 [Journal]
  95. Marek Chrobak, Tomasz Szymacha, Adam Krawczyk
    A Data Structure Useful for Finding Hamiltonian Cycles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:71, n:3, pp:419-424 [Journal]
  96. Marek Chrobak
    Finite Automata and Unary Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:47, n:3, pp:149-158 [Journal]
  97. Marek Chrobak
    Hierarchies of One-Way Multihead Automata Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:48, n:3, pp:153-181 [Journal]
  98. Marek Chrobak, Peter Couperus, Christoph Dürr, Gerhard J. Woeginger
    On tiling under tomographic constraints. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:2125-2136 [Journal]
  99. Marek Chrobak, Christoph Dürr
    Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:81-98 [Journal]
  100. Marek Chrobak, David Eppstein
    Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:86, n:2, pp:243-266 [Journal]
  101. Marek Chrobak, Elias Koutsoupias, John Noga
    More on randomized on-line algorithms for caching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1997-2008 [Journal]
  102. Marek Chrobak, Lawrence L. Larmore
    Harmonic is 3-Competitive for Two Servers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:98, n:2, pp:339-346 [Journal]
  103. Marek Chrobak, Wojciech Rytter
    Two Results on Linear Embeddings of Complete Binary Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:136, n:2, pp:507-526 [Journal]
  104. 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]
  105. Wojciech Rytter, Marek Chrobak
    A Characterization of Reversal-Bounded Multipushdown Machine Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:36, n:, pp:341-344 [Journal]
  106. Philippe Baptiste, Marek Chrobak, Christoph Dürr
    Polynomial Time Algorithms for Minimum Energy Scheduling. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:136-150 [Conf]
  107. Vaishnavi Krishnamurthy, Michalis Faloutsos, Marek Chrobak, Jun-Hong Cui, Li Lao, Allon G. Percus
    Sampling large Internet topologies for simulation purposes. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2007, v:51, n:15, pp:4284-4302 [Journal]
  108. Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana A. Kravchenko, Francis Sourd
    The Complexity of Mean Flow Time Scheduling Problems with Release Times [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  109. Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
    Oblivious Medians via Online Bidding [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  110. Marek Chrobak, Claire Kenyon, Neal E. Young
    The reverse greedy algorithm for the metric k-median problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  111. Philippe Baptiste, Marek Chrobak, Christoph Dürr, Francis Sourd
    Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]

  112. Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems. [Citation Graph (, )][DBLP]


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


  114. Algorithms for Placing Monitors in a Flow Network. [Citation Graph (, )][DBLP]


  115. Tile-Packing Tomography Is \mathbbNP{\mathbb{NP}}-hard. [Citation Graph (, )][DBLP]


  116. Caching Is Hard - Even in the Fault Model. [Citation Graph (, )][DBLP]


  117. Policy-Aware Topologies for Efficient Inter-Domain Routing Evaluations. [Citation Graph (, )][DBLP]


  118. Dynamic Thermal Management through Task Scheduling. [Citation Graph (, )][DBLP]


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


  120. Collecting weighted items from a dynamic queue. [Citation Graph (, )][DBLP]


  121. Better Bounds for Incremental Medians. [Citation Graph (, )][DBLP]


  122. Randomized Algorithms for Buffer Management with 2-Bounded Delay. [Citation Graph (, )][DBLP]


  123. Experimental Analysis of Scheduling Algorithms for Aggregated Links. [Citation Graph (, )][DBLP]


  124. Incremental Medians via Online Bidding. [Citation Graph (, )][DBLP]


  125. Competitive Analysis of Scheduling Algorithms for Aggregated Links. [Citation Graph (, )][DBLP]


  126. Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems [Citation Graph (, )][DBLP]


  127. Generalized Whac-a-Mole [Citation Graph (, )][DBLP]


  128. Polynomial Time Algorithms for Minimum Energy Scheduling [Citation Graph (, )][DBLP]


  129. Algorithms for Placing Monitors in a Flow Network [Citation Graph (, )][DBLP]


  130. Tile Packing Tomography is NP-hard [Citation Graph (, )][DBLP]


  131. On common edges in optimal solutions to traveling salesman and other optimization problems. [Citation Graph (, )][DBLP]


Search in 0.045secs, Finished in 0.052secs
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