default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRebekah Herrman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c2]Samuel Bringman, Anthony Wilkie, Rebekah Herrman, James Ostrowski:
Mathematical Model for SWAP Gate Minimization on NISQ Hardware. ISVLSI 2024: 640-643- [i5]Bernardo Ameneyro, Rebekah Herrman, George Siopsis, Vasileios Maroulas:
Quantum Distance Approximation for Persistence Diagrams. CoRR abs/2402.17295 (2024) - [i4]Anthony Wilkie, Igor Gaidai, James Ostrowski, Rebekah Herrman:
QAOA with random and subgraph phase operators. CoRR abs/2402.18412 (2024) - 2023
- [j11]Rizwanul Alam, George Siopsis
, Rebekah Herrman, James Ostrowski, Phillip C. Lotshaw, Travis S. Humble:
Solving MaxCut with quantum imaginary time evolution. Quantum Inf. Process. 22(7): 281 (2023) - [i3]Igor Gaidai, Rebekah Herrman:
Performance Analysis of Multi-Angle QAOA for p > 1. CoRR abs/2312.00200 (2023) - 2022
- [j10]Rebekah Herrman, Peter van Hintum, Stephen G. Z. Smith:
Capture times in the bridge-burning cops and robbers game. Discret. Appl. Math. 317: 10-17 (2022) - [j9]Rebekah Herrman, Stephen G. Z. Smith:
On the length of L-Grundy sequences. Discret. Optim. 45: 100725 (2022) - [j8]Rebekah Herrman:
The (d-2)-leaky forcing number of Qd and ℓ-leaky forcing number of GP(n, 1). Discret. Optim. 46: 100744 (2022) - [j7]Rebekah Herrman, Thomas G. Wong:
Simplifying continuous-time quantum walks on dynamic graphs. Quantum Inf. Process. 21(2): 54 (2022) - [c1]Kaiyan Shi, Rebekah Herrman, Ruslan Shaydulin, Shouvanik Chakrabarti, Marco Pistoia, Jeffrey Larson:
Multiangle QAOA Does Not Always Need All Its Angles. SEC 2022: 414-419 - 2021
- [j6]Rebekah Herrman, Lorna Treffert, James Ostrowski, Phillip C. Lotshaw, Travis S. Humble, George Siopsis:
Globally Optimizing QAOA Circuit Depth for Constrained Optimization Problems. Algorithms 14(10): 294 (2021) - [j5]Rebekah Herrman, Peter van Hintum:
The (t, r) broadcast domination number of some regular graphs. Discret. Appl. Math. 289: 270-280 (2021) - [j4]Vojtech Dvorák, Rebekah Herrman, Peter van Hintum:
The eternal game chromatic number of random graphs. Eur. J. Comb. 95: 103324 (2021) - [j3]Rebekah Herrman, James Ostrowski, Travis S. Humble, George Siopsis:
Lower bounds on circuit depth of the quantum approximate optimization algorithm. Quantum Inf. Process. 20(2): 59 (2021) - [j2]Rebekah Herrman, Lorna Treffert, James Ostrowski, Phillip C. Lotshaw, Travis S. Humble, George Siopsis:
Impact of graph structures for QAOA on MaxCut. Quantum Inf. Process. 20(8): 289 (2021) - [j1]Phillip C. Lotshaw, Travis S. Humble, Rebekah Herrman, James Ostrowski, George Siopsis:
Empirical performance bounds for quantum approximate optimization. Quantum Inf. Process. 20(12): 403 (2021) - 2020
- [i2]James Ostrowski, Rebekah Herrman, Travis S. Humble, George Siopsis:
Lower Bounds on Circuit Depth of the Quantum Approximate Optimization Algorithm. CoRR abs/2008.01820 (2020) - [i1]Rebekah Herrman, Peter van Hintum, Stephen G. Z. Smith:
Capture times in the Bridge-burning Cops and Robbers game. CoRR abs/2011.00317 (2020)
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-02 21:42 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:
