The following list provides some examples of papers published this year that I think would be good ones to present, but you are free to find others.  If you need help choosing a paper, you can come talk to me.  Once you have selected a paper, email me.
<UL>
<LI>
  <a href="http://dx.doi.org/10.1145/2755573.2755604">Sorting with asymmetric read and write costs</a>
<LI>
<a href="http://dx.doi.org/10.1007/978-3-662-53426-7_22">k-abortable objects:  progress under high contention</a>
<LI>
<a href="http://dx.doi.org/10.1007/978-3-662-53426-7_2">Deterministic leader election in O(D+log n) time with messages of size O(1)</a>
<LI>
<a href="http://dx.doi.org/10.1007/978-3-662-53426-7_28">Priority mutual exclusion:  specification and algorithm</a>
<LI>
<a href="http://dx.doi.org/10.1016/j.jpdc.2016.06.007">Fair synchronization</a>
<LI>
<a href="http://dx.doi.org/10.1145/2897518.2897565">A tight space bound for consensus</a>
<LI>
<a href="http://dx.doi.org/10.1145/2933057.2933087">Recoverable mutual exclusion</a>
<LI>
<a href="http://dx.doi.org/10.1145/2933057.2933108">A randomized concurrent algorithm for disjoint set union</a>
<LI>
<a href="http://dx.doi.org/10.1145/2933057.2933083">Optimal dynamic distributed MIS</a>
<LI>
<a href="http://dx.doi.org/10.1007/s00446-016-0272-0">The computability of relaxed data structures: queues and stacks as examples</a>
<LI>
  <a href="http://dx.doi.org/10.1145/2933057.2933113"> A complexity-based hierarchy for multiprocessor synchronization</a>
</UL>