589 search results - page 101 / 118 » Matching Concavity Trees |
83
Voted
ICALP
1994
Springer
15 years 1 months ago
1994
Springer
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
FOCS
1992
IEEE
15 years 1 months ago
1992
IEEE
The main purpose of this paper is to promote the study of computational aspects, primarily the convergence rate, of nonlinear dynamical systems from a combinatorial perspective. W...
115
click to vote
CASES
2007
ACM
15 years 1 months ago
2007
ACM
With increasing complexity of modern embedded systems, the availability of highly optimizing compilers becomes more and more important. At the same time, application specific inst...
CAAN
2006
Springer
15 years 1 months ago
2006
Springer
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping ...
95
Voted
IPPS
2000
IEEE
15 years 1 months ago
2000
IEEE
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...