1369 search results - page 72 / 274 » Lattice computations for random numbers |
ICCAD
2009
IEEE
13 years 6 months ago
2009
IEEE
With the adoption of ultra regular fabric paradigms for controlling design printability at the 22nm node and beyond, there is an emerging need for a layout-driven, pattern-based p...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
We consider the set Gn of all period sets of strings of length n over a finite alphabet. We show that there is redundancy in period sets and introduce the notion of an irreducibl...
COCOON
1999
Springer
14 years 1 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
ASIACRYPT
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the...