☰

Ivan H. Sudborough

Affiliations: 
University of Texas at Dallas, Richardson, TX, United States 
Area:
Computer Science
Google:
"Ivan Sudborough"
Tree Publications Similar researchers PubMed Report error

Parents

Sign in to add mentor

Children

Sign in to add trainee
Charles O. Shields grad student 2001 UT Dallas
Taoyu Zhang grad student 2001 UT Dallas
Xuerong Feng grad student 2005 UT Dallas
Bhadrachalam Chitturi grad student 2007 UT Dallas
Quan T. Nguyen grad student 2013 UT Dallas

Collaborators

Sign in to add collaborator
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Bereg S, Miller Z, Mojica LG, et al. (2019) New lower bounds for permutation arrays using contraction Designs, Codes and Cryptography. 87: 2105-2128
Bereg S, Morales L, Sudborough IH. (2016) Extending permutation arrays: improving MOLS bounds Designs, Codes, and Cryptography. 1-23
Miller Z, Pritikin D, Sudborough IH. (2014) Embedding multidimensional grids into optimal hypercubes Theoretical Computer Science. 552: 52-82
Bein WW, Larmore LL, Morales L, et al. (2009) A quadratic time 2-approximation algorithm for block sorting Theoretical Computer Science. 410: 711-717
Chitturi B, Fahle W, Meng Z, et al. (2009) An (18 / 11) n upper bound for sorting by prefix reversals Theoretical Computer Science. 410: 3372-3390
Chitturi B, Sudborough IH. (2008) Bounding prefix transposition distance for strings and permutations Proceedings of the Annual Hawaii International Conference On System Sciences
Heydari MH, Shields CO, Morales L, et al. (2007) Computing cross associations for attack graphs and other applications Proceedings of the Annual Hawaii International Conference On System Sciences
Bass DW, Sudborough IH. (2006) Hamilton decompositions and (n/2)-factorizations of hypercubes Graph Algorithms and Applications 4. 79-98
Miller Z, Pritikin D, Perkel M, et al. (2005) The sequential sum problem and performance bounds on the greedy algorithm for the on-line steiner problem Networks. 45: 143-164
Feng X, Meng Z, Sudborough IH. (2004) Improved upper bound for sorting by short swaps Proceedings of the International Symposium On Parallel Architectures, Algorithms and Networks, I-Span. 98-103
See more...