709 search results - page 76 / 142 » On LR(k)-Parsers of Polynomial Size |
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We design and analyze an on-line reordering buffer management algorithm with improved O log k log log k competitive ratio for non-uniform costs, where k is the buffer size. This i...
ALT
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We describe an alternative construction of an existing canonical representation for definite Horn theories, the Guigues-Duquenne basis (or GD basis), which minimizes a n...
CTRSA
2010
Springer
15 years 4 months ago
2010
Springer
At ches 2009, Coron, Joux, Kizhvatov, Naccache and Paillier (cjknp) exhibited a fault attack against rsa signatures with partially known messages. This attack allows factoring the ...
149
click to vote
WIA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. State elimination is an intuitive and easy-to-implement algorithm that computes a regular expression from a finite-state automaton (FA). The size of a regular expression...