default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 711
Volume 711, February 2018
- Yuyan Guo, Jiguo Li
, Yang Lu, Yichen Zhang, Futai Zhang:
Provably secure certificate-based encryption with leakage resilience. 1-10 - Shay Mozes, Yahav Nussbaum, Oren Weimann:
Faster shortest paths in dense distance graphs, with applications. 11-35 - Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng:
Strong matching preclusion for k-composition networks. 36-43 - Eminjan Sabir, Jixiang Meng:
Structure fault tolerance of hypercubes and folded hypercubes. 44-55 - Marek Karpinski, Andrzej Lingas, Dzmitry Sledneu:
A QPTAS for the base of the number of crossing-free structures on a planar point set. 56-65 - Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pedro Montealegre, Pawel Rzazewski:
Fixing improper colorings of graphs. 66-78 - Farzam Ebrahimnejad:
On the gap between separating words and separating their reversals. 79-91 - Patrice Séébold:
Sturmian images of non Sturmian words and standard morphisms. 92-104
- Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
The topology of wireless communication on a line. 105-108 - Tomás Masopust:
Separability by piecewise testable languages is PTime-complete. 109-114
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 2025-05-15 21:23 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:
