All Structured Programs Have Small Tree Width and Good Register Allocation

ISSN： 0890-5401

Source： Information and Computation, Vol.142, Iss.2, 1998-05, pp. : 159-181

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

By Kannan S. Proebsting T.

Journal of Algorithms, Vol. 29, Iss. 2, 1998-11 ,pp. : 223-237

Academic Press

Access to resources Recommend Favorite

Min-energy voltage allocation for tree-structured tasks

By Li Minming Liu Becky Yao Frances

Journal of Combinatorial Optimization, Vol. 11, Iss. 3, 2006-05 ,pp. : 305-319

Springer Publishing Company

Access to resources Recommend Favorite

On Local Register Allocation

By Farach-Colton M. Liberatore V.

Journal of Algorithms, Vol. 37, Iss. 1, 2000-10 ,pp. : 37-65

Academic Press

Access to resources Recommend Favorite

Inductive Counting for Width-Restricted Branching Programs

By Damm C. Holzer M.

Information and Computation, Vol. 130, Iss. 1, 1996-10 ,pp. : 91-99

Academic Press

Access to resources Recommend Favorite

Controlling the data space of tree structured computations

By Gottlieb I. Obrenic B.

Information and Computation, Vol. 187, Iss. 2, 2003-12 ,pp. : 246-276

Elsevier

Access to resources Recommend Favorite