S. G. Williamson

Publication Activity (10 Years)

Years Active: 1971-2004
Publications (10 Years): 0

Publications

Ömer Egecioglu, Jeffrey B. Remmel, S. G. Williamson
A Class Of Graphs Which Has Efficient Ranking And Unranking Algorithms For Spanning Trees And Forests. Int. J. Found. Comput. Sci. 15 (4) (2004)
Jeffrey B. Remmel, S. G. Williamson
Spanning Trees and Function Classes. Electron. J. Comb. 9 (1) (2002)
Thomas E. Kammeyer, Richard K. Belew, S. G. Williamson
Evolving Compare-Exchange Networks Using Grammars. Artif. Life 2 (2) (1995)
S. G. Williamson
Depth-First Search and Kuratowski Subgraphs. J. ACM 31 (4) (1984)
Edward A. Bender, L. Bruce Richmond, S. G. Williamson
Central and Local Limit Theorems Applied to Asymptotic Enumeration. III. Matrix Recursions. J. Comb. Theory, Ser. A 35 (3) (1983)
James T. Joichi, Dennis E. White, S. G. Williamson
Combinatorial Gray codes. SIAM J. Comput. 9 (1) (1980)
Dennis E. White, S. G. Williamson
Recursive Matching Algorithms and Linear Orders on the Subset Lattice. J. Comb. Theory, Ser. A 23 (2) (1977)
Jay P. Fillmore, S. G. Williamson
Ranking Algorithms: The Symmetries and Colorations of the n-Cube. SIAM J. Comput. 5 (2) (1976)
S. G. Williamson
Ranking Algorithms for Lists of Partitions. SIAM J. Comput. 5 (4) (1976)
Dennis E. White, S. G. Williamson
Computational Algorithms for the Enumeration of Group Invariant Partitions. SIAM J. Comput. 4 (3) (1975)
Jay P. Fillmore, S. G. Williamson
On Backtracking: A Combinatorial Description of the Algorithm. SIAM J. Comput. 3 (1) (1974)
S. G. Williamson
Isomorph Rejection and a Theorem of De Bruijn. SIAM J. Comput. 2 (1) (1973)
S. G. Williamson
The combinatorial analysis of patterns and the principle of inclusion-exclusion. Discret. Math. 1 (4) (1972)
S. G. Williamson
Symmetry Operators of Kranz Products. J. Comb. Theory, Ser. A 11 (2) (1971)