=== 2012 ===

  * [[http://www.cse.yorku.ca/~franck|Franck van Breugel]]. On behavioural pseudometrics and closure ordinals. //Information Processing Letters//, 112(19): 715-718, 2012.

  * Arkadev Chattopadhyay, [[http://www.cse.yorku.ca/~jeff|Jeff Edmonds]], Faith Ellen, and Toniann Pitassi.  A little advice can be very helpful.  In //Proc. ACM-SIAM Symposium on Discrete Algorithms//, 2012.

  * Di Chen, [[http://www.cse.yorku.ca/~franck|Franck van Breugel]], James Worrell.  On the Complexity of Computing Probabilistic Bisimilarity.  In //Proc. 15th International Conference on Foundations of Software Science and Computational Structures//, 2012.

  * Elise Cormie-Bowins, [[http://www.cse.yorku.ca/~franck|Franck van Breugel]].  Measuring Progress of Probabilistic LTL Model Checking. In //Proc. 10th Workshop on Quantitative Aspects of Programming Languages and Systems//, 2012.

  * [[http://www.cse.yorku.ca/~jeff|Jeff Edmonds]]. On the Competitiveness of AIMD-TCP within a General Network. //Theoretical Computer Science// 462: 12-22, 2012.

  * [[http://www.cse.yorku.ca/~jeff|Jeff Edmonds]], Kirk Pruhs. Scalably scheduling processes with arbitrary speedup curves. //ACM Transactions on Algorithms//, 8(3): 28, 2012.

  * [[http://www.cse.yorku.ca/~gt|George Tourlakis]], //Theory of Computation//, John Wiley and Sons, 2012.

  * Hui Wang, Michael Jenkin, [[http://www.cse.yorku.ca/~patrick|Patrick W. Dymond]]. Enhancing Exploration in Topological Worlds with Multiple Immovable Markers. In //Proc. 9th Conference on Computer and Robot Vision//, 2012.