In many applications of sensor networks, it is essential to ensure that messages are transmitted to their destinations as early as possible and the buffer size of each sensor node...
Huimin She, Zhonghai Lu, Axel Jantsch, Li-Rong Zhe...
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...
We present an integer-linear-programming-based approach for estimating the maximum instantaneous current through the power supply lines for CMOS circuits. It produces the exact so...
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
Abstract. We apply autocorrelation and Walsh coefficients for the investigation of correlation immune and resilient Boolean functions. We prove new lower bound for the absolute ind...