Recommendations
Cites work
- scientific article; zbMATH DE number 1975593 (Why is no real title available?)
- scientific article; zbMATH DE number 2079369 (Why is no real title available?)
- scientific article; zbMATH DE number 2119644 (Why is no real title available?)
- A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
- A series of approximation algorithms for the acyclic directed Steiner tree problem
- All structured programs have small tree width and good register allocation
- An approximation algorithm for the register allocation problem
- Analysis and approximation for bank selection instruction minimization on partitioned memory architecture
- Approximating directed multicuts
- Approximation Algorithms for Directed Steiner Problems
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Improved approximation for directed cut problems
- Multiway cuts in node weighted graphs
- On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes
- Register Allocation in Structured Programs
- The allocation problem in hardware design
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(3)
This page was built for publication: Register loading via linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494793)