Bit-reversal, tree-traversal and shuffling in vector algorithms

By:

Material type: Text

TextPublication details: Nijmegen: Catholic University, Department of Mathematics, 1981.Description: 15p.: 21cmSubject(s):

LOC classification:

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode
Research Report	UDSM Library	Social Sciences Collection	QA3.R46 No.8122 (Browse shelf(Opens below))	Available		000000201902

Previous	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	Next
Previous	QA3.R46 no.7929 Implications of the asymptotic behaviour of Vn on characterizing properties of stochastic games	QA3.R46 no.8117 On the existence of easy initial states for undiscounted stochastic gamestion	QA3.R46 no.8117 On the existence of easy initial states for undiscounted stochastic gamestion	QA3.R46 No.8122 Bit-reversal, tree-traversal and shuffling in vector algorithms	QA3.R46 no.8306 Existence of multiple normal mode trajectories on convex energy surfaces of even, classicial Hamiltonian systems	QA3.R46 no.8352 Discounted stochastic games and mathematical programming	QA3.R46 no.8701 On the space of all regular operators from C (K) into C (K)	Next

Includes bibliographical references

There are no comments on this title.

to post a comment.