11066 search results - page 171 / 2214 » Linearity in Process Languages |
IR
2012
12 years 3 months ago
2012
ICALP
1997
Springer
14 years 14 days ago
1997
Springer
We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth≤ k and, if so, outputs a branch decomposition of minimum width....
LOGCOM
2000
13 years 8 months ago
2000
Several calculi of objects have been studied in the recent literature, that support the central features of object-based languages: messages, inheritance, dynamic dispatch, object...
TSD
2005
Springer
14 years 1 months ago
2005
Springer
ELSNET
2000
13 years 12 months ago
2000
