This paper studies non-crossing geometric perfect matchings. Two such perfect matchings are compatible if they have the same vertex set and their union is also non-crossing. Our f...
Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu,...
Abstract. We commonly use the experience of others when taking decisions. Reputation mechanisms aggregate in a formal way the feedback collected from peers and compute the reputati...
In Service Oriented Architecture (SOA), the need for inter-service compatibility analysis has gone beyond what existing service composition/ verification approaches can handle. Giv...
Pair programming has been shown to be beneficial for both students and teaching staff in university courses. A two-phased study of 1350 students was conducted at North Carolina St...
Laurie Williams, Lucas Layman, Jason Osborne, Neha...
We present an interprocedural and compositional algorithm for finding pairs of compatible allocation sites, which have the property that no object allocated at one site is live at...
Ovidiu Gheorghioiu, Alexandru Salcianu, Martin C. ...