The following pages link to Encoding Data Structures in Trees (Q3857699):
Displaying 13 items.
- On the k-ary hypercube (Q673771) (← links)
- Minimal storage representations for binary relations (Q789170) (← links)
- The complexity of minimizing wire lengths in VLSI layouts (Q1107990) (← links)
- Uniform data encodings (Q1134520) (← links)
- On the complexity of tree embedding problems (Q1209372) (← links)
- A note on paths embedded in trees (Q1253099) (← links)
- On efficient entreeings (Q1323334) (← links)
- Minimum-perimeter domain assignment (Q1373754) (← links)
- A new combinatorial approach to optimal embeddings of rectangles (Q1920427) (← links)
- Blocking for external graph searching (Q1920428) (← links)
- On computing distances between leaves in a complete tree (Q3890125) (← links)
- Encoding search trees in lists<sup>†</sup> (Q3939219) (← links)
- A comparison of two methods of encoding arrays (Q4167534) (← links)
