default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnne Penfold Street
Person information
- affiliation: University of Queensland, Department of Mathematics, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j23]Anne Penfold Street:
Ralph Gordon Stanton. Australas. J Comb. 48: 3-4 (2010)
2000 – 2009
- 2008
- [j22]Rudolf Mathon, Anne Penfold Street, Greg Gamble:
Classification of partitions of all triples on ten points into copies of Fano and affine planes. Discret. Math. 308(13): 2789-2795 (2008) - 2006
- [j21]Mike J. Grannell, Terry S. Griggs, Anne Penfold Street:
A Flaw in the Use of Minimal Defining Sets for Secret Sharing Schemes. Des. Codes Cryptogr. 40(2): 225-236 (2006) - 2004
- [j20]Rudolf Mathon, Anne Penfold Street:
Mixed partitions of sets of triples into small planes. Discret. Math. 284(1-3): 209-215 (2004) - 2003
- [j19]Brenton D. Gray, Rudolf Mathon, Tony Moran, Anne Penfold Street:
The spectrum of minimal defining sets of some Steiner systems. Discret. Math. 261(1-3): 277-284 (2003) - [j18]Diane M. Donovan
, Abdollah Khodkar, Anne Penfold Street:
Doubling and Tripling Constructions for Defining Sets in Steiner Triple Systems. Graphs Comb. 19(1): 65-89 (2003) - 2002
- [j17]Rudolf Mathon, Anne Penfold Street:
Partitioning Sets of Triples into Small Planes. Des. Codes Cryptogr. 27(1-2): 119-130 (2002) - [j16]Rudolf Mathon, Anne Penfold Street:
Overlarge sets of 2-(11, 5, 2) designs and related configurations. Discret. Math. 255(1-3): 275-286 (2002) - [j15]Richard Bean, Diane M. Donovan, Abdollah Khodkar, Anne Penfold Street:
Steiner Trades That Give Rise to Completely Decomposable Latin Interchanges. Int. J. Comput. Math. 79(12): 1273-1284 (2002)
1990 – 1999
- 1999
- [j14]Ebadollah S. Mahmoodian, Nasrin Soltankhah, Anne Penfold Street:
On defining sets of directed designs. Australas. J Comb. 19: 179-190 (1999) - [j13]Deborah J. Street, Anne Penfold Street:
But where are designs used? Ars Comb. 53 (1999) - 1997
- [j12]Cathy Delaney, Brenton D. Gray, Ken Gray, Barbara M. Maenhaut, Martin J. Sharry, Anne Penfold Street:
Pointwise defining sets and trade cores. Australas. J Comb. 16: 51-76 (1997) - [j11]Lynn Margaret Batten, Kris Coolsaet, Anne Penfold Street:
Blocking Sets in (v, {2, 4}, 1)-Designs. Des. Codes Cryptogr. 10(3): 309-314 (1997) - 1995
- [j10]Rudolf Mathon, Anne Penfold Street:
Partitions of sets of two-fold triple systems, and their relation to some strongly regular graphs. Graphs Comb. 11(4): 347-366 (1995) - 1993
- [j9]D. R. Breach, Martin J. Sharry, Anne Penfold Street:
In search of 4-(12, 6, 4) designs: Part I. Australas. J Comb. 7: 237-246 (1993) - [j8]D. R. Breach, Anne Penfold Street:
In search of 4-(12, 6, 4) designs: Part III. Australas. J Comb. 7: 259- (1993) - [j7]Alan Rahilly, Cheryl E. Praeger, Anne Penfold Street, Darryn E. Bryant:
Half-regular symmetric designs. Australas. J Comb. 8: 1-26 (1993) - 1991
- [j6]Martin J. Sharry, Anne Penfold Street:
Partitioning sets of blocks into designs. Australas. J Comb. 3: 111-140 (1991) - [j5]Martin J. Sharry, Anne Penfold Street:
Partitioning sets of quadruples into designs III. Discret. Math. 92(1-3): 341-359 (1991)
1980 – 1989
- 1989
- [j4]Martin J. Sharry, Anne Penfold Street:
Partitioning sets of quadruples into designs I. Discret. Math. 77(1-3): 299-305 (1989) - 1983
- [j3]Charles C. Lindner, Anne Penfold Street:
Construction of Large Sets of Pairwise Disjoint Transitive Triple Systems. Eur. J. Comb. 4(4): 335-346 (1983) - 1982
- [j2]Robert Day, Anne Penfold Street:
Sequential Binary Arrays. I. The Square Grid. J. Comb. Theory A 32(1): 35-52 (1982)
1970 – 1979
- 1974
- [j1]Anne Penfold Street, Earl Glen Whitehead Jr.:
Group Ramsey Theory. J. Comb. Theory A 17(2): 219-226 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
