882 search results - page 63 / 177 » On self-embeddings of computable linear orderings |
PPL
2000
14 years 9 months ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
SIAMCOMP
1998
14 years 9 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We give a forbidden substructure characterization of set families that have the consecutive-ones property, and a linear time algorithm to find the forbidden substructure if a set ...
DAM
2007
14 years 10 months ago
2007
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
JSCIC
2006
2006
Optimal Strong-Stability-Preserving Time-Stepping Schemes with Fast Downwind Spatial Discretizations
14 years 10 months ago
In the field of strong-stability-preserving time discretizations, a number of researchers have considered using both upwind and downwind approximations for the same derivative, in...