S. Gill Williamson

According to our database, S. Gill Williamson authored at least 18 papers between 1971 and 2004.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2004

A Class Of Graphs Which Has Efficient Ranking And Unranking Algorithms For Spanning Trees And Forests.

Ömer Egecioglu, Jeffrey B. Remmel, S. G. Williamson

Int. J. Found. Comput. Sci., 2004

2002

Spanning Trees and Function Classes.

Jeffrey B. Remmel, S. G. Williamson

Electron. J. Comb., 2002

1999

Large-Scale Regularities of Lattice Embeddings of Posets.

Jeffrey B. Remmel, S. Gill Williamson

Order, 1999

1998

Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks.

Edward A. Bender, S. Gill Williamson

Electron. J. Comb., 1998

1995

Evolving Compare-Exchange Networks Using Grammars.

Thomas E. Kammeyer, Richard K. Belew, S. G. Williamson

Artif. Life, 1995

1991

Foundations of applied combinatorics.

Edward A. Bender, S. G. Williamson

Addison-Wesley, ISBN: 978-0-201-51039-3, 1991

1984

Depth-First Search and Kuratowski Subgraphs.

S. G. Williamson

J. ACM, 1984

1983

Central and Local Limit Theorems Applied to Asymptotic Enumeration. III. Matrix Recursions.

Edward A. Bender, L. Bruce Richmond, S. G. Williamson

J. Comb. Theory, Ser. A, 1983

1980

Combinatorial Gray codes.

James T. Joichi, Dennis E. White, S. G. Williamson

SIAM J. Comput., 1980

L'arbre des cycles d'un graphe.

S. Gill Williamson

Proceedings of the Proc. 5eme Colleque de Lille sur les Arbres en Algebre et en Programmation, 1980

1977

Recursive Matching Algorithms and Linear Orders on the Subset Lattice.

Dennis E. White, S. G. Williamson

J. Comb. Theory, Ser. A, 1977

1976

Ranking Algorithms for Lists of Partitions.

S. G. Williamson

SIAM J. Comput., 1976

Ranking Algorithms: The Symmetries and Colorations of the n-Cube.

Jay P. Fillmore, S. G. Williamson

SIAM J. Comput., 1976

1975

Computational Algorithms for the Enumeration of Group Invariant Partitions.

Dennis E. White, S. G. Williamson

SIAM J. Comput., 1975

1974

On Backtracking: A Combinatorial Description of the Algorithm.

Jay P. Fillmore, S. G. Williamson

SIAM J. Comput., 1974

1973

Isomorph Rejection and a Theorem of De Bruijn.

S. G. Williamson

SIAM J. Comput., 1973

1972

The combinatorial analysis of patterns and the principle of inclusion-exclusion.

S. G. Williamson

Discret. Math., 1972

1971

Symmetry Operators of Kranz Products.

S. G. Williamson

J. Comb. Theory, Ser. A, 1971