709 search results - page 109 / 142 » On LR(k)-Parsers of Polynomial Size |
111
click to vote
FSTTCS
1993
Springer
15 years 1 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
104
click to vote
CCS
2007
ACM
15 years 1 months ago
2007
ACM
Administrative RBAC (ARBAC) policies specify how Role-Based Access Control (RBAC) policies may be changed by each administrator. It is often difficult to fully understand the effe...
COCO
2010
Springer
15 years 1 months ago
2010
Springer
We present a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programmi...
FCT
2009
Springer
15 years 1 months ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
ASWEC
2004
IEEE
15 years 1 months ago
2004
IEEE
Network protocol implementations are susceptible to problems caused by their lack of ability to handle invalid inputs. We present ASPIRE: Automated Systematic Protocol Implementat...