✦ LIBER ✦

Implementation of samplesort: A minimal storage tree sort

✍ Scribed by J. G. Peters; P. S. Kritzinger

Publisher: Springer Netherlands
Year: 1975
Tongue: English
Weight: 580 KB
Volume: 15
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01932999

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An alternative for the implementation of

An alternative for the implementation of Kruskal's minimal spanning tree algorithm

✍ Jyrki Katajainen; Olli Nevalainen 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 784 KB

Implementation of bubble sort and the od

Implementation of bubble sort and the odd-even transposition sort on a rack of transputers

✍ Jagdish Modi; Richard Prager 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 231 KB

The suffix tree of a tree and minimizing

The suffix tree of a tree and minimizing sequential transducers

✍ Dany Breslauer 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 1013 KB

This paper gives a linear-time algorithm for the construction of the suffix tree of a tree, which was introduced by Kosaraju, as a natural generalization of the suffix tree of a string. The suffix tree of a tree is used to obtain an efficient algorithm for the minimization of sequential transducers.

The Minimal Number of Layers of a Percep

The Minimal Number of Layers of a Perceptron That Sorts

✍ P.J. Zwietering; E.H.L. Aarts; J. Wessels 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 582 KB

Sorting algorithms for the implementatio

Sorting algorithms for the implementation of a generalized vector product

✍ Alberto Garcia-Diaz; Donald K. Friesen; Donald J. Bagert 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB

A class of full Steiner minimal trees

✍ F.K. Hwang; Jia Feng Weng; Ding Zhu Du 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 559 KB

Steiner minimal tree for a given set of points in the plane is a tree which interconnects these points using Eines of shortest possible total length. We construct an infinite class of trees which are the unique full Steiner minimal trees for their sets of endpoints (vertices of degree one).