11066 search results - page 171 / 2214 » Linearity in Process Languages |
120
Voted
IR
2012
13 years 10 months ago
2012
ICALP
1997
Springer
15 years 6 months 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....
89
Voted
LOGCOM
2000
15 years 2 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...
77
Voted
TSD
2005
Springer
15 years 8 months ago
2005
Springer
