Combinatorics and Theoretical Computer Science

Constructive Complexity (K. Abrahamson et al.). q-Functional Equations and Some Partition Identities (A.K. Agarwal). On doing Todd-Coxeter Coset Enumeration in Parallel (S. Akl et al.). The Mapmaker's Dilemma (R. Beigel, W.I. Gasarch). Computation of the Expected Number of Leaves in a Tree having a Given Automorphism, and related topics (F. Bergeron, G. Labelle, P. Leroux). Generalized Flags in Finite Abelian p -Groups (L.M. Butler). Threshold Functions for Local Properties of Graphs: Triangles (L.H. Clark, R.C. Entringer, L.A. Szekely). Brick Tabloids and the Connection Matrices between Bases of Symmetric Functions (O. Egecioglu, J.B. Remmel). Matchings and Cycle Covers in Random Digraphs (J. Gimbel, E.M. Palmer). Semigroup Automaton Structure by Homomorphism and Domain Partition (B. Greenblatt, W.R. Edwards Jr.). Linear and Nonlinear Inequalities concerning a certain Combinatorial Sequence which arises from Counting the Number of Chains of a Finite Distributive Lattice (T. Hibi). On a Unique Tree Representation for P 4 -Extendible Graphs (B. Jamison, S. Olariu). An Introduction to Randomized Algorithms (R.M. Karp). Improved Bounds for Harmonic-Based Bin Packing Algorithms (M.B. Richey). The Riordan Group (L.W. Shapiro et al.). Some Applications of Algebra to Combinatorics (R.P. Stanley). The Maximum Number of Winning 2-Sets (D.B. West). Reading List.