Sciweavers

167 search results - page 13 / 34
» A New Lower Bound for A(17, 6, 6)
Sort
View
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 8 months ago
Improved complexity bounds for real root isolation using Continued Fractions
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
Elias P. Tsigaridas
ISW
2007
Springer
14 years 2 months ago
New Weaknesses in the Keystream Generation Algorithms of the Stream Ciphers TPy and Py
The stream ciphers Py, Py6 designed by Biham and Seberry were promising candidates in the ECRYPT-eSTREAM project because of their impressive speed. Since their publication in Apri...
Gautham Sekar, Souradyuti Paul, Bart Preneel
GLVLSI
2003
IEEE
177views VLSI» more  GLVLSI 2003»
14 years 1 months ago
Congestion reduction in traditional and new routing architectures
In dense integrated circuit designs, management of routing congestion is essential; an over congested design may be unroutable. Many factors influence congestion: placement, rout...
Ameya R. Agnihotri, Patrick H. Madden
ICCAD
2006
IEEE
129views Hardware» more  ICCAD 2006»
14 years 4 months ago
Energy budgeting for battery-powered sensors with a known task schedule
Battery-powered wireless sensors are severely constrained by the amount of the available energy. A method for computing the energy budget per sensing task can be a valuable design...
Daler N. Rakhmatov
FOCS
1990
IEEE
14 years 5 hour ago
Complexity of Unification in Free Groups and Free Semi-groups
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...
Antoni Koscielski, Leszek Pacholski