| 2020 | WAIFI | Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions. | Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough |
| 2017 | CISS | Parallel Partition and Extension. | Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough |
| 2017 | ISIT | Kronecker product and tiling of permutation arrays for hamming distances. | Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough |
| 2008 | COCOON | Adjacent Swaps on Strings. | Bhadrachalam Chitturi, Ivan Hal Sudborough, Walter Voit, Xuerong Feng |
| 2008 | IDC | Calibrating an Embedded Protocol on an Asynchronous System. | Yukiko Yamauchi, Doina Bein, Toshimitsu Masuzawa, Linda Morales, Ivan Hal Sudborough |
| 2005 | FCT | A Faster and Simpler 2-Approximation Algorithm for Block Sorting. | Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough |
| 1998 | ICPP | Pancake Problems with Restricted Prefix Reversals and some Corresponding Cayley Networks. | Douglas W. Bass, Ivan Hal Sudborough |
| 1993 | ICCI | Parallel Algorithm for Quadtree Medial Axis Transform. | Dipak Pravin Doctor, Ivan Hal Sudborough |
| 1992 | LATIN | Simulation Permutation Networks on Hypercubes. | Sad Bettayeb, Bin Cong, Mike Girou, Ivan Hal Sudborough |
| 1990 | WG | Deterministic Message Routing in Faulty Hypercubes. | Seshu Madhavapeddy, Ivan Hal Sudborough |
| 1989 | WADS | On the Complexity of Single Row Routing Problems. | Adair Dingle, Ivan Hal Sudborough |
| 1989 | WG | Disjoint Paths in the Hypercube. | Seshu Madhavapeddy, Ivan Hal Sudborough |
| 1988 | MFCS | Comparing Interconnection Networks. | Burkhard Monien, Ivan Hal Sudborough |
| 1986 | ICALP | Min Cut is NP-Complete for Edge Weigthed Trees. | Burkhard Monien, Ivan Hal Sudborough |
| 1983 | ICALP | Minimizing Width in Linear Layouts. | Fillia Makedon, Ivan Hal Sudborough |
| 1982 | FOCS | Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees | Moon-Jung Chung, Fillia Makedon, Ivan Hal Sudborough, Jonathan S. Turner |
| 1981 | FCT | Pebbling and Bandwith. | Ivan Hal Sudborough |
| 1981 | MFCS | Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey). | Burkhard Monien, Ivan Hal Sudborough |
| 1981 | STOC | Bandwidth Constrained NP-Complete Problems | Burkhard Monien, Ivan Hal Sudborough |
| 1980 | FOCS | Efficient Algorithms for Path System Problems and Applications to Alternating and Time-Space Complexity Classes | Ivan Hal Sudborough |
| 1980 | WG | Bounding the Bandwidth of NP-Complete Problems. | Burkhard Monien, Ivan Hal Sudborough |
| 1980 | WG | The Complexity of Path Problems in Graphs and Path Systems of Bounded Bandwidth. | Ivan Hal Sudborough |
| 1979 | ICALP | On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space. | Burkhard Monien, Ivan Hal Sudborough |
| 1977 | ICALP | The Time and Tape Complexity of Developmental Languages. | Ivan Hal Sudborough |
| 1977 | MFCS | Time and Tape Bounded Auxiliary Pushdown Automata. | Ivan Hal Sudborough |
| 1977 | STOC | Separating Tape Bounded Auxiliary Pushdown Automata Classes | Ivan Hal Sudborough |
| 1976 | STOC | On Deterministic Context-Free Languages, Multihead Automata, and the Power of an Auxiliary Pushdown Store | Ivan Hal Sudborough |
| 1973 | FOCS | On Tape-Bounded Complexity Classes and Multi-Head Finite Automata | Ivan Hal Sudborough |
| 1973 | MFCS | On Families of Languages Defined by Time-Bounded Random Access Machines. | Ivan Hal Sudborough, A. Zalcberg |
| 1971 | FOCS | Computation by Multi-Head Finite Automata | Ivan Hal Sudborough |