2924 search results - page 277 / 585 » Lower Bounds in Distributed Computing |
144
Voted
COORDINATION
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We show how to extend a coordination language with support for aspect oriented programming. The main challenge is how to properly deal with the trapping of actions before...
134
Voted
DATE
2004
IEEE
15 years 8 months ago
2004
IEEE
Performance analysis has many advantages in theory compared to simulation for the validation of complex embedded systems, but is rarely used in practice. To make analysis more att...
142
Voted
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
139
click to vote
ALGORITHMICA
1998
15 years 3 months ago
1998
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
147
click to vote
GD
2008
Springer
15 years 5 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...