The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Immediate predominators in a directed graph [H]
Communications of the ACM
Communications of the ACM
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
Proceedings of a symposium on Compiler optimization
Global common subexpression elimination
Proceedings of a symposium on Compiler optimization
A mathematical theory of global program optimization (Prentice-Hall series in automatic computation)
A mathematical theory of global program optimization (Prentice-Hall series in automatic computation)
Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Analysis of a simple algorithm for global data flow problems
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Nearest common ancestors: a survey and a new distributed algorithm
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Temporal Relationships in Databases
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Testing flow graph reducibility
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Dominance analysis of irreducible CFGs by reduction
ACM SIGPLAN Notices
Using ontology network analysis for research document recommendation
Expert Systems with Applications: An International Journal
Superimposed Code-Based Indexing Method for Extracting MCTs from XML Documents
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Testing flow graph reducibility
Journal of Computer and System Sciences
The integral dictionary: a lexical network based on componential semantics
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartI
On space efficient two dimensional range minimum data structures
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Algorithms and theory of computation handbook
Flow-sensitive type recovery in linear-log time
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
An algorithm for generating MCCTree from XML document
ACS'11 Proceedings of the 11th WSEAS international conference on Applied computer science
A study of irreducibility in C programs
Software—Practice & Experience
| Hi-index | 0.00 |
Trees in an n node forest are to be merged according to instructions in a given sequence, while other instructions in the sequence ask for the lowest common ancestor of pairs of nodes. We show that any sequence of O(n) instructions can be processed “on line” in O(n log n) steps on a random access computer. If we can accept our answer “off-line”, that is, no answers need to be produced until the entire sequence of instructions has been seen seen, then we may perform the task in O(n G(n)) steps, where G(n) is the number of times we must apply log2 to n to obtain a number less than or equal to zero. A third algorithm solves a problem of intermediate complexity. We require the answers on line, but we suppose that all tree merging instructions precede the information requests. This algorithm requires O(n log log n) time. We apply the first on line algorithm to a problem in code optimization, that of computing immediate dominators in a reducible flow graph. We show how this computation can be performed in O(n log n) steps.