Permutations generated by token passing in graphs

Theoretical Computer Science

Volumn 178, Issue 1-2, 1997, Pages 103-118

  Atkinson, M D ^a   Livesey, M J ^a   Tulley, D ^a  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; DATA STRUCTURES; PACKET NETWORKS;

PERMUTATIONS; TOKENS; TRANSPORTATION GRAPHS;

GRAPH THEORY;

EID: 0031144622     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00057-6     Document Type: Article

References (18)

1. M.D. Atkinson, Sorting permutations with networks of stacks, Technical Report TR-210, School of Computer Science, Carleton University, Ottawa, Canada, August 1992.
2. M.D. Atkinson and D. Tulley, The combinatorics of abstract data types, Proc. IMA Conf. on Applications of Combinatorics, to appear.
3. F. Baccelli, E. Gelenbe and B. Plateau, An end-to-end approach to the resequencing problem, J. ACM 31 (1984) 474-485.
4. N. Chomsky and M.P. Schutzenberger, The algebraic theory of context-free languages, in: Computer Programming and Format Systems (North-Holland, Amsterdam, 1963) 118-161.
5. N.G. de Bruijn, D.E. Knuth and S.O. Rice, The average height of planted plane trees, in: Graph Theory and Computing (Academic Press, New York, 1972) 15-22.
6. S. Even and A. Itai, Queues, stacks and graphs, in: Z. Kohavi and A. Paz, eds., Theory of Machines and Computations, Proc. Internat. Symp. on the Theory of Machines and Computations, Technion - Israel Inst. of Technol., Haifa, Israel, August 1971 (Academic Press, New York, 1971) 71-86.
7. G. Harris and B. Plateau, Queuing analysis of a re-ordering issue, IEEE Trans. Software Engrg. 8 (1982) 113-123.
8. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation (Addison-Wesley, Reading, MA, 1979).
9. I. Iliadis and L.Y.-C. Lien, Resequencing delay for a queuing system with two heterogeneous servers under a threshold-type scheduling, IEEE Trans. Commun. 36 (1988) 692-702.
10. L. Kleinrock, F. Camoun and R. Muntz, Queuing analysis of the re-ordering issue in a distributed database concurrency control mechanism, in: Proc. 2nd. Internat. Conf. Distrib. Database Syst., Versailles, France, April 1981.
11. D.E. Knuth, Fundamental Algorithms, The Art of Computer Programming, Vol. 1 (Addison-Wesley, Reading, MA, 2nd ed., 1973).
12. D.E. Knuth, Sorting and Searching, The Art of Computer Programming, Vol. 3 (Addison-Wesley, Reading, MA, 1973).
13. V.R. Pratt, Computing permutations with double-ended queues, parallel stacks and parallel queues, Proc. ACM Symp. Theory of Computing 5 (1973) 268-277.
14. D. Rotem, On a correspondence between binary trees and a certain type of permutation, Inform. Process. Lett. 4 (1975) 58-61.
15. N. Shacham and D. Towsley, Resequencing delay and buffer occupancy in selective repeat ARQ with multiple receivers, IEEE Trans. Commun. 39 (1991) 928-937.
16. R. Simion and F.W. Schmidt, Restricted permutations, European J. Combin. 6 (1985) 383-406.
17. R.E. Tarjan, Sorting using networks of queues and stacks, J. ACM 19 (1972) 341-346.
18. T.-S.P. Yum, T.-Y. Ngai, Resequencing of messages in communication networks, IEEE Trans. Commun. 34 (1986) 143-149.