default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam Maxwell
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j2]David Eppstein, Daniel Frishberg
, William Maxwell:
On the treewidth of Hanoi graphs. Theor. Comput. Sci. 906: 1-17 (2022)- 2020
- [j1]Ghita Berrada, James Cheney, Sidahmed Benabderrahmane, William Maxwell, Himan Mookherjee, Alec Theriault, Ryan Wright:
A baseline for unsupervised advanced persistent threat detection in system-level provenance. Future Gener. Comput. Syst. 108: 401-413 (2020)
Conference and Workshop Papers
- 2024
- [c8]Matthew Amy, Andrew N. Glaudell, Shaun Kelso, William Maxwell, Samuel S. Mendelson, Neil J. Ross:
Exact Synthesis of Multiqubit Clifford-Cyclotomic Circuits. RC 2024: 238-245 - 2022
- [c7]Mitchell Black, William Maxwell, Amir Nayyeri, Eli Winkelman:
Computational Topology in a Collapsing Universe: Laplacians, Homology, Cohomology. SODA 2022: 226-251 - 2021
- [c6]William Maxwell, Amir Nayyeri:
Generalized Max-Flows and Min-Cuts in Simplicial Complexes. ESA 2021: 69:1-69:16 - [c5]David Eppstein, Daniel Frishberg, William Maxwell:
On the Treewidth of Hanoi Graphs. FUN 2021: 13:1-13:21 - [c4]Mitchell Black, William Maxwell:
Effective Resistance and Capacitance in Simplicial Complexes and a Quantum Algorithm. ISAAC 2021: 31:1-31:27 - 2020
- [c3]Glencora Borradaile, William Maxwell, Amir Nayyeri:
Minimum Bounded Chains and Minimum Homologous Chains in Embedded Simplicial Complexes. SoCG 2020: 21:1-21:15 - [c2]Glencora Borradaile, Erin Wolf Chambers, David Eppstein, William Maxwell, Amir Nayyeri:
Low-Stretch Spanning Trees of Graphs with Bounded Width. SWAT 2020: 15:1-15:19 - 2018
- [c1]Md Amran Siddiqui, Alan Fern, Ryan Wright, Alec Theriault, David W. Archer, William Maxwell:
Detecting Cyberattack Entities from Audit Data via Multi-View Anomaly Detection with Feedback. AAAI Workshops 2018: 277-284
Informal and Other Publications
- 2023
- [i6]Mitchell Black, William Maxwell, Amir Nayyeri:
An Incremental Span-Program-Based Algorithm and the Fine Print of Quantum Topological Data Analysis. CoRR abs/2307.07073 (2023) - 2021
- [i5]William Maxwell, Amir Nayyeri:
Generalized max-flows and min-cuts in simplicial complexes. CoRR abs/2106.14116 (2021) - 2020
- [i4]Glencora Borradaile, William Maxwell, Amir Nayyeri:
Minimum bounded chains and minimum homologous chains in embedded simplicial complexes. CoRR abs/2003.02801 (2020) - [i3]Glencora Borradaile, Erin Wolf Chambers, David Eppstein, William Maxwell, Amir Nayyeri:
Low-stretch spanning trees of graphs with bounded width. CoRR abs/2004.08375 (2020) - [i2]David Eppstein, Daniel Frishberg, William Maxwell:
On the treewidth of Hanoi graphs. CoRR abs/2005.00179 (2020) - 2019
- [i1]Ghita Berrada, Sidahmed Benabderrahmane, James Cheney, William Maxwell, Himan Mookherjee, Alec Theriault, Ryan Wright:
A baseline for unsupervised advanced persistent threat detection in system-level provenance. CoRR abs/1906.06940 (2019)
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-07-05 21: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:
