Bonjour,
Je cherche à avoir accès aux thèses suivantes :
- H. Erkiö. Studies on the Efficiency of Certain Internal Sort Algorithms. PhD Dissertation, Helsingin yliopisto, Finland, 1980.
- P. Flajolet. Analyse d’algorithmes de manipulation d’arbres et de fichiers. Habilitation Dissertation, Université Paris VII, France, 1979.
- G. Franceschini. On the Computational Power of Permutations in Sorting and Searching Problems. PhD Dissertation, Università di Pisa, Italy, 2005.
- P. Flajolet and J.-M. Steyaert. Une formalisation de la notion d’algorithme de tri non récurrent. PhD Dissertation, Université Paris VII, France, 1972.
- J. M. Incerpi. A Study of the Worst-Case of Shellsort. PhD Dissertation, Brown University, United States of America, 1986.
- V. Jayapaul. Sorting and Selection in Restricted Models of Computation. PhD Dissertation, Chennai Mathematical Institute, India, 2017.
- H. Mannila. Instance Complexity for Sorting and NP-Complete Problems. PhD Dissertation, Helsingin yliopisto, Finland, 1985.
- M. O’Keeffe. The Extended Balance Order: A New Model of Decision Tree Balance and Its Application in Linking Algorithmic Design to Performance Times. PhD Dissertation, University College Cork, Ireland, 2009.
- O. Petersson. Adaptive Sorting. PhD Dissertation, Lunds universitet, Sweden, 1990.
- V. Raman. Sorting In-place with Minimum Data Movement. PhD Dissertation, University of Waterloo, Canada, 1991.
- S. Roura. Divide-and-Conquer Algorithms and Data Structures. PhD Dissertation, Universitat Politècnica de Catalunya, Spain, 1997.
- J.-M. Steyaert. Structure et complexité des algorithmes. Habilitation Dissertation, Université Paris VII, France, 1984.
- D. Strzałka. Procesy w systemie komputerowym na styku dane-algorytm prostego sortowania przez wstawianie w ujęciu statystyki nieekstensywnej. PhD Dissertation, Politechnika Śląska, Poland, 2007.
- A. I. Verkamo. Sorting in Hierarchical Memories. PhD Dissertation, Helsingin yliopisto, Finland, 1988.
Pouvez-vous m’aider ?
Je vous remercie.
Partager