default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdward Spence
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j26]Edward Spence:
Luciano Floridi's Metaphysical Theory of Information Ethics: A Critical Appraisal and an Alternative Neo-Gewirthian Information Ethics. Int. J. Technol. Hum. Interact. 6(1): 1-14 (2010)
2000 – 2009
- 2009
- [j25]Andries E. Brouwer, Edward Spence:
Cospectral Graphs on 12 Vertices. Electron. J. Comb. 16(1) (2009) - 2006
- [j24]Kris Coolsaet, Jan Degraer, Edward Spence:
The Strongly Regular (45, 12, 3, 3) Graphs. Electron. J. Comb. 13(1) (2006) - [j23]Edwin R. van Dam
, Willem H. Haemers, Jacobus H. Koolen, Edward Spence:
Characterizing distance-regularity of graphs by the spectrum. J. Comb. Theory A 113(8): 1805-1820 (2006) - 2004
- [j22]Willem H. Haemers, Edward Spence:
Enumeration of cospectral graphs. Eur. J. Comb. 25(2): 199-211 (2004) - [j21]Edwin R. van Dam, Edward Spence:
Combinatorial designs with two singular values--I: uniform multiplicative designs. J. Comb. Theory A 107(1): 127-142 (2004) - 2001
- [j20]Brendan D. McKay, Edward Spence:
Classification of regular two-graphs on 36 and 38 vertices. Australas. J Comb. 24: 293-300 (2001) - [j19]Willem H. Haemers, Edward Spence:
The Pseudo-geometric Graphs for Generalized Quadrangles of Order (3, t). Eur. J. Comb. 22(6): 839-845 (2001) - 2000
- [j18]Edward Spence:
The Strongly Regular (40, 12, 2, 4) Graphs. Electron. J. Comb. 7 (2000) - [j17]Frans C. Bussemaker, Willem H. Haemers, Edward Spence:
The Search for Pseudo Orthogonal Latin Squares of Order Six. Des. Codes Cryptogr. 21(1/3): 77-82 (2000)
1990 – 1999
- 1999
- [j16]Mario-Osvin Pavcevic, Edward Spence:
Some new symmetric designs with lambda = 10 having an automorphism of order 5. Discret. Math. 196(1-3): 257-266 (1999) - [j15]Dominique de Caen, Edwin R. van Dam, Edward Spence:
A Nonregular Analogue of Conference Graphs. J. Comb. Theory A 88(1): 194-204 (1999) - 1998
- [j14]Edwin R. van Dam, Edward Spence:
Small regular graphs with four eigenvalues. Discret. Math. 189(1-3): 233-257 (1998) - 1995
- [j13]Edward Spence:
Five nondual 2-(41, 16, 6) designs with a trivial automorphism group. Ars Comb. 41 (1995) - [j12]Edward Spence:
Classification of hadamard matrices of order 24 and 28. Discret. Math. 140(1-3): 185-243 (1995) - 1994
- [j11]Christopher Parker, Edward Spence, Vladimir D. Tonchev:
Designs with the Symmetric Difference Property on 64 Points and Their Groups. J. Comb. Theory A 67(1): 23-43 (1994) - 1993
- [j10]Edward Spence:
A New Family of Symmetric 2-(v, k, lambda) Block Designs. Eur. J. Comb. 14(2): 131-136 (1993) - 1992
- [j9]Edward Spence:
A Complete Classification of Symmetric (31, 10, 3) Designs. Des. Codes Cryptogr. 2(2): 127-136 (1992) - [j8]Edward Spence:
Is Taylor's graph geometric? Discret. Math. 106-107: 449-454 (1992) - [j7]Edward Spence, Vladimir D. Tonchev:
Extremal self-dual codes from symmetric designs. Discret. Math. 110(1-3): 265-268 (1992)
1980 – 1989
- 1989
- [j6]Frans C. Bussemaker, Willem H. Haemers, J. J. Seidel, Edward Spence:
On (v, k, lambda) graphs and designs with trivial automorphism group. J. Comb. Theory A 50(1): 33-46 (1989)
1970 – 1979
- 1977
- [j5]Edward Spence:
Skew-Hadamard matrices of order 2(q + 1). Discret. Math. 18(1): 79-85 (1977) - [j4]Edward Spence:
A Family of Difference Sets. J. Comb. Theory A 22(1): 103-106 (1977) - 1975
- [j3]Michael J. Ganley, Edward Spence:
Relative Difference Sets and Quasiregular Collineation Groups. J. Comb. Theory A 19(2): 134-153 (1975) - [j2]Edward Spence:
Hadamard Matrices from Relative Difference Sets. J. Comb. Theory A 19(3): 287-300 (1975) - 1971
- [j1]Edward Spence:
Some New Symmetric Block Designs. J. Comb. Theory A 11(3): 299-302 (1971)
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-10-07 22:06 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:
