| New results on server problems M Chrobak, H Karloff, T Payne, S Vishwnathan SIAM Journal on Discrete Mathematics 4 (2), 172-181, 1991 | 302 | 1991 |
| Fast broadcasting and gossiping in radio networks M Chrobak, L Gasieniec, W Rytter Proceedings 41st Annual Symposium on Foundations of Computer Science, 575-581, 2000 | 293 | 2000 |
| Finite automata and unary languages M Chrobak Theoretical Computer Science 47, 149-158, 1986 | 271* | 1986 |
| A linear-time algorithm for drawing a planar graph on a grid M Chrobak, TH Payne Information Processing Letters 54 (4), 241-246, 1995 | 230 | 1995 |
| An optimal on-line algorithm for k servers on trees M Chrobak, LL Larmore SIAM Journal on Computing 20 (1), 144-148, 1991 | 190 | 1991 |
| Convex grid drawings of 3-connected planar graphs M Chrobak, G Kant International Journal of Computational Geometry & Applications 7 (03), 211-223, 1997 | 176 | 1997 |
| Competitive analysis of randomized paging algorithms D Achlioptas, M Chrobak, J Noga Theoretical Computer Science 234 (1-2), 203-218, 2000 | 171* | 2000 |
| Analysis of bacterial community composition by oligonucleotide fingerprinting of rRNA genes L Valinsky, G Della Vedova, AJ Scupham, S Alvey, A Figueroa, B Yin, ... Appl. Environ. Microbiol. 68 (7), 3243-3250, 2002 | 152 | 2002 |
| Dynamic thermal management through task scheduling J Yang, X Zhou, M Chrobak, Y Zhang, L Jin ISPASS 2008-IEEE International Symposium on Performance Analysis of Systems …, 2008 | 151 | 2008 |
| Reconstructing hv-convex polyominoes from orthogonal projections C Durr, M Chrobak arXiv preprint cs/9906021, 1999 | 144 | 1999 |
| Online competitive algorithms for maximizing weighted throughput of unit jobs FYL Chin, M Chrobak, SPY Fung, W Jawor, J Sgall, T Tichý Journal of Discrete Algorithms 4 (2), 255-276, 2006 | 125* | 2006 |
| Planar orientations with low out-degree and compaction of adjacency matrices M Chrobak, D Eppstein Theoretical Computer Science 86 (2), 243-266, 1991 | 122 | 1991 |
| The Server Problem and On-Line Games. M Chrobak, LL Larmore On-line algorithms 7, 11-64, 1991 | 121 | 1991 |
| Minimum-width grid drawings of plane graphs M Chrobak, SI Nakano Computational Geometry 11 (1), 29-54, 1998 | 118* | 1998 |
| LRU is better than FIFO M Chrobak, J Noga Algorithmica 23 (2), 180-185, 1999 | 99 | 1999 |
| Reducing large internet topologies for faster simulations V Krishnamurthy, M Faloutsos, M Chrobak, L Lao, JH Cui, AG Percus International Conference on Research in Networking, 328-341, 2005 | 98 | 2005 |
| Convex drawings of graphs in two and three dimensions (preliminary version) M Chrobak, MT Goodrich, R Tamassia Proceedings of the twelfth annual symposium on Computational geometry, 319-328, 1996 | 98 | 1996 |
| Probe selection algorithms with applications in the analysis of microbial communities J Borneman, M Chrobak, G Della Vedova, A Figueroa, T Jiang Bioinformatics 17 (suppl_1), S39-S48, 2001 | 94 | 2001 |
| On some packing problem related to dynamic storage allocation M Chrobak, M Ślusarek RAIRO-Theoretical Informatics and Applications 22 (4), 487-499, 1988 | 93 | 1988 |
| The wake-up problem in multihop radio networks M Chrobak, L G a¸ sieniec, DR Kowalski SIAM Journal on Computing 36 (5), 1453-1471, 2007 | 88 | 2007 |
Christoph DürrCNRS, LIP6, Université Pierre et Marie CurieBestätigte E-Mail-Adresse bei lip6.fr
