☰

Ivan H. Sudborough - Publications

Affiliations: 
University of Texas at Dallas, Richardson, TX, United States 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

35 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2019 Bereg S, Miller Z, Mojica LG, Morales L, Sudborough IH. New lower bounds for permutation arrays using contraction Designs, Codes and Cryptography. 87: 2105-2128. DOI: 10.1007/S10623-019-00607-Y  0.376
2016 Bereg S, Morales L, Sudborough IH. Extending permutation arrays: improving MOLS bounds Designs, Codes, and Cryptography. 1-23. DOI: 10.1007/S10623-016-0263-Y  0.311
2014 Miller Z, Pritikin D, Sudborough IH. Embedding multidimensional grids into optimal hypercubes Theoretical Computer Science. 552: 52-82. DOI: 10.1016/J.Tcs.2014.07.026  0.399
2009 Bein WW, Larmore LL, Morales L, Sudborough IH. A quadratic time 2-approximation algorithm for block sorting Theoretical Computer Science. 410: 711-717. DOI: 10.1016/j.tcs.2008.10.022  0.394
2009 Chitturi B, Fahle W, Meng Z, Morales L, Shields CO, Sudborough IH, Voit W. An (18 / 11) n upper bound for sorting by prefix reversals Theoretical Computer Science. 410: 3372-3390. DOI: 10.1016/J.Tcs.2008.04.045  0.505
2008 Chitturi B, Sudborough IH. Bounding prefix transposition distance for strings and permutations Proceedings of the Annual Hawaii International Conference On System Sciences. DOI: 10.1016/J.Tcs.2011.11.018  0.75
2007 Heydari MH, Shields CO, Morales L, Sudborough IH. Computing cross associations for attack graphs and other applications Proceedings of the Annual Hawaii International Conference On System Sciences. DOI: 10.1109/HICSS.2007.141  0.574
2006 Bass DW, Sudborough IH. Hamilton decompositions and (n/2)-factorizations of hypercubes Graph Algorithms and Applications 4. 79-98. DOI: 10.1142/9789812773296_0003  0.377
2005 Miller Z, Pritikin D, Perkel M, Sudborough IH. The sequential sum problem and performance bounds on the greedy algorithm for the on-line steiner problem Networks. 45: 143-164. DOI: 10.1002/Net.V45:3  0.557
2004 Feng X, Meng Z, Sudborough IH. Improved upper bound for sorting by short swaps Proceedings of the International Symposium On Parallel Architectures, Algorithms and Networks, I-Span. 98-103. DOI: 10.1109/ISPAN.2004.1300465  0.515
2003 Lin YB, Miller Z, Perkel M, Pritikin D, Sudborough IH. Expansion of layouts of complete binary trees into grids Discrete Applied Mathematics. 131: 611-642. DOI: 10.1016/S0166-218X(02)00550-4  0.46
2002 Justan MP, Muga FP, Sudborough IH. On the generalization of the pancake network Proceedings of the International Symposium On Parallel Architectures, Algorithms and Networks, I-Span. 2002: 173-178. DOI: 10.1109/ISPAN.2002.1004278  0.319
2002 Morales L, Sudborough IH. Comparing star and pancake networks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2566: 18-36.  0.355
2001 Gardner L, Miller Z, Pritikin D, Sudborough IH. One-to-many embeddings of hypercubes into Cayley graphs generated by reversals Theory of Computing Systems. 34: 399-431. DOI: 10.1007/S00224-001-1034-2  0.38
2000 Kim C, Sudborough IH. Leftmove-bound picture languages Theoretical Computer Science. 237: 183-195. DOI: 10.1016/S0304-3975(98)00164-9  0.341
2000 Bass DW, Sudborough IH. Removing edges from hypercubes to obtain vertex-symmetric networks with small diameter Telecommunication Systems. 13: 135-146.  0.431
1998 Bass DW, Sudborough IH. Small Dilation Embeddings between Cayley-Graph Networks Proceedings of the Joint Conference On Information Sciences. 4: 80-83.  0.46
1996 Bettayeb S, Cong B, Girou M, Sudborough IH. Embedding star networks into hypercubes Ieee Transactions On Computers. 45: 186-194. DOI: 10.1109/12.485371  0.445
1996 Miller Z, Pritikin D, Sudborough IH. Bounded dilation maps of hypercubes into cayley graphs on the symmetric group Mathematical Systems Theory. 29: 551-572. DOI: 10.1007/Bf01301964  0.319
1994 Miller Z, Pritikin D, Sudborough IH. Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group Ieee Transactions On Computers. 43: 13-22. DOI: 10.1109/12.250605  0.426
1994 Ellis JA, Sudborough IH, Turner JS. The Vertex Separation and Search Number of a Graph Information and Computation. 113: 50-79. DOI: 10.1006/inco.1994.1064  0.355
1992 Kim C, Sudborough IH. On reversal-bounded picture languages Theoretical Computer Science. 104: 185-206. DOI: 10.1016/0304-3975(92)90122-V  0.37
1991 Miller Z, Sudborough IH. A polynomial algorithm for recognizing bounded cutwidth in hypergraphs Mathematical Systems Theory. 24: 11-40. DOI: 10.1007/Bf02090388  0.508
1989 Makedon F, Sudborough IH. On minimizing width in linear layouts Discrete Applied Mathematics. 23: 243-265. DOI: 10.1016/0166-218X(89)90016-4  0.318
1988 Monien B, Sudborough IH. Min cut is NP-complete for edge weighted trees Theoretical Computer Science. 58: 209-229. DOI: 10.1016/0304-3975(88)90028-X  0.372
1987 Kim C, Sudborough IH. The membership and equivalence problems for picture languages Theoretical Computer Science. 52: 177-191. DOI: 10.1016/0304-3975(87)90107-1  0.32
1985 Monien B, Sudborough IH. Bandwidth constrained NP-complete problems Theoretical Computer Science. 41: 141-167. DOI: 10.1016/0304-3975(85)90068-4  0.494
1985 Chung MJ, Evangelist WM, Sudborough IH. Complete problems for space bounded subclasses of NP Acta Informatica. 22: 379-395. DOI: 10.1007/Bf00288774  0.519
1984 Gurari EM, Sudborough IH. Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem Journal of Algorithms. 5: 531-546. DOI: 10.1016/0196-6774(84)90006-3  0.347
1983 Sudborough IH. Bandwidth constraints on problems complete for polynomial time Theoretical Computer Science. 26: 25-52. DOI: 10.1016/0304-3975(83)90078-6  0.445
1983 Rosenberg AL, Sudborough IH. Bandwidth and pebbling Computing. 31: 115-139. DOI: 10.1007/Bf02259908  0.306
1982 Monien B, Sudborough IH. On eliminating nondeterminism from turing machines which use less than logarithm worktape space Theoretical Computer Science. 21: 237-253. DOI: 10.1016/0304-3975(82)90075-5  0.484
1977 Sudborough IH. Separating tape bounded auxiliary pushdown automata classes Proceedings of the Annual Acm Symposium On Theory of Computing. 2: 208-217. DOI: 10.1145/800105.803410  0.324
1975 Sudborough IH. A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages Journal of the Acm (Jacm). 22: 499-500. DOI: 10.1145/321906.321913  0.332
1975 Sudborough IH. On tape-bounded complexity classes and multihead finite automata Journal of Computer and System Sciences. 10: 62-76. DOI: 10.1016/S0022-0000(75)80014-6  0.366
Show low-probability matches.