4315 search results - page 137 / 863 » Sorting in linear time |
DATE
2007
IEEE
14 years 3 months ago
2007
IEEE
— We present a waveform based variational static timing analysis methodology. It is a timing paradigm that lies midway between convention static delay approximations and full dyn...
ICCS
2005
Springer
14 years 2 months ago
2005
Springer
This paper proposes an innovative algorithm to find the two’s complement of a binary number. The proposed method works in logarithmic time (O(logN)) instead of the worst case li...
SIROCCO
1998
13 years 10 months ago
1998
We consider broadcasting on asynchronous anonymous totally unoriented Nnode hypercubes. First we generalize a technique, introduced in 3 , for partial broadcasting and orientation...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been ...
ICCS
2009
Springer
14 years 3 months ago
2009
Springer
This paper introduces a three and a four order explicit time stepping method. These methods have high stage order and favorable monotonicity properties. The proposed methods are ba...