709 search results - page 61 / 142 » On LR(k)-Parsers of Polynomial Size |
FOCS
1998
IEEE
15 years 2 months ago
1998
IEEE
The properties of any system of k simultaneous equations in n variables over GF(q), are studied, with a particular emphasis on unsatisfiable systems. A general formula for the num...
103
click to vote
CAAP
1992
15 years 2 months ago
1992
We extend results about heights of random trees (Devroye, 1986, 1987, 1998b). In this paper, a general split tree model is considered in which the normalized subtree sizes of node...
102
click to vote
ACNS
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. Rule-based packet classification plays a central role in network intrusion detection systems such as Snort. To enhance performance, these rules are typically compiled int...
CONCUR
2000
Springer
15 years 1 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
SPIN
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. In this article, we address the problem of statically determining an approximation of the communication topology of concurrent programs. These programs may contain dynami...