![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 11 matches
- 2008
- Andris Ambainis, Nikolajs Nahimovs:
Improved Constructions of Quantum Automata. TQC 2008: 47-56 - Michael Batty, Andrea Casaccino, Andrew J. Duncan, Sarah Rees, Simone Severini:
An Application of the Deutsch-Jozsa Algorithm to Formal Languages and the Word Problem in Groups. TQC 2008: 57-69 - J. Niel de Beaudrap, Vincent Danos, Elham Kashefi, Martin Rötteler
:
Quadratic Form Expansions for Unitaries. TQC 2008: 29-46 - Francesco Buscemi:
Irreversibility of Entanglement Loss. TQC 2008: 16-28 - Donny Cheung, Dmitri Maslov, Jimson Mathew, Dhiraj K. Pradhan:
On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography. TQC 2008: 96-104 - Richard Cleve, Dmitry Gavinsky, David L. Yonge-Mallo:
Quantum Algorithms for Evaluating Min-MaxTrees. TQC 2008: 11-15 - Wim van Dam, Igor E. Shparlinski:
Classical and Quantum Algorithms for Exponential Congruences. TQC 2008: 1-10 - Rodney Van Meter
, W. J. Munro, Kae Nemoto:
Architecture of a Quantum Multicomputer Implementing Shor's Algorithm. TQC 2008: 105-114 - Valerio Scarani, Renato Renner:
Security Bounds for Quantum Cryptography with Finite Resources. TQC 2008: 83-95 - Toshiyuki Tashima, Sahin Kaya Özdemir, Takashi Yamamoto, Masato Koashi, Nobuyuki Imoto:
An Elementary Optical Gate for Expanding Symmetrically Shared Entanglement. TQC 2008: 70-82 - Yasuhito Kawano, Michele Mosca:
Theory of Quantum Computation, Communication, and Cryptography, Third Workshop, TQC 2008, Tokyo, Japan, January 30 - February 1, 2008. Revised Selected Papers. Lecture Notes in Computer Science 5106, Springer 2008, ISBN 978-3-540-89303-5 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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.
retrieved on 2025-02-18 17:34 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint