13603 search results - page 202 / 2721 » On the Complexity of Computing Treelength |
145
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing ma...
141
click to vote
FCT
2005
Springer
15 years 10 months ago
2005
Springer
We review a recently introduced computation model for streaming and external memory data. An important feature of this model is that it distinguishes between sequentially reading (...
158
click to vote
ECOOPW
1999
Springer
15 years 8 months ago
1999
Springer
Impact analysis is seen as an important technique for controlling the evolution of software systems. Numerous approaches have been proposed which aim to assess the impact of chang...
111
click to vote
MFCS
1993
Springer
15 years 8 months ago
1993
Springer
We prove (for fixed k) that at least 1 k−1 (n 2 ) − O(n) equality tests and no more than 2 k (n 2 )+O(n) equality tests are needed in the worst case to determine whether a giv...
221
click to vote
GI
2007
Springer
15 years 8 months ago
2007
Springer
Abstract: Modeling systems with Statecharts has become standard practice in the design of reactive embedded devices. However, the modeling of realistic applications with the paradi...