Ralph Gordon Stanton
#59,232
Most Influential Person Now
Mathematician and computer scientist
Ralph Gordon Stanton's AcademicInfluence.com Rankings
Ralph Gordon Stantoncomputer-science Degrees
Computer Science
#4578
World Rank
#4830
Historical Rank
Theoretical Computer Science
#141
World Rank
#141
Historical Rank
Ralph Gordon Stantonmathematics Degrees
Mathematics
#3483
World Rank
#5129
Historical Rank
Group Theory
#146
World Rank
#176
Historical Rank
Algebra
#285
World Rank
#405
Historical Rank
Measure Theory
#3325
World Rank
#3929
Historical Rank
Download Badge
Computer Science Mathematics
Ralph Gordon Stanton's Degrees
- PhD Mathematics Princeton University
Why Is Ralph Gordon Stanton Influential?
(Suggest an Edit or Addition)According to Wikipedia, Ralph Gordon Stanton was a Canadian mathematician, teacher, scholar, and pioneer in mathematics and computing education. As a researcher, he made important contributions in the area of discrete mathematics; and as an educator and administrator, was also instrumental in founding the Faculty of Mathematics at the University of Waterloo, and for establishing its unofficial mascot of the pink tie.
Ralph Gordon Stanton's Published Works
Published Works
- Note on a “Square” Functional Equation (1970) (55)
- On the maximal triangle-free edge-chromatic graphs in three colors (1968) (54)
- Numerical Methods for Science and Engineering. (1961) (53)
- A lower bound on the average shortest path length in regular graphs (1974) (48)
- A Family of Difference Sets (1958) (46)
- Construction of Room Squares (1968) (44)
- The Mathieu Groups (1951) (38)
- Maximal and minimal coverings of (k − 1)-tuples by k-tuples (1968) (37)
- A Combinatorial Problem in Matching (1969) (36)
- Graph factorization, general triple systems, and cyclic triple systems (1981) (36)
- Numerical methods for science and engineering (1962) (35)
- On Covering Sets and Error-Correcting Codes (1971) (31)
- A map-theoretic approach to Davenport-Schinzel sequences. (1972) (30)
- Block Intersections in Balanced Incomplete Block Designs (1964) (24)
- Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components (1969) (22)
- Intersection Inequalities for the Covering Problem (1969) (21)
- Some properties of Davenport-Schinzel sequences (1971) (21)
- Covering Problems for Dichotomized Matching (1968) (18)
- On the Nonexistence of a Class of Circulant Balanced Weighing Matrices (1976) (17)
- An upper bound for the period of the simple continued fraction for $\sqrtD$. (1976) (16)
- A computer search for B-coverings (1980) (16)
- A recursive construction for Room designs (1970) (14)
- Genetic correlations with multiple alíeles. (1960) (14)
- Filial and fraternal correlations in successive generations. (1946) (13)
- Covering problems for dichotomized matchings (1968) (13)
- Inductive Methods for Balanced Incomplete Block Designs (1966) (12)
- TRIPARTITE PATH NUMBERS (1972) (12)
- A Multiplication Theorem for Room Squares (1972) (11)
- A partial census of trivalent generalized Moore networks (1975) (10)
- Uniqueness theorems in balanced incomplete block designs (1969) (9)
- Topological Design Considerations in Computer Communication Networks (1975) (8)
- Quasi-symmetric balanced incomplete block designs (1968) (8)
- Acknowledgment of Priority (1959) (8)
- A census of minimum pair-coverings with restricted largest block length (1999) (7)
- Interconnections of related BIBDs (1969) (7)
- Quasi-residual designs (1968) (7)
- A Packing Problem (1967) (7)
- The Asymptotes of the Root Locus (1963) (7)
- Using affine planes to partition full designs with block size three (2010) (6)
- Bipackings of pairs into triples, and isomorphism classes of small bipackings (1983) (6)
- A Result of Macmahon on Electoral Predictions (1980) (6)
- A Note on BIBDS (1957) (5)
- Old and new results on perfect coverings (1982) (5)
- Some Finite Inversion Formulae (1962) (5)
- Nonexistence of an extremal graph of a certain type (1980) (5)
- COVERINGS OF PAIRS BY k‐SETS (1970) (5)
- Room quasigroups and fermat primes (1972) (4)
- Corrigendum: A Combinatorial Problem in Matching (1969) (4)
- Ryser Designs (1997) (4)
- Minimal perfect bicoverings of Kv with block sizes two, three and four (2004) (4)
- Computation of g(1,3;12) (1976) (3)
- The relationship between epilepsy and maternal age. (1946) (3)
- On $\lambda$-fold coverings with maximum block size four for $\lambda\ge 6$ (2004) (3)
- Some new results on the covering numbers N(t,k,v) (1980) (3)
- A combinatorial property of spanning forests in connected graphs (1967) (3)
- A generalization of the circumcircle theorem (1990) (3)
- The current status of the generalised moore graph problem (1979) (3)
- Excess graphs and bicoverings (1990) (3)
- Computation of some number-theoretic coverings (1981) (3)
- A characterization of Pseudo-Affine Designs and their Relation to a Problem of Cordes (1978) (2)
- The determinant of a class of skew-symmetric toeplitz matrices (1976) (2)
- Selected papers of T.N.E. Greville (1984) (2)
- Selected Papers Of W.T. Tutte (1979) (2)
- Further results on coverin integers of the form 1+k2 N by primes (1981) (2)
- On exact bicoverings of 12 points (2000) (1)
- Triple systems with tripoints (2000) (1)
- Exact coverings of triples with specified longest block length (1987) (1)
- Minimal pairwise balanced designs (1989) (1)
- Integration over spheres (1985) (1)
- Non-isomorphic Minimal Bicovers of K8 (2002) (1)
- Packings in enneads (1992) (1)
- A retrospective look at the Erdős-DeBruijn theorem (1997) (1)
- On a Certain Set of Linear Inequalities (1968) (1)
- The geometric points of coverings (1991) (1)
- Computer assisted generation of difference blocks (1975) (1)
- Introduction to Ramsey theory (1980) (1)
- On the small covering numbers $g^{(5)}_1(v)$ (2007) (1)
- Some properties of H-designs (1981) (1)
- An upper approximation to the BIBD (15, 21, 7, 5, 2) (1990) (0)
- Chapter 5 – Numerical Analysis (1975) (0)
- Bounds on g(1)((5)) (v) for v equivalent to 9, 13, 17 (mod 20) (2009) (0)
- A Representation Problem (1970) (0)
- The doehlert-klee problem: Part I, statistical background (1978) (0)
- A study of hendecads (1995) (0)
- Four Colour Classes in Projective Planes with Non-Fano Quads (2007) (0)
- Fano Quads in Projective Planes (2000) (0)
- From covering designs to graphs (1971) (0)
- Lattice path combinatorics with statistical applications. by T. V. Narayana. Mathematical Expositions No. 23, University of Toronto Press, Toronto, Ontario, 1979. xii + 106 pp. C $15.00. ISBN 0‐8020‐5405‐6 (1980) (0)
- From covering designs to graphs (1972) (0)
- On the covering number $g_1^{(4)}(18)$ (2005) (0)
- Numerical solution of partial differential equations, by G.D. Smith. Oxford, London, 1965. viii + 179 pages. $3.50. (1967) (0)
- The collections & collectors of UBC Library Rare Books and Special Collections (2011) (0)
- Utilitas Mathematica Volume 26 (1984) (0)
- Non-isomorphic solutions for some triple systems with bipoints (2000) (0)
- Algebra and vector geometry (1965) (0)
- Identities from graphs (1969) (0)
- Covering problems for dichotomized matchings (1968) (0)
- Pairwise balanced designs on $4s+1$ points with longest block of cardinality $2s$ (2000) (0)
- A recursive construction for room designs (1970) (0)
- On $\lambda$-fold coverings with maximum block size four for $\lambda = 3, 4$ and 5 (2004) (0)
- Proper edge-colourings of complete graphs (2000) (0)
- The Half-Baked Method for Cooking of Experimental Data (1959) (0)
- More on exact bicoverings of 12 points (2003) (0)
- Quasi-residual designs (1969) (0)
- Isomorphism Classes of Small Covering Designs with Block Size Five (1987) (0)
This paper list is powered by the following services:
Other Resources About Ralph Gordon Stanton
What Schools Are Affiliated With Ralph Gordon Stanton?
Ralph Gordon Stanton is affiliated with the following schools: