Bibliography. S. Gill Williamson

Transcription

1 Bibliography S. Gill Williamson 1. S. G. Williamson, A Combinatorial Property of Finite Sequences with Applications to Tensor Algebra, J. Combinatorial Theory, 1 (1966), pp S. G. Williamson, Some Remarks on a Class of Matrix Inequalities, Proc. Amer. Math. Soc., 19 (1968), S. G. Williamson, On a Class of Combinatorial Inequalities, J. Combinatorial Theory, 6 (1969), pp S. G. Williamson, Tensor Contraction and Hermitian Forms, Linear Algebra and Applications, 2 (1969), pp P. Botta and S. G. Williamson, Unitary Similarity of Symmetry Operators, Linear Algebra and Applications, 3(1970), pp S. G. Williamson, Operator Theoretic Invariants and the Enumeration Theory of Polya and DeBruijn, J. Combinatorial Theory, 8 (1970), pp S. G. Williamson, Symmetry Operators of Kranz Products, J. Combinatorial Theory, 11 (1971), pp S. G. Williamson, Polya s Counting Theorem and a Class of Tensor Identities from the Theory of Inequalities, J. London Math. Soc., 2 (1971), pp S. G. Williamson, The Combinatorial Analysis of Patterns and the Principle of Inclusion-Exclusion, J. Discrete Math., 1 (1972), pp J.P. Fillmore and S. G. Williamson, A Linear Algebra Setting for the Rota-Mullin Theory of Polynomials of Binomial Type, Linear and Multilinear Algebra, 1(1973), pp

2 11. S. G. Williamson, Tensor Compositions and Lists of Combinatorial Structures, Linear and Multilinear Algebra, 1 (1973), pp S. G. Williamson, Isomorph Rejection and a Theorem of DeBruijn, Siam J. on Computing, 2 (1973), pp J. P. Fillmore and S. G. Williamson, On Backtracking a Combinatorial Description of the Algorithm, Siam J. on Computing, 3(1974), pp D. E. White and S. G. Williamson, Computational Algorithms for the Enumeration of Group Invariant Partitions, Siam J. on Computing, 4 (1975), pp D. E. White and S. G. Williamson, Combinatorial Structures and Group Invariant Partitions, Proc. Amer. Math. Soc., 55 (1976), pp J. P. Fillmore and S. G. Williamson, On Ranking Functions: the Symmetries and Colorations of the NCube, Siam J. on Computing, 5(1976), pp D. E. White and S. G. Williamson, Probabilistic Analogs of Polya s Enumeration Theory, Linear and Multilinear Algebra, 4 (1976), pp S. G. Williamson, Ranking Algorithms for Lists of Partitions, Siam J. on Computing, 5 (1976), pp S. G. Williamson, On the Ordering, Ranking, and Random Generation of Basic Combinatorial Sets, Combinatoire et Representation du Groupe Symmetrique, Springer Verlag Lecture Notes in Mathematics, 579(1977), pp D. E. White and S. G. Williamson, Recursive Matching Algorithms and Linear Orders on the Subset Lattice, J. Combinatorial Theory (A), 22 (1977), pp

3 21. J. Joichi, D. E. White and S. G. Williamson, Combinatorial Gray Codes, Siam J. on Computing, 9 (1980), pp S. G. Williamson, On Embedding Graphs in the Plane Algorithmic Aspects, Annals of Discrete Math., 6 (1980), pp D. E. White and S. G. Williamson, Construction of Minimal Representative Systems, Linear and Multilinear Algebra, 9 (1980), pp S. G. Williamson, Finding a Kuratowski Subgraph in Linear Time, IRMA Strasbourg, Universite de Strasbourg (1980), 89/P S. G. Williamson, The Tree of Paths of a Graph, Proc. 5eme Colleque de Lille sur les Arbres en Algebre et en Programmation, Lille, France, 21, 22 et 23 févier (1980), pp S. G. Williamson, Symmetry Operators, Polarizations, and a Generalized Capelli Identity, Linear and Multilinear Algebra, 9 (1981), pp E. R. Canfield and S. G. Williamson, Hook Length Products and Cayley Operators of Classical Invariant Theory, Linear and Multilinear Algebra, 9 (1981), pp E. Bender, B. Richmond and S. G. Williamson, Central and Local Limit Theorems Applied to Asymptotic Enumeration, III., Matrix Recursions, J. Comb. Theory (A), 35 (1983), pp E. Bender, G. Viennot and S. G. Williamson, Global Analysis of the Delete Contract Recursion for Graphs and Matroids, J. Linear and Multilinear Algebra, 15 (1984), pp S. G. Williamson, Depth First Search and Kuratowski Subgraphs, JACM, 31(1984), pp K. P. Vo, W. Dick and S. G. Williamson, Ranking and Unranking Planar Embeddings, J. Linear and Multilinear Algebra, 19 (1985), pp S. G. Williamson, Combinatorics for Computer Science, Computer Science Press, Rockville, Maryland, 1985, 479 pp. 3

4 33. J. P. Fillmore and S. G. Williamson, Permanents and Determinants with Non-Commuting Entries, Linear and Multilinear Algebra, 19 (1986), pp S. G. Williamson, Generic Common Minor Expansions, Linear and Multilinear Algebra, 20 (1987), pp S. G. Williamson, Top-Down Calculus, Computer Science Press, Rockville, Maryland, 1987, 429 pp. 36. S. Hart and S. G. Williamson, Menus of Kuratowski Subgraphs, Linear and Multilinear Algebra, 23 (1988), pp E. R. Canfield and S. G. Williamson, A Combinatorial Study of Straightening Bases, Linear and Multilinear Algebra, 24 (1989), pp J. G. Broida and S. G. Willilamson, A Comprehensive Introduction to Linear Algebra, Addison-Wesley, Redwood City, California (1989), 734 pp. 39. E. R. Canfield and S. G. Williamson, The Two Basic Linear Time Planarity Algorithms: Are They the Same?, Linear and Multilinear Algebra, 26 (1990), pp E. R. Canfield and S. G. Williamson, A Sequential Sorting Network Analogous to the Batcher Merge, Linear and Multilinear Algebra, 29 (1991), pp E. A. Bender and S. G. Williamson, Foundations of Applied Combinatorics, Addison - Wesley, Redwood City, California (1991), 425 pp. 42. S. G. Williamson, Canonical Forms for Cycles in Bridge Graphs, Linear and Multilinear Algebra, 34 (1993), pp R. C. Compton and S. G. Williamson, Doubly Adjacent Gray Codes for the Symmetric Group, Linear and Multilinear Algebra, 35 (1993), pp E. R. Canfield and S. G. Williamson, A Loop-free Algorithm for Generating the Linear Extensions of a Poset, Order, 12 (1995), pp

5 45. T. Kammeyer, R. K. Belew and S. G. Williamson, Evolving Compare- Exchange Networks Using Grammers, Artificial Life 2(2)(1995), pp E. A. Bender and S. G. Williamson, Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks Electronic J. of Comb., 5 (1) (1998), 21 pp. 47. S. G. Williamson, Straightening Bases for Tensor Products, Linear and Multilinear Algebra, 4 (1999), pp J. B. Remmel and S. G. Williamson, Large-Scale Regularities of Lattice Embeddings of Posets, Order, 16 (1999), pp D. E. White and S. G. Williamson, Combinatorial and Multilinear Aspects of Sign-Balanced Posets, Linear and Multilinear Algebra, 2 (2001), pp S. G. Williamson, Combinatorics for Computer Science, Dover, N.Y.,2002, 479 pp. (republication of Compute Science Press title) 51. J. B. Remmel and S. G. Williamson, Spanning Trees and Function Classes, Electronic J. of Comb., 9 (2002), R34, 24 pp. 52. Ömer Eğecioğlu, J. B. Remmel, and S. G. Williamson, A Class of Graphs with Efficient Ranking and Unranking Algorithms for Spanning Trees and Forests, Int. J. Found. Comp. Science 15 (2004), E. A. Bender and S. G. Williamson, A Short Course in Discrete Mathematics, Dover, N.Y., 2005, 240 pp. 54. E. A. Bender and S. G. Williamson, Mathematics for Algorithm and System Analysis, Dover, N.Y., 2005, 248 pp. 55. E. A. Bender and S. G. Williamson, Foundations of Combinatorics with Applications, Dover, N.Y., 2006, 468 pp. 5