Search the dblp DataBase

Publications of Author

1. Thomas E. Kammeyer, Richard K. Belew, S. G. Williamson
   Evolving Compare-Exchange Networks Using Grammars. [Citation Graph (0, 0)][DBLP]
   Artificial Life, 1995, v:2, n:2, pp:199-237 [Journal]
   
2. Jeffrey B. Remmel, S. G. Williamson
   Spanning Trees and Function Classes. [Citation Graph (0, 0)][DBLP]
   Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal]
   
3. Ömer Egecioglu, Jeffrey B. Remmel, S. G. Williamson
   A Class Of Graphs Which Has Efficient Ranking And Unranking Algorithms For Spanning Trees And Forests. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2004, v:15, n:4, pp:619-648 [Journal]
   
4. S. G. Williamson
   Depth-First Search and Kuratowski Subgraphs. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1984, v:31, n:4, pp:681-693 [Journal]
   
5. Edward A. Bender, L. Bruce Richmond, S. G. Williamson
   Central and Local Limit Theorems Applied to Asymptotic Enumeration. III. Matrix Recursions. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. A, 1983, v:35, n:3, pp:263-278 [Journal]
   
6. Dennis E. White, S. G. Williamson
   Recursive Matching Algorithms and Linear Orders on the Subset Lattice. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. A, 1977, v:23, n:2, pp:117-127 [Journal]
   
7. S. G. Williamson
   Symmetry Operators of Kranz Products. [Citation Graph (0, 0)][DBLP]
   J. Comb. Theory, Ser. A, 1971, v:11, n:2, pp:122-138 [Journal]
   
8. Jay P. Fillmore, S. G. Williamson
   On Backtracking: A Combinatorial Description of the Algorithm. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1974, v:3, n:1, pp:42-55 [Journal]
   
9. Jay P. Fillmore, S. G. Williamson
   Ranking Algorithms: The Symmetries and Colorations of the n-Cube. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1976, v:5, n:2, pp:297-304 [Journal]
   
10. J. T. Joichi, Dennis E. White, S. G. Williamson
    Combinatorial Gray codes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:1, pp:130-141 [Journal]
    
11. Dennis E. White, S. G. Williamson
    Computational Algorithms for the Enumeration of Group Invariant Partitions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1975, v:4, n:3, pp:209-213 [Journal]
    
12. S. G. Williamson
    Isomorph Rejection and a Theorem of De Bruijn. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1973, v:2, n:1, pp:44-59 [Journal]
    
13. S. G. Williamson
    Ranking Algorithms for Lists of Partitions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1976, v:5, n:4, pp:602-617 [Journal]