Ivan Hal Sudborough

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

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

Linda Morales, Ivan Hal Sudborough: A quadratic lower bound for Topswops. Theor. Comput. Sci. 411(44-46): 3965-3970 (2010)

Bhadrachalam Chitturi, Ivan Hal Sudborough: Prefix Reversals on Strings. BIOCOMP 2010: 591-598

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

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): 711-717 (2009)

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

Wolfgang W. Bein, Shahram Latifi, Linda Morales, Ivan Hal Sudborough: Bounding the Size of k-Tuple Covers. HICSS 2009: 1-8

Bhadrachalam Chitturi, Ivan Hal Sudborough, Walter Voit, Xuerong Feng: Adjacent Swaps on Strings. COCOON 2008: 299-308

Bhadrachalam Chitturi, Ivan Hal Sudborough: Bounding Prefix Transposition Distance for Strings and Permutations. HICSS 2008: 468

Doina Bein, Linda Morales, Wolfgang W. Bein, C. O. Shields Jr., Z. Meng, Ivan Hal Sudborough: Clustering and the Biclique Partition Problem. HICSS 2008: 475

Yukiko Yamauchi, Doina Bein, Toshimitsu Masuzawa, Linda Morales, Ivan Hal Sudborough: Calibrating an Embedded Protocol on an Asynchronous System. IDC 2008: 227-236

Daniel W. Cranston, Ivan Hal Sudborough, Douglas B. West: Short proofs for cut-and-paste sorting of permutations. Discrete Mathematics 307(22): 2866-2870 (2007)

Mohammad Hossain Heydari, Linda Morales, C. O. Shields Jr., Ivan Hal Sudborough: Computing Cross Associations for Attack Graphs and Other Applications. HICSS 2007: 270

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

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): 143-164 (2005)

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

Mohamed Eltoweissy, Mohammad Hossain Heydari, Linda Morales, Ivan Hal Sudborough: Combinatorial Optimization of Group Key Management. J. Network Syst. Manage. 12(1): 33-50 (2004)

Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough: Embedding A Complete Binary Tree Into A Three-Dimensional Grid. Journal of Interconnection Networks 5(2): 111-130 (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: 98-103

Y.-B. Lin, Zevi Miller, Manley Perkel, Dan Pritikin, Ivan Hal Sudborough: Expansion of layouts of complete binary trees into grids. Discrete Applied Mathematics 131(3): 611-642 (2003)

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

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

Douglas W. Bass, Ivan Hal Sudborough: Pancake problems with restricted prefix reversals and some corresponding Cayley networks. J. Parallel Distrib. Comput. 63(3): 327-336 (2003)

Linda Morales, Ivan Hal Sudborough, Mohamed Eltoweissy, Mohammad Hossain Heydari: Combinatorial Optimization of Multicast Key Management. HICSS 2003: 332

Linda Morales, Ivan Hal Sudborough: Comparing Star and Pancake Networks. The Essence of Computation 2002: 18-36

Marissa P. Justan, Felix P. Muga II, Ivan Hal Sudborough: On the Generalization of the Pancake Network. ISPAN 2002: 173-178

Douglas W. Bass, Ivan Hal Sudborough: Symmetric k-Factorizations of Hypercubes with Factors of Small Diameter. ISPAN 2002: 219-224

Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough: Fixed Layer Embeddings of Binary Trees. ISPAN 2002: 281-

Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough: Block Sorting is Hard. ISPAN 2002: 349-354

Torben Æ. Mogensen, David A. Schmidt, Ivan Hal Sudborough (Eds.): The Essence of Computation, Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones [on occasion of his 60th birthday]. Lecture Notes in Computer Science 2566, Springer 2002, isbn 3-540-00326-6

Changwook Kim, Ivan Hal Sudborough: Leftmove-bounded picture languages. Theor. Comput. Sci. 237(1-2): 183-195 (2000)

Douglas W. Bass, Ivan Hal Sudborough: Removing edges from hypercubes to obtain vertex-symmetric networks with small diameter. Telecommunication Systems 13(1): 135-146 (2000)

Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough: Three-Dimensional Embedding of Binary Trees. ISPAN 2000: 140-147

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

Ivan Hal Sudborough, Taoyu Zhang: Circuit-Switched Routings for Automorphisms of a Hypercube. ISPAN 1999: 28-35

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

Douglas W. Bass, Ivan Hal Sudborough: Pancake Problems with Restricted Prefix Reversals and some Corresponding Cayley Networks. ICPP 1998: 11-

Mohammad Hossain Heydari, Ivan Hal Sudborough: On the Diameter of the Pancake Network. J. Algorithms 25(1): 67-94 (1997)

Douglas W. Bass, Ivan Hal Sudborough: On The Shuffle-Exchange Permutation Network. ISPAN 1997: 165-171

Zevi Miller, Dan Pritikin, Ivan Hal Sudborough: Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group. Mathematical Systems Theory 29(6): 551-572 (1996)

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

Adair Dingle, Ivan Hal Sudborough: Single Row Routing on Multilayers. J. Comput. Syst. Sci. 50(1): 126-131 (1995)

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

Jonathan A. Ellis, Ivan Hal Sudborough, Jonathan S. Turner: The Vertex Separation and Search Number of a Graph. Inf. Comput. 113(1): 50-79 (1994)

Zevi Miller, Ivan Hal Sudborough: Compressing grids into small hypercubes. Networks 24(6): 327-357 (1994)

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

Adair Dingle, Ivan Hal Sudborough: Efficient Mappings of Pyramid Networks. IEEE Trans. Parallel Distrib. Syst. 5(10): 1009-1017 (1994)

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: 73-80

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): 199-203 (1993)

Adair Dingle, Ivan Hal Sudborough: Simulation of Binary Trees and X-Trees on Pyramid Networks. J. Parallel Distrib. Comput. 19(2): 119-124 (1993)

Darel A. Linebarger, Ivan Hal Sudborough, Ioannis G. Tollis: Difference bases and sparse sensor arrays. IEEE Transactions on Information Theory 39(2): 716-721 (1993)

Dipak Pravin Doctor, Ivan Hal Sudborough: Parallel Algorithm for Quadtree Medial Axis Transform. ICCI 1993: 266-271

Dipak Pravin Doctor, Ivan Hal Sudborough: Efficient Parallel Sibling Finding for Quadtree Data Structure. SPDP 1993: 141-149

Shai Simonson, Ivan Hal Sudborough: On the Complexity of Tree Embedding Problems. Inf. Process. Lett. 44(6): 323-328 (1992)

Saïd Bettayeb, Zevi Miller, Ivan Hal Sudborough: Embedding Grids into Hypercubes. J. Comput. Syst. Sci. 45(3): 340-366 (1992)

Changwook Kim, Ivan Hal Sudborough: On Reversal-Bounded Picture Languages. Theor. Comput. Sci. 104(2): 185-206 (1992)

Saïd Bettayeb, Bin Cong, Mike Girou, Ivan Hal Sudborough: Simulation Permutation Networks on Hypercubes. LATIN 1992: 61-70

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

Zevi Miller, Ivan Hal Sudborough: A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs. Mathematical Systems Theory 24(1): 11-40 (1991)

Martin Dietzfelbinger, Seshu Madhavapeddy, Ivan Hal Sudborough: Three disjoint path paradigms in star networks. SPDP 1991: 400-406

Bin Cong, Zevi Miller, Ivan Hal Sudborough: Optimum Simulation of Meshes by Small Hypercubes. IMYCS 1990: 30-46

Seshu Madhavapeddy, Ivan Hal Sudborough: A topological property of hypercubes: node disjoint paths. SPDP 1990: 532-539

Seshu Madhavapeddy, Ivan Hal Sudborough: Deterministic Message Routing in Faulty Hypercubes. WG 1990: 154-169

Fillia Makedon, Ivan Hal Sudborough: On minimizing width in linear layouts. Discrete Applied Mathematics 23(3): 243-265 (1989)

Adair Dingle, Ivan Hal Sudborough: On the Complexity of Single Row Routing Problems. WADS 1989: 529-540

Seshu Madhavapeddy, Ivan Hal Sudborough: Disjoint Paths in the Hypercube. WG 1989: 3-18

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

Burkhard Monien, Ivan Hal Sudborough: Simulating Binary Trees on Hypercubes. AWOC 1988: 170-180

Saïd Bettayeb, Zevi Miller, Ivan Hal Sudborough: Embedding Grids into Hypercubes. AWOC 1988: 201-211

Burkhard Monien, Ivan Hal Sudborough: Comparing Interconnection Networks. MFCS 1988: 138-153

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

Zevi Miller, Ivan Hal Sudborough: A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs. Aegean Workshop on Computing 1986: 252-260

Burkhard Monien, Ivan Hal Sudborough: Min Cut is NP-Complete for Edge Weigthed Trees. ICALP 1986: 265-274

Moon-Jung Chung, Michael Evangelist, Ivan Hal Sudborough: Complete Problems for Space Bounded Subclasses of NP. Acta Inf. 22(4): 379-395 (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): 158-177 (1985)

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

Burkhard Monien, Ivan Hal Sudborough: Bandwidth Constrained NP-Complete Problems. Theor. Comput. Sci. 41: 141-167 (1985)

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

Arnold L. Rosenberg, Ivan Hal Sudborough: Bandwidth and pebbling. Computing 31(2): 115-139 (1983)

Ivan Hal Sudborough: Bandwidth Constraints on Problems Complete for Polynomial Time. Theor. Comput. Sci. 26: 25-52 (1983)

Fillia Makedon, Christos H. Papadimitriou, Ivan Hal Sudborough: Topological Bandwidth. CAAP 1983: 317-331

Fillia Makedon, Ivan Hal Sudborough: Minimizing Width in Linear Layouts. ICALP 1983: 478-490

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

Moon-Jung Chung, Fillia Makedon, Ivan Hal Sudborough, Jonathan S. Turner: Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees. FOCS 1982: 262-271

Hermann A. Maurer, Ivan Hal Sudborough, Emo Welzl: On the Complexity of the General Coloring Problem. Information and Control 51(2): 128-145 (1981)

Ivan Hal Sudborough: Pebbling and Bandwith. FCT 1981: 373-383

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

Burkhard Monien, Ivan Hal Sudborough: Bandwidth Constrained NP-Complete Problems. STOC 1981: 207-217

Ivan Hal Sudborough: Efficient Algorithms for Path System Problems and Applications to Alternating and Time-Space Complexity Classes. FOCS 1980: 62-73

Ivan Hal Sudborough: The Complexity of Path Problems in Graphs and Path Systems of Bounded Bandwidth. WG 1980: 293-305

Burkhard Monien, Ivan Hal Sudborough: On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space. ICALP 1979: 431-445

Ivan Hal Sudborough: A Note on Weak Operator Precedence Grammars. Inf. Process. Lett. 7(5): 213-218 (1978)

Ivan Hal Sudborough: On the Tape Complexity of Deterministic Context-Free Languages. J. ACM 25(3): 405-414 (1978)

Ivan Hal Sudborough: A Note on Weak Operator Precedence Grammars. Inf. Process. Lett. 6(6): 213-218 (1977)

Ivan Hal Sudborough: Some Remarks on Multihead Automata. ITA 11(3): 181-195 (1977)

Ivan Hal Sudborough: The Time and Tape Complexity of Developmental Languages. ICALP 1977: 509-523

Ivan Hal Sudborough: Time and Tape Bounded Auxiliary Pushdown Automata. MFCS 1977: 493-503

Ivan Hal Sudborough: Separating Tape Bounded Auxiliary Pushdown Automata Classes. STOC 1977: 208-217

Ivan Hal Sudborough: One-Way Multihead Writing Finite Automata. Information and Control 30(1): 1-20 (1976)

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

Ivan Hal Sudborough: On Deterministic Context-Free Languages, Multihead Automata, and the Power of an Auxiliary Pushdown Store. STOC 1976: 141-148

Ivan Hal Sudborough: A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages. J. ACM 22(4): 499-500 (1975)

Ivan Hal Sudborough: On Tape-Bounded Complexity Classes and Multihead Finite Automata. J. Comput. Syst. Sci. 10(1): 62-76 (1975)

Ivan Hal Sudborough: Bounded-Reversal Multihead Finite Automata Languages. Information and Control 25(4): 317-328 (1974)

Ivan Hal Sudborough: On Tape-Bounded Complexity Classes and Multi-Head Finite Automata. SWAT (FOCS) 1973: 138-144

Ivan Hal Sudborough, A. Zalcberg: On Families of Languages Defined by Time-Bounded Random Access Machines. MFCS 1973: 333-338

Ivan Hal Sudborough: Computation by Multi-Head Finite Automata. SWAT (FOCS) 1971: 105-113