2069 search results - page 50 / 414 » Linear time algorithms for Clobber |
142
click to vote
PLDI
1994
ACM
15 years 8 months ago
1994
ACM
In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flo...
224
click to vote
PC
2011
14 years 10 months ago
2011
This paper addresses the problem of minimizing the average running time of the Las Vegas type algorithm, both in serial and parallel setups. The necessary conditions for the exist...
106
click to vote
WIA
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. LR parsers have long been known as being an efficient algorithm for recognizing deterministic context
118
Voted
ENTCS
2008
15 years 3 months ago
2008
This paper considers QLtl, a quantitative analagon of Ltl and presents algorithms for model checking QLtl over quantitative versions of Kripke structures and Markov chains.
154
click to vote
TAMC
2010
Springer
15 years 2 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...