2016 search results - page 99 / 404 » Megamaps: Construction and Examples |
140
click to vote
PPOPP
2012
ACM
14 years 8 days ago
2012
ACM
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
140
click to vote
MKM
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We present a computational origami construction of Morley’s triangles and automated proof of correctness of the generalized Morley’s theorem in a streamlined process ...
130
click to vote
ICALP
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. In this paper we investigate automated methods for externalizing internal memory data structures. We consider a class of balanced trees that we call weight-balanced parti...
162
click to vote
CRYPTO
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Let A and B denote cryptographic primitives. A (k, m)robust A-to-B combiner is a construction, which takes m implementations of primitive A as input, and yields an implem...
155
Voted
FINTAL
2006
15 years 8 months ago
2006
Abstract. Every language employs its own coordination strategies, according to the type of coordinating marking, the pattern of marking, the position of the marker, and the phrase ...