973 search results - page 49 / 195 » New Bounds on Crossing Numbers |
CPM
2008
Springer
15 years 1 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
RV
2009
Springer
15 years 6 months ago
2009
Springer
Synthesizing monitor circuits for LTL formulas is expensive, because the number of flip-flops in the circuit is exponential in the length of the formula. As a result, the IEEE st...
FOCS
2005
IEEE
15 years 5 months ago
2005
IEEE
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary’s quantum memory is of bounded size. We show that oblivious ...
133
click to vote
COCO
1997
Springer
15 years 4 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
SIAMCOMP
2008
14 years 10 months ago
2008
We initiate the study of two-party cryptographic primitives with unconditional security, assuming that the adversary's quantum memory is of bounded size. We show that oblivio...