default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 130
Volume 130, February 2018
- Daniel Lemire
, Nathan Kurz, Christoph Rupp:
Stream VByte: Faster byte-oriented integer compression. 1-6 - Christian Ikenmeyer, Stefan Mengel:
On the relative power of reduction notions in arithmetic circuit complexity. 7-10 - Min Chih Lin, Julián Mestre, Saveliy Vasiliev:
Approximating weighted neighborhood independent sets. 11-15 - Yanwei Zhou, Bo Yang:
Leakage-resilient CCA2-secure certificateless public-key encryption scheme without bilinear pairing. 16-24 - Zepeng Li, Enqiang Zhu, Zehui Shao, Jin Xu:
NP-completeness of local colorings of graphs. 25-29 - Ruicong Zhi, Lianyu Cao, Gang Cao:
Translation and scale invariants of Krawtchouk moments. 30-35 - Po-An Chen:
Generalized mirror descents with non-convex potential functions in atomic congestion games: Continuous time and discrete time. 36-39 - Vincent Vajnovszki:
The equidistribution of some length-three vincular patterns on Sn(132). 40-45 - Toan Thang Ta, Cheng-Yao Lin, Chin Lung Lu:
Two-string consensus problem under non-overlapping inversion and transposition distance. 46-51 - Luis A. Leiva:
Responsive text summarization. 52-57 - Sukhamay Kundu:
A generalized linear time algorithm for an optimal k-distance dominating set of a weighted tree. 58-62 - Karol Kosinski, Robert Mercas, Dirk Nowotka:
Corrigendum to "A note on Thue games" [Inf. Process. Lett. 118 (2017) 75-77]. 63-65
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-09-22 23:37 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:
