## Associate Professor of Practice

I graduated from the University of Nebraskaâ€“Lincoln with a PhD in Computer Science in 2008. My research interests include Computational Complexity Theory and Machine Learning. I have been involved in the development of several software projects and have a strong interest in web development. I primarily teach introductory level Computer Science courses (CS1, CS2, Discrete Mathematics). I am also the Director of the CSE Honors Program and an Undergraduate Advisor for Computer Science and Computer Engineering students.

### My Schedule

## Teaching

- You can clone via GitHub,
`chdir`

to your`public_html`

directory and execute:

`git clone https://github.com/cbourke/grade`

We have produced an introductory video for instructors and teaching assistants. - Computer Science I - A draft of my text book for Computer Science I, covering CS1 topics in a generic manner using psuedocode with supplemental parts for specific languages (including Java, C, and PHP currently).
- Computer Science II - Draft book for material from CSCE 156 - Computer Science II
- Computer Science III - Lecture notes used in CSCE 310 - Data Structures
- Trees - Lecture notes on Tree data structures and algorithms
- Searching & Sorting - Lecture Notes on searching & sorting
- Cryptography & Security - Lecture notes on Cryptography and security used in CSCE 477/877
- Git Tutorial

#### Fall 2017

- CSCE 120 – Learning to Code
- CSCE 155H – Computer Science II – Honors
- RAIK 183H – Honors: Software Development Essentials

#### Prior Teaching

- Spring 2018 - CSCE 155E, CSCE 235, CSCE 496 (Exploring Virtual Reality)
- Fall 2017 - CSCE 120, CSCE 155H, RAIK 183H
- Summer 2017 - CSCE 310
- Spring 2017 - CSCE 156, CSCE 156H, RAIK 184H, CSCE 496 (Exploring Virtual Reality)
- Fall 2016 - CSCE 120, CSCE 155H, RAIK 183H
- Summer 2016 - CSCE 235, CSCE 310
- Spring 2016 - CSCE 156H, CSCE 235H, RAIK 184H
- Fall 2015 - CSCE 120, CSCE 155H, RAIK 183H
- Summer 2015 - CSCE 235, 310
- Spring 2015 - CSCE 156H, 235H, RAIK 184H
- Fall 2014 - CSCE120, 155E, 155H, 477/877
- Summer 2014 - CSCE 235, CSCE 310
- Spring 2014 - CSCE 155E, CSCE 156, CSCE 156H, CSCE 235, CSCE 235H
- Fall 2013 - CSCE 155H, CSCE 156, CSCE 235
- Summer 2013 - CSCE 235, 310
- Spring 2013 - CSCE 155E, CSCE 156, CSCE 156H, CSCE 235H
- Fall 2012 - CSCE 155E, CSCE 155H, CSCE 156, CSCE 235
- Summer 2012 - CSCE 235, 310
- Spring 2012 - CSCE 155E, CSCE 156, CSCE 235H
- Fall 2011 - CSCE 156, CSCE 235

## Publications

[1] |
Chris Bourke.
Finite-state dimension of individual sequences.
Master's thesis, University of Nebraska-Lincoln, May 2004. |

[2] |
Chris Bourke, John M. Hitchcock, and N. V. Vinodchandran.
Entropy rates and finite-state dimension.
Theoretical Computer Science, 349(3):392-406, 2005.[ .pdf ] |

[3] |
Deng Kun, 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).[ .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.[ .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. [ .pdf ] |

[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), pages 463-468, 2007.[ .pdf ] |

[7] |
Chris Bourke, Kun Deng, Stephen D. Scott, Robert E. Schapire,
and N. V.
Vinodchandran.
On reoptimizing multi-class classifiers.
Machine Learning, 71(2-3):219-242, June 2008.[ .pdf ] |

[8] |
Chris Bourke, Raghunath Tewari, and N. V. Vinodchandran.
Directed planar reachability is in unambiguous log-space.
ACM Transactions on Computation Theory, page To Appear,
2008.[ .pdf ] |

[9] |
Derrick Stolee, Chris Bourke, and N. V. Vinodchandran.
"A log-space algorithm for reachability in planar acyclic digraphs with
few sources", 25th Annual IEEE Conference on Computational Complexity,
June 2010 |

## Useful Stuff

#### Coding Stuff

#### Computational Complexity

- complexity (latest version is .80, 04/12/07) is a LaTeX package that defines (almost) every Computational Complexity Class with options to easily change fonts. 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/
- ECCC
- Complexity Zoo

#### Misc.

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

#### CSS

#### JavaScript

#### LaTeX

- 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 (v0.7 .zip)

#### LaTeX - Beamer

Beamer is a LaTeX class with which you can create beautiful PDF slides.

- Beamer Homepage - http://sourceforge.net/projects/latex-beamer/
- UNL Beamer Theme
- Useful Scripts
- makehandout - a script to create 2x6 handout pages of your slides interleaved with "note" pages. Requires PDFjam.
- 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.

Dr. Chris Bourke

Assistant Professor of Practice

363 Avery Hall

Department of Computer Science
& Engineering

University of
Nebraska-Lincoln

Lincoln, NE
58588-0115

cbourke@cse.unl.edu

(402) 472-5008 (voice)

(402) 472-7767 (fax)

### Resources

- Curriculum Vitae
- Anonymous Email
- Join me on GitHub
- I've been blogging!