This map shows the geographic impact of Anne Street'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 Anne Street with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Anne Street more than expected).
This network shows the impact of papers produced by Anne Street. 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 Anne Street. The network helps show where Anne Street may publish in the future.
Co-authorship network of co-authors of Anne Street
This figure shows the co-authorship network connecting the top 25 collaborators of Anne Street.
A scholar is included among the top collaborators of Anne Street 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 Anne Street. Anne Street is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Gray, K. E., Anne Street, & R. G. Stanton. (2010). Using affine planes to partition full designs with block size three. Ars Combinatoria. 383–402.2 indexed citations
2.
Gray, K. E. & Anne Street. (2008). Constructing defining sets of full designs. Queensland's institutional digital repository (The University of Queensland). 76. 91–99.4 indexed citations
3.
Havas, George, et al.. (2008). Defining Set Spectra for Designs can have Arbitrarily Large Gaps. Queensland's institutional digital repository (The University of Queensland). 75. 67–81.5 indexed citations
4.
Gray, K. E. & Anne Street. (2007). On defining sets of full designs and of designs related to them. Journal of Combinatorial Mathematics and Combinatorial Computing. 60. 97–104.4 indexed citations
5.
Seberry, Jennifer, et al.. (2004). Further results on strongbox secured secret sharing schemes. Research Online (University of Wollongong). 66. 165–193.5 indexed citations
Seberry, Jennifer & Anne Street. (2000). Strongbox secured secret sharing schemes. Research Online (University of Wollongong). 57(2). 147–163.5 indexed citations
8.
Street, Deborah J. & Anne Street. (1999). But where are designs used. Ars Combinatoria. 53. 3–26.1 indexed citations
9.
Mahmoodian, E. S., et al.. (1999). Defining sets of directed designs. Queensland's institutional digital repository (The University of Queensland). 19. 179–190.3 indexed citations
Street, Anne, et al.. (1993). In search of 4- (12,6,4) designs. Part III. University of Canterbury Research Repository (University of Canterbury). 7. 237–246.2 indexed citations
13.
Praeger, Cheryl E., et al.. (1993). Half-regular symmetric designs. UWA Profiles and Research Repository (University of Western Australia). 8. 1–26.
14.
Street, Anne, et al.. (1991). Partitioning sets of blocks into designs.. Australas. J Comb.. 3. 111–140.4 indexed citations
15.
Iyer, Hari, Anne Street, & Deborah J. Street. (1989). Combinatorics of Experimental Design.. Journal of the American Statistical Association. 84(405). 333–333.148 indexed citations
Street, Anne, et al.. (1974). Group ramsey theory. Journal of Combinatorial Theory Series A. 17(2). 219–226.10 indexed citations
20.
Cossey, John, et al.. (1970). On the laws of certain finite groups. Journal of the Australian Mathematical Society. 11(4). 441–489.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.