期刊： INFORMATION PROCESSING LETTERS, 2021; 172 ()
A graph G is P->= k-factor uniform if for arbitrary e(1), e(2) is an element of E(G) with e(1) not equal e(2), G admits a P->= k-factor includin......
期刊： INFORMATION PROCESSING LETTERS, 2021; 171 ()
At EUROCRYPT 2015, Dinur et al. proposed cube-attack-like cryptanalysis on reduced-round Keccak. The process of recovering the key is divided into the......
期刊： INFORMATION PROCESSING LETTERS, 2021; 172 ()
Motivated by the famous Locke's Conjecture, we study the following special kind of fault-tolerance of hypercubes. Let Q(m) be a certain subcube of an ......
期刊： INFORMATION PROCESSING LETTERS, 2021; 172 ()
Given a bit-vector t, operation rank(1)(t, i) returns the number of occurrences of 1-bits in the prefix of t ending at position i. Operation select(1)......
期刊： INFORMATION PROCESSING LETTERS, 2021; 166 ()
A k-container of a graph G is a set of k internally disjoint paths between two distinct vertices. A k-container of Gis a k*-container if it contains a......
期刊： INFORMATION PROCESSING LETTERS, 2021; 166 ()
A subset S of vertices in a graph G with vertex set V and edge set E is a dominating set of G if every vertex of V \ S is adjacent to a vertex in S. T......
期刊： INFORMATION PROCESSING LETTERS, 2021; 168 ()
We study the two-opposite-facility location game on a line segment, where a mechanism determines the locations of a popular facility and an obnoxious ......
期刊： INFORMATION PROCESSING LETTERS, 2021; 165 ()
In this paper, we introduce two new notions of S-continuous information systems and S-abstract bases which provide concrete representations of stably ......
期刊： INFORMATION PROCESSING LETTERS, 2020; 162 ()
There are two options for the leasing problem, buying at a high price or leasing at a low price. Once you choose to purchase the resources, you lose t......
期刊： INFORMATION PROCESSING LETTERS, 2020; 154 ()
Deterministic public-key encryption (D-PKE), introduced by Bellare, Boldyreva, and O'Neill (CRYPT0'07), encrypts every plaintext into a unique ciphert......
期刊： INFORMATION PROCESSING LETTERS, 2020; 164 ()
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfec......
期刊： INFORMATION PROCESSING LETTERS, 2020; 156 ()
From January 2013, COST R 34.11-2012 hash function has been the new Russian Federal standard hash function which replaced the old one COST R 34.11-97.......
期刊： INFORMATION PROCESSING LETTERS, 2020; 157 ()
A semicomplete digraph is a digraph obtained from a complete graph by orienting each edge either in one direction or both possible ways. In this paper......
期刊： INFORMATION PROCESSING LETTERS, 2020; 157 ()
(t, n) threshold secret sharing (SS) is an important cryptographic primitive in which a secret is divided into n shares, and then any t or more shareh......
期刊： INFORMATION PROCESSING LETTERS, 2020; 159 ()
Let n(1) and n(2) be two integers with n(1), n(2) >= 3 and G a graph of order n = n(1) + n(2). As a variation of Ore's degree condition for the exi......
