Ivan Hal Sudborough

ORCID

Publication Activity (10 Years)

Years Active: 1971-2024
Publications (10 Years): 14

Top Venues

Publications

Sergey Bereg, Mohammadreza Haghpanah, Brian Malouf, Ivan Hal Sudborough
Improved bounds for permutation arrays under Chebyshev distance. Des. Codes Cryptogr. 92 (4) (2024)
Sergey Bereg, Mohammadreza Haghpanah, Brian Malouf, Ivan Hal Sudborough
Improved Bounds for Permutation Arrays Under Chebyshev Distance. CoRR (2023)
Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough
Using permutation rational functions to obtain permutation arrays with large hamming distance. Des. Codes Cryptogr. 90 (7) (2022)
Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough
Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions. CoRR (2020)
Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough
Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions. WAIFI (2020)
Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough
Constructing permutation arrays using partition and extension. Des. Codes Cryptogr. 88 (2) (2020)
Sergey Bereg, Zevi Miller, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough
New lower bounds for permutation arrays using contraction. Des. Codes Cryptogr. 87 (9) (2019)
Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough, Alexander Wong
Equivalence Relations for Computing Permutation Polynomials. CoRR (2019)
Sergey Bereg, Avi Levy, Ivan Hal Sudborough
Constructing permutation arrays from groups. Des. Codes Cryptogr. 86 (5) (2018)
Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough
Constructing Permutation Arrays using Partition and Extension. CoRR (2018)
Sergey Bereg, Zevi Miller, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough
Maximizing Hamming Distance in Contraction of Permutation Arrays. CoRR (2018)
Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough
Kronecker product and tiling of permutation arrays for hamming distances. ISIT (2017)
Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough
Parallel Partition and Extension. CISS (2017)
Sergey Bereg, Linda Morales, Ivan Hal Sudborough
Extending permutation arrays: improving MOLS bounds. Des. Codes Cryptogr. 83 (3) (2017)
Sergey Bereg, Avi Levy, Ivan Hal Sudborough
Constructing Permutation Arrays from Groups. CoRR (2015)
Zevi Miller, Dan Pritikin, Ivan Hal Sudborough
Embedding multidimensional grids into optimal hypercubes. Theor. Comput. Sci. 552 (2014)
Bhadrachalam Chitturi, Ivan Hal Sudborough
Bounding prefix transposition distance for strings and permutations. Theor. Comput. Sci. 421 (2012)
Yukiko Yamauchi, Doina Bein, Toshimitsu Masuzawa, Linda Morales, Ivan Hal Sudborough
Calibrating embedded protocols on asynchronous systems. Inf. Sci. 180 (10) (2010)
Saïd Bettayeb, Mohammad Hossain Heydari, Linda Morales, Ivan Hal Sudborough
Stack and Queue Layouts for Toruses and Extended Hypercubes. HICSS (2010)
Linda Morales, Ivan Hal Sudborough
A quadratic lower bound for Topswops. Theor. Comput. Sci. 411 (44-46) (2010)
Bhadrachalam Chitturi, Ivan Hal Sudborough
Prefix Reversals on Strings. BIOCOMP (2010)
Bhadrachalam Chitturi, William Fahle, Z. Meng, Linda Morales, Charles O. Shields Jr., Ivan Hal Sudborough, Walter Voit
An (18/11)n upper bound for sorting by prefix reversals. Theor. Comput. Sci. 410 (36) (2009)
Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough
A quadratic time 2-approximation algorithm for block sorting. Theor. Comput. Sci. 410 (8-10) (2009)
Wolfgang W. Bein, Shahram Latifi, Linda Morales, Ivan Hal Sudborough
Bounding the Size of k-Tuple Covers. HICSS (2009)
Bhadrachalam Chitturi, Ivan Hal Sudborough
Bounding Prefix Transposition Distance for Strings and Permutations. HICSS (2008)
Yukiko Yamauchi, Doina Bein, Toshimitsu Masuzawa, Linda Morales, Ivan Hal Sudborough
Calibrating an Embedded Protocol on an Asynchronous System. IDC (2008)
Doina Bein, Linda Morales, Wolfgang W. Bein, Charles O. Shields Jr., Z. Meng, Ivan Hal Sudborough
Clustering and the Biclique Partition Problem. HICSS (2008)
Bhadrachalam Chitturi, Ivan Hal Sudborough, Walter Voit, Xuerong Feng
Adjacent Swaps on Strings. COCOON (2008)
Daniel W. Cranston, Ivan Hal Sudborough, Douglas B. West
Short proofs for cut-and-paste sorting of permutations. Discret. Math. 307 (22) (2007)
Mohammad Hossain Heydari, Linda Morales, Charles O. Shields Jr., Ivan Hal Sudborough
Computing Cross Associations for Attack Graphs and Other Applications. HICSS (2007)
Mohammad Hossain Heydari, Linda Morales, Ivan Hal Sudborough
Efficient Algorithms for Batch Re-Keying Operations in Secure Multicast. HICSS (2006)
Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough
A Faster and Simpler 2-Approximation Algorithm for Block Sorting. FCT (2005)
Zevi Miller, Dan Pritikin, Manley Perkel, Ivan Hal Sudborough
The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem. Networks 45 (3) (2005)
Wolfgang W. Bein, Lawrence L. Larmore, Charles O. Shields Jr., Ivan Hal Sudborough
Embedding A Complete Binary Tree Into A Three-Dimensional Grid. J. Interconnect. Networks 5 (2) (2004)
Mohamed Eltoweissy, Mohammad Hossain Heydari, Linda Morales, Ivan Hal Sudborough
Towards Trusted Online Dissemination of Consumer Information. HICSS (2004)
Xuerong Feng, Z. Meng, Ivan Hal Sudborough
Improved Upper Bound for Sorting by Short Swaps. ISPAN (2004)
Mohamed Eltoweissy, Mohammad Hossain Heydari, Linda Morales, Ivan Hal Sudborough
Combinatorial Optimization of Group Key Management. J. Netw. Syst. Manag. 12 (1) (2004)
Y.-B. Lin, Zevi Miller, Manley Perkel, Dan Pritikin, Ivan Hal Sudborough
Expansion of layouts of complete binary trees into grids. Discret. Appl. Math. 131 (3) (2003)
Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough
Block Sorting is Hard. Int. J. Found. Comput. Sci. 14 (3) (2003)
Douglas W. Bass, Ivan Hal Sudborough
Hamilton Decompositions and (n/2)-Factorizations of Hypercubes. J. Graph Algorithms Appl. 7 (1) (2003)
Linda Morales, Ivan Hal Sudborough, Mohamed Eltoweissy, Mohammad Hossain Heydari
Combinatorial Optimization of Multicast Key Management. HICSS (2003)
Douglas W. Bass, Ivan Hal Sudborough
Pancake problems with restricted prefix reversals and some corresponding Cayley networks. J. Parallel Distributed Comput. 63 (3) (2003)
Wolfgang W. Bein, Lawrence L. Larmore, Charles O. Shields Jr., Ivan Hal Sudborough
Fixed Layer Embeddings of Binary Trees. ISPAN (2002)
Linda Morales, Ivan Hal Sudborough
Comparing Star and Pancake Networks. The Essence of Computation (2002)
Douglas W. Bass, Ivan Hal Sudborough
Symmetric k-Factorizations of Hypercubes with Factors of Small Diameter. ISPAN (2002)
Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough
Block Sorting is Hard. ISPAN (2002)
Marissa P. Justan, Felix P. Muga II, Ivan Hal Sudborough
On the Generalization of the Pancake Network. ISPAN (2002)
Wolfgang W. Bein, Lawrence L. Larmore, Charles O. Shields Jr., Ivan Hal Sudborough
Three-Dimensional Embedding of Binary Trees. ISPAN (2000)
Douglas W. Bass, Ivan Hal Sudborough
Removing edges from hypercubes to obtain vertex-symmetric networks with small diameter. Telecommun. Syst. 13 (1) (2000)
Changwook Kim, Ivan Hal Sudborough
Leftmove-bounded picture languages. Theor. Comput. Sci. 237 (1-2) (2000)
Qian-Ping Gu, Shietung Peng, Ivan Hal Sudborough
A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions. Theor. Comput. Sci. 210 (2) (1999)
Ivan Hal Sudborough, Taoyu Zhang
Circuit-Switched Routings for Automorphisms of a Hypercube. ISPAN (1999)
Y.-B. Lin, Ivan Hal Sudborough, Zevi Miller, Dan Pritikin, Manley Perkel
On Mapping Complete Binary Trees into Grids and Extended Grids. ISPAN (1999)
Douglas W. Bass, Ivan Hal Sudborough
Pancake Problems with Restricted Prefix Reversals and some Corresponding Cayley Networks. ICPP (1998)
Mohammad Hossain Heydari, Ivan Hal Sudborough
On the Diameter of the Pancake Network. J. Algorithms 25 (1) (1997)
Douglas W. Bass, Ivan Hal Sudborough
On The Shuffle-Exchange Permutation Network. ISPAN (1997)
Saïd Bettayeb, Bin Cong, Mike Girou, Ivan Hal Sudborough
Embedding Star Networks into Hypercubes. IEEE Trans. Computers 45 (2) (1996)
Zevi Miller, Dan Pritikin, Ivan Hal Sudborough
Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group. Math. Syst. Theory 29 (6) (1996)
Linda Gardner, Zevi Miller, Dan Pritikin, Ivan Hal Sudborough
Embedding hypercubes into pancake, cycle prefix and substring reversal networks. HICSS (2) (1995)
Adair Dingle, Ivan Hal Sudborough
Single Row Routing on Multilayers. J. Comput. Syst. Sci. 50 (1) (1995)
Saïd Bettayeb, Zevi Miller, Tony Peng, Ivan Hal Sudborough
Embedding k-D Meshes into Optimum Hypercubes with Dilation 2k-1 (Extended Abstract). Canada-France Conference on Parallel and Distributed Computing (1994)
Zevi Miller, Dan Pritikin, Ivan Hal Sudborough
Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group. IEEE Trans. Computers 43 (1) (1994)
Adair Dingle, Ivan Hal Sudborough
Efficient Mappings of Pyramid Networks. IEEE Trans. Parallel Distributed Syst. 5 (10) (1994)
Zevi Miller, Ivan Hal Sudborough
Compressing grids into small hypercubes. Networks 24 (6) (1994)
John A. Ellis, Ivan Hal Sudborough, Jonathan S. Turner
The Vertex Separation and Search Number of a Graph Inf. Comput. 113 (1) (1994)
Darel A. Linebarger, Ivan Hal Sudborough, Ioannis G. Tollis
Difference bases and sparse sensor arrays. IEEE Trans. Inf. Theory 39 (2) (1993)
Dipak Pravin Doctor, Ivan Hal Sudborough
Parallel Algorithm for Quadtree Medial Axis Transform. ICCI (1993)
Dipak Pravin Doctor, Ivan Hal Sudborough
Efficient Parallel Sibling Finding for Quadtree Data Structure. SPDP (1993)
Xiaojun Shen, Qing Hu, Bin Cong, Ivan Hal Sudborough, Mike Girou, Saïd Bettayeb
The 4-Star Graph is not a Subgraph of Any Hypercube. Inf. Process. Lett. 45 (4) (1993)
Adair Dingle, Ivan Hal Sudborough
Simulation of Binary Trees and X-Trees on Pyramid Networks. J. Parallel Distributed Comput. 19 (2) (1993)
Mohammad Hossain Heydari, Ivan Hal Sudborough
On Sorting by Prefix Reversals and the Diameter of Pancake Networks. Heinz Nixdorf Symposium (1992)
Saïd Bettayeb, Bin Cong, Mike Girou, Ivan Hal Sudborough
Simulation Permutation Networks on Hypercubes. LATIN (1992)
Saïd Bettayeb, Zevi Miller, Ivan Hal Sudborough
Embedding Grids into Hypercubes. J. Comput. Syst. Sci. 45 (3) (1992)
Changwook Kim, Ivan Hal Sudborough
On Reversal-Bounded Picture Languages. Theor. Comput. Sci. 104 (2) (1992)
Shai Simonson, Ivan Hal Sudborough
On the Complexity of Tree Embedding Problems. Inf. Process. Lett. 44 (6) (1992)
Martin Dietzfelbinger, Seshu Madhavapeddy, Ivan Hal Sudborough
Three disjoint path paradigms in star networks. SPDP (1991)
Zevi Miller, Ivan Hal Sudborough
A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs. Math. Syst. Theory 24 (1) (1991)
Seshu Madhavapeddy, Ivan Hal Sudborough
A topological property of hypercubes: node disjoint paths. SPDP (1990)
Seshu Madhavapeddy, Ivan Hal Sudborough
Deterministic Message Routing in Faulty Hypercubes. WG (1990)
Bin Cong, Zevi Miller, Ivan Hal Sudborough
Optimum Simulation of Meshes by Small Hypercubes. IMYCS (1990)
Adair Dingle, Ivan Hal Sudborough
On the Complexity of Single Row Routing Problems. WADS (1989)
Seshu Madhavapeddy, Ivan Hal Sudborough
Disjoint Paths in the Hypercube. WG (1989)
Fillia Makedon, Ivan Hal Sudborough
On minimizing width in linear layouts. Discret. Appl. Math. 23 (3) (1989)
Burkhard Monien, Ivan Hal Sudborough
Min Cut is NP-Complete for Edge Weighted Treees. Theor. Comput. Sci. 58 (1988)
Saïd Bettayeb, Zevi Miller, Ivan Hal Sudborough
Embedding Grids into Hypercubes. AWOC (1988)
Burkhard Monien, Ivan Hal Sudborough
Simulating Binary Trees on Hypercubes. AWOC (1988)
Burkhard Monien, Ivan Hal Sudborough
Comparing Interconnection Networks. MFCS (1988)
Changwook Kim, Ivan Hal Sudborough
The Membership and Equivalence Problems for Picture Languages. Theor. Comput. Sci. 52 (1987)
Burkhard Monien, Ivan Hal Sudborough
Min Cut is NP-Complete for Edge Weigthed Trees. ICALP (1986)
Zevi Miller, Ivan Hal Sudborough
A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs. Aegean Workshop on Computing (1986)
Ivan Hal Sudborough, Emo Welzl
Complexity and Decidability for Chain Code Picture Languages. Theor. Comput. Sci. 36 (1985)
Burkhard Monien, Ivan Hal Sudborough
Bandwidth Constrained NP-Complete Problems. Theor. Comput. Sci. 41 (1985)
Moon-Jung Chung, Fillia Makedon, Ivan Hal Sudborough, Jonathan S. Turner
Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees. SIAM J. Comput. 14 (1) (1985)
Moon-Jung Chung, Michael Evangelist, Ivan Hal Sudborough
Complete Problems for Space Bounded Subclasses of NP. Acta Informatica 22 (4) (1985)
Eitan M. Gurari, Ivan Hal Sudborough
Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem. J. Algorithms 5 (4) (1984)
Arnold L. Rosenberg, Ivan Hal Sudborough
Bandwidth and pebbling. Computing 31 (2) (1983)
Ivan Hal Sudborough
Bandwidth Constraints on Problems Complete for Polynomial Time. Theor. Comput. Sci. 26 (1983)
Fillia Makedon, Ivan Hal Sudborough
Minimizing Width in Linear Layouts. ICALP (1983)
Fillia Makedon, Christos H. Papadimitriou, Ivan Hal Sudborough
Topological Bandwidth. CAAP (1983)
Burkhard Monien, Ivan Hal Sudborough
On Eliminating Nondeterminism from Turing Machines which Use less than Logarithm Worktape Space. Theor. Comput. Sci. 21 (1982)

Ivan Hal Sudborough.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ivan Hal Sudborough