1579 search results - page 180 / 316 » On the Constructions of Constant-Weight Codes |
151
click to vote
FOCS
2007
IEEE
16 years 22 days ago
2007
IEEE
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
160
click to vote
CASC
2007
Springer
16 years 17 days ago
2007
Springer
We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system F with coefficients in a field. In broad words, this is a finite part...
141
click to vote
FSTTCS
2007
Springer
16 years 17 days ago
2007
Springer
There are two somewhat contradictory ways of looking at modules in a given programming language. On the one hand, module systems are largely independent of the particulars of progr...
174
click to vote
STOC
2003
ACM
15 years 11 months ago
2003
ACM
Given a k-uniform hypergraph, the Ek-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyperedge. We present a new multilayered PCP constructi...
174
click to vote
VL
1996
IEEE
15 years 10 months ago
1996
IEEE
ToonTalkTM is a general-purpose concurrent programming system in which the source code is animated and the programming environment is like a me. Every abstract computational aspec...