Patrick K. Nicholson
About Me
I started my PhD in computer science at the University of Waterloo in the Spring term of 2009. My supervisor is Ian Munro, and I am working in the area of algorithms and complexity theory. My main research interests are space-efficient (succinct) data structures and computational geometry.
Projects and Internships
- Optimal Data Structures for Organization and Retrieval of Spatial Data, Participating Graduate Researcher
- Cisco Graduate Internship Program, San Jose, California (S08)
Selected Publications
Complete list (DBLP)- Amr Elmasry, Meng He, J. Ian Munro, and Patrick K. Nicholson
Dynamic Range Majority Data Structures
In Proc. International Symposium on Algorithms and Computation (ISAAC 2011). Early Draft on arXiv from April 28th, 2011. - Travis Gagie, Meng He, J. Ian Munro, and Patrick K. Nicholson.
Finding Frequent Elements in Compressed 2D Arrays and Strings
In Proc. The 18th International Symposium on String Processing and Information Retrieval (SPIRE 2011).
- Stephane Durocher, Meng He, J. Ian Munro, Patrick K. Nicholson, and Matthew Skala.
Range Majority in Constant Time and Linear Space
In Proc. The 38th International Colloquium on Automata, Languages and Programming (ICALP 2011). Accepted to a special issue of Information and Computation for ICALP 2011.
Software
- Reptile Playground: An interactive program for creating and displaying substitution tilings.
- JPDFNum: A program for inserting page numbers into a PDF
- Some Perl one-liners:
- Very simple continued fraction calculator
- Script to convert a dat file into a latex table: dat2latextable