Sciweavers

7758 search results - page 25 / 1552
» On the Number of Distributive Lattices
Sort
View
ASIACRYPT
2010
Springer
13 years 6 months ago
Lattice-Based Blind Signatures
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
Markus Rückert
DAM
2002
96views more  DAM 2002»
13 years 8 months ago
The structure of stable marriage with indifference
We consider the stable marriage problem where participants are permitted to express indifference in their preference lists (i.e., each list can be partially ordered). We prove tha...
David Manlove
ACS
2007
13 years 8 months ago
More on Configurations in Priestley Spaces, and Some New Problems
Abstract. Prohibiting configurations (≡ induced finite connected posets) in Priestley spaces and properties of the associated classes of distributive lattices, and the related ...
Richard N. Ball, Ales Pultr, Jirí Sichler