| other,32-3-C92-2068,ak | graphs </term> without any use of costly <term> | dependency pointers | </term> . The proposed scheme eliminates | #22981 We propose a method of attaining such a design through a method of structure-sharing which avoids log(d) overheads often associated with structure-sharing of graphs without any use of costly dependency pointers . | |
| tech,10-2-C92-2068,ak | speed-up element in the design of <term> | unification algorithms | </term> : avoidance of copying of unmodified | #22939 We focus on one speed-up element in the design of unification algorithms : avoidance of copying of unmodified subgraphs. |
