✦ LIBER ✦

A predecessor algorithm for ordered lists

✍ Scribed by Wilfred J. Hansen

Book ID: 113162022
Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 204 KB
Volume: 7
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(78)90076-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A dominant predecessor duplication sched

A dominant predecessor duplication scheduling algorithm for heterogeneous systems

✍ Kuan-Chou Lai; Chao-Tung Yang 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 684 KB

A fast equivalence-checking algorithm fo

A fast equivalence-checking algorithm for circular lists

✍ Yossi Shiloach 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 376 KB

A randomized algorithm for checking equi

A randomized algorithm for checking equivalence of circular lists

✍ Alon Itai 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 529 KB

Priority waiting lists: Is there a clini

Priority waiting lists: Is there a clinically ordered queue?

✍ Boris G. Sobolev; Peter M. Brown; David Zelt; Mark FitzGerald 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 55 KB

A microcomputer program for the correlat

A microcomputer program for the correlating of two ordered lists of numbers

✍ R.D. Kent; M. Schlesinger 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 30 KB

A microcomputer program for the correlat

A microcomputer program for the correlating of two ordered lists of numbers

✍ R.D. Kent; M. Schlesinger 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Programming language used: PDP Assembler, (Fortran driver Method of rolution available) Iterative 'compare' statements. High speed storage required: 878 words ## Restrictions on the complexity of the problem As given, the program treats only cases where, at most, two No. of bits in a word: 16 e