Results 1 
4 of
4
Dominators in Linear Time
, 1997
"... A linear time algorithm is presented for finding dominators in control flow graphs. ..."
Abstract

Cited by 26 (0 self)
 Add to MetaCart
(Show Context)
A linear time algorithm is presented for finding dominators in control flow graphs.
A Simple and Optimal Algorithm for Finding Immediate Dominators in Reducible Graphs
, 1996
"... We present two simple algorithm for finding immediate dominator in reducible graphs with n nodes and m edges: A O(n + m) RAM algorithm and a O(n +m log log n) pointer machine algorithm. 1 Introduction Algorithms for finding dominator trees for control flow graphs are described in [5, 7, 8]. Dominat ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We present two simple algorithm for finding immediate dominator in reducible graphs with n nodes and m edges: A O(n + m) RAM algorithm and a O(n +m log log n) pointer machine algorithm. 1 Introduction Algorithms for finding dominator trees for control flow graphs are described in [5, 7, 8]. Dominator trees are used in control flow analysis [1, 4]. In [5] a linear time algorithm is given. This algorithm is complicated and to our knowledge no experimental results using this algorithm have been published. This is the motivation for presenting two simpler algorithms, one of which runs on a pointer machine [10]. The algorithms presented in this paper have previously been described by the authors of this paper and also independently and simultaneously in [9]. But at that time the important results from [2, 3], were not applied, so the contribution of this paper is only a compilation. 2 Notation A control flow graph CFG(V;E; s) is a directed graph with a start node s, from which all nodes i...
Polymorphic Algorithms FFTImplementations That Share
"... Abstract. We denote by a polymorphic radixn FFT an abstract algorithm scheme that is shared by all radixn FFT algorithms, similar to the way polymorphic data types share. Given such polymorphic algorithm, particular radixn algorithms can be obtained by specialization, thus need not be implemented ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We denote by a polymorphic radixn FFT an abstract algorithm scheme that is shared by all radixn FFT algorithms, similar to the way polymorphic data types share. Given such polymorphic algorithm, particular radixn algorithms can be obtained by specialization, thus need not be implemented separately. How to accomplish sharing between different radixn algorithms is not obvious: for example the four major radix2 algorithms, defining different divideandconquer schemes and working for different input formats, have little in common at the implementation level. At a higher level of abstraction, however, it is possible to provide a unifying framework. In this paper we introduce a polymorphic radixn FFT, mathematically based on the CooleyTukey mapping, and show how to effectively realize this mapping using techniques from generic programming. Since specializations can take place entirely at compile time, their generalization does not incur any runtime overhead. We implemented the polymorphic radixn FFT as a C++ metaprogram.
Commonsubexpression Elimination of Conditional Expressions
, 2001
"... Consider a sideeddectfree expression  possibly containing conditionals  represented as a directed acyclic graph. Such an expression can be linearised into a tree by introducing letabstractions for common subexpressions (viz. shared subgraphs). Let the number of vertices in the graph be n, let ..."
Abstract
 Add to MetaCart
(Show Context)
Consider a sideeddectfree expression  possibly containing conditionals  represented as a directed acyclic graph. Such an expression can be linearised into a tree by introducing letabstractions for common subexpressions (viz. shared subgraphs). Let the number of vertices in the graph be n, let the number of edges be m and the number of shared vertices be k. We present a simple O(m + k maxfn; m= log mg) algorithm for optimal placement of letabstractions.