Related articles |
---|
dominator tree lkaplan@mips.complang.tuwien.ac.at (1998-03-05) |
Re: dominator tree mwolfe@pgroup.com (1998-03-07) |
Re: dominator tree chase@naturalbridge.com (David Chase) (1998-03-07) |
Re: dominator tree jason@reflections.com.au (1998-03-08) |
Re: dominator tree awaters@acm.org (1998-03-12) |
Re: dominator tree sreedhar@cup.hp.com (Vugranam Sreedhar) (1998-03-12) |
Re: dominator tree mun@cup.hp.com (Richard F. Man) (1998-03-13) |
Re: dominator tree cliffc@jaberwocky.Eng.Sun.COM (1998-03-15) |
Re: dominator tree mkgardne@cs.uiuc.edu (1998-03-15) |
From: | Vugranam Sreedhar <sreedhar@cup.hp.com> |
Newsgroups: | comp.compilers |
Date: | 12 Mar 1998 23:16:59 -0500 |
Organization: | California Language Labs |
References: | 98-03-029 |
Keywords: | theory, analysis |
[Has anyone implemented the dominator tree algorithm by Dov Harel
(idescribed in the paper "A linear time algorithm for finding
dominators in a flow graph and related problems")? I would be very
interested in the exchange of ideas.]
Alstrup et al. have shown that Harel's algorithm is not linear. They
have proposed a new linear time algorithm. Check out the www site at
diku.dk (I don't recall the exact location, but I am sure in 5 mins
you can find out the paper.)
Sreedhar
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.