default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid J. Rosenbaum 0001
Person information
- affiliation: University of Washington, USA
- affiliation (former): Portland State University, OR, USA
Other persons with the same name
- David J. Rosenbaum 0002 — New Jersey Institute of Technology, Newark, NJ, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j3]David J. Rosenbaum:
Beating the Generator-Enumeration Bound for Solvable-Group Isomorphism. ACM Trans. Comput. Theory 12(2): 12:1-12:18 (2020)
2010 – 2019
- 2016
- [i8]François Le Gall, David J. Rosenbaum:
On the Group and Color Isomorphism Problems. CoRR abs/1609.08253 (2016) - 2015
- [b1]David J. Rosenbaum:
Quantum Computation and Isomorphism Testing. University of Washington, USA, 2015 - [j2]David J. Rosenbaum, Fabian Wagner:
Beating the generator-enumeration bound for p-group isomorphism. Theor. Comput. Sci. 593: 16-25 (2015) - 2014
- [j1]Aram W. Harrow, David J. Rosenbaum:
Uselessness for an Oracle model with internal randomness. Quantum Inf. Comput. 14(7-8): 608-624 (2014) - [i7]David J. Rosenbaum:
Beating the Generator-Enumeration Bound for Solvable-Group Isomorphism. CoRR abs/1412.0639 (2014) - 2013
- [c5]David J. Rosenbaum:
Breaking the nlog n Barrier for Solvable-Group Isomorphism. SODA 2013: 1054-1073 - [c4]David J. Rosenbaum:
Optimal Quantum Circuits for Nearest-Neighbor Architectures. TQC 2013: 294-307 - [i6]David J. Rosenbaum:
Bidirectional Collision Detection and Faster Deterministic Isomorphism Testing. CoRR abs/1304.3935 (2013) - [i5]David J. Rosenbaum, Fabian Wagner:
Beating the Generator-Enumeration Bound for $p$-Group Isomorphism. CoRR abs/1312.1755 (2013) - 2012
- [i4]David J. Rosenbaum:
Optimal Quantum Circuits for Nearest-Neighbor Architectures. CoRR abs/1205.0036 (2012) - [i3]David J. Rosenbaum:
Breaking the nlog n Barrier for Solvable-Group Isomorphism. CoRR abs/1205.0642 (2012) - 2011
- [i2]David J. Rosenbaum, Aram W. Harrow:
Uselessness for an Oracle Model with Internal Randomness. CoRR abs/1111.1462 (2011) - 2010
- [c3]David J. Rosenbaum, Marek A. Perkowski:
Mapping Binary Functions to a Practical Adiabatic Quantum Computer. ISMVL 2010: 270-275 - [i1]David J. Rosenbaum:
Quantum Algorithms for Tree Isomorphism and State Symmetrization. CoRR abs/1011.4138 (2010)
2000 – 2009
- 2009
- [c2]David J. Rosenbaum, Marek A. Perkowski:
Efficient Implementation of Controlled Operations for Multivalued Quantum Logic. ISMVL 2009: 86-91 - 2008
- [c1]David J. Rosenbaum, Marek A. Perkowski:
Superposed Quantum State Initialization Using Disjoint Prime Implicants (SQUID). ISMVL 2008: 144-149
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 13:10 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:
