1383 search results - page 268 / 277 » On the Complexity of the Interlace Polynomial |
73
Voted
CSR
2006
Springer
15 years 3 months ago
2006
Springer
We show that two equivalent K-automata are conjugate to a third one, when K is equal to B, N, Z, or any (skew) field and that the same holds true for functional tranducers as well....
126
click to vote
EUROCRYPT
2000
Springer
15 years 3 months ago
2000
Springer
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
98
Voted
FLAIRS
2008
15 years 2 months ago
2008
Children are facile at both discovering word boundaries and using those words to build higher-level structures in tandem. Current research treats lexical acquisition and grammar i...
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
107
click to vote
COMPGEOM
2008
ACM
15 years 1 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...