Chris Bourke's Home Page

Chris Bourke Ph.D. Candidate Curriculum Vitae My Schedule Department of Computer Science & Engineering University of Nebraska-Lincoln Lincoln, NE 68588-0115 Office: 123C Avery Hall Phone: (402) 472-4679 Fax: (402) 472-7767 Email: cbourke@cse.unl.edu

Image Generated by University of St. Andrew's Perceptron Laboratory

• Fall 2008 - CSE 310 Data Structures & Algorithms
• Spring 2008 - CSE 251k Introduction to C Programming
• Fall 2007 - CSE 235 Introduction to Discrete Mathematics
• Spring 2006 - CSE 235 Introduction to Discrete Mathematics
• Fall 2005 - CSE 235 (Lecturer)
• Summer 2004 - CSE 310 (Lecturer)

[1]	Chris Bourke. Finite-state dimension of individual sequences. Master's thesis, University of Nebraska-Lincoln, May 2004. [ bib | .ps | .pdf ]
[2]	Chris Bourke, John M. Hitchcock, and N. V. Vinodchandran. Entropy rates and finite-state dimension. Theoretical Computer Science, 349(3):392-406, 2005. [ bib | .ps | .pdf ]
[3]	Kun Deng, Chris Bourke, Stephen Scott, and N. V. Vinodchandran. New algorithms for optimizing multi-class classifiers via ROC surfaces. In Proceedings of the 3rd International Workshop ROC Analysis in Machine Learning (ROCML-2006), pages 17-24, June 2006. Held within the 23rd International Conference on Machine Learning (ICML'06). [ bib | .ps | .pdf ]
[4]	Chris Bourke, Raghunath Tewari, and N. V. Vinodchandran. Directed planar reachability is in unambiguous log-space. In Proceedings of the 22nd Annual IEEE Conference on Computational Complexity, pages 217-221, 2007. [ bib | .ps | .pdf ]
[5]	Chris Bourke. A note on the karp-lipton collapse for the exponential hierarchy. Technical Report UNL-CSE-2007-0004, University of Nebraska-Lincoln, 2007. [ bib ]
[6]	Deng Kun, Chris Bourke, Stephen Scott, Julie Sunderman, and Yaling Zheng. Bandit-based algorithms for budgeted learning. In Proceedings of IEEE International Conference on Data Mining (ICDM), page To Appear, 2007. [ bib | .ps | .pdf ]
[7]	Chris Bourke, Kun Deng, Stephen D. Scott, Robert E. Schapire, and N. V. Vinodchandran. On reoptimizing multi-class classifiers. Technical Report #TR-UNL-CSE-2006-0017, University of Nebraska-Lincoln, 2006. Under journal review for Machine Learning. [ bib | .ps | .pdf ]

• complexity (complexity.tar.gz) - complexity (newest version is .80, 04/12/07) is a LaTeX package that defines (almost) every Computational Complexity Class with options to easily specify fonts to typeset them in You can download the documentation (.pdf) by itself. Its also available on CTAN in the directory www.ctan.org/tex-archive/macros/latex/contrib/complexity/
• ComplexityZoo (.pdf) -- a LaTeXed version of the website ComplexityZoo.com by Scott Aaronson using the complexity LaTeX package. You can also download the TeX source files: ComplexityZoo.tar.gz
• ECCC
• BEATCS
• Atlantic Theory Seminar
• Complexity Zoo
• MathWorld
• Wikipedia

• Electric Sheep fractal screen saver
• Blatte's Fractal Art
• MOSS - Measure Of Software Similarity, a software plagarism detector

• Getting Started with LaTeX
• TeX Users Group
• The Not So Short Introduction to LaTeX 2e (.pdf)
• BibTeX Help
• CTAN.org - THE source for LaTeX software and packages
• MiKTeX.org - MiKTeX is a free windows distribution of latex
• WinEDT.com - WinEDT is the BEST windows front-end LaTeX editor
• UNL Thesis Document Class (.zip)

Beamer is a LaTeX class with which you can create beautiful PDF slides with more functionality than even Power Point!

• Beamer Homepage - http://sourceforge.net/projects/latex-beamer/
• UNL Beamer Theme
  • Style File (.sty)
  • UNL Logo (.pdf)
  • Example (.pdf, .tex)
• Useful Scripts
  • makehandout - a script to create 2x6 handout pages of your slides interleaved with "note" pages. Requires pdfnup.
  • Note Slide (.pdf, .tex) - The necessary pdf (and tex source) for the note slides.
  • Extract PGF (extractpgf) A script that extracts each tikzpicture environment to its own pdf file.
• PGF/TikZ - Beamer's companion package to create graphcis
• fauskes.net - A nice list of resources for PGF/TikZ