3653 search results - page 218 / 731 » On Recognizable Timed Languages |
156
click to vote
APLAS
2006
ACM
15 years 9 months ago
2006
ACM
Abstract. Fast dynamic compilers trade code quality for short compilation time in order to balance application performance and startup time. This paper investigates the interplay o...
142
Voted
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
222
click to vote
ICALP
1995
Springer
15 years 9 months ago
1995
Springer
The problem to determine whether a given k-colored graph is a subgraph of a properly colored interval graph has an application in DNA physical mapping. In this paper, we study the...
147
click to vote
ANLP
2000
15 years 6 months ago
2000
We compare the asymptotic time complexity of left-to-right and bidirectional parsing techniques for bilexical context-free grammars, a grammar formalis an abstraction of language ...
147
click to vote
PAAPP
2002
15 years 5 months ago
2002
We demonstrate that the run time of implicitly parallel programs can be statically predicted with considerable accuracy when expressed within the constraints of a skeletal, shapel...