Ivan Hal Sudborough

Z. Meng

Proceedings of the 41st Hawaii International International Conference on Systems Science (HICSS-41 2008), 2008

Adjacent Swaps on Strings.

[BibT_eX]

[DOI]

Bhadrachalam Chitturi

Walter Voit

Xuerong Feng

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007

Short proofs for cut-and-paste sorting of permutations.

[BibT_eX]

[DOI]

Daniel W. Cranston

Douglas B. West

Discret. Math., 2007

Computing Cross Associations for Attack Graphs and Other Applications.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Networks, 2005

A Faster and Simpler 2-Approximation Algorithm for Block Sorting.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004

Embedding A Complete Binary Tree Into A Three-Dimensional Grid.

[BibT_eX]

[DOI]

Lawrence L. Larmore

J. Interconnect. Networks, 2004

Combinatorial Optimization of Group Key Management.

[BibT_eX]

[DOI]

Mohamed Eltoweissy

J. Netw. Syst. Manag., 2004

Improved Upper Bound for Sorting by Short Swaps.

[BibT_eX]

[DOI]

Xuerong Feng

Z. Meng

Proceedings of the 7th International Symposium on Parallel Architectures, 2004

Towards Trusted Online Dissemination of Consumer Information.

[BibT_eX]

[DOI]

Mohamed Eltoweissy

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.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2003

Hamilton Decompositions and (n/2)-Factorizations of Hypercubes.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2003

Block Sorting is Hard.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2003

Expansion of layouts of complete binary trees into grids.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Combinatorial Optimization of Multicast Key Management.

[BibT_eX]

[DOI]

Mohamed Eltoweissy

Proceedings of the 36th Hawaii International Conference on System Sciences (HICSS-36 2003), 2003

2002

On the Generalization of the Pancake Network.

[BibT_eX]

[DOI]

Marissa P. Justan

Felix P. Muga II

Proceedings of the International Symposium on Parallel Architectures, 2002

Fixed Layer Embeddings of Binary Trees.

[BibT_eX]

[DOI]

Lawrence L. Larmore

Proceedings of the International Symposium on Parallel Architectures, 2002

Symmetric k-Factorizations of Hypercubes with Factors of Small Diameter.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Parallel Architectures, 2002

Comparing Star and Pancake Networks.

[BibT_eX]

[DOI]

Proceedings of the Essence of Computation, Complexity, Analysis, 2002

2000

Removing edges from hypercubes to obtain vertex-symmetric networks with small diameter.

[BibT_eX]

[DOI]

Telecommun. Syst., 2000

Leftmove-bounded picture languages.

[BibT_eX]

[DOI]

Changwook Kim

Theor. Comput. Sci., 2000

Three-Dimensional Embedding of Binary Trees.

[BibT_eX]

[DOI]

Lawrence L. Larmore

Proceedings of the 5th International Symposium on Parallel Architectures, 2000

1999

A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions.

[BibT_eX]

[DOI]

Qian-Ping Gu

Shietung Peng

Theor. Comput. Sci., 1999

Circuit-Switched Routings for Automorphisms of a Hypercube.

[BibT_eX]

[DOI]

Taoyu Zhang

Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

On Mapping Complete Binary Trees into Grids and Extended Grids.

[BibT_eX]

[DOI]

Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

1997

On the Diameter of the Pancake Network.

[BibT_eX]

[DOI]

J. Algorithms, 1997

On The Shuffle-Exchange Permutation Network.

[BibT_eX]

[DOI]

Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

1996

Embedding Star Networks into Hypercubes.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1996

Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group.

[BibT_eX]

[DOI]

Dan Pritikin

Math. Syst. Theory, 1996

1995

Single Row Routing on Multilayers.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

Embedding hypercubes into pancake, cycle prefix and substring reversal networks.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

1994

The Vertex Separation and Search Number of a Graph

[BibT_eX]

[DOI]

John A. Ellis

Jonathan S. Turner

Inf. Comput., August, 1994

Efficient Mappings of Pyramid Networks.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1994

Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group.

[BibT_eX]

[DOI]

Dan Pritikin

IEEE Trans. Computers, 1994

Compressing grids into small hypercubes.

[BibT_eX]

[DOI]

Networks, 1994

Embedding k-D Meshes into Optimum Hypercubes with Dilation 2k-1 (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Parallel and Distributed Computing, 1994

1993

Difference bases and sparse sensor arrays.

[BibT_eX]

[DOI]

Darel A. Linebarger

Ioannis G. Tollis

IEEE Trans. Inf. Theory, 1993

Simulation of Binary Trees and X-Trees on Pyramid Networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1993

The 4-Star Graph is not a Subgraph of Any Hypercube.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1993

Efficient Parallel Sibling Finding for Quadtree Data Structure.

[BibT_eX]

[DOI]

Dipak Pravin Doctor

Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993

Parallel Algorithm for Quadtree Medial Axis Transform.

[BibT_eX]

Dipak Pravin Doctor

Proceedings of the Computing and Information, 1993

1992

On Reversal-Bounded Picture Languages.

[BibT_eX]

[DOI]

Changwook Kim

Theor. Comput. Sci., 1992

Embedding Grids into Hypercubes.

[BibT_eX]

[DOI]

Saïd Bettayeb

J. Comput. Syst. Sci., 1992

On the Complexity of Tree Embedding Problems.

[BibT_eX]

[DOI]

Shai Simonson

Inf. Process. Lett., 1992

On Sorting by Prefix Reversals and the Diameter of Pancake Networks.

[BibT_eX]

[DOI]

Proceedings of the Parallel Architectures and Their Efficient Use, 1992

Simulation Permutation Networks on Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the LATIN '92, 1992

1991

A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1991

Three disjoint path paradigms in star networks.

[BibT_eX]

[DOI]

Martin Dietzfelbinger

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

1990

Deterministic Message Routing in Faulty Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990

A topological property of hypercubes: node disjoint paths.

[BibT_eX]

[DOI]

Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 1990

Optimum Simulation of Meshes by Small Hypercubes.

[BibT_eX]

[DOI]

Bin Cong

Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990

1989

On minimizing width in linear layouts.

[BibT_eX]

[DOI]

Fillia Makedon

Discret. Appl. Math., 1989

Disjoint Paths in the Hypercube.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

On the Complexity of Single Row Routing Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 1989

1988

Min Cut is NP-Complete for Edge Weighted Treees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

Comparing Interconnection Networks.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

Simulating Binary Trees on Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

The Membership and Equivalence Problems for Picture Languages.

[BibT_eX]

[DOI]

Changwook Kim

Theor. Comput. Sci., 1987

1986

Min Cut is NP-Complete for Edge Weigthed Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the VLSI Algorithms and Architectures, 1986

1985

Complexity and Decidability for Chain Code Picture Languages.

[BibT_eX]

[DOI]

Emo Welzl

Theor. Comput. Sci., 1985

Bandwidth Constrained NP-Complete Problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 1985

Complete Problems for Space Bounded Subclasses of NP.

[BibT_eX]

[DOI]

Moon-Jung Chung

Michael Evangelist

Acta Informatica, 1985

1984

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

[BibT_eX]

[DOI]

Eitan M. Gurari

J. Algorithms, 1984

1983

Bandwidth Constraints on Problems Complete for Polynomial Time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1983

Bandwidth and pebbling.

[BibT_eX]

[DOI]

Arnold L. Rosenberg

Christos H. Papadimitriou

Computing, 1983

Topological Bandwidth.

[BibT_eX]

[DOI]

Fillia Makedon

Proceedings of the CAAP'83, 1983

1982

On Eliminating Nondeterminism from Turing Machines which Use less than Logarithm Worktape Space.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

1981

On the Complexity of the General Coloring Problem

[BibT_eX]

[DOI]

Hermann A. Maurer

Emo Welzl

Inf. Control., November, 1981

Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

Pebbling and Bandwith.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1981

1980

The Complexity of Path Problems in Graphs and Path Systems of Bounded Bandwidth.

[BibT_eX]

[DOI]

Proceedings of the Graphtheoretic Concepts in Computer Science, 1980

Efficient Algorithms for Path System Problems and Applications to Alternating and Time-Space Complexity Classes

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1979

1978

On non-erasing oracle tapes in space bounded reducibility.

[BibT_eX]

[DOI]

Bruce E. Litow

SIGACT News, 1978

On the Tape Complexity of Deterministic Context-Free Languages.

[BibT_eX]

[DOI]

J. ACM, 1978

1977

Some Remarks on Multihead Automata.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1977

A Note on Weak Operator Precedence Grammars.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1977

Separating Tape Bounded Auxiliary Pushdown Automata Classes

[BibT_eX]

[DOI]

Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

Time and Tape Bounded Auxiliary Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1977, 1977

The Time and Tape Complexity of Developmental Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1977

1976

One-Way Multihead Writing Finite Automata

[BibT_eX]

[DOI]

Inf. Control., January, 1976

On Families of Languages Defined by Time-Bounded Random Access Machines.

[BibT_eX]

[DOI]

A. Zalcberg

SIAM J. Comput., 1976

On Deterministic Context-Free Languages, Multihead Automata, and the Power of an Auxiliary Pushdown Store

[BibT_eX]

[DOI]

Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

1975

On Tape-Bounded Complexity Classes and Multihead Finite Automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1975

A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages.

[BibT_eX]

[DOI]

J. ACM, 1975

1974

Bounded-Reversal Multihead Finite Automata Languages

[BibT_eX]

[DOI]

Inf. Control., August, 1974

1973

On Tape-Bounded Complexity Classes and Multi-Head Finite Automata

[BibT_eX]

[DOI]

Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973

1971

Computation by Multi-Head Finite Automata

[BibT_eX]

[DOI]