default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 660
Volume 660, January 2017
- Irena Rusu:
log-Lists and their applications to sorting by transpositions, reversals and block-interchanges. 1-15 - George Barmpalias
, Andrew Lewis-Pye:
Computing halting probabilities from other halting probabilities. 16-22 - Antonio Faonio, Jesper Buus Nielsen, Daniele Venturi:
Fully leakage-resilient signatures revisited: Graceful degradation, noisy leakage, and construction in the bounded-retrieval model. 23-56 - Tatsuya Akutsu, Jesper Jansson, Atsuhiro Takasu, Takeyuki Tamura:
On the parameterized complexity of associative and commutative unification. 57-74 - Siyao Guo, Ilan Komargodski:
Negation-limited formulas. 75-85 - Maggie X. Cheng, Yi Ling, Brian M. Sadler:
Network connectivity assessment and improvement through relay node deployment. 86-101
- Yaroslav Shitov:
On the complexity of failed zero forcing. 102-104
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-11-05 21:03 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:
