Computation by Multi-Head Finite Automata - Ivan Hal Sudborough (SWAT, 1971)

On Tape-Bounded Complexity Classes and Multi-Head Finite Automata - Ivan Hal Sudborough (SWAT, 1973)

Bounded-Reversal Multihead Finite Automata Languages - Ivan Hal Sudborough (Inf. Control., 1974)

A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages. - Ivan Hal Sudborough (J. ACM, 1975)

On Tape-Bounded Complexity Classes and Multihead Finite Automata. - Ivan Hal Sudborough (J. Comput. Syst. Sci., 1975)

On Deterministic Context-Free Languages, Multihead Automata, and the Power of an Auxiliary Pushdown Store - Ivan Hal Sudborough (STOC, 1976)

On Families of Languages Defined by Time-Bounded Random Access Machines. - Ivan Hal Sudborough; A. Zalcberg (SIAM J. Comput., 1976)

One-Way Multihead Writing Finite Automata - Ivan Hal Sudborough (Inf. Control., 1976)

The Time and Tape Complexity of Developmental Languages. - Ivan Hal Sudborough (ICALP, 1977)

Time and Tape Bounded Auxiliary Pushdown Automata. - Ivan Hal Sudborough (MFCS, 1977)

Separating Tape Bounded Auxiliary Pushdown Automata Classes - Ivan Hal Sudborough (STOC, 1977)

A Note on Weak Operator Precedence Grammars. - Ivan Hal Sudborough (Inf. Process. Lett., 1977)

Some Remarks on Multihead Automata. - Ivan Hal Sudborough (RAIRO Theor. Informatics Appl., 1977)

On the Tape Complexity of Deterministic Context-Free Languages. - Ivan Hal Sudborough (J. ACM, 1978)

On non-erasing oracle tapes in space bounded reducibility. - Bruce E. Litow; Ivan Hal Sudborough (SIGACT News, 1978)

On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space. - Burkhard Monien; Ivan Hal Sudborough (ICALP, 1979)

Efficient Algorithms for Path System Problems and Applications to Alternating and Time-Space Complexity Classes - Ivan Hal Sudborough (FOCS, 1980)

Bounding the Bandwidth of NP-Complete Problems. - Burkhard Monien; Ivan Hal Sudborough (WG, 1980)

The Complexity of Path Problems in Graphs and Path Systems of Bounded Bandwidth. - Ivan Hal Sudborough (WG, 1980)

Pebbling and Bandwith. - Ivan Hal Sudborough (FCT, 1981)

Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey). - Burkhard Monien; Ivan Hal Sudborough (MFCS, 1981)

On the Complexity of the General Coloring Problem - Hermann A. Maurer; Ivan Hal Sudborough; Emo Welzl (Inf. Control., 1981)

On Eliminating Nondeterminism from Turing Machines which Use less than Logarithm Worktape Space. - Burkhard Monien; Ivan Hal Sudborough (Theor. Comput. Sci., 1982)

Topological Bandwidth. - Fillia Makedon; Christos H. Papadimitriou; Ivan Hal Sudborough (CAAP, 1983)

Bandwidth and pebbling. - Arnold L. Rosenberg; Ivan Hal Sudborough (Computing, 1983)

Bandwidth Constraints on Problems Complete for Polynomial Time. - Ivan Hal Sudborough (Theor. Comput. Sci., 1983)

Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem. - Eitan M. Gurari; Ivan Hal Sudborough (J. Algorithms, 1984)

Complete Problems for Space Bounded Subclasses of NP. - Moon-Jung Chung; Michael Evangelist; Ivan Hal Sudborough (Acta Informatica, 1985)

Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees. - Moon-Jung Chung; Fillia Makedon; Ivan Hal Sudborough; Jonathan S. Turner (SIAM J. Comput., 1985)

Bandwidth Constrained NP-Complete Problems. - Burkhard Monien; Ivan Hal Sudborough (Theor. Comput. Sci., 1985)

Complexity and Decidability for Chain Code Picture Languages. - Ivan Hal Sudborough; Emo Welzl (Theor. Comput. Sci., 1985)

A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs. - Zevi Miller; Ivan Hal Sudborough (Aegean Workshop on Computing, 1986)

Min Cut is NP-Complete for Edge Weigthed Trees. - Burkhard Monien; Ivan Hal Sudborough (ICALP, 1986)

The Membership and Equivalence Problems for Picture Languages. - Changwook Kim; Ivan Hal Sudborough (Theor. Comput. Sci., 1987)

Simulating Binary Trees on Hypercubes. - Burkhard Monien; Ivan Hal Sudborough (AWOC, 1988)

Comparing Interconnection Networks. - Burkhard Monien; Ivan Hal Sudborough (MFCS, 1988)

Min Cut is NP-Complete for Edge Weighted Treees. - Burkhard Monien; Ivan Hal Sudborough (Theor. Comput. Sci., 1988)

On the Complexity of Single Row Routing Problems. - Adair Dingle; Ivan Hal Sudborough (WADS, 1989)

Disjoint Paths in the Hypercube. - Seshu Madhavapeddy; Ivan Hal Sudborough (WG, 1989)

On minimizing width in linear layouts. - Fillia Makedon; Ivan Hal Sudborough (Discret. Appl. Math., 1989)

Optimum Simulation of Meshes by Small Hypercubes. - Bin Cong; Zevi Miller; Ivan Hal Sudborough (IMYCS, 1990)

A topological property of hypercubes: node disjoint paths. - Seshu Madhavapeddy; Ivan Hal Sudborough (SPDP, 1990)

Deterministic Message Routing in Faulty Hypercubes. - Seshu Madhavapeddy; Ivan Hal Sudborough (WG, 1990)

Three disjoint path paradigms in star networks. - Martin Dietzfelbinger; Seshu Madhavapeddy; Ivan Hal Sudborough (SPDP, 1991)

A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs. - Zevi Miller; Ivan Hal Sudborough (Math. Syst. Theory, 1991)

Simulation Permutation Networks on Hypercubes. - Saïd Bettayeb; Bin Cong; Mike Girou; Ivan Hal Sudborough (LATIN, 1992)

On Sorting by Prefix Reversals and the Diameter of Pancake Networks. - Mohammad Hossain Heydari; Ivan Hal Sudborough (Heinz Nixdorf Symposium, 1992)

On the Complexity of Tree Embedding Problems. - Shai Simonson; Ivan Hal Sudborough (Inf. Process. Lett., 1992)

Embedding Grids into Hypercubes. - Saïd Bettayeb; Zevi Miller; Ivan Hal Sudborough (J. Comput. Syst. Sci., 1992)

On Reversal-Bounded Picture Languages. - Changwook Kim; Ivan Hal Sudborough (Theor. Comput. Sci., 1992)

Parallel Algorithm for Quadtree Medial Axis Transform. - Dipak Pravin Doctor; Ivan Hal Sudborough (ICCI, 1993)

Efficient Parallel Sibling Finding for Quadtree Data Structure. - Dipak Pravin Doctor; Ivan Hal Sudborough (SPDP, 1993)

The 4-Star Graph is not a Subgraph of Any Hypercube. - Xiaojun Shen 002; Qing Hu 007; Bin Cong; Ivan Hal Sudborough; Mike Girou; Saïd Bettayeb (Inf. Process. Lett., 1993)

Simulation of Binary Trees and X-Trees on Pyramid Networks. - Adair Dingle; Ivan Hal Sudborough (J. Parallel Distributed Comput., 1993)

Difference bases and sparse sensor arrays. - Darel A. Linebarger; Ivan Hal Sudborough; Ioannis G. Tollis (IEEE Trans. Inf. Theory, 1993)

Embedding k-D Meshes into Optimum Hypercubes with Dilation 2k-1 (Extended Abstract). - Saïd Bettayeb; Zevi Miller; Tony Peng; Ivan Hal Sudborough (Canada-France Conference on Parallel and Distributed Computing, 1994)

Compressing grids into small hypercubes. - Zevi Miller; Ivan Hal Sudborough (Networks, 1994)

Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group. - Zevi Miller; Dan Pritikin; Ivan Hal Sudborough (IEEE Trans. Computers, 1994)

Efficient Mappings of Pyramid Networks. - Adair Dingle; Ivan Hal Sudborough (IEEE Trans. Parallel Distributed Syst., 1994)

The Vertex Separation and Search Number of a Graph - John A. Ellis; Ivan Hal Sudborough; Jonathan S. Turner (Inf. Comput., 1994)

Embedding hypercubes into pancake, cycle prefix and substring reversal networks. - Linda Gardner; Zevi Miller; Dan Pritikin; Ivan Hal Sudborough (HICSS (2), 1995)

Single Row Routing on Multilayers. - Adair Dingle; Ivan Hal Sudborough (J. Comput. Syst. Sci., 1995)

Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group. - Zevi Miller; Dan Pritikin; Ivan Hal Sudborough (Math. Syst. Theory, 1996)

Embedding Star Networks into Hypercubes. - Saïd Bettayeb; Bin Cong; Mike Girou; Ivan Hal Sudborough (IEEE Trans. Computers, 1996)

On The Shuffle-Exchange Permutation Network. - Douglas W. Bass; Ivan Hal Sudborough (ISPAN, 1997)

On the Diameter of the Pancake Network. - Mohammad Hossain Heydari; Ivan Hal Sudborough (J. Algorithms, 1997)

On Mapping Complete Binary Trees into Grids and Extended Grids. - Y.-B. Lin; Ivan Hal Sudborough; Zevi Miller; Dan Pritikin; Manley Perkel (ISPAN, 1999)

Circuit-Switched Routings for Automorphisms of a Hypercube. - Ivan Hal Sudborough; Taoyu Zhang (ISPAN, 1999)

A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions. - Qian-Ping Gu; Shietung Peng; Ivan Hal Sudborough (Theor. Comput. Sci., 1999)

Three-Dimensional Embedding of Binary Trees. - Wolfgang W. Bein; Lawrence L. Larmore; Charles O. Shields Jr.; Ivan Hal Sudborough (ISPAN, 2000)

Leftmove-bounded picture languages. - Changwook Kim; Ivan Hal Sudborough (Theor. Comput. Sci., 2000)

Removing edges from hypercubes to obtain vertex-symmetric networks with small diameter. - Douglas W. Bass; Ivan Hal Sudborough (Telecommun. Syst., 2000)

Comparing Star and Pancake Networks. - Linda Morales; Ivan Hal Sudborough (The Essence of Computation, 2002)

Symmetric k-Factorizations of Hypercubes with Factors of Small Diameter. - Douglas W. Bass; Ivan Hal Sudborough (ISPAN, 2002)

Fixed Layer Embeddings of Binary Trees. - Wolfgang W. Bein; Lawrence L. Larmore; Charles O. Shields Jr.; Ivan Hal Sudborough (ISPAN, 2002)

On the Generalization of the Pancake Network. - Marissa P. Justan; Felix P. Muga II; Ivan Hal Sudborough (ISPAN, 2002)

Combinatorial Optimization of Multicast Key Management. - Linda Morales; Ivan Hal Sudborough; Mohamed Eltoweissy; Mohammad Hossain Heydari (HICSS, 2003)

Expansion of layouts of complete binary trees into grids. - Y.-B. Lin; Zevi Miller; Manley Perkel; Dan Pritikin; Ivan Hal Sudborough (Discret. Appl. Math., 2003)

Block Sorting is Hard. - Wolfgang W. Bein; Lawrence L. Larmore; Shahram Latifi; Ivan Hal Sudborough (Int. J. Found. Comput. Sci., 2003)

Hamilton Decompositions and (n/2)-Factorizations of Hypercubes. - Douglas W. Bass; Ivan Hal Sudborough (J. Graph Algorithms Appl., 2003)

Pancake problems with restricted prefix reversals and some corresponding Cayley networks. - Douglas W. Bass; Ivan Hal Sudborough (J. Parallel Distributed Comput., 2003)

Towards Trusted Online Dissemination of Consumer Information. - Mohamed Eltoweissy; Mohammad Hossain Heydari; Linda Morales; Ivan Hal Sudborough (HICSS, 2004)

Improved Upper Bound for Sorting by Short Swaps. - Xuerong Feng; Z. Meng; Ivan Hal Sudborough (ISPAN, 2004)

Combinatorial Optimization of Group Key Management. - Mohamed Eltoweissy; Mohammad Hossain Heydari; Linda Morales; Ivan Hal Sudborough (J. Netw. Syst. Manag., 2004)

Embedding A Complete Binary Tree Into A Three-Dimensional Grid. - Wolfgang W. Bein; Lawrence L. Larmore; Charles O. Shields Jr.; Ivan Hal Sudborough (J. Interconnect. Networks, 2004)

A Faster and Simpler 2-Approximation Algorithm for Block Sorting. - Wolfgang W. Bein; Lawrence L. Larmore; Linda Morales; Ivan Hal Sudborough (FCT, 2005)

The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem. - Zevi Miller; Dan Pritikin; Manley Perkel; Ivan Hal Sudborough (Networks, 2005)

Efficient Algorithms for Batch Re-Keying Operations in Secure Multicast. - Mohammad Hossain Heydari; Linda Morales; Ivan Hal Sudborough (HICSS, 2006)

Computing Cross Associations for Attack Graphs and Other Applications. - Mohammad Hossain Heydari; Linda Morales; Charles O. Shields Jr.; Ivan Hal Sudborough (HICSS, 2007)

Short proofs for cut-and-paste sorting of permutations. - Daniel W. Cranston; Ivan Hal Sudborough; Douglas B. West (Discret. Math., 2007)

Adjacent Swaps on Strings. - Bhadrachalam Chitturi; Ivan Hal Sudborough; Walter Voit; Xuerong Feng (COCOON, 2008)

Clustering and the Biclique Partition Problem. - Doina Bein; Linda Morales; Wolfgang W. Bein; Charles O. Shields Jr.; Z. Meng; Ivan Hal Sudborough (HICSS, 2008)

Calibrating an Embedded Protocol on an Asynchronous System. - Yukiko Yamauchi; Doina Bein; Toshimitsu Masuzawa; Linda Morales; Ivan Hal Sudborough (IDC, 2008)

Bounding the Size of k-Tuple Covers. - Wolfgang W. Bein; Shahram Latifi; Linda Morales; Ivan Hal Sudborough (HICSS, 2009)

A quadratic time 2-approximation algorithm for block sorting. - Wolfgang W. Bein; Lawrence L. Larmore; Linda Morales; Ivan Hal Sudborough (Theor. Comput. Sci., 2009)

An (18/11)n upper bound for sorting by prefix reversals. - Bhadrachalam Chitturi; William Fahle; Z. Meng; Linda Morales; Charles O. Shields Jr.; Ivan Hal Sudborough; Walter Voit (Theor. Comput. Sci., 2009)

Prefix Reversals on Strings. - Bhadrachalam Chitturi; Ivan Hal Sudborough (BIOCOMP, 2010)

Stack and Queue Layouts for Toruses and Extended Hypercubes. - Saïd Bettayeb; Mohammad Hossain Heydari; Linda Morales; Ivan Hal Sudborough (HICSS, 2010)

Calibrating embedded protocols on asynchronous systems. - Yukiko Yamauchi; Doina Bein; Toshimitsu Masuzawa; Linda Morales; Ivan Hal Sudborough (Inf. Sci., 2010)

A quadratic lower bound for Topswops. - Linda Morales; Ivan Hal Sudborough (Theor. Comput. Sci., 2010)

Bounding prefix transposition distance for strings and permutations. - Bhadrachalam Chitturi; Ivan Hal Sudborough (Theor. Comput. Sci., 2012)

Embedding multidimensional grids into optimal hypercubes. - Zevi Miller; Dan Pritikin; Ivan Hal Sudborough (Theor. Comput. Sci., 2014)

Parallel Partition and Extension. - Sergey Bereg; Luis Gerardo Mojica; Linda Morales; Ivan Hal Sudborough (CISS, 2017)

Kronecker product and tiling of permutation arrays for hamming distances. - Sergey Bereg; Luis Gerardo Mojica; Linda Morales; Ivan Hal Sudborough (ISIT, 2017)

Extending permutation arrays: improving MOLS bounds. - Sergey Bereg; Linda Morales; Ivan Hal Sudborough (Des. Codes Cryptogr., 2017)

Maximizing Hamming Distance in Contraction of Permutation Arrays. - Sergey Bereg; Zevi Miller; Luis Gerardo Mojica; Linda Morales; Ivan Hal Sudborough (CoRR, 2018)

Constructing permutation arrays from groups. - Sergey Bereg; Avi Levy; Ivan Hal Sudborough (Des. Codes Cryptogr., 2018)

Equivalence Relations for Computing Permutation Polynomials. - Sergey Bereg; Brian Malouf; Linda Morales; Thomas Stanley; Ivan Hal Sudborough; Alexander Wong (CoRR, 2019)

New lower bounds for permutation arrays using contraction. - Sergey Bereg; Zevi Miller; Luis Gerardo Mojica; Linda Morales; Ivan Hal Sudborough (Des. Codes Cryptogr., 2019)

Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions. - Sergey Bereg; Brian Malouf; Linda Morales; Thomas Stanley; Ivan Hal Sudborough (WAIFI, 2020)

Constructing permutation arrays using partition and extension. - Sergey Bereg; Luis Gerardo Mojica; Linda Morales; Ivan Hal Sudborough (Des. Codes Cryptogr., 2020)

Using permutation rational functions to obtain permutation arrays with large hamming distance. - Sergey Bereg; Brian Malouf; Linda Morales; Thomas Stanley; Ivan Hal Sudborough (Des. Codes Cryptogr., 2022)

Improved bounds for permutation arrays under Chebyshev distance. - Sergey Bereg; Mohammadreza Haghpanah; Brian Malouf; Ivan Hal Sudborough (Des. Codes Cryptogr., 2024)