default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 128
Volume 128, December 2017
- Michael Rudow:
Discrete Logarithm and Minimum Circuit Size. 1-4 - Yijie Han
:
Construct a perfect word hash function in time independent of the size of integers. 5-10 - Hans Raj Tiwary, Stefan Weltge, Rico Zenklusen:
Extension complexities of Cartesian products involving a pyramid. 11-13 - Ming-Che Lee, Sheng Yu Chiu, Jia-Wei Chang:
A Deep Convolutional Neural Network based Chinese Menu Recognition App. 14-20 - Arne Leitert:
3-colouring for dually chordal graphs and generalisations. 21-26 - Shinil Kwon, Sung Deok Cha:
CAPTCHA-based image annotation. 27-31 - Kristóf Bérczi, Erika R. Bérczi-Kovács:
Directed hypergraphs and Horn minimization. 32-37 - Debanjan Sadhya, Sanjay Kumar Singh:
Privacy risks ensuing from cross-matching among databases: A case study for soft biometrics. 38-45 - Pascal Ochem:
2-subcoloring is NP-complete for planar comparability graphs. 46-48 - Attila Bernáth:
Covering symmetric supermodular functions with graph edges: A short proof of a theorem of Benczúr and Frank. 49-53 - Amihood Amir, Costas S. Iliopoulos, Jakub Radoszewski:
Two strings at Hamming distance 1 cannot be both quasiperiodic. 54-57 - Fanica Gavril:
New insights on GA-H reduced graphs. 58-61
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-19 22:13 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:
