The concept of distributed air-to-air separation assurance envisions aircraft detecting and resolving conflicts autonomously without the need for a ground based air traffic service provider. Current automated conflict resolution algorithms that assume instantaneous heading changes without consideration of turn dynamics can result in unintentional loss of separation. A simulation of distributed conflict resolutions is used to evaluate a recently developed algorithm that implements realistic turn dynamics, i.e., without assuming instantaneous heading changes. In particular, the algorithm incorporates turn dynamics to resolve pair-wise, horizontal conflicts at close ranges. Examples of resolution trajectories generated by the separation assurance algorithm are shown. Data on the performance of this algorithm is extracted from the simulation. More importantly, analysis of these results indicates a need for coordination and communication between conflicting aircraft in order to guarantee a high level of safety in a distributed air-to-air separation assurance environment. = Minimum distance achieved during the entire maneuver. This may occur during the turn, at the end of the turn, or in the straight-line segment beginning at the end of the turn