Earl S. Kramer

517 total citations
25 papers, 324 citations indexed

About

Earl S. Kramer is a scholar working on Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics and Artificial Intelligence. According to data from OpenAlex, Earl S. Kramer has authored 25 papers receiving a total of 324 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Electrical and Electronic Engineering, 12 papers in Discrete Mathematics and Combinatorics and 8 papers in Artificial Intelligence. Recurrent topics in Earl S. Kramer's work include graph theory and CDMA systems (22 papers), Finite Group Theory Research (11 papers) and Coding theory and cryptography (8 papers). Earl S. Kramer is often cited by papers focused on graph theory and CDMA systems (22 papers), Finite Group Theory Research (11 papers) and Coding theory and cryptography (8 papers). Earl S. Kramer collaborates with scholars based in United States, Canada and Slovakia. Earl S. Kramer's co-authors include Dale M. Mesner, Spyros S. Magliveras, Rudolf Mathon, William Bridges, Douglas R. Stinson, Donald L. Kreher, E. A. O’Brien, Leo G. Chouinard, Haim Hanani and Alan Hartman and has published in prestigious journals such as Discrete Mathematics, Journal of Combinatorial Theory Series A and Journal of Combinatorial Designs.

In The Last Decade

Earl S. Kramer

24 papers receiving 288 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Earl S. Kramer United States	11	306	244	169	51	28	25	324
D. Jungnickel Germany	3	207 0.7×	193 0.8×	120 0.7×	44 0.9×	19 0.7×	4	259
E. R. Lamken United States	13	382 1.2×	242 1.0×	179 1.1×	63 1.2×	76 2.7×	44	412
Luc Teirlinck United States	13	415 1.4×	317 1.3×	215 1.3×	109 2.1×	28 1.0×	21	462
G. Ge Canada	10	361 1.2×	301 1.2×	113 0.7×	48 0.9×	23 0.8×	19	364
F.E. Bennett Canada	14	519 1.7×	382 1.6×	234 1.4×	138 2.7×	37 1.3×	76	563
Marlene J. Colbourn Canada	9	168 0.5×	117 0.5×	73 0.4×	72 1.4×	14 0.5×	14	216
R. H. F. Denniston United Kingdom	9	271 0.9×	220 0.9×	204 1.2×	36 0.7×	16 0.6×	11	328
P. J. Schellenberg Canada	9	234 0.8×	118 0.5×	159 0.9×	91 1.8×	17 0.6×	14	311
Mario Gionfriddo Italy	11	289 0.9×	153 0.6×	164 1.0×	116 2.3×	16 0.6×	67	334
Peter Danziger Canada	9	185 0.6×	99 0.4×	113 0.7×	35 0.7×	15 0.5×	35	221

Countries citing papers authored by Earl S. Kramer

Since Specialization

Citations

This map shows the geographic impact of Earl S. Kramer's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Earl S. Kramer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Earl S. Kramer more than expected).

Fields of papers citing papers by Earl S. Kramer

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Earl S. Kramer. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Earl S. Kramer. The network helps show where Earl S. Kramer may publish in the future.

Co-authorship network of co-authors of Earl S. Kramer

This figure shows the co-authorship network connecting the top 25 collaborators of Earl S. Kramer. A scholar is included among the top collaborators of Earl S. Kramer based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Earl S. Kramer. Earl S. Kramer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Brualdi, Richard A., et al.. (1995). On a matrix partition conjecture. Journal of Combinatorial Theory Series A. 69(2). 333–346. 1 indexed citations

Kramer, Earl S., et al.. (1995). Construction of new symmetric designs with parameters (66,26,10). Journal of Combinatorial Designs. 3(6). 405–410. 5 indexed citations

Kramer, Earl S. & Rudolf Mathon. (1995). Proper S(t, K,v)'s for t ≥ 3,v ≤ 16, |K| > 1 and Their Extensions. Journal of Combinatorial Designs. 3(6). 411–425. 6 indexed citations

Kramer, Earl S., Spyros S. Magliveras, & E. A. O’Brien. (1993). Some new large sets of t-designs.. Australas. J Comb.. 7. 189–194. 16 indexed citations

Kramer, Earl S., Spyros S. Magliveras, & Douglas R. Stinson. (1991). Some small large sets of t-designs.. Australas. J Comb.. 3. 191–206. 14 indexed citations

Kramer, Earl S., et al.. (1991). Some perpendicular arrays for arbitrarily large t. Discrete Mathematics. 96(2). 101–110. 6 indexed citations

Kramer, Earl S., et al.. (1990). Finite Geometries and Combinatorial Designs. Contemporary mathematics - American Mathematical Society. 18 indexed citations

Kramer, Earl S., Spyros S. Magliveras, & Rudolf Mathon. (1989). The Steiner systems S(2,4,25) with nontrivial automorphism group. Discrete Mathematics. 77(1-3). 137–157. 16 indexed citations

Kramer, Earl S.. (1985). On projective planes of order 20. Matematički Vesnik. 37(92). 385–387. 4 indexed citations

10.

Hanani, Haim, Alan Hartman, & Earl S. Kramer. (1983). On three-designs of small order. Discrete Mathematics. 45(1). 75–97. 11 indexed citations

11.

Chouinard, Leo G., Earl S. Kramer, & Donald L. Kreher. (1983). Graphical t-wise balanced designs. Discrete Mathematics. 46(3). 227–240. 12 indexed citations

12.

Kramer, Earl S., Spyros S. Magliveras, & Dale M. Mesner. (1981). t-Designs from the large Mathieu groups. Discrete Mathematics. 36(2). 171–189. 8 indexed citations

13.

Kramer, Earl S., Spyros S. Magliveras, & Dale M. Mesner. (1980). Some resolutions of S(5, 8, 24). Journal of Combinatorial Theory Series A. 29(2). 166–173. 3 indexed citations

14.

Kramer, Earl S.. (1977). A generalized room square GRS(4, 24) of dimension 9. Discrete Mathematics. 20. 91–92.

15.

Kramer, Earl S. & Dale M. Mesner. (1976). t-designs on hypergraphs. Discrete Mathematics. 15(3). 263–296. 94 indexed citations

16.

Kramer, Earl S. & Dale M. Mesner. (1974). On Steiner tableaus. Discrete Mathematics. 10(1). 123–131. 1 indexed citations

17.

Kramer, Earl S. & Dale M. Mesner. (1974). Intersections among Steiner systems. Journal of Combinatorial Theory Series A. 16(3). 273–285. 47 indexed citations

18.

Kramer, Earl S. & Spyros S. Magliveras. (1974). Some mutually disjoint steiner systems. Journal of Combinatorial Theory Series A. 17(1). 39–43. 16 indexed citations

19.

Kramer, Earl S.. (1974). Indecomposable triple systems. Discrete Mathematics. 8(2). 173–180. 9 indexed citations

20.

Bridges, William & Earl S. Kramer. (1970). The determination of all λ-designs with λ=3. Journal of Combinatorial Theory. 8(4). 343–349. 11 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact