Stephen Alstrup, Dov Harel, Peter W. Lauridsen, Mikkel Thorup  Home/Search
Context Related
| diku.dk/research/techrepo...9728.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: diku.dk/research/techrep...blaa97 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A linear time algorithm is presented for finding dominators in control flow graphs. (Update)
Context of citations to this paper: More
.... nodes, let2 introduction would simply amount to nding the immediate dominator for each shared node, which can be achieved in linear time [2]. In the presence of conditionals, however, it may not be safe to let bind a shared subexpression at its immediate dominator, because such...
...the construction of a System Dependence Graph 5 . Recently, a linear algorithm for constructing post dominator trees was proposed (Alstrup et al. 1997). The most commonly used algorithm (Horwitz et al. 1990) for (interprocedural) slice construction uses the System Dependence...
Cited by: More
A Practical Mobile-Code Format with Linear Verification Effort - Wang, Franz (2003) (Correct)
A Simple, Fast Dominance Algorithm - Cooper, Harvey, Kennedy (2001) (Correct)
General-Purpose Architecture Instruction Scheduling Techniques - De Sutter (1998) (Correct)
Similar documents (at the sentence level):
67.9%: Dominators in Linear Time - Alstrup, Lauridsen, Thorup (1997) (Correct)
Active bibliography (related documents): More All
0.3: A Simple and Optimal Algorithm for Finding Immediate.. - Alstrup, Lauridsen (1996) (Correct)
0.3: A Simple Dynamic Algorithm for Maintaining a Dominator Tree - Alstrup, Lauridsen (1996) (Correct)
0.1: Generalized Dominators for Structured Programs - Alstrup, Lauridsen, Thorup (1996) (Correct)
Similar documents based on text: More All
0.6: A New, Simpler Linear-Time Dominators Algorithm - Buchsbaum, Kaplan, Rogers.. (1999) (Correct)
0.5: A Global Code Optimizer Utilizing Static Single Assignment Form - Sjödin (1997) (Correct)
0.4: Computing Dominators and Dominance Frontiers - Briggs, Harvey (1994) (Correct)
Related documents from co-citation: More All
8: A linear time algorithm for finding dominators in flow graphs and related proble.. (context) - Harel - 1985
8: A fast algorithm for finding dominators in a flow graph (context) - Lengauer, Tarjan - 1979
5: Data structures for weighted matching and nearest common ancestors with linking (context) - Gabow - 1990
BibTeX entry: (Update)
Alstrup, S., Harel, D., Lauridsen, P. W., and Thorup, M. 1997. Dominators in linear time. Manuscript available at ftp://ftp.diku.dk/pub/diku/users/stephen/dom.ps. http://citeseer.ist.psu.edu/article/alstrup99dominators.html More
@article{ alstrup99dominators,
author = "Stephen Alstrup and Dov Harel and Peter W. Lauridsen and Mikkel Thorup",
title = "Dominators in Linear Time",
journal = "SIAM Journal on Computing",
volume = "28",
number = "6",
pages = "2117--2132",
year = "1999",
url = "citeseer.ist.psu.edu/article/alstrup99dominators.html" }
Citations (may not include all citations):415 Efficiently computing static single assignment form and the .. - Cytron, Ferrante et al. - 1991
405 Depth-first search and linear graph algorithms (context) - Tarjan - 1972
127 A linear-time algorithm for a special case of disjoint set u.. (context) - Gabow, Tarjan - 1985
127 Principles of compiler design (context) - Aho, Ullman - 1979
97 Trans-dichotomous algorithms for minimum spanning trees and .. (context) - Fredman, Willard - 1994
92 A fast algorithm for finding dominators in a flowgraph (context) - Lengauer, Tarjan - 1979
77 Translation and Compiling (context) - Aho, Ullman et al. - 1972
71 A data structure for manipulating priority queues (context) - Vuillemin - 1978
68 Data structure for weighted matching and nearest common ance.. (context) - Gabow - 1990
66 A class of algorithms which require nonlinear time to mainta.. (context) - Tarjan - 1979
53 Relaxed heaps: An alternative to fibonacci heaps with applic.. (context) - Driscoll, Gabow et al. - 1988
47 A linear time algorithm for finding dominators in flow graph.. (context) - Harel - 1985
32 Finding dominators in directed graphs (context) - Tarjan - 1974
31 A linear time algorithm for placing OE-nodes (context) - Gao, Sreedhar - 1995
16 Object code optimization (context) - Lowry, Medlock - 1969
14 An incremental algorithm for maintaining the dominator tree .. - Ramalingam, Reps - 1994
14 Immediate predominators in a directed graph (context) - Purdom, Moore - 1972
12 On finding lowest common ancestors in trees (context) - Aho, Hopcroft et al. - 1973
11 The art of programming (context) - Knuth - 1968
4 Department of Computer Science (context) - Lauridsen, thesis - 1996
4 of Computation Theory (context) - Ochranova, Fundamentals et al. - 1983
4 A framwork for generalized control dependence (context) - Bilardi, Pingali - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.diku.dk/research/techreports/blaa97.html): More
Experiments With the Auction Algorithm for the Shortest Path.. - Larsen, Pedersen (1997) (Correct)
Local Analysis of Scale Space - Johansen (1996) (Correct)
Scale-Space has been discovered in Japan - Weickert, al. (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC