Ivan Hal Sudborough

According to our database1, Ivan Hal Sudborough
  • authored at least 112 papers between 1971 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Extending permutation arrays: improving MOLS bounds.
Des. Codes Cryptography, 2017

Parallel Partition and Extension.
Proceedings of the 51st Annual Conference on Information Sciences and Systems, 2017

2015
Constructing Permutation Arrays from Groups.
CoRR, 2015

2014
Embedding multidimensional grids into optimal hypercubes.
Theor. Comput. Sci., 2014

2012
Bounding prefix transposition distance for strings and permutations.
Theor. Comput. Sci., 2012

2010
A quadratic lower bound for Topswops.
Theor. Comput. Sci., 2010

Calibrating embedded protocols on asynchronous systems.
Inf. Sci., 2010

Stack and Queue Layouts for Toruses and Extended Hypercubes.
Proceedings of the 43rd Hawaii International International Conference on Systems Science (HICSS-43 2010), 2010

Prefix Reversals on Strings.
Proceedings of the International Conference on Bioinformatics & Computational Biology, 2010

2009
An (18/11)n upper bound for sorting by prefix reversals.
Theor. Comput. Sci., 2009

A quadratic time 2-approximation algorithm for block sorting.
Theor. Comput. Sci., 2009

Bounding the Size of k-Tuple Covers.
Proceedings of the 42st Hawaii International International Conference on Systems Science (HICSS-42 2009), 2009

2008
Calibrating an Embedded Protocol on an Asynchronous System.
Proceedings of the Intelligent Distributed Computing, Systems and Applications, Proceedings of the 2nd International Symposium on Intelligent Distributed Computing, 2008

Bounding Prefix Transposition Distance for Strings and Permutations.
Proceedings of the 41st Hawaii International International Conference on Systems Science (HICSS-41 2008), 2008

Clustering and the Biclique Partition Problem.
Proceedings of the 41st Hawaii International International Conference on Systems Science (HICSS-41 2008), 2008

Adjacent Swaps on Strings.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007
Short proofs for cut-and-paste sorting of permutations.
Discrete Mathematics, 2007

Computing Cross Associations for Attack Graphs and Other Applications.
Proceedings of the 40th Hawaii International International Conference on Systems Science (HICSS-40 2007), 2007

2006
Efficient Algorithms for Batch Re-Keying Operations in Secure Multicast.
Proceedings of the 39th Hawaii International International Conference on Systems Science (HICSS-39 2006), 2006

2005
The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem.
Networks, 2005

A Faster and Simpler 2-Approximation Algorithm for Block Sorting.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004
Embedding A Complete Binary Tree Into A Three-Dimensional Grid.
Journal of Interconnection Networks, 2004

Combinatorial Optimization of Group Key Management.
J. Network Syst. Manage., 2004

Improved Upper Bound for Sorting by Short Swaps.
Proceedings of the 7th International Symposium on Parallel Architectures, 2004

Towards Trusted Online Dissemination of Consumer Information.
Proceedings of the 37th Hawaii International Conference on System Sciences (HICSS-37 2004), 2004

2003
Pancake problems with restricted prefix reversals and some corresponding Cayley networks.
J. Parallel Distrib. Comput., 2003

Hamilton Decompositions and (n/2)-Factorizations of Hypercubes.
J. Graph Algorithms Appl., 2003

Block Sorting is Hard.
Int. J. Found. Comput. Sci., 2003

Expansion of layouts of complete binary trees into grids.
Discrete Applied Mathematics, 2003

Combinatorial Optimization of Multicast Key Management.
Proceedings of the 36th Hawaii International Conference on System Sciences (HICSS-36 2003), 2003

2002
On the Generalization of the Pancake Network.
Proceedings of the International Symposium on Parallel Architectures, 2002

Fixed Layer Embeddings of Binary Trees.
Proceedings of the International Symposium on Parallel Architectures, 2002

Block Sorting is Hard.
Proceedings of the International Symposium on Parallel Architectures, 2002

Symmetric k-Factorizations of Hypercubes with Factors of Small Diameter.
Proceedings of the International Symposium on Parallel Architectures, 2002

Comparing Star and Pancake Networks.
Proceedings of the Essence of Computation, Complexity, Analysis, 2002

2000
Removing edges from hypercubes to obtain vertex-symmetric networks with small diameter.
Telecommunication Systems, 2000

Leftmove-bounded picture languages.
Theor. Comput. Sci., 2000

Three-Dimensional Embedding of Binary Trees.
Proceedings of the 5th International Symposium on Parallel Architectures, 2000

1999
A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions.
Theor. Comput. Sci., 1999

Circuit-Switched Routings for Automorphisms of a Hypercube.
Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

On Mapping Complete Binary Trees into Grids and Extended Grids.
Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

1998
Pancake Problems with Restricted Prefix Reversals and some Corresponding Cayley Networks.
Proceedings of the 1998 International Conference on Parallel Processing (ICPP '98), 1998

1997
On the Diameter of the Pancake Network.
J. Algorithms, 1997

On The Shuffle-Exchange Permutation Network.
Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

1996
Embedding Star Networks into Hypercubes.
IEEE Trans. Computers, 1996

Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group.
Mathematical Systems Theory, 1996

1995
Single Row Routing on Multilayers.
J. Comput. Syst. Sci., 1995

Embedding hypercubes into pancake, cycle prefix and substring reversal networks.
Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

1994
The Vertex Separation and Search Number of a Graph
Inf. Comput., August, 1994

Efficient Mappings of Pyramid Networks.
IEEE Trans. Parallel Distrib. Syst., 1994

Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group.
IEEE Trans. Computers, 1994

Compressing grids into small hypercubes.
Networks, 1994

Embedding k-D Meshes into Optimum Hypercubes with Dilation 2k-1 (Extended Abstract).
Proceedings of the Parallel and Distributed Computing, 1994

1993
Difference bases and sparse sensor arrays.
IEEE Trans. Information Theory, 1993

Simulation of Binary Trees and X-Trees on Pyramid Networks.
J. Parallel Distrib. Comput., 1993

The 4-Star Graph is not a Subgraph of Any Hypercube.
Inf. Process. Lett., 1993

Efficient Parallel Sibling Finding for Quadtree Data Structure.
Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993

Parallel Algorithm for Quadtree Medial Axis Transform.
Proceedings of the Computing and Information, 1993

1992
On Reversal-Bounded Picture Languages.
Theor. Comput. Sci., 1992

Embedding Grids into Hypercubes.
J. Comput. Syst. Sci., 1992

On the Complexity of Tree Embedding Problems.
Inf. Process. Lett., 1992

On Sorting by Prefix Reversals and the Diameter of Pancake Networks.
Proceedings of the Parallel Architectures and Their Efficient Use, 1992

Simulation Permutation Networks on Hypercubes.
Proceedings of the LATIN '92, 1992

1991
A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs.
Mathematical Systems Theory, 1991

Three disjoint path paradigms in star networks.
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

1990
Deterministic Message Routing in Faulty Hypercubes.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990

A topological property of hypercubes: node disjoint paths.
Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 1990

Optimum Simulation of Meshes by Small Hypercubes.
Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990

1989
On minimizing width in linear layouts.
Discrete Applied Mathematics, 1989

Disjoint Paths in the Hypercube.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

On the Complexity of Single Row Routing Problems.
Proceedings of the Algorithms and Data Structures, 1989

1988
Min Cut is NP-Complete for Edge Weighted Treees.
Theor. Comput. Sci., 1988

Comparing Interconnection Networks.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

Simulating Binary Trees on Hypercubes.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

Embedding Grids into Hypercubes.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987
The Membership and Equivalence Problems for Picture Languages.
Theor. Comput. Sci., 1987

1986
Min Cut is NP-Complete for Edge Weigthed Trees.
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs.
Proceedings of the VLSI Algorithms and Architectures, 1986

1985
Complexity and Decidability for Chain Code Picture Languages.
Theor. Comput. Sci., 1985

Bandwidth Constrained NP-Complete Problems.
Theor. Comput. Sci., 1985

Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees.
SIAM J. Comput., 1985

Complete Problems for Space Bounded Subclasses of NP.
Acta Inf., 1985

1984
Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem.
J. Algorithms, 1984

1983
Bandwidth Constraints on Problems Complete for Polynomial Time.
Theor. Comput. Sci., 1983

Bandwidth and pebbling.
Computing, 1983

Minimizing Width in Linear Layouts.
Proceedings of the Automata, 1983

Topological Bandwidth.
Proceedings of the CAAP'83, 1983

1982
On Eliminating Nondeterminism from Turing Machines which Use less than Logarithm Worktape Space.
Theor. Comput. Sci., 1982

Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1981
On the Complexity of the General Coloring Problem
Information and Control, November, 1981

Bandwidth Constrained NP-Complete Problems
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey).
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

Pebbling and Bandwith.
Proceedings of the Fundamentals of Computation Theory, 1981

1980
The Complexity of Path Problems in Graphs and Path Systems of Bounded Bandwidth.
Proceedings of the Graphtheoretic Concepts in Computer Science, 1980

Efficient Algorithms for Path System Problems and Applications to Alternating and Time-Space Complexity Classes
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979
On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space.
Proceedings of the Automata, 1979

1978
On the Tape Complexity of Deterministic Context-Free Languages.
J. ACM, 1978

A Note on Weak Operator Precedence Grammars.
Inf. Process. Lett., 1978

1977
Some Remarks on Multihead Automata.
ITA, 1977

A Note on Weak Operator Precedence Grammars.
Inf. Process. Lett., 1977

Separating Tape Bounded Auxiliary Pushdown Automata Classes
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

Time and Tape Bounded Auxiliary Pushdown Automata.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

The Time and Tape Complexity of Developmental Languages.
Proceedings of the Automata, 1977

1976
One-Way Multihead Writing Finite Automata
Information and Control, January, 1976

On Families of Languages Defined by Time-Bounded Random Access Machines.
SIAM J. Comput., 1976

On Deterministic Context-Free Languages, Multihead Automata, and the Power of an Auxiliary Pushdown Store
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

1975
On Tape-Bounded Complexity Classes and Multihead Finite Automata.
J. Comput. Syst. Sci., 1975

A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages.
J. ACM, 1975

1974
Bounded-Reversal Multihead Finite Automata Languages
Information and Control, August, 1974

1973
On Families of Languages Defined by Time-Bounded Random Access Machines.
Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973

On Tape-Bounded Complexity Classes and Multi-Head Finite Automata
Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973

1971
Computation by Multi-Head Finite Automata
Proceedings of the 12th Annual Symposium on Switching and Automata Theory, 1971


  Loading...