Partial Redundancy Elimination
Partial Redundancy Elimination is a compiler optimization technique that eliminates computations which are redundant on some, but not necessarily all, control flow paths by inserting computations at strategic points to make them fully redundant and then removing the original redundant expressions.
90
Publications
4.8K
Citations
195
Authors
87
Institutions
Publications per year
2017–2026
5
Parents
90
Global optimization by suppression of partial redundancies
E. H. Morel, C. Renvoise · Communications of the ACM · 1979 · 377 citations · Full text
Rastislav Bodík, Rajiv Gupta, Vivek Sarkar · 2000 · 234 citations · Full text
Chen Yang, Ke Liang, Xuepan Zhang et al. · Mechanical Systems and Signal Processing · 2019 · 179 citations
Engineering, Civil Engineering, Computational Structural Analysis +15
1–5 of 90
195
9
h-index
7
h-index
6
h-index
5
h-index
5
h-index
1–5 of 195
87
University of Pittsburgh
Pittsburgh, United States
8 h-index
17 publications
953 citations

Rice University
Houston, United States
6 h-index
12 publications
940 citations
Intel (United States)
Santa Clara, United States
5 h-index
13 publications
600 citations
Silicon Labs (United States)
Austin, United States
5 h-index
28 publications
2.1K citations
IBM (United States)
Armonk, United States
4 h-index
7 publications
317 citations

Indian Institute of Technology Bombay
Mumbai, India
3 h-index
4 publications
52 citations
University of Arizona
Tucson, United States
3 h-index
4 publications
291 citations

University of Minnesota
Minneapolis, United States
3 h-index
12 publications
496 citations
1–8 of 87
16 publications · 477 citations
13
h-index
5 publications · 250 citations
5
h-index
4 publications · 255 citations
4
h-index
TACO · 2 publications · 28 citations
2
h-index
TPDS · 2 publications · 81 citations
2
h-index
1–5