default search action
S. Gill Williamson
Person information
- affiliation: University of California, San Diego, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
- [j16]Ö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): 619-648 (2004) - 2002
- [j15]Jeffrey B. Remmel, S. G. Williamson:
Spanning Trees and Function Classes. Electron. J. Comb. 9(1) (2002)
1990 – 1999
- 1999
- [j14]Jeffrey B. Remmel, S. Gill Williamson:
Large-Scale Regularities of Lattice Embeddings of Posets. Order 16(3): 245-260 (1999) - 1998
- [j13]Edward A. Bender, S. Gill Williamson:
Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks. Electron. J. Comb. 5 (1998) - 1995
- [j12]Thomas E. Kammeyer, Richard K. Belew, S. G. Williamson:
Evolving Compare-Exchange Networks Using Grammars. Artif. Life 2(2): 199-237 (1995) - 1991
- [b1]Edward A. Bender, S. G. Williamson:
Foundations of applied combinatorics. Addison-Wesley 1991, ISBN 978-0-201-51039-3, pp. I-V, 1-425
1980 – 1989
- 1984
- [j11]S. G. Williamson:
Depth-First Search and Kuratowski Subgraphs. J. ACM 31(4): 681-693 (1984) - 1983
- [j10]Edward A. Bender, L. Bruce Richmond, S. G. Williamson:
Central and Local Limit Theorems Applied to Asymptotic Enumeration. III. Matrix Recursions. J. Comb. Theory A 35(3): 263-278 (1983) - 1980
- [j9]James T. Joichi, Dennis E. White, S. G. Williamson:
Combinatorial Gray codes. SIAM J. Comput. 9(1): 130-141 (1980) - [c1]S. Gill Williamson:
L'arbre des cycles d'un graphe. CLAAP 1980: 241-261
1970 – 1979
- 1977
- [j8]Dennis E. White, S. G. Williamson:
Recursive Matching Algorithms and Linear Orders on the Subset Lattice. J. Comb. Theory A 23(2): 117-127 (1977) - 1976
- [j7]Jay P. Fillmore, S. G. Williamson:
Ranking Algorithms: The Symmetries and Colorations of the n-Cube. SIAM J. Comput. 5(2): 297-304 (1976) - [j6]S. G. Williamson:
Ranking Algorithms for Lists of Partitions. SIAM J. Comput. 5(4): 602-617 (1976) - 1975
- [j5]Dennis E. White, S. G. Williamson:
Computational Algorithms for the Enumeration of Group Invariant Partitions. SIAM J. Comput. 4(3): 209-213 (1975) - 1974
- [j4]Jay P. Fillmore, S. G. Williamson:
On Backtracking: A Combinatorial Description of the Algorithm. SIAM J. Comput. 3(1): 41-55 (1974) - 1973
- [j3]S. G. Williamson:
Isomorph Rejection and a Theorem of De Bruijn. SIAM J. Comput. 2(1): 44-59 (1973) - 1972
- [j2]S. G. Williamson:
The combinatorial analysis of patterns and the principle of inclusion-exclusion. Discret. Math. 1(4): 357-388 (1972) - 1971
- [j1]S. G. Williamson:
Symmetry Operators of Kranz Products. J. Comb. Theory A 11(2): 122-138 (1971)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: