Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Partial redundancy elimination: A simple, pragmatic, and provably correct algorithm.

From MaRDI portal
Publication:1400469
Jump to:navigation, search

DOI10.1016/S0167-6423(02)00083-7zbMath1056.68061OpenAlexW1981423943MaRDI QIDQ1400469

Y. N. Srikant, V. K. Paleri, Priti Shankar

Publication date: 13 August 2003

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6423(02)00083-7


zbMATH Keywords

Computational optimalityData-flow analysisFlow graphsLifetime optimalityPartial redundancy elimination


Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Distributed algorithms (68W15)


Related Items (1)

Proof optimization for partial redundancy elimination







This page was built for publication: Partial redundancy elimination: A simple, pragmatic, and provably correct algorithm.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1400469&oldid=13558371"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 16:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki