Jump Minimization in Linear Time

Authors:
M. V. S. Ramanath;Marvin Solomon
Affiliations:
Computer Science Department, University of Western Ontario, London, Ontario, Canada N6A 5B6;Computer Sciences Department, University of Wisconsin-Madison, 1210 West Dayton St., Madison, WI
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Year:
1984

Citing 8
Cited 1

An Algorithm for Structuring Flowgraphs

Journal of the ACM (JACM)
Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization

Journal of the ACM (JACM)
Assembling code for machines with span-dependent instructions

Communications of the ACM
A genealogy of control structures

Communications of the ACM
On the capabilities of while, repeat, and exit statements

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Optimal code for control structures

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Graphs and Hypergraphs

Graphs and Hypergraphs

Static transition compression

SAIG'01 Proceedings of the 2nd international conference on Semantics, applications, and implementation of program generation

Quantified Score

Hi-index	0.00

Visualization

Abstract