1423 search results - page 227 / 285 » Languages of Nested Trees |
167
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
128
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
109
click to vote
LICS
2009
IEEE
15 years 11 months ago
2009
IEEE
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
134
click to vote
IFIP
2009
Springer
15 years 10 months ago
2009
Springer
New Internet services and technologies call for higher packet switching capacities in the core network. Thus, a performance bottleneck arises at the backbone routers, as forwarding...
120
click to vote
OOPSLA
2009
Springer
15 years 10 months ago
2009
Springer
Side effects are both the essence and bane of imperative programming. The programmer must carefully coordinate actions to manage their side effects upon each other. Such coordinat...