default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDG. Stacey Staples
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2019
[b1]George Stacey Staples:
Clifford Algebras and Zeons - Geometry to Combinatorics and Beyond. WorldScientific 2019, ISBN 9789811202575, pp. 1-380
Journal Articles
- 2019
- [j4]Abdusy Syarif
, Abdelhafid Abouaissa, Lhassane Idoumghar, Pascal Lorenz, René Schott, G. Stacey Staples:
New Path Centrality Based on Operator Calculus Approach for Wireless Sensor Network Deployment. IEEE Trans. Emerg. Top. Comput. 7(1): 162-173 (2019) - 2011
- [j3]René Schott, G. Stacey Staples:
Nilpotent Adjacency Matrices and Random Graphs. Ars Comb. 98: 225-239 (2011) - [j2]René Schott, G. Stacey Staples:
Complexity of counting cycles using zeons. Comput. Math. Appl. 62(4): 1828-1837 (2011) - 2008
- [j1]René Schott, G. Stacey Staples:
Partitions and Clifford algebras. Eur. J. Comb. 29(5): 1133-1138 (2008)
Conference and Workshop Papers
- 2017
- [c3]G. Stacey Staples:
Zeons, orthozeons, and processes on colored graphs. CGI 2017: 42:1-42:6 - 2015
- [c2]Bilel Nefzi, René Schott, Yeqiong Song, George Stacey Staples, Evangelia Tsiontsiou:
An Operator Calculus Approach for Multi-constrained Routing in Wireless Sensor Networks. MobiHoc 2015: 367-376 - 2012
- [c1]Hugo Cruz-Sanchez, G. Stacey Staples, René Schott, Yeqiong Song:
Operator calculus approach to minimal paths: Precomputed routing in a store and forward satellite constellation. GLOBECOM 2012: 3431-3436
Parts in Books or Collections
- 2011
- [p2]René Schott, G. Stacey Staples:
On the Complexity of Cycle Enumeration for Simple Graphs. Guide to Geometric Algebra in Practice 2011: 233-249 - 2010
- [p1]René Schott, G. Stacey Staples:
Computational Complexity Reductions Using Clifford Algebras. Geometric Algebra Computing 2010: 431-453
Informal and Other Publications
- 2022
- [i1]Samuel Ewing, G. Stacey Staples:
Zeon and Idem-Clifford Formulations of Hypergraph Problems. CoRR abs/2201.05895 (2022)
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-04-24 23:13 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:
