P. K. Agarwal and M. Sharir, Davenport-Schinzel Sequences and Their Geometric Applications, 1995.

P. K. Agarwal and M. Sharir, Davenport-Schinzel sequences and their geometric applications, 1995.

M. J. Attalah, Some dynamic computational geometry problems, Computers & Mathematics with Applications, vol.11, issue.12, pp.1171-1181, 1985.
DOI : 10.1016/0898-1221(85)90105-1

F. Baccelli, G. Cohen, G. J. Olsder, and J. Quadrat, Synchronization and Linearity, 1992.

J. D. Boissonat and M. Yvinec, Algorithmic Geometry, 1998.
DOI : 10.1017/CBO9781139172998

J. Boudec and P. Thiran, Network Calculus: A Theory of Deterministic Queuing Systems for the Internet, volume LNCS 2050, 2001.

A. Bouillard and E. Thierry, Some examples and counterexamples for (min, +) filtering operations, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00123709

C. S. Chang, Deterministic traffic specification via projections under the min-plus algebra, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320), pp.43-50, 1999.
DOI : 10.1109/INFCOM.1999.749251

C. S. Chang, Performance Guarantees in Communication Networks, TNCS, 2000.

C. Corduneanu and H. Bohr, Almost Periodic Functions, 1961.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2001.

S. Gaubert, Théorie Linéaire des Systèmes dans les Dio¨?desDio¨?des, 1992.

J. Hershberger, Finding the upper envelope of n line segments in O(n log n) time, Information Processing Letters, vol.33, issue.4, pp.169-174, 1989.
DOI : 10.1016/0020-0190(89)90136-1

M. Klazar, On the maximum lengths of Davenport-Schinzel sequences, Contemporary Trends in Discrete Mathematics, pp.169-178, 1999.

L. Thiele, Real-time calculus Research Project

F. Nielsen and M. Yvinec, An Output-Sensitive Convex Hull Algorithm for Planar Objects, International Journal of Computational Geometry & Applications, vol.08, issue.01, pp.39-66, 1998.
DOI : 10.1142/S0218195998000047
URL : https://hal.archives-ouvertes.fr/inria-00074107

A. V. Oppenheim, A. S. Willsky, and S. H. Nawab, Signals and Systems, 1997.

K. Pandit, C. Kirchner, J. Schmitt, and R. Steinmetz, Optimization of the min-plus convolution computation under Network Calculus constraints, 2004.

K. Pandit, J. Schmitt, C. Kirchner, and R. Steinmetz, Optimal allocation of service curves by exploiting properties of the min-plus convolution, 2004.

J. L. Ramirez-alfonsin, Complexity of the Frobenius problem, Combinatorica, vol.301, issue.294, pp.143-147, 1996.
DOI : 10.1007/BF01300131

J. L. Ramirez-alfonsin, The Diophantine Frobenius Problem, 2005.
DOI : 10.1093/acprof:oso/9780198568209.001.0001

R. T. Rockfellar, Convex Analysis, 1996.
DOI : 10.1515/9781400873173

J. B. Schmitt and F. A. Zdarsky, The DISCO Network Calculator -A Toolbox for Worst Case Analysis, Proceedings of the First International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS'06), 2006.

J. J. Sylvester, 41:21, 1884. INRIA Unité de recherche INRIA Rennes IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Futurs : Parc Club Orsay Université -ZAC des Vignes 4, rue Jacques Monod -91893 ORSAY Cedex

I. Unité-de-recherche and . Lorraine, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt : Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex (France) Unité de recherche, 2004.