Skip to search formSkip to main contentSkip to account menu

Parent pointer tree

Known as: Cactus stack, Saguaro stack, Spaghetti stack 
In computer science, an in-tree or parent pointer tree is an N-ary tree data structure in which each node has a pointer to its parent node, but no… 
Wikipedia (opens in a new tab)

Related topics

Related topics

20 relations
Abstract syntax treeBurroughs large systemsCilk PlusCompiler

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Classifications of Different Trends ( Extended Abstract )
The most famous, and simple suboptimal search algorithm is Weighted A∗ (WA∗) (Pohl 1970). Similar to A∗, WA∗ uses two data… 
2011
2011
Facilitating program parallelisation : a profiling-based approach
The advance of multi-core architectures signals the end of universal speed-up of software over time. To continue exploiting… 
2011
2011
The compiler for the XMTC parallel language: Lessons for compiler developers and in-depth description
In this technical report, we present information on the XMTC compiler and language. We start by presenting the XMTC Memory Model… 
2010
2010
Efficient invariant syntax expression with a gradual change
By generating a data structure comprising at least one tree structure that allows efficient invariant syntax expressions… 
2000
2000
Balancing Steiner trees and shortest path trees online
Given a weighted undirected graph G(V, E) and a subset R of V, we present an online algori thm for finding a Steiner tree on R… 
1999
1999
1 Linux Process Control via the File System
We report on the implementation of process control and inspection via the process file system on Linux. Our work extends the… 
1980
1980
MULTI - a LISP based multiprocessing system
A package of LISP functions, collectively called MULTI, which extends LISP 1.5 to multiprogramming is presented. MULTI defines…