Home
 
  • Journals
  • Seminars
  • Books
  • Lecture notes
  • Theses
  • Authors
  • Journals
  • Seminars
  • Books
  • Lecture notes
  • Theses
  • Authors
  • All
  • Author
  • Title
  • References
  • Keywords
  • Full text
NOT
Between and
  • All
  • Author
  • Title
  • Date
  • References
  • Keywords
  • Full text
  • RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
  • Volume 51 (2017)
  • no. 2

Table of contents

Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations
Ktari, Mouna; Haddar, Mohamed Amine; Mosbah, Mohamed; Hadj Kacem, Ahmed
p. 51-70
The connectivity and nature diagnosability of expanded k-ary n-cubes
Wang, Mujiangshan; Lin, Yuqing; Wang, Shiying
p. 71-89
A Better bound of randomized algorithms for the multislope ski-rental problem
Hu, Maolin; Xu, Weijun
p. 91-98
Minimal partial languages and automata
Blanchet-Sadri, Francine; Goldner, K.; Shackleton, A.
p. 99-119
  • About
  • Help
  • Legal notice
  • Contact
 

Published by

 

Supported by

 
 

Partner of