default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 121
Volume 121, May 2017
- Sugata Gangopadhyay
, Enes Pasalic, Pantelimon Stanica, Saral Datta:
A note on non-splitting Z-bent functions. 1-5 - Akitoshi Kawamura, Yuichi Tatsu, Yushi Uno, Masahide Yamato:
Morpion Solitaire 5D: A new upper bound of 121 on the maximum score. 6-10 - Adisak Supeesun, Jittat Fakcharoenphol:
Learning network structures from contagion. 11-16 - Karthik C. S.:
Did the train reach its destination: The complexity of finding a witness. 17-21 - Luiz Emilio Allem, Carlos Hoppen:
A pre-test for factoring bivariate polynomials with coefficients in F2. 22-28 - Arman Boyaci, Tínaz Ekim, Mordechai Shalom:
A polynomial-time algorithm for the maximum cardinality cut problem in proper interval graphs. 29-33 - Hon-Chan Chen, Yun-Hao Zou, Yue-Li Wang, Kung-Jui Pai:
A note on path embedding in crossed cubes with faulty vertices. 34-38 - Julien Baste, Fairouz Beggas, Hamamache Kheddouci, Ignasi Sau:
On the parameterized complexity of the Edge Monitoring problem. 39-44 - Aleksandar Radonjic, Vladimir Vujicic:
Integer codes correcting single errors and burst asymmetric errors within a byte. 45-50
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-04-24 20:51 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:
