731 search results - page 85 / 147 » Reductions to Graph Isomorphism |
LCTRTS
2009
Springer
14 years 3 months ago
2009
Springer
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting aft...
COCOON
2001
Springer
14 years 1 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
TLCA
2009
Springer
14 years 3 months ago
2009
Springer
Taha and Nielsen have developed a multi-stage calculus λα with a sound type system using the notion of environment classifiers. They are special identifiers, with which code fr...
FPL
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. Data dependent circuits are logic circuits specialized to specific input data. They are smaller and faster than the original circuits, although they are not reusable and...
ICCSA
2004
Springer
14 years 2 months ago
2004
Springer
The algorithmic techniques which allow high efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges are ...