Остановите войну!
for scientists:
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 28 matches
- 2014
- Romain Alléaume, Cyril Branciard, Jan Bouda, Thierry Debuisschert, Mehrdad Dianati, Nicolas Gisin, Mark Godfrey, Philippe Grangier, Thomas Länger, Norbert Lütkenhaus, Christian Monyk, Philippe Painchault, Momtchil Peev, Andreas Poppe, Thomas Pornin, John G. Rarity, Renato Renner, Gregoire Ribordy, Michel Riguidel, Louis Salvail, Andrew J. Shields, Harald Weinfurter, Anton Zeilinger:
Using quantum key distribution for cryptographic purposes: A survey. Theor. Comput. Sci. 560: 62-81 (2014) - George Barmpalias, Manindra Agrawal, S. Barry Cooper:
Theory and Applications of Models of Computation at the Turing Centenary in China. Theor. Comput. Sci. 560: 107 (2014) - Hervé Baumann, Pierre Fraigniaud, Hovhannes A. Harutyunyan, Rémi de Joannis de Verclos:
The worst case behavior of randomized gossip protocols. Theor. Comput. Sci. 560: 108-120 (2014) - Charles H. Bennett, Gilles Brassard:
Quantum cryptography: Public key distribution and coin tossing. Theor. Comput. Sci. 560: 7-11 (2014) - Jingguo Bi, Qi Cheng:
Lower bounds of shortest vector lengths in random NTRU lattices. Theor. Comput. Sci. 560: 121-130 (2014) - Beate Bollig, Marc Gillé, Tobias Pröger:
Implicit computation of maximum bipartite matchings by sublinear functional operations. Theor. Comput. Sci. 560: 131-146 (2014) - Davide Bresolin, Dario Della Monica, Angelo Montanari, Pietro Sala, Guido Sciavicco:
Interval temporal logics over strongly discrete linear orders: Expressiveness and complexity. Theor. Comput. Sci. 560: 269-291 (2014) - Felix Canavoi, Erich Grädel, Roman Rabinovich:
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs. Theor. Comput. Sci. 560: 235-250 (2014) - Domenico Cantone, Cristiano Longo:
A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions. Theor. Comput. Sci. 560: 307-325 (2014) - Pavol Cerný, Martin Chmelik, Thomas A. Henzinger, Arjun Radhakrishna:
Interface simulation distances. Theor. Comput. Sci. 560: 348-363 (2014) - Ivan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner:
Secure identification and QKD in the bounded-quantum-storage model. Theor. Comput. Sci. 560: 12-26 (2014) - Aleksandar S. Dimovski:
Program verification using symbolic game semantics. Theor. Comput. Sci. 560: 364-379 (2014) - Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire:
Approximating MAX SAT by moderately exponential and parameterized algorithms. Theor. Comput. Sci. 560: 147-157 (2014) - Marco Faella, Aniello Murano:
Preface to the special issue on GandALF 2012. Theor. Comput. Sci. 560: 217-218 (2014) - Qilong Feng, Jianxin Wang, Chao Xu, Jinyi Yao, Jianer Chen:
Improved parameterized algorithms for minimum link-length rectilinear spanning path problem. Theor. Comput. Sci. 560: 158-171 (2014) - Julian Gutierrez, Felix Klaedtke, Martin Lange:
The μ-calculus alternation hierarchy collapses over structures with restricted connectivity. Theor. Comput. Sci. 560: 292-306 (2014) - Lawrence M. Ioannou, Michele Mosca:
Public-key cryptography based on bounded quantum reference frames. Theor. Comput. Sci. 560: 33-45 (2014) - Shaoquan Jiang:
Timed encryption with application to deniable key exchange. Theor. Comput. Sci. 560: 172-189 (2014) - Martin Lange, Étienne Lozes, Manuel Vargas Guzmán:
Model-checking process equivalences. Theor. Comput. Sci. 560: 326-347 (2014) - Marco Lucamarini, Stefano Mancini:
Quantum key distribution using a two-way quantum channel. Theor. Comput. Sci. 560: 46-61 (2014) - Tal Mor:
Preface. Theor. Comput. Sci. 560: 1-6 (2014) - Daniel Neider, Roman Rabinovich, Martin Zimmermann:
Down the Borel hierarchy: Solving Muller games via safety games. Theor. Comput. Sci. 560: 219-234 (2014) - Valerio Scarani, Christian Kurtsiefer:
The black paper of quantum cryptography: Real implementation problems. Theor. Comput. Sci. 560: 27-32 (2014) - Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Fencol C. C. Yung, Shmuel Zaks:
Online optimization of busy time on parallel machines. Theor. Comput. Sci. 560: 190-206 (2014) - Alessandro Solimando, Giorgio Delzanno, Giovanna Guerrini:
Validating XML document adaptations via Hedge Automata transformations. Theor. Comput. Sci. 560: 251-268 (2014) - Karl Svozil:
Non-contextual chocolate balls versus value indefinite quantum cryptography. Theor. Comput. Sci. 560: 82-90 (2014) - Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Optimal axis compensation in quantum key distribution protocols over unital channels. Theor. Comput. Sci. 560: 91-106 (2014) - Mingyu Xiao, Hiroshi Nagamochi:
A refined exact algorithm for Edge Dominating Set. Theor. Comput. Sci. 560: 207-216 (2014)
loading more results
failed to load more results, please try again later
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 2024-08-17 22:56 CEST 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