Searching for "On a Generalization of Heaps." – sorted by Relevance.
-
The fifth International Seminar on the Mathematical Analysis of Algorithms
- Robert Smythe (George Washington Univ., U.S.A.) 10:15 Generalized Heap Recurrence and its Applications
- Add To MetaCart
-
Euler Circuits, DNA Sequencing by Hybridization, and a New Graph Polynomial that Counts Euler
- A generalized heap (or a d-heap) is a d-ary tree with the heap property. It is known
- Add To MetaCart
-
The Muse Approach to Or-Parallel Prolog
- and bagof , and some global registers. The shared memory segment is administrated as a general heap. 4
- Cited by 21 (6 self) – Add To MetaCart
-
Phantom Stacks - if you look too hard, they aren't there
- other than a general heap is the "spaghetti stack" technique, developed in 1972 by Bobrow and Wegbreit
- Cited by 3 (0 self) – Add To MetaCart
-
On rank functions for heaps
- the converse of Lemma 1.2.7 for a general heap. The main result of this section is Theorem 2.1.1. 2.1. The main
- Cited by 2 (1 self) – Add To MetaCart

