Abstract
We present and develop a linear in-situ algorithm for the power of a cyclic permutation Pr(-n< r < n). Several related algorithms become the special cases of this algorithm. At first, we used an abstract structure, named twin ring, to represent cyclic permutation and derive a simple algorithm to compute Pr on twin ring. Then, the algorithm and the abstract structure twin ring were implemented based on PAR platform that consists of a set of program generating tools. The correctness of the final algorithmic program is based on the data coupling invariant and the assumption of PAR Platform correct. The abstract structure twin ring and the program generating tools take a key role in deriving the simple algorithm for computing Pr. The techniques demonstrated in this paper can be used in developing intricate algorithms.
Supported by the National Natural Science Foundation of China under Grant No.60573080, 60773054 and the National Grand Fundamental Research 973 Program of China under Grant No. 2003CCA02800 and the Natural Science Foundation of Jiangxi Province no.0211027.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Feijen, et al.: In-situ Inversion of a Cyclic Permutation. J. IPL. 24, 11–14 (1987)
Gries, D., Xue, J.: Generating a Random Cyclic Permutation. J. BITÂ 28 (1988)
Huang, B.C.: An Algorithm for Inverting a Permutation. J. IPLÂ 10 (1981)
Knuth, D.E.: The Art of Computer Programming, vol. 1. Addison-Wesley, Reading (1973)
Prodinger, H.: On the Analysis of An Algorithm to Generate a Random Cyclic Permutation. J. Ars Comb. 65 (2002)
Sattolo (Sandra).: An algorithm to generate a random cyclic permutation. J. Information Processing Letters. 22, 315–317 (1986)
Semple, C., Steel, M.: Cyclic permutations and evolutionary trees. J. Advances in Applied Mathematics 32, 669–680 (2004)
Wilson, M.C.: Overview of Sattolo’s Algorithm. J. Algorithms Seminar 2002 – 2004, Chyzak, F.(ed.) INRIA, pp.105–108 (2005)
Xue, J., Gries, D.: Developing a Linear Algorithm for Cubing a Cyclic Permutation. Sci. Comput. Program. 11(2), 161–165 (1988)
Xue, J.: A Unified Approach for Developing Efficient Algorithmic Programs. J. Journal of Computer Science and Technology 12, 103–118 (1997)
Xue, J.: Formal Derivation of Graph Algorithmic Programs Using Partition and Recur. J. Journal of Computer Sciences and Technology 13, 553–561 (1998)
Xue, J.: A Practicable Approach for Formal Development of Algorithmic Programs. In: Proceedings of the International Symposium on Future software Technology (1999)
Xue, J., et al.: Methods of program design. Higher education press (2001)
Xue, J.: PAR Method and Its Supporting Platform. In: Proceedings of The First International Workshop on Asian Working Conference on Verified Software (2006)
The application in cryptography, http://planetmath.org/encyclopedia/CyclicPermutation.htm http://www.cs.utsa.edu/~wagner/laws/AESkeys.html
The application in a wireless radio communication, http://www.patentstorm.us/patents/6999760-claims.html
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xue, J., Yang, B., Zuo, Z. (2008). A Linear In-situ Algorithm for the Power of Cyclic Permutation. In: Preparata, F.P., Wu, X., Yin, J. (eds) Frontiers in Algorithmics. FAW 2008. Lecture Notes in Computer Science, vol 5059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69311-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-69311-6_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69310-9
Online ISBN: 978-3-540-69311-6
eBook Packages: Computer ScienceComputer Science (R0)