4315 search results - page 39 / 863 » Sorting in linear time |
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract-- We consider here the problem of finding a controller such that when interconnected to the plant, we obtain a system which is asymptotically equivalent to a desired syste...
FOSSACS
2011
Springer
12 years 11 months ago
2011
Springer
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
ICALP
1997
Springer
13 years 11 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....
DAM
2008
13 years 7 months ago
2008
For each constant k, we present a linear time algorithm that, given a planar graph G, either finds a minimum odd cycle vertex transversal in G or guarantees that there is no transv...
APLAS
2005
ACM
14 years 1 months ago
2005
ACM
act Interpretation Perspective on Linear vs. Branching Time Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy It is...