| Hamiltonian properties of DCell networks X Wang, A Erickson, J Fan, X Jia The Computer Journal 58 (11), 2944-2955, 2015 | 47 | 2015 |
| The stellar transformation: From interconnection networks to datacenter networks A Erickson, IA Stewart, J Navaridas, AE Kiasari Computer Networks 113, 29-45, 2017 | 19 | 2017 |
| An optimal single-path routing algorithm in the datacenter network DPillar A Erickson, AE Kiasari, J Navaridas, IA Stewart IEEE Transactions on Parallel and Distributed Systems 28 (3), 689-703, 2016 | 16 | 2016 |
| Connectivity graphs of uncertainty regions E Chambers, A Erickson, S Fekete, J Lenchner, J Sember, S Venkatesh, ... Algorithms and Computation: 21st International Symposium, ISAAC 2010, Jeju …, 2010 | 16* | 2010 |
| Nested recurrence relations with Conolly-like solutions A Erickson, A Isgur, BW Jackson, F Ruskey, SM Tanny SIAM Journal on Discrete Mathematics 26 (1), 206-238, 2012 | 14 | 2012 |
| Monomer-dimer tatami tilings of rectangular regions A Erickson, F Ruskey, J Woodcock, M Schurch the electronic journal of combinatorics, P109-P109, 2011 | 11 | 2011 |
| Monomer-dimer tatami tilings of square regions A Erickson, M Schurch Journal of Discrete Algorithms 16, 258-269, 2012 | 7 | 2012 |
| Improved routing algorithms in the dual-port datacenter networks HCN and BCN A Erickson, IA Stewart, JA Pascual, J Navaridas Future Generation Computer Systems 75, 58-71, 2017 | 5 | 2017 |
| Routing algorithms for recursively-defined data centre networks A Erickson, A Kiasari, J Navaridas, IA Stewart 2015 IEEE Trustcom/BigDataSE/ISPA 3, 84-91, 2015 | 5 | 2015 |
| Domino tatami covering is NP-complete A Erickson, F Ruskey International Workshop on Combinatorial Algorithms, 140-149, 2013 | 4 | 2013 |
| An efficient shortest-path routing algorithm in the data centre network DPillar A Erickson, AE Kiasari, J Navaridas, IA Stewart Combinatorial Optimization and Applications: 9th International Conference …, 2015 | 3 | 2015 |
| Monomino-Domino Tatami Coverings A Erickson University of Victoria (Canada), 2013 | 3 | 2013 |
| Enumerating tatami mat arrangements of square grids A Erickson, M Schurch Combinatorial Algorithms: 22nd International Workshop, IWOCA 2011, Victoria …, 2011 | 3 | 2011 |
| Auspicious tatami mat arrangements A Erickson, F Ruskey, M Schurch, J Woodcock Computing and Combinatorics: 16th Annual International Conference, COCOON …, 2010 | 3 | 2010 |
| Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge isoperimetric problems in graphs A Erickson, J Navaridas, IA Stewart Journal of Computer and System Sciences 108, 10-28, 2020 | 1 | 2020 |
| WITHDRAWN: Star-replaced networks: A generalised class of dual-port server-centric data centre networks A Erickson, IA Stewart, J Navaridas, AE Kiasari Computer Networks, 2015 | 1 | 2015 |
| Generating tatami coverings efficiently A Erickson, F Ruskey arXiv preprint arXiv:1403.4776, 2014 | 1 | 2014 |
| Enumerating maximal tatami mat coverings of square grids with vertical dominoes A Erickson, F Ruskey arXiv preprint arXiv:1304.0070, 2013 | 1 | 2013 |
| Tatami Maker: A combinatorially rich mechanical game board A Erickson arXiv preprint arXiv:1301.5969, 2013 | 1 | 2013 |
| Collaborative problem solving: integrating theory and practice in the classroom M Cheng, E Delisle, A Erickson, S Ganti, F Mason, N Vining, S Whitesides Proceedings of the 15th Western Canadian Conference on Computing Education, 1-5, 2010 | 1 | 2010 |
Frank RuskeyComputer Science, University of Victoria在 cs.uvic.ca 的电子邮件经过验证
