default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 129
Volume 129, January 2018
- Francesco Aldà, Hans Ulrich Simon
:
A lower bound on the release of differentially private integer partitions. 1-4 - Jungjoo Seo, Kunsoo Park:
Fast batch modular exponentiation with common-multiplicand multiplication. 5-10 - Shunsuke Inenaga, Heikki Hyyrö:
A hardness result and new algorithm for the longest common palindromic subsequence problem. 11-15 - Moussa Demba:
Equivalence checking of two functional programs using inductive theorem provers. 16-24 - Matias Korman, Sheung-Hung Poon, Marcel Roeloffzen:
Line segment covering of cells in arrangements. 25-30 - Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Manish Purohit, Kanthi K. Sarpatwar:
On maximum leaf trees and connections to connected maximum cut problems. 31-34 - Fabio Grandi:
On the analysis of Bloom filters. 35-39 - Xing Huang:
An implicit degree sum condition for cycles through specified vertices. 40-43 - Deepak Panday, Renato Cordeiro de Amorim, Peter C. R. Lane:
Feature weighting as a tool for unsupervised feature selection. 44-52 - Yiqiao Wang, Ping Wang, Weifan Wang:
Strong chromatic index of K4-minor free graphs. 53-56 - Chun Jiang Zhu, Kam-yiu Lam:
Deterministic improved round-trip spanners. 57-60
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 2026-05-05 23:52 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:
