Skip Jordan (= Charles Jordan) Laboratory for Algorithmics Division of Computer Science Graduate School of Information Science and Technology Hokkaido University North-14, West-9 Sapporo, 060-0814 JAPAN Office: Building 21, 8th Floor, Room 8-14 Phone/Fax: +81-11-706-7675 skip at ist.hokudai.ac.jp

• Master of Information Science and Technology in Computer Science, Hokkaido University, 2009.
  
• B.S. in Computer Science, University of Massachusetts-Amherst, 2005.
  
• B.A. in Japanese Language and Literature, University of Massachusetts-Amherst, 2005.

• Untestable Properties in the Kahr-Moore-Wang Class. [pdf]
  Charles Jordan and Thomas Zeugmann. In Logic, Language, Information and Computation, 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 2011, Proceedings, (Lev D. Beklemishev and Ruy de Queiroz, Eds.), Lecture Notes in Artificial Intelligence 6642, pp. 176 - 186, Springer 2011.
  
  
• A Note on the Testability of Ramsey's Class. [pdf]
  Charles Jordan and Thomas Zeugmann. In Theory and Applications of Models of Computation, 7th International Conference, TAMC 2010, Prague, Czech Republic, June 2010, Proceedings, (Jan Kratochvíl, Angsheng Li, Jiří Fiala and Petr Kolman, Eds.), Lecture Notes in Computer Science 6108, pp. 296 - 307, Springer 2010.
  
  
• Untestable Properties Expressible with Four First-Order Quantifiers. [pdf]
  Charles Jordan and Thomas Zeugmann. In Language and Automata Theory and Applications, 4th International Conference, LATA 2010, Trier, Germany, May 2010, Proceedings, (Adrian-Horia Dediu, Henning Fernau and Carlos Martín-Vide, Eds.), Lecture Notes in Computer Science 6031, pp. 333 - 343, Springer 2010.
  This is a conference version (improved but shorter) of the following technical report.
  
  
• Contributions to the Classification for Testability: Four Universal and One Existential Quantifier. [pdf]
  Charles Jordan and Thomas Zeugmann. Technical Report TCS-TR-A-09-39, Hokkaido University, Division of Computer Science, November 2009.
  
  
• Relational Properties Expressible with One Universal Quantifier Are Testable. [pdf]
  Charles Jordan and Thomas Zeugmann. In Stochastic Algorithms: Foundations and Applications, 5th International Symposium, SAGA 2009, Sapporo, Japan, October 2009, Proceedings, (Osamu Watanabe and Thomas Zeugmann, Eds.), Lecture Notes in Computer Science 5792, pp. 141 - 155, Springer 2009.
  
  
• The Classification Problem in Relational Property Testing. [ps.gz]
  Charles Harold JORDAN. Master's Thesis, February 16, 2009.
  This is also available as a technical report.
  
  
• Indistinguishability and First-Order Logic. [pdf]
  Skip Jordan and Thomas Zeugmann. In Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 2008, Proceedings, (Manindra Agrawal, Dingzhu Du, Zhenhua Duan and Angsheng Li, Eds.), Lecture Notes in Computer Science 4978, pp. 94 - 104, Springer 2008.

• Recent Progress in the Classification for Testability.
  Charles Jordan and Thomas Zeugmann. Summary of short talk at LICS 2011, Toronto, June 2011. Audio and slides are also available, thanks to the Fields Institute.

I TAed Theory of Computation (3rd year undergraduates) in 2008.

Public key
Here are two (ElG and RSA) PGP public keys for me.