Sciweavers

281 search results - page 43 / 57
» Primitive words and roots of words
Sort
View
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
14 years 4 months ago
Fully-Functional Succinct Trees
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
Kunihiko Sadakane, Gonzalo Navarro
ECTEL
2007
Springer
14 years 1 months ago
Role Based Access Control for the Interaction with Search Engines
Search engine-based features are a basic interaction mean for users to find information inside a Web-based Learning Management Systems (LMS); nonetheless, traditional solutions la...
Alessandro Bozzon, Tereza Iofciu, Wolfgang Nejdl, ...
ASIACRYPT
2005
Springer
14 years 1 months ago
Spreading Alerts Quietly and the Subgroup Escape Problem
We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has n...
James Aspnes, Zoë Diamadi, Kristian Gjø...
AES
2004
Springer
151views Cryptology» more  AES 2004»
14 years 28 days ago
General Principles of Algebraic Attacks and New Design Criteria for Cipher Components
This paper is about the design of multivariate public key schemes, as well as block and stream ciphers, in relation to recent attacks that exploit various types of multivariate alg...
Nicolas Courtois
STACS
2004
Springer
14 years 26 days ago
Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models
Motivated by problems of pattern statistics, we study the limit distribution of the random variable counting the number of occurrences of the symbol a in a word of length n chosen...
Alberto Bertoni, Christian Choffrut, Massimiliano ...