๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Developing a linear algorithm for cubing a cyclic permutation

โœ Scribed by Jinyun Xue; David Gries

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
261 KB
Volume
11
Category
Article
ISSN
0167-6423

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A linear time algorithm to recognize cir
A linear time algorithm to recognize circular permutation graphs
โœ Sritharan, R. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 368 KB

An undirected graph G is a circular permutation graph if it can be represented by the following intersectiori model: Each vertex of G corresponds to a chord in the annular region between two concentric circles, and two vertices are adjacent in G if and only if their corresponding chords intersect ea

A d-move local permutation routing for t
A d-move local permutation routing for the d-cube
โœ Frank K. Hwang; Y.C. Yao; Miltos D. Grammatikakis ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 680 KB

Optimal packet routing algorithms for all binary d-cubes of dimension d < 7 are presented. The algorithms given are synchronous, offer distributed control, and assume d-port, multiacccpting communication. While the previous best known packet routing algorithm [3] on the 7-cube takes 11 time-units,

A Random Base Change Algorithm for Permu
A Random Base Change Algorithm for Permutation Groups
โœ Gene Cooperman; Larry Finkelstein ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 549 KB

A new random base change algorithm is presented for a permutation group \(G\) acting on \(n\) points whose worst case asymptotic running time is better for groups with a small to moderate size base than any known deterministic algorithm. To achieve this time bound, the algorithm requires a random ge