730 search results - page 41 / 146 » Combinatorics of Monotone Computations |
COCOON
2006
Springer
14 years 13 days ago
2006
Springer
We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a ...
RTA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...
COMBINATORICS
2007
13 years 8 months ago
2007
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
COCOON
2001
Springer
14 years 1 months ago
2001
Springer
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...
SIGMOD
2007
ACM
14 years 8 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...