default search action
Arthur Schmidt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j5]Aiman Soliman, Andrew Mackay, Arthur Schmidt, Brian Allan, Shaowen Wang:
Quantifying the geographic distribution of building coverage across the US for urban sustainability studies. Comput. Environ. Urban Syst. 71: 199-208 (2018) - [c4]Sandeep Puthanveetil Satheesan
, Jay Alameda, Shannon Bradley, Michael C. Dietze
Brown Dog: Making the Digital World a Better Place, a Few Files at a Time. PEARC 2018: 38:1-38:8 - 2015
- [j4]Andrea Zimmer, Arthur Schmidt, Avi Ostfeld
Evolutionary algorithm enhancement for model predictive control and real-time decision support. Environ. Model. Softw. 69: 330-341 (2015) - [c3]Jeffery Roesler, Paul Littleton, Arthur Schmidt, Lance Schideman, Morgan Johnston, Jose Mestre, Geoffrey L. Herman
Campus integrated project-based learning course in civil and environmental engineering. FIE 2015: 1-7 - 2010
- [j3]Laurent Imbert, Michael J. Jacobson Jr., Arthur Schmidt:
Fast ideal cubing in imaginary quadratic number and function fields. Adv. Math. Commun. 4(2): 237-260 (2010)
2000 – 2009
- 2009
- [i3]Arthur Schmidt:
Quantum Algorithms for many-to-one Functions to Solve the Regulator and the Principal Ideal Problem. CoRR abs/0912.4807 (2009) - 2007
- [b1]Arthur Schmidt:
Zur Lösung von zahlentheoretischen Problemen mit klassischen und Quantencomputern. Darmstadt University of Technology, Germany, 2007, pp. 1-146 - [j2]Daniela Engelbert, Raphael Overbeck, Arthur Schmidt:
A Summary of McEliece-Type Cryptosystems and their Security. J. Math. Cryptol. 1(2): 151-199 (2007) - 2006
- [c2]Arthur Schmidt:
Quantum Algorithm for Solving the Discrete Logarithm Problem in the Class Group of an Imaginary Quadratic Field and Security Comparison of Current Cryptosystems at the Beginning of Quantum Computer Age. ETRICS 2006: 481-493 - [i2]Daniela Engelbert, Raphael Overbeck, Arthur Schmidt:
A Summary of McEliece-Type Cryptosystems and their Security. IACR Cryptol. ePrint Arch. 2006: 162 (2006) - 2005
- [j1]Johannes Buchmann, Arthur Schmidt:
Computing the structure of a finite abelian group. Math. Comput. 74(252): 2017-2026 (2005) - [c1]Arthur Schmidt, Ulrich Vollmer:
Polynomial time quantum algorithm for the computation of the unit group of a number field. STOC 2005: 475-480 - 2004
- [i1]Johannes Buchmann, Luis Carlos Coronado García, Martin Döring, Daniela Engelbert, Christoph Ludwig, Raphael Overbeck, Arthur Schmidt, Ulrich Vollmer, Ralf-Philipp Weinmann:
Post-Quantum Signatures. IACR Cryptol. ePrint Arch. 2004: 297 (2004)
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-05-08 21:00 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: