835 articles – 1515 references  [version française]
.:. Browse > List by year > 2001 .:.
35 documents ordered by :
First Previous 1 - 2 - 3 - 4 Next Last
Resource allocation in a mobile telephone network~: a constructive repair algorithm
Boizumault P., David P., Djellab H.
RAIRO Operations Research 35 (2001) 189--209 [hal-00442812 - version 1]
PicoDBMS: Scaling down database techniques for the smartcard.
Pucheral P., Bouganim L., Valduriez P., Bobineau C.
VLDB Journal 10, 2-3 (2001) 120-132 [hal-00442710 - version 1]
Une expérience de spécification d'organisation d'agents déployés sur Internet
Cazalens S., Lamarre P.
Actes de l'atelier SMA, Plate-forme AFIA 2001 (2001) 37--46 [hal-00442705 - version 1]
The Ecobase project: database and web technologies for environmental information systems
Bouganim L., Cavalcanti M. C., Fabret F., Campos M. L., Llirbat F., Mattoso M., Melo R., Moura A. M., Pacitti E., Porto F. et al
SIGMOD Rec. 30, 3 (2001) 70--75 [hal-00442699 - version 1]
Size and Path Length in Patricia Tries: Dynamical Sources Context
Bourdon J.
Random Structures and Algorithms 3-4, 19 (2001) 289--315 [hal-00442432 - version 1]
On The Stack-Size of General Tries
Bourdon J., Nebel M., Vallee B.
Theoretical Informatics and Applications, 35 (2001) 163--185 [hal-00442422 - version 1]
Size and Path Length in Patricia Tries: Dynamical Sources Context
Bourdon J.
Random Structures and Algorithms 3-4, 19 (2001) 289--315 [hal-00442420 - version 1]
Routing Permutations and 2-1 Routing Requests in the Hypercube
Baudon O., Fertin G., Havel I.
Discrete Applied Mathematics 113, 1 (2001) 43--58 [hal-00442419 - version 1]
Domination graphs: examples and counterexamples
Rusu I., Spinrad J. P.
Discrete Applied Mathematics 110 (2001) 289--300 [hal-00442416 - version 1]
An O(n^2) algorithm to color Meyniel graphs
Roussel F., Rusu I.
Discrete Mathematics 235 (2001) 107--123 [hal-00442409 - version 1]