Kevin O'Neill

Recent

Last semester I was the TA for CS513: System Security.

In 2005 I was an intern at Google in Mountain View, California.

In 2004 and 2005 I taught CS113: Introduction to C Programming.

Research

In my undergraduate thesis work at The University of British Columbia, I studied stochastic search methods for dynamic satisfiability problems. I got to work with really great people like Holger Hoos, Alan Mackworth, and David Poole.

I also did some actual hacking while I was at UBC: check out CIspace, a set of on-line applets for teaching people about artificial intelligence.

I spent the summer of 2002 as an intern at the Palo Alto Research Center.

Want to find all the maximal cliques or maximal independent sets of a given graph or matrix? I implemented the classic algorithm of Tsukiyama, Ide, Ariyoshi, and Shirakawa. The C implementation can be found here. (To former CS113 students, I apologize for the use of fscanf!) The source code is copyrighted under the terms of the GNU General Public License. Copyright © 2003 Kevin O'Neill.

Publications:

Copyright Notice

• Selectively Traceable Anonymity
  • Authors: Luis von Ahn, Andrew Bortz, Nicholas Hopper, and Kevin O'Neill
    
  • Conference version: to appear, PET 2006. (pdf, ps,)
• Information-Flow Security for Interactive Programs
  • Authors: Kevin O'Neill, Michael Clarkson, and Stephen Chong
    
  • Conference version: to appear, CSFW 2006. (pdf, ps)
  • Full version: Cornell University Technical Report TR2006-2022. (pdf, ps)
  • Slides from the CSFW talk: (pdf)
• Relative Character-State Space, Amount of Potential Phylogenetic Information, and Heterogeneity of Nucleotide and Amino Acid Characters
  • Authors: Mark Simmons, Timothy Carr, and Kevin O'Neill
    
  • Full version: Molecular Phylogenetics and Evolution, 32, 2004, pp. 913-926 (ScienceDirect)
• Anonymity and Information Hiding in Multiagent Systems
  • Authors: Joseph Halpern and Kevin O'Neill
    
  • Conference version: in Proceedings of the 16th IEEE Computer Security Foundations Workshop, 2003, pp. 75-88 (pdf, ps)
  • Full version: Journal of Computer Security 13:3, 2005, pp. 483-514 (pdf, ps)
  • Slides from the CSFW talk: (pdf)
• Secrecy in Multiagent Systems
  • Authors: Joseph Halpern and Kevin O'Neill
    
  • Conference version: in Proceedings of the 15th IEEE Computer Security Foundations Workshop, 2002, pp. 32-46 (pdf, ps)
  • Full version: submitted for publication, December 2005 (pdf, ps)
• Stochastic Local Search Methods for Dynamic SAT--an Initial Investigation
  • Authors: Holger Hoos and Kevin O'Neill
  • Workshop version: in AAAI-2000 Workshop "Leveraging Probability and Uncertainty in Computation", 2000, pp. 22-26 (pdf, ps)

Links