AAAAAA
Results:
1-9
|
Results: 9
Authors:
Chrobak, M
Durr, C
Citation: M. Chrobak et C. Durr, Reconstructing polyatomic structures from discrete X-rays: NP-completenessproof for three atoms, THEOR COMP, 259(1-2), 2001, pp. 81-98
Authors:
Cheng, Q
Chrobak, M
Sundaram, G
Citation: Q. Cheng et al., Computing simple paths among obstacles, COMP GEOM, 16(4), 2000, pp. 223-233
Authors:
Bartal, Y
Chrobak, M
Larmore, LL
Citation: Y. Bartal et al., Randomized algorithm for two servers on the line, INF COMPUT, 158(1), 2000, pp. 53-69
Authors:
Achlioptas, D
Chrobak, M
Noga, J
Citation: D. Achlioptas et al., Competitive analysis of randomized paging algorithms, THEOR COMP, 234(1-2), 2000, pp. 203-218
Authors:
Chrobak, M
Noga, J
Citation: M. Chrobak et J. Noga, Competitive algorithms for relaxed list update and multilevel caching, J ALGORITHM, 34(2), 2000, pp. 282-308
Authors:
Chrobak, M
Sgall, J
Citation: M. Chrobak et J. Sgall, A simple analysis of the harmonic algorithm for two servers, INF PROCESS, 75(1-2), 2000, pp. 75-77
Authors:
Chrobak, M
Noga, J
Citation: M. Chrobak et J. Noga, LRU is better than FIFO, ALGORITHMIC, 23(2), 1999, pp. 180-185
Authors:
Chrobak, M
Durr, C
Citation: M. Chrobak et C. Durr, Reconstructing hv-convex polyominoes from orthogonal projections, INF PROCESS, 69(6), 1999, pp. 283-289
Authors:
Chrobak, M
Larmore, LL
Citation: M. Chrobak et Ll. Larmore, Metrical task systems, the server problem and the work function algorithm, LECT N COMP, 1442, 1998, pp. 74-96
Risultati:
1-9
|