2069 search results - page 55 / 414 » Linear time algorithms for Clobber |
160
click to vote
HIPC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Linear scan register allocation is an attractive register allocation algorithm because of its simplicity and fast running time. However, it is generally felt that linear ...
189
click to vote
STOC
1999
ACM
15 years 8 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
129
click to vote
SAS
2004
Springer
15 years 9 months ago
2004
Springer
We describe data structures and algorithms for performing a path-sensitive program analysis to discover equivalences of expressions involving linear arithmetic or uninterpreted fun...
107
Voted
DAM
2008
15 years 3 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...
122
Voted
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...