default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 560
Volumes 560, Part 1, December 2014
Preface
- Tal Mor:
Preface. 1-6
- Charles H. Bennett, Gilles Brassard:
Quantum cryptography: Public key distribution and coin tossing. 7-11 - Ivan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner
:
Secure identification and QKD in the bounded-quantum-storage model. 12-26 - Valerio Scarani, Christian Kurtsiefer:
The black paper of quantum cryptography: Real implementation problems. 27-32 - Lawrence M. Ioannou, Michele Mosca:
Public-key cryptography based on bounded quantum reference frames. 33-45 - Marco Lucamarini, Stefano Mancini:
Quantum key distribution using a two-way quantum channel. 46-61 - 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. 62-81 - Karl Svozil:
Non-contextual chocolate balls versus value indefinite quantum cryptography. 82-90 - Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Optimal axis compensation in quantum key distribution protocols over unital channels. 91-106
Volumes 560, Part 2, December 2014
Preface
- George Barmpalias, Manindra Agrawal, S. Barry Cooper:
Theory and Applications of Models of Computation at the Turing Centenary in China. 107
- Hervé Baumann, Pierre Fraigniaud, Hovhannes A. Harutyunyan, Rémi de Joannis de Verclos:
The worst case behavior of randomized gossip protocols. 108-120 - Jingguo Bi, Qi Cheng:
Lower bounds of shortest vector lengths in random NTRU lattices. 121-130 - Beate Bollig, Marc Gillé, Tobias Pröger:
Implicit computation of maximum bipartite matchings by sublinear functional operations. 131-146 - Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire:
Approximating MAX SAT by moderately exponential and parameterized algorithms. 147-157 - Qilong Feng, Jianxin Wang, Chao Xu, Jinyi Yao, Jianer Chen:
Improved parameterized algorithms for minimum link-length rectilinear spanning path problem. 158-171 - Shaoquan Jiang:
Timed encryption with application to deniable key exchange. 172-189 - Mordechai Shalom, Ariella Voloshin, Prudence W. H. Wong, Fencol C. C. Yung, Shmuel Zaks:
Online optimization of busy time on parallel machines. 190-206 - Mingyu Xiao, Hiroshi Nagamochi:
A refined exact algorithm for Edge Dominating Set. 207-216
Volumes 560, Part 3, December 2014
Preface
- Marco Faella, Aniello Murano:
Preface to the special issue on GandALF 2012. 217-218
- Daniel Neider, Roman Rabinovich, Martin Zimmermann:
Down the Borel hierarchy: Solving Muller games via safety games. 219-234 - Felix Canavoi, Erich Grädel, Roman Rabinovich:
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs. 235-250 - Alessandro Solimando, Giorgio Delzanno, Giovanna Guerrini:
Validating XML document adaptations via Hedge Automata transformations. 251-268 - Davide Bresolin, Dario Della Monica, Angelo Montanari, Pietro Sala, Guido Sciavicco:
Interval temporal logics over strongly discrete linear orders: Expressiveness and complexity. 269-291 - Julian Gutierrez, Felix Klaedtke, Martin Lange:
The μ-calculus alternation hierarchy collapses over structures with restricted connectivity. 292-306 - Domenico Cantone, Cristiano Longo:
A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions. 307-325 - Martin Lange, Étienne Lozes, Manuel Vargas Guzmán:
Model-checking process equivalences. 326-347 - Pavol Cerný, Martin Chmelik, Thomas A. Henzinger, Arjun Radhakrishna:
Interface simulation distances. 348-363 - Aleksandar S. Dimovski:
Program verification using symbolic game semantics. 364-379
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.
last updated on 2024-12-16 22:27 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:
