Optimal code from flow graphs

Baskett, 1978, The best simple code generation technique for WHILE, FOR, and DO loops, Sigplan Notices, 13, 31, 10.1145/953411.953412 Plesnik, 1979, The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound 2, 8, 199 Hecht, 1974, Characterizations of reducible flow graphs, J. Am. Comput. Mach., 21, 367, 10.1145/321832.321835 Hecht, 1977 Boesch, 1977, Covering the points of a digraph with point-disjoint paths and its application to code optimization, J. Am. Comput. Mach., 24, 192, 10.1145/322003.322005 Hopcroft, 1973, An n5 2 algorithm for maximum matchings in bipartite graphs, Siam J. Comput., 2, 225, 10.1137/0202019 Szymanski, 1978, Assembling code for machines with span-dependent instructions, CACM, 21, 300, 10.1145/359460.359474 DeMillo, 1976, Can structured programs be efficient?, SIGPLAN Notices, 11, 10, 10.1145/956020.956021 Ramanath, 1982, Optimal code generation for control structures