The Erdös Number Project
The Erdös Number Project Extended
Le site de l'AMS

Retour à la page Web (pour des infos plus sérieuses)



NOMBRE D'ERDÖS ≤ 5 :

Gaucher, P.; Goubault, E.
Topological deformation of higher dimensional automata.
Algebraic topological methods in computer science (Stanford, CA, 2001).
Homology Homotopy Appl. 5 (2003), no. 2, 39--82 (electronic).

Costan, A.; Gaubert, S.; Goubault, E.; Martel, M.; Putot, S.
A policy iteration algorithm for computing fixed points in static analysis of programs.
Computer aided verification, 462--475,
Lecture Notes in Comput. Sci., 3576, Springer, Berlin, 2005.

Blondel, V. D.; Gaubert, S.; Tsitsiklis, J. N.
Approximating the spectral radius of sets of matrices in the max-algebra is NP-hard.
IEEE Trans. Automat. Control 45 (2000), no. 9, 1762--1765.

Blondel, V. D.; Rupp, R.; Shapiro, H. S.
On zero and one points of analytic functions.
Complex Variables Theory Appl. 28 (1995), no. 2, 189--192.

Erdös, P.; Shapiro, H. S.; Shields, A. L.
Large and small subspaces of Hilbert space.
Michigan Math. J. 12 1965 169--178.