Optimal strategies for the list update problem under the MRM alternative cost model Fulltext Access 5 Pages 2012
Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules Fulltext Access 5 Pages 2012
Routing and wavelength assignment for 3-ary n-cube in array-based optical network Fulltext Access 5 Pages 2012
The tensor product of two good codes is not necessarily robustly testable Fulltext Access 5 Pages 2012
Exponential lower bound for bounded depth circuits with few threshold gates Fulltext Access 5 Pages 2012
On the parameterized complexity of the repetition free longest common subsequence problem Fulltext Access 5 Pages 2012
Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations Fulltext Access 5 Pages 2012
The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices Fulltext Access 5 Pages 2012
HORSIC: An efficient one-time signature scheme for wireless sensor networks Fulltext Access 5 Pages 2012
A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix Fulltext Access 5 Pages 2012
A note on minimizing the sum of quadratic completion times on two identical parallel machines Fulltext Access 5 Pages 2012
Scheduling on parallel identical machines with job-rejection and position-dependent processing times Fulltext Access 5 Pages 2012
Minimizing interference in ad hoc networks with bounded communication radius Fulltext Access 5 Pages 2012
Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs Fulltext Access 6 Pages 2012
Impact of Intelʼs new instruction sets on software implementation of GF(2)[x]GF(2)[x] multiplication Fulltext Access 6 Pages 2012
On the complexity of the edge-disjoint min–min problem in planar digraphs Fulltext Access 6 Pages 2012
Sparse weighted voting classifier selection and its linear programming relaxations Fulltext Access 6 Pages 2012
Paired many-to-many disjoint path covers of hypercubes with faulty edges Fulltext Access 6 Pages 2012
Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks Fulltext Access 6 Pages 2012
Analysis of the false-positive error rate of tagged fragment marking scheme Fulltext Access 6 Pages 2012
The provable constructive effect of diffusion switching mechanism in CLEFIA-type block ciphers Fulltext Access 6 Pages 2012
Linear complexity of binary sequences derived from Euler quotients with prime-power modulus Fulltext Access 6 Pages 2012
Annotating problem diagrams with architectural tactics for reasoning on quality requirements Fulltext Access 6 Pages 2012
A related key impossible differential attack against 22 rounds of the lightweight block cipher LBlock Fulltext Access 6 Pages 2012
Effect of increasing the energy gap between the two lowest energy states on the mixing time of the Metropolis algorithm Fulltext Access 6 Pages 2012
A simple reduction from maximum weight matching to maximum cardinality matching Fulltext Access 6 Pages 2012
Internal state recovery of keystream generator LILI-128 based on a novel weakness of the employed Boolean function Fulltext Access 6 Pages 2012
Squeeziness: An information theoretic measure for avoiding fault masking Fulltext Access 6 Pages 2012
An efficient algorithm for parameterizing HsMM with Gaussian and Gamma distributions Fulltext Access 6 Pages 2012
Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead Fulltext Access 6 Pages 2012
Fault tolerance analysis of mesh networks with uniform versus nonuniform node failure probability Fulltext Access 6 Pages 2012
Hash challenges: Stretching the limits of compare-by-hash in distributed data deduplication Fulltext Access 6 Pages 2012