default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSarah Spence Adams
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j24]Sarah Spence Adams, Zachary Brass, Connor Stokes, Denise Sakai Troxell:
Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products. Australas. J Comb. 56: 47-60 (2013)- [j23]Sarah Spence Adams, Noura Howell
, Nathaniel J. Karst, Denise Sakai Troxell, Junjie Zhu:
On the L(2, 1)-labelings of amalgamations of graphs. Discret. Appl. Math. 161(7-8): 881-888 (2013) - 2012
- [j22]Mathav Kishore Murugan, Sarah Spence Adams:
Hurwitz-Radon inspired maximal three-dimensional real orthogonal designs. Australas. J Comb. 54: 151-162 (2012) - [j21]Sarah Spence Adams, Paul Booth, Harold Jaffe, Denise Sakai Troxell, S. Luke Zinnen:
Exact lambda-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips. Discret. Appl. Math. 160(4-5): 436-447 (2012) - [j20]Sarah Spence Adams, Paul Booth, Denise Sakai Troxell, S. Luke Zinnen:
Modeling the spread of fault in majority-based network systems: Dynamic monopolies in triangular grids. Discret. Appl. Math. 160(10-11): 1624-1633 (2012) - 2011
- [j19]Jennifer Seberry, Sarah Spence Adams:
The amicable-Kronecker construction of quaternion orthogonal designs. Australas. J Comb. 50: 243-258 (2011) - [j18]Sarah Spence Adams, Denise Sakai Troxell:
Labeling matched sums with a condition at distance two. Appl. Math. Lett. 24(6): 950-957 (2011) - [j17]Sarah Spence Adams, Denise Sakai Troxell, S. Luke Zinnen:
Dynamic monopolies and feedback vertex sets in hexagonal grids. Comput. Math. Appl. 62(11): 4049-4057 (2011) - [j16]Sarah Spence Adams, James A. Davis, Nathaniel J. Karst, Mathav Kishore Murugan, Bryce Lee, Matthew Crawford, Caitlin Greeley:
Novel Classes of Minimal Delay and Low PAPR Rate 1øver 2 Complex Orthogonal Designs. IEEE Trans. Inf. Theory 57(4): 2254-2262 (2011) - [j15]Sarah Spence Adams, Nathaniel J. Karst, Mathav Kishore Murugan, Tadeusz A. Wysocki:
On Transceiver Signal Linearization and the Decoding Delay of Maximum Rate Complex Orthogonal Space-Time Block Codes. IEEE Trans. Inf. Theory 57(6): 3618-3621 (2011) - [i1]Sarah Spence Adams, Zachary Brass, Connor Stokes, Denise Sakai Troxell:
Irreversible k-threshold and majority conversion processes on complete multipartite graphs and graph products. CoRR abs/1102.5361 (2011) - 2010
- [j14]Sarah Spence Adams, Alex Trazkovich, Denise Sakai Troxell, Bradford Westgate:
On island sequences of labelings with a condition at distance two. Discret. Appl. Math. 158(1): 1-7 (2010) - [j13]Sarah Spence Adams, Nathaniel J. Karst, Mathav Kishore Murugan:
The final case of the decoding delay problem for maximum rate complex orthogonal designs. IEEE Trans. Inf. Theory 56(1): 103-112 (2010)
2000 – 2009
- 2009
- [j12]Sarah Spence Adams, Matthew Crawford, Caitlin Greeley, Bryce Lee, Mathav Kishore Murugan:
Multilevel and multidimensional Hadamard matrices. Des. Codes Cryptogr. 51(3): 245-252 (2009) - [j11]Beata J. Wysocki, Tadeusz A. Wysocki, Sarah Spence Adams:
On an Orthogonal Space-Time-Polarization Block Code. J. Commun. 4(1): 20-25 (2009) - [j10]Le Chung Tran, Tadeusz A. Wysocki, Jennifer Seberry, Alfred Mertins, Sarah Spence Adams:
Novel constructions of improved square complex orthogonal designs for eight transmit antennas. IEEE Trans. Inf. Theory 55(10): 4439-4448 (2009) - [j9]Tadeusz A. Wysocki, Beata J. Wysocki, Sarah Spence Adams:
Correction to "The theory of quaternion orthogonal designs". IEEE Trans. Signal Process. 57(8): 3298 (2009) - 2008
- [j8]Jennifer Seberry, Kenneth Finlayson, Sarah Spence Adams, Tadeusz A. Wysocki, Tianbing Xia, Beata J. Wysocki:
The Theory of Quaternion Orthogonal Designs. IEEE Trans. Signal Process. 56(1): 256-265 (2008) - 2007
- [j7]Sarah Spence Adams, Jonathan Cass, Matthew Tesch, Denise Sakai Troxell, Cody Wheeland:
The minimum span of L(2, 1)-labelings of certain generalized Petersen graphs. Discret. Appl. Math. 155(10): 1314-1325 (2007) - [j6]Sarah Spence Adams, Matthew Tesch, Denise Sakai Troxell, Bradford Westgate, Cody Wheeland:
On the hole index of L(2, 1)-labelings of r-regular graphs. Discret. Appl. Math. 155(17): 2391-2393 (2007) - [j5]Sarah Spence Adams, Nathaniel J. Karst, Jonathan Pollack:
The Minimum Decoding Delay of Maximum Rate Complex Orthogonal Space-Time Block Codes. IEEE Trans. Inf. Theory 53(8): 2677-2684 (2007) - [c2]Beata J. Wysocki, Tadeusz A. Wysocki, Jennifer Seberry, Sarah Spence Adams, Hamid Sharif:
A Simple Orthogonal Space-Time-Polarization Block Code. VTC Fall 2007: 754-757 - 2006
- [j4]Sarah Spence Adams, Jonathan Cass, Denise Sakai Troxell:
An extension of the channel-assignment problem: L(2, 1)-labelings of generalized Petersen graphs. IEEE Trans. Circuits Syst. I Regul. Pap. 53-I(5): 1101-1107 (2006) - 2005
- [j3]Mark H. Somerville, David Anderson, Hillary Berbeco, John R. Bourne, Jill D. Crisman, Diana Dabby, Helen Donis-Keller, Stephen S. Holt, Sherra E. Kerns, David V. Kerns Jr., Robert Martello, Richard K. Miller, Michael Moody, Gill A. Pratt, Joanne Pratt, Christina Shea, Stephen Schiffman, Sarah Spence Adams, Lynn Andrea Stein, Jonathan D. Stolk, Brian D. Storey, Burt S. Tilley, Benjamin Vandiver, Yevgeniya V. Zastavker:
The Olin curriculum: thinking toward the future. IEEE Trans. Educ. 48(1): 198-205 (2005) - [c1]Le Chung Tran, Tadeusz A. Wysocki, Jennifer Seberry, Alfred Mertins, Sarah Spence Adams:
Generalized Williamson and Wallis-Whiteman constructions for improved square order-8 CO STBCs. PIMRC 2005: 1155-1159 - 2004
- [j2]Sarah Spence Adams:
Identifying High-Dimension Subspace Subcodes of Reed-Solomon Codes. IEEE Trans. Inf. Theory 50(6): 1280-1282 (2004) - 2000
- [j1]Sarah Spence Adams:
Stratified Graphs and Distance Graphs. Ars Comb. 55 (2000)
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 2025-01-09 12:49 CET 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:
