V. Adlakha and V. Kulkarni, A Classified Bibliography Of Research On Stochastic Pert Networks: 1966-1987, INFOR: Information Systems and Operational Research, vol.27, issue.3, pp.272-296, 1989.
DOI : 10.1080/03155986.1989.11732098

R. Ahuja, T. Magnanti, and J. Orlin, Network flows, 1993.

B. Gaujal, A. Jean-marie, and J. Mairesse, Computations of Uniform Recurrence Equations Using Minimal Memory Size, SIAM Journal on Computing, vol.30, issue.5, pp.1701-1738, 2000.
DOI : 10.1137/S0097539795290350
URL : https://hal.archives-ouvertes.fr/inria-00074113

H. Sabih and . Gerez, Algorithms for VLSI Design Automation, 1999.

D. Gary, F. Hachtel, and . Somenzi, Logic Synthesis and Verification Algorithms, 2000.

R. Karp, R. Miller, and S. Winograd, The Organization of Computations for Uniform Recurrence Equations, Journal of the ACM, vol.14, issue.3, pp.563-590, 1967.
DOI : 10.1145/321406.321418

C. Leiserson and J. Saxe, Retiming synchronous circuitry, Algorithmica, vol.9, issue.No. 1, 1991.
DOI : 10.1007/BF01759032
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.368.3222

G. and D. Micheli, Synthesis and Optimization of Digital Circuits, 1994.

J. B. Orlin, Maximum-throughput dynamic network flows, Mathematical Programming, vol.30, issue.2, pp.214-231, 1983.
DOI : 10.1007/BF02591946
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.4456

J. B. Orlin, Minimum Convex Cost Dynamic Network Flows, Mathematics of Operations Research, vol.9, issue.2, pp.190-207, 1984.
DOI : 10.1287/moor.9.2.190
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.5590