default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDonald A. Preece
Person information
- affiliation: Queen Mary University of London, School of Mathematical Sciences, UK
- affiliation: University of Kent, Institute of Mathematics, Statistics and Actuarial Science, Canterbury, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j35]Ian Anderson, Matthew A. Ollis, Donald A. Preece:
On Power-Sequence and Matryoshka Terraces for ℤn. Bull. ICA 81: 98-117 (2017)- 2012
- [j34]Donald A. Preece, Ian Anderson:
Obtaining All or Half of Un as 〈 x 〉 x 〈 x+1 〉. Integers 12: A52 (2012) - 2011
- [j33]Donald A. Preece, Emil R. Vaughan:
Daisy chains with four generators. Australas. J Comb. 49: 77-94 (2011) - 2010
- [j32]Ian Anderson, Donald A. Preece:
Combinatorially fruitful properties of 3.2-1 and 3.2-2 modulo p. Discret. Math. 310(2): 312-324 (2010)
2000 – 2009
- 2009
- [j31]Donald A. Preece:
Half-cycles and chaplets. Australas. J Comb. 43: 253-280 (2009) - [j30]Donald A. Preece:
Daisy chains with three generators. Australas. J Comb. 45: 157-174 (2009) - 2008
- [j29]Donald A. Preece:
Daisy chains - a fruitful combinatorial concept. Australas. J Comb. 41: 297- (2008) - [j28]Donald A. Preece:
Zigzag and foxtrot terraces for Zn. Australas. J Comb. 42: 261-278 (2008) - [j27]Ian Anderson, Donald A. Preece:
Some da capo directed power-sequence Zn+1 terraces with n an odd prime power. Discret. Math. 308(2-3): 192-206 (2008) - [j26]Ian Anderson, Donald A. Preece:
A general approach to constructing power-sequence terraces for Zn. Discret. Math. 308(5-6): 631-644 (2008) - [j25]Ian Anderson, Donald A. Preece:
Some I terraces from I power-sequences, n being an odd prime. Discret. Math. 308(18): 4086-4107 (2008) - 2007
- [j24]Peter Dobcsányi, Donald A. Preece, Leonard H. Soicher:
On balanced incomplete-block designs with repeated blocks. Eur. J. Comb. 28(7): 1955-1970 (2007) - 2006
- [j23]Andries E. Brouwer, Peter J. Cameron
, Willem H. Haemers, Donald A. Preece:
Self-dual, not self-polar. Discret. Math. 306(23): 3051-3053 (2006) - 2005
- [j22]Donald A. Preece, Walter D. Wallis, Joseph L. Yucas:
Paley triple arrays. Australas. J Comb. 33: 237-246 (2005) - [j21]Ian Anderson, Donald A. Preece:
Some power-sequence terraces for Zpq with as few segments as possible. Discret. Math. 293(1-3): 29-59 (2005) - [j20]Nicholas C. K. Phillips, Donald A. Preece, Walter D. Wallis:
The seven classes of 5×6 triple arrays. Discret. Math. 293(1-3): 213-218 (2005) - 2004
- [j19]Ian Anderson, Donald A. Preece:
Narcissistic half-and-half power-sequence terraces for Zn with n=pqt. Discret. Math. 279(1-3): 33-60 (2004) - 2003
- [j18]Ian Anderson, Donald A. Preece:
Power-sequence terraces for where n is an odd prime power. Discret. Math. 261(1-3): 31-58 (2003) - [j17]Rosemary A. Bailey, Matthew A. Ollis, Donald A. Preece:
Round-dance neighbour designs from terraces. Discret. Math. 266(1-3): 69-86 (2003) - [j16]Matthew A. Ollis, Donald A. Preece:
Sectionable terraces and the (generalised) Oberwolfach problem. Discret. Math. 266(1-3): 399-416 (2003) - 2001
- [j15]John P. Morgan, Donald A. Preece, David H. Rees:
Nested balanced incomplete block designs. Discret. Math. 231(1-3): 351-389 (2001)
1990 – 1999
- 1999
- [j14]Donald A. Preece, B. J. Vowden, Nicholas C. K. Phillips:
Double Youden rectangles of sizes p(2p+1) and (p+1)(2p+1). Ars Comb. 51 (1999) - [j13]B. J. Vowden, Donald A. Preece:
Some New Infinite Series of Freeman-Youden Rectangles. Ars Comb. 51 (1999) - [j12]Nicholas C. K. Phillips, Donald A. Preece:
Tight single-change covering designs with v = 12, K = 4. Discret. Math. 197-198: 657-670 (1999) - [j11]Donald A. Preece, B. J. Vowden:
Some series of cyclic balanced hyper-graeco-Latin superimpositions of three Youden squares. Discret. Math. 197-198: 671-682 (1999) - [j10]David H. Rees, Donald A. Preece:
Perfect Graeco-Latin balanced incomplete block designs (pergolas). Discret. Math. 197-198: 691-712 (1999) - 1997
- [j9]P. J. Owens, Donald A. Preece:
Aspects of complete sets of 9 × 9 pairwise orthogonal latin squares. Discret. Math. 167-168: 519-525 (1997) - [j8]Donald A. Preece:
Some 6 × 11 Youden squares and double Youden rectangles. Discret. Math. 167-168: 527-541 (1997) - 1996
- [j7]P. J. Owens, Donald A. Preece:
Some new non-cyclic latin squares that have cyclic and Youden properties. Ars Comb. 44 (1996) - 1995
- [j6]Robert L. Constable, Donald A. Preece, Nicholas C. K. Phillips, Thomas Dale Porter, Walter D. Wallis:
Single change neighbor designs. Australas. J Comb. 11: 247-256 (1995) - [j5]Donald A. Preece:
How many 7 × 7 latin squares can be partitioned into Youden squares? Discret. Math. 138(1-3): 343-352 (1995) - [j4]Donald A. Preece, B. J. Vowden:
Graeco-Latin squares with embedded balanced superimpositions of Youden squares. Discret. Math. 138(1-3): 353-363 (1995) - 1994
- [j3]Donald A. Preece:
Double Youden rectangles - an update with examples of size 5x11. Discret. Math. 125(1-3): 309-317 (1994) - [j2]Donald A. Preece, P. W. Brading, Clement W. H. Lam, Michel Côté:
Balanced 6 × 6 designs for 4 equally replicated treatments. Discret. Math. 125(1-3): 319-327 (1994)
1970 – 1979
- 1972
- [j1]John C. Gower, Donald A. Preece:
Generating Successive Incomplete Blocks with Each Pair of Elements in at Least One Block. J. Comb. Theory A 12(1): 81-97 (1972)
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 20:31 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:
