Another approach for primitive deterministic procedures is the quadratic indexing scheme. A tree-sharing method reduces the nodes in an index tree to have a size at most . The index tree is transformed into a directed acyclic graph (DAG).
