9532 search results - page 266 / 1907 » Logic, Graphs, and Algorithms |
131
click to vote
GLVLSI
2006
IEEE
16 years 9 days ago
2006
IEEE
This paper presents a systematic design methodology for yield enhancement of asynchronous logic circuits using 3-D (3-Dimensional) integration technology. In this design, the targ...
142
click to vote
ICALP
1994
Springer
15 years 10 months ago
1994
Springer
We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k 2, there is an O(V 2) time algorithm that decide...
143
Voted
STOC
1990
ACM
15 years 10 months ago
1990
ACM
a 3-dimensions a separator size where is the ber of 3-simplexes in and is the number of ization of the separator results for planar graphs, such as the and Tarjan planar separator...
193
click to vote
CPHYSICS
2011
14 years 9 months ago
2011
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
165
click to vote
CADE
2001
Springer
15 years 10 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...