Ivan Hal Sudborough

129 papers A* 9B 14C 2Misc 3Journal 68Unranked 32

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Efficient Algorithms for Permutation Arrays from Permutation Polynomials. Entropy Sergey Bereg, Brian Malouf, Linda Morales, Ivan Hal Sudborough
2025	J	`jnl`	Upper Bounds for Chebyshev Permutation Arrays. Entropy Sergey Bereg, Zevi Miller, Ivan Hal Sudborough
2024	J	`jnl`	Improved bounds for permutation arrays under Chebyshev distance. Des. Codes Cryptogr. Sergey Bereg, Mohammadreza Haghpanah, Brian Malouf, Ivan Hal Sudborough
2023	J	`jnl`	Improved Bounds for Permutation Arrays Under Chebyshev Distance. CoRR Sergey Bereg, Mohammadreza Haghpanah, Brian Malouf, Ivan Hal Sudborough
2022	J	`jnl`	Using permutation rational functions to obtain permutation arrays with large hamming distance. Des. Codes Cryptogr. Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough
2020	J	`jnl`	Constructing permutation arrays using partition and extension. Des. Codes Cryptogr. Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough
2020	C	`conf`	Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions. WAIFI Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough
2020	J	`jnl`	Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions. CoRR Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough
2019	J	`jnl`	Equivalence Relations for Computing Permutation Polynomials. CoRR Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough, Alexander Wong
2019	J	`jnl`	New lower bounds for permutation arrays using contraction. Des. Codes Cryptogr. Sergey Bereg, Zevi Miller, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough
2018	J	`jnl`	Constructing Permutation Arrays using Partition and Extension. CoRR Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough
2018	J	`jnl`	Constructing permutation arrays from groups. Des. Codes Cryptogr. Sergey Bereg, Avi Levy, Ivan Hal Sudborough
2018	J	`jnl`	Maximizing Hamming Distance in Contraction of Permutation Arrays. CoRR Sergey Bereg, Zevi Miller, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough
2017	J	`jnl`	Extending permutation arrays: improving MOLS bounds. Des. Codes Cryptogr. Sergey Bereg, Linda Morales, Ivan Hal Sudborough
2017	B	`conf`	Kronecker product and tiling of permutation arrays for hamming distances. ISIT Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough
2017	Misc	`conf`	Parallel Partition and Extension. CISS Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough
2015	J	`jnl`	Constructing Permutation Arrays from Groups. CoRR Sergey Bereg, Avi Levy, Ivan Hal Sudborough
2014	J	`jnl`	Embedding multidimensional grids into optimal hypercubes. Theor. Comput. Sci. Zevi Miller, Dan Pritikin, Ivan Hal Sudborough
2012	J	`jnl`	Bounding prefix transposition distance for strings and permutations. Theor. Comput. Sci. Bhadrachalam Chitturi, Ivan Hal Sudborough
2010	J	`jnl`	A quadratic lower bound for Topswops. Theor. Comput. Sci. Linda Morales, Ivan Hal Sudborough
2010	J	`jnl`	Calibrating embedded protocols on asynchronous systems. Inf. Sci. Yukiko Yamauchi, Doina Bein, Toshimitsu Masuzawa, Linda Morales, Ivan Hal Sudborough
2010	—	`conf`	Prefix Reversals on Strings. BIOCOMP Bhadrachalam Chitturi, Ivan Hal Sudborough
2010	—	`conf`	Stack and Queue Layouts for Toruses and Extended Hypercubes. HICSS Saïd Bettayeb, Mohammad Hossain Heydari, Linda Morales, Ivan Hal Sudborough
2009	J	`jnl`	A quadratic time 2-approximation algorithm for block sorting. Theor. Comput. Sci. Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough
2009	J	`jnl`	An (18/11)n upper bound for sorting by prefix reversals. Theor. Comput. Sci. Bhadrachalam Chitturi, William Fahle, Z. Meng, Linda Morales, Charles O. Shields Jr., Ivan Hal Sudborough, Walter Voit
2009	—	`conf`	Bounding the Size of k-Tuple Covers. HICSS Wolfgang W. Bein, Shahram Latifi, Linda Morales, Ivan Hal Sudborough
2008	Misc	`conf`	Adjacent Swaps on Strings. COCOON Bhadrachalam Chitturi, Ivan Hal Sudborough, Walter Voit, Xuerong Feng
2008	—	`conf`	Bounding Prefix Transposition Distance for Strings and Permutations. HICSS Bhadrachalam Chitturi, Ivan Hal Sudborough
2008	Misc	`conf`	Calibrating an Embedded Protocol on an Asynchronous System. IDC Yukiko Yamauchi, Doina Bein, Toshimitsu Masuzawa, Linda Morales, Ivan Hal Sudborough
2008	—	`conf`	Clustering and the Biclique Partition Problem. HICSS Doina Bein, Linda Morales, Wolfgang W. Bein, Charles O. Shields Jr., Z. Meng, Ivan Hal Sudborough
2007	—	`conf`	Computing Cross Associations for Attack Graphs and Other Applications. HICSS Mohammad Hossain Heydari, Linda Morales, Charles O. Shields Jr., Ivan Hal Sudborough
2007	J	`jnl`	Short proofs for cut-and-paste sorting of permutations. Discret. Math. Daniel W. Cranston, Ivan Hal Sudborough, Douglas B. West
2006	—	`conf`	Efficient Algorithms for Batch Re-Keying Operations in Secure Multicast. HICSS Mohammad Hossain Heydari, Linda Morales, Ivan Hal Sudborough
2005	B	`conf`	A Faster and Simpler 2-Approximation Algorithm for Block Sorting. FCT Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough
2005	J	`jnl`	The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem. Networks Zevi Miller, Dan Pritikin, Manley Perkel, Ivan Hal Sudborough
2004	J	`jnl`	Combinatorial Optimization of Group Key Management. J. Netw. Syst. Manag. Mohamed Eltoweissy, Mohammad Hossain Heydari, Linda Morales, Ivan Hal Sudborough
2004	J	`jnl`	Embedding A Complete Binary Tree Into A Three-Dimensional Grid. J. Interconnect. Networks Wolfgang W. Bein, Lawrence L. Larmore, Charles O. Shields Jr., Ivan Hal Sudborough
2004	—	`conf`	Improved Upper Bound for Sorting by Short Swaps. ISPAN Xuerong Feng, Z. Meng, Ivan Hal Sudborough
2004	—	`conf`	Towards Trusted Online Dissemination of Consumer Information. HICSS Mohamed Eltoweissy, Mohammad Hossain Heydari, Linda Morales, Ivan Hal Sudborough
2003	J	`jnl`	Block Sorting is Hard. Int. J. Found. Comput. Sci. Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough
2003	—	`conf`	Combinatorial Optimization of Multicast Key Management. HICSS Linda Morales, Ivan Hal Sudborough, Mohamed Eltoweissy, Mohammad Hossain Heydari
2003	J	`jnl`	Expansion of layouts of complete binary trees into grids. Discret. Appl. Math. Y.-B. Lin, Zevi Miller, Manley Perkel, Dan Pritikin, Ivan Hal Sudborough
2003	J	`jnl`	Hamilton Decompositions and (n/2)-Factorizations of Hypercubes. J. Graph Algorithms Appl. Douglas W. Bass, Ivan Hal Sudborough
2003	J	`jnl`	Pancake problems with restricted prefix reversals and some corresponding Cayley networks. J. Parallel Distributed Comput. Douglas W. Bass, Ivan Hal Sudborough
2002	—	`conf`	Block Sorting is Hard. ISPAN Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough
2002	—	`conf`	Comparing Star and Pancake Networks. The Essence of Computation Linda Morales, Ivan Hal Sudborough
2002	—	`conf`	Fixed Layer Embeddings of Binary Trees. ISPAN Wolfgang W. Bein, Lawrence L. Larmore, Charles O. Shields Jr., Ivan Hal Sudborough
2002	—	`conf`	On the Generalization of the Pancake Network. ISPAN Marissa P. Justan, Felix P. Muga II, Ivan Hal Sudborough
2002	—	`conf`	Symmetric k-Factorizations of Hypercubes with Factors of Small Diameter. ISPAN Douglas W. Bass, Ivan Hal Sudborough
2002	—	`ed.`	The Essence of Computation, Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones [on occasion of his 60th birthday] The Essence of Computation Torben Æ. Mogensen, David A. Schmidt, Ivan Hal Sudborough
2000	J	`jnl`	Leftmove-bounded picture languages. Theor. Comput. Sci. Changwook Kim, Ivan Hal Sudborough
2000	J	`jnl`	Removing edges from hypercubes to obtain vertex-symmetric networks with small diameter. Telecommun. Syst. Douglas W. Bass, Ivan Hal Sudborough
2000	—	`conf`	Three-Dimensional Embedding of Binary Trees. ISPAN Wolfgang W. Bein, Lawrence L. Larmore, Charles O. Shields Jr., Ivan Hal Sudborough
1999	J	`jnl`	A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions. Theor. Comput. Sci. Qian-Ping Gu, Shietung Peng, Ivan Hal Sudborough
1999	—	`conf`	Circuit-Switched Routings for Automorphisms of a Hypercube. ISPAN Ivan Hal Sudborough, Taoyu Zhang
1999	—	`conf`	On Mapping Complete Binary Trees into Grids and Extended Grids. ISPAN Y.-B. Lin, Ivan Hal Sudborough, Zevi Miller, Dan Pritikin, Manley Perkel
1998	B	`conf`	Pancake Problems with Restricted Prefix Reversals and some Corresponding Cayley Networks. ICPP Douglas W. Bass, Ivan Hal Sudborough
1997	—	`conf`	On The Shuffle-Exchange Permutation Network. ISPAN Douglas W. Bass, Ivan Hal Sudborough
1997	J	`jnl`	On the Diameter of the Pancake Network. J. Algorithms Mohammad Hossain Heydari, Ivan Hal Sudborough
1996	J	`jnl`	Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group. Math. Syst. Theory Zevi Miller, Dan Pritikin, Ivan Hal Sudborough
1996	J	`jnl`	Embedding Star Networks into Hypercubes. IEEE Trans. Computers Saïd Bettayeb, Bin Cong, Mike Girou, Ivan Hal Sudborough
1995	—	`conf`	Embedding hypercubes into pancake, cycle prefix and substring reversal networks. HICSS (2) Linda Gardner, Zevi Miller, Dan Pritikin, Ivan Hal Sudborough
1995	J	`jnl`	Single Row Routing on Multilayers. J. Comput. Syst. Sci. Adair Dingle, Ivan Hal Sudborough
1994	J	`jnl`	Compressing grids into small hypercubes. Networks Zevi Miller, Ivan Hal Sudborough
1994	J	`jnl`	Efficient Mappings of Pyramid Networks. IEEE Trans. Parallel Distributed Syst. Adair Dingle, Ivan Hal Sudborough
1994	—	`conf`	Embedding k-D Meshes into Optimum Hypercubes with Dilation 2k-1 (Extended Abstract). Canada-France Conference on Parallel and Distributed Computing Saïd Bettayeb, Zevi Miller, Tony Peng, Ivan Hal Sudborough
1994	J	`jnl`	Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group. IEEE Trans. Computers Zevi Miller, Dan Pritikin, Ivan Hal Sudborough
1994	J	`jnl`	The Vertex Separation and Search Number of a Graph Inf. Comput. John A. Ellis, Ivan Hal Sudborough, Jonathan S. Turner
1993	J	`jnl`	Difference bases and sparse sensor arrays. IEEE Trans. Inf. Theory Darel A. Linebarger, Ivan Hal Sudborough, Ioannis G. Tollis
1993	—	`conf`	Efficient Parallel Sibling Finding for Quadtree Data Structure. SPDP Dipak Pravin Doctor, Ivan Hal Sudborough
1993	C	`conf`	Parallel Algorithm for Quadtree Medial Axis Transform. ICCI Dipak Pravin Doctor, Ivan Hal Sudborough
1993	J	`jnl`	Simulation of Binary Trees and X-Trees on Pyramid Networks. J. Parallel Distributed Comput. Adair Dingle, Ivan Hal Sudborough
1993	J	`jnl`	The 4-Star Graph is not a Subgraph of Any Hypercube. Inf. Process. Lett. Xiaojun Shen, Qing Hu, Bin Cong, Ivan Hal Sudborough, Mike Girou, Saïd Bettayeb
1992	J	`jnl`	Embedding Grids into Hypercubes. J. Comput. Syst. Sci. Saïd Bettayeb, Zevi Miller, Ivan Hal Sudborough
1992	J	`jnl`	On Reversal-Bounded Picture Languages. Theor. Comput. Sci. Changwook Kim, Ivan Hal Sudborough
1992	—	`conf`	On Sorting by Prefix Reversals and the Diameter of Pancake Networks. Heinz Nixdorf Symposium Mohammad Hossain Heydari, Ivan Hal Sudborough
1992	J	`jnl`	On the Complexity of Tree Embedding Problems. Inf. Process. Lett. Shai Simonson, Ivan Hal Sudborough
1992	B	`conf`	Simulation Permutation Networks on Hypercubes. LATIN Saïd Bettayeb, Bin Cong, Mike Girou, Ivan Hal Sudborough
1991	J	`jnl`	A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs. Math. Syst. Theory Zevi Miller, Ivan Hal Sudborough
1991	—	`conf`	Three disjoint path paradigms in star networks. SPDP Martin Dietzfelbinger, Seshu Madhavapeddy, Ivan Hal Sudborough
1990	—	`conf`	A topological property of hypercubes: node disjoint paths. SPDP Seshu Madhavapeddy, Ivan Hal Sudborough
1990	B	`conf`	Deterministic Message Routing in Faulty Hypercubes. WG Seshu Madhavapeddy, Ivan Hal Sudborough
1990	—	`conf`	Optimum Simulation of Meshes by Small Hypercubes. IMYCS Bin Cong, Zevi Miller, Ivan Hal Sudborough
1989	B	`conf`	Disjoint Paths in the Hypercube. WG Seshu Madhavapeddy, Ivan Hal Sudborough
1989	J	`jnl`	On minimizing width in linear layouts. Discret. Appl. Math. Fillia Makedon, Ivan Hal Sudborough
1989	B	`conf`	On the Complexity of Single Row Routing Problems. WADS Adair Dingle, Ivan Hal Sudborough
1988	B	`conf`	Comparing Interconnection Networks. MFCS Burkhard Monien, Ivan Hal Sudborough
1988	—	`conf`	Embedding Grids into Hypercubes. AWOC Saïd Bettayeb, Zevi Miller, Ivan Hal Sudborough
1988	J	`jnl`	Min Cut is NP-Complete for Edge Weighted Treees. Theor. Comput. Sci. Burkhard Monien, Ivan Hal Sudborough
1988	—	`conf`	Simulating Binary Trees on Hypercubes. AWOC Burkhard Monien, Ivan Hal Sudborough
1987	J	`jnl`	The Membership and Equivalence Problems for Picture Languages. Theor. Comput. Sci. Changwook Kim, Ivan Hal Sudborough
1986	—	`conf`	A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs. Aegean Workshop on Computing Zevi Miller, Ivan Hal Sudborough
1986	A*	`conf`	Min Cut is NP-Complete for Edge Weigthed Trees. ICALP Burkhard Monien, Ivan Hal Sudborough
1985	J	`jnl`	Bandwidth Constrained NP-Complete Problems. Theor. Comput. Sci. Burkhard Monien, Ivan Hal Sudborough
1985	J	`jnl`	Complete Problems for Space Bounded Subclasses of NP. Acta Informatica Moon-Jung Chung, Michael Evangelist, Ivan Hal Sudborough
1985	J	`jnl`	Complexity and Decidability for Chain Code Picture Languages. Theor. Comput. Sci. Ivan Hal Sudborough, Emo Welzl
1985	J	`jnl`	Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees. SIAM J. Comput. Moon-Jung Chung, Fillia Makedon, Ivan Hal Sudborough, Jonathan S. Turner
1984	J	`jnl`	Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem. J. Algorithms Eitan M. Gurari, Ivan Hal Sudborough
1983	J	`jnl`	Bandwidth Constraints on Problems Complete for Polynomial Time. Theor. Comput. Sci. Ivan Hal Sudborough
1983	J	`jnl`	Bandwidth and pebbling. Computing Arnold L. Rosenberg, Ivan Hal Sudborough
1983	A*	`conf`	Minimizing Width in Linear Layouts. ICALP Fillia Makedon, Ivan Hal Sudborough
1983	—	`conf`	Topological Bandwidth. CAAP Fillia Makedon, Christos H. Papadimitriou, Ivan Hal Sudborough
1982	J	`jnl`	On Eliminating Nondeterminism from Turing Machines which Use less than Logarithm Worktape Space. Theor. Comput. Sci. Burkhard Monien, Ivan Hal Sudborough
1982	A*	`conf`	Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees FOCS Moon-Jung Chung, Fillia Makedon, Ivan Hal Sudborough, Jonathan S. Turner
1981	A*	`conf`	Bandwidth Constrained NP-Complete Problems STOC Burkhard Monien, Ivan Hal Sudborough
1981	J	`jnl`	On the Complexity of the General Coloring Problem Inf. Control. Hermann A. Maurer, Ivan Hal Sudborough, Emo Welzl
1981	B	`conf`	Pebbling and Bandwith. FCT Ivan Hal Sudborough
1981	B	`conf`	Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey). MFCS Burkhard Monien, Ivan Hal Sudborough
1980	B	`conf`	Bounding the Bandwidth of NP-Complete Problems. WG Burkhard Monien, Ivan Hal Sudborough
1980	A*	`conf`	Efficient Algorithms for Path System Problems and Applications to Alternating and Time-Space Complexity Classes FOCS Ivan Hal Sudborough
1980	B	`conf`	The Complexity of Path Problems in Graphs and Path Systems of Bounded Bandwidth. WG Ivan Hal Sudborough
1979	A*	`conf`	On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space. ICALP Burkhard Monien, Ivan Hal Sudborough
1978	J	`jnl`	A Note on Weak Operator Precedence Grammars. Inf. Process. Lett. Ivan Hal Sudborough
1978	J	`jnl`	On non-erasing oracle tapes in space bounded reducibility. SIGACT News Bruce E. Litow, Ivan Hal Sudborough
1978	J	`jnl`	On the Tape Complexity of Deterministic Context-Free Languages. J. ACM Ivan Hal Sudborough
1977	J	`jnl`	A Note on Weak Operator Precedence Grammars. Inf. Process. Lett. Ivan Hal Sudborough
1977	A*	`conf`	Separating Tape Bounded Auxiliary Pushdown Automata Classes STOC Ivan Hal Sudborough
1977	J	`jnl`	Some Remarks on Multihead Automata. RAIRO Theor. Informatics Appl. Ivan Hal Sudborough
1977	A*	`conf`	The Time and Tape Complexity of Developmental Languages. ICALP Ivan Hal Sudborough
1977	B	`conf`	Time and Tape Bounded Auxiliary Pushdown Automata. MFCS Ivan Hal Sudborough
1976	A*	`conf`	On Deterministic Context-Free Languages, Multihead Automata, and the Power of an Auxiliary Pushdown Store STOC Ivan Hal Sudborough
1976	J	`jnl`	On Families of Languages Defined by Time-Bounded Random Access Machines. SIAM J. Comput. Ivan Hal Sudborough, A. Zalcberg
1976	J	`jnl`	One-Way Multihead Writing Finite Automata Inf. Control. Ivan Hal Sudborough
1975	J	`jnl`	A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages. J. ACM Ivan Hal Sudborough
1975	J	`jnl`	On Tape-Bounded Complexity Classes and Multihead Finite Automata. J. Comput. Syst. Sci. Ivan Hal Sudborough
1974	J	`jnl`	Bounded-Reversal Multihead Finite Automata Languages Inf. Control. Ivan Hal Sudborough
1973	B	`conf`	On Families of Languages Defined by Time-Bounded Random Access Machines. MFCS Ivan Hal Sudborough, A. Zalcberg
1973	—	`conf`	On Tape-Bounded Complexity Classes and Multi-Head Finite Automata SWAT Ivan Hal Sudborough
1971	—	`conf`	Computation by Multi-Head Finite Automata SWAT Ivan Hal Sudborough