Showing papers in "Information Processing Letters in 2020"

TL;DR: In this paper, the authors prove that blockchain interoperability is impossible according to the classical definition of a blockchain and show that having interoperability requires a 2-in-1 blockchain containing both ledgers.

TL;DR: A bivariate symmetry polynomial is utilized to propose a basic threshold changeable secret sharing (TCSS) scheme which is cheating immune and thwarts the above illegal participant attack.

TL;DR: This paper identifies a problem in both the TLA+ specification and the implementation of the E egalitarian Paxos protocol related to how replicas switch from one ballot to another when computing the dependencies of a command.

TL;DR: It is proved by counterexample that the linear-time algorithm presented in 1979 by Dobkin and Snyder for solving the largest-area inscribed triangle fails, as well as a renewed analysis of the problem.

TL;DR: This article introduces the full anonymous model, namely a model in which both the processes and the registers are anonymous, and presents a deadlock-free mutual exclusion algorithm in such a fully anonymous model where the anonymous registers are read/modify/write registers.

TL;DR: The classic problem of triangle-free graph recognition reduces to the problem of does M accept a word of length l, and an O(n^{\omega} (log n) 1+{\epsilon}} log l)-time algorithm is given to solve it, where {\omega] is the optimal exponent for matrix multiplication.

TL;DR: The Hierarchical Overlap Graph (HOG) is an alternative graph that also encodes all maximal overlaps, but uses a space that is linear in the sum of the lengths of the input words.

TL;DR: In this article, the authors consider finding a path with some constraints on its length and the number of vertices neighboring the path, that is, being outside of and incident with the path.

TL;DR: In this paper, the authors introduce a new type of metric called a cactus metric, which is a metric that can be realized by a Cactus graph and describe an algorithm that can recognize whether or not a metric is acactus metric and, if so, compute its optimal realization in O(n3) time, where n is the number of points in the space.

TL;DR: This work shows that problem kernels of asymptotically optimal size O ( k d ) for d-Hitting Set are computable in linear time and space and experimentally compares the linear-time kernelizations to each other and to a classical data reduction algorithm due to Weihe.

TL;DR: In this paper, the binary reachability relation of a timed automaton is definable in linear arithmetic and a new proof of the result of Comon and Jurski is given.

TL;DR: The approach is a generic construction based on the identity-based lossy trapdoor functions (IB-LTDF), and it also can be extended to design CCA secure deterministic identity- based encryption schemes (D-IBE).

TL;DR: In this paper, it was shown that any ternary Euclidean (resp. quaternary Hermitian) linear complementary dual [n, k ] code contains a Euclideans (resp., Hermitians) LHD subcode for 2 ≤ k ≤ n.

TL;DR: Accounting for opportunity cost is extended to the online leasing strategy for depreciable equipment and shows that a smaller competitive ratio can be obtained when considering opportunity cost, which illustrates that the introduction of the opportunity cost has a significant influence on both the deterministic and randomized strategies.

TL;DR: The eccentricities of all vertices of a chordal graph G can be computed in linear time with an additive one-sided error of at most 2 after a linear time preprocessing.

TL;DR: This work analyzes in detail the probability that sequences of equal length generated by a pseudorandom number generator starting from random points of the state space overlap, providing for the first time an exact result and manageable bounds.

TL;DR: Modified versions of quadratic double circulant and quadratically bordered doublecirculant constructions over the binary field and the rings F 2 + u F 2 and F 4 - u F 4 for different prime values of p are considered.

TL;DR: PSMF2 is described, a program synthesizer that combines model finder and genetic programming that has allowed PSMF2 to synthesize 7 programs found in the SyGuS competition, the iJava and IntroClass, and the Genetic programming communities.

TL;DR: The signed chromatic number for the class G of all 2-dimensional grids lies between 5 and 6 and the coloring of signed graphs is defined through homomorphism.

TL;DR: A dealer-free and non-interactive dynamic threshold secret sharing scheme has been proposed by Harn and Hsu in Information Processing Letters in 2015 as discussed by the authors, where it has been claimed that the secrecy of shares and the secret of the secret are unconditionally preserved if m ∈ ( t, 1 + t ( t + 1 ) / 2 ].

TL;DR: The problem of minimizing the number of tardy orders in this context is proved to be strongly NP-hard, and an efficient heuristic is introduced.

TL;DR: The probabilistic analogue to the notion of semi-branching bisimilarity and to van Glabbeek and Weijland's Stuttering Lemma are introduced to prove that Probabilistic branching bis similarity is indeed an equivalence relation.

TL;DR: In this article, the authors give algorithms for Cograph Deletion and Cograph Editing whose running times are O ⁎ ( 2.303 k ) and O ε ( 4.329 k ), respectively.

TL;DR: In this paper, a decisional security proof for the case of a corrupt sender was provided and it was shown that the protocol of Chou and Orlandi cannot be instantiated securely with groups for which their decisional problem cannot be solved correctly with overwhelming probability.

TL;DR: Two open problems on the construction of bent functions are proposed, one of which is solved by considering a class of PS − vectorial bent functions, and the other is still outstanding, which has been settled by Tang et al. in 2017.

TL;DR: It is shown that the minimum weight spanning tree problem on undirected n-vertex graphs can be solved by a pure DP algorithm performing only O ( n 3 ) operations, and the presence of both min and max operations means that now DP algorithms can sort.

TL;DR: In this paper, the authors give necessary conditions and sufficient conditions for a graph to be in PCG based on cut-vertices and twins, which provide reductions among PCGs and imply that complete k-partite graphs, cacti, and some other graph classes are subsets of PCG.

TL;DR: A novel technique is presented that addresses the all best swap edges problem in a distributed environment from a time perspective that works in linear time with respect to the height h of T for a number of different criteria, while retaining the optimal number of messages.

TL;DR: An algorithm is provided, which takes as input an a priori TSP solution with approximation factor γ, and gives a solution to the aPriori CVRP with unit demands, whose cost is at most ( 1 + k / N + γ ) times the value of the optimal solution.

TL;DR: A better analysis is presented that shows the integrality gap is not worse than $3 + 5/6 \approx 3.8333$ and is shown to be non-constructive since the local search has not been shown to terminate in polynomial time.