1. Abeledo, H., Rothblum, U.G.: Paths to marriage stability. Discrete Applied Mathematics 63, 1–12 (1995)

   Article MATH MathSciNet  Google Scholar 

2. Anderson, R.: Parallel algorithms for generating random permutations on a shared memory machine. In: Proc. of the 2nd ACM Symposium on Parallel Algorithms and Architectures, pp. 95–102 (1990)

   Google Scholar 

3. Chuang, S.T., Goel, A., McKeown, N., Prabhakar, B.: Matching output queuing with a combined input/output-queued switch. IEEE Journal on Selected Areas in Communications 17(6), 1030–1039 (1999)

   Article  Google Scholar 

4. Durstenfeld, R.: Random permutation (Algorithm 235). Communication of ACM 7(7), 420 (1964)

   Article  Google Scholar 

5. Feder, T., Megiddo, N., Plotkin, S.: A sublinear parallel algorithm for stable matching. Theoretical Computer Science 233, 297–308 (2000)

   Article MATH MathSciNet  Google Scholar 

6. Gale, D., Shapley, L.S.: College admissions and the stability of marriage. American Mathematical Monthly 69, 9–15 (1962)

   Article MATH MathSciNet  Google Scholar 

7. Gusfield, D.: Three fast algorithms for four problems in stable marriage. SIAM Journal on Computing 16(1), 111–128 (1987)

   Article MATH MathSciNet  Google Scholar 

8. Gusfield, D., Irving, R.W.: The Stable Marriage Problem Structure and Algorithms. MIT Press, Cambridge (1989)

   MATH  Google Scholar 

9. Hagerup, T.: Fast parallel generation of random permutations. In: Proc. of the 18th Annual International Colloquium on Automata, Languages and Programming, pp. 405–416 (1991)

   Google Scholar 

10. Hattori, T., Yamasaki, T., Kumano, M.: New fast iteration algorithm for the solution of generalized stable marriage problem. In: Proc. of IEEE International Conference on Systems, Man, and Cybernetics, vol. 6, pp. 1051–1056 (1999)

    Google Scholar 

11. Hull, M.E.C.: A parallel view of stable marriages. Information Processing Letters 18(1), 63–66 (1984)

    Article  Google Scholar 

12. Jaja, J.: An Introduction to Parallel Algorithms. Addison-Wesley, Reading (1992)

    MATH  Google Scholar 

13. Kapur, D., Krishnamoorthy, M.S.: Worst-case choice for the stable marriage problem. Information Processing Letters 21, 27–30 (1985)

    Article MATH MathSciNet  Google Scholar 

14. Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays · Trees · Hypercubes. Morgan Kaufmann Publishers, San Francisco (1992)

    MATH  Google Scholar 

15. McKeown, N.: Scheduling algorithms for input-buffered cell switches. Ph.D. Thesis, University of California, Berkeley (1995)

    Google Scholar 

16. McVitie, D.G., Wilson, L.B.: The stable marriage problem. Communication of the ACM 14(7), 486–490 (1971)

    Article MathSciNet  Google Scholar 

17. Nong, G., Hamdi, M.: On the provision of quality-of-service guarantees for input queued switches. IEEE Communications Magazine 38(12), 62–69 (2000)

    Article  Google Scholar 

18. Prabhakar, B., McKeown, N.: On the speedup required for combined input- and output-queued switching. Automatica 35(12), 1909–1920 (1999)

    Article MATH MathSciNet  Google Scholar 

19. Quinn, M.J.: A note on two parallel algorithms to solve the stable marriage problem. BIT 25, 473–476 (1985)

    Article MathSciNet  Google Scholar 

20. Stoica, I., Zhang, H.: Exact emulation of an output queuing switch by a combined input output queuing switch. In: Proc. of the 6th IEEE/IFIP IWQoS 1998, Napa Valley, CA, pp. 218–224 (1998)

    Google Scholar 

21. Subramanian, A.: A new approach to stable matching problems. SIAM Journal on Computing 23(4), 671–700 (1994)

    Article MATH MathSciNet  Google Scholar 

22. Tseng, S.S., Lee, R.C.T.: A parallel algorithm to solve the stable marriage algorithm. BIT 24, 308–316 (1984)

    Article MATH MathSciNet  Google Scholar 

Download references