Mitchell Jones

PhD Candidate & Research Assistant
Working with Sariel Har-Peled
Algorithms and Theory Group
Department of Computer Science
University of Illinois at Urbana-Champaign

About

Email
'mf' + <lastname> + '2@illinois.edu'
Education
Bachelor of Computer Science and Technology
(Advanced) (Honors Class I and University Medal),
University of Sydney, Australia
Research interests
Computational geometry, randomized & approximation algorithms, optimization
Other info
Curriculum Vitae
LinkedIn
Google Scholar

Publications

See also my arXiv page and DBLPs listing.

Conferences

  1. S. Har-Peled and M. Jones. Journey to the center of the point set. Symposium on Computational Geometry (SoCG 2019), 41:1-41:14, 2019. [SoCG slides]
  2. T. M. Chan, S. Har-Peled, and M. Jones. On locality-sensitive orderings and their applications. Innovations in Theoretical Computer Science Conference (ITCS 2019), 21:1–21:17, 2019. [ITCS slides] [USYD slides] [UIUC slides]
  3. S. Har-Peled and M. Jones. On separating points by lines. Symposium on Discrete Algorithms (SODA 2018), 918–932, 2018. [SODA slides]
  4. M. Jones, J. Mestre, and B. Scholz. Towards memory-optimal schedules for SDF. Parallel Processing Workshops (Auto-DaSP 2017), 94–105, 2017.
  5. S. Gaspers, J. Gudmundsson, M. Jones, J. Mestre, and S. Rummele. Turbocharging treewidth heuristics. International Symposium on Parameterized and Exact Computation (IPEC 2016), 13:1–13:13, 2016. [UIUC slides]

Journals

  1. S. Har-Peled and M. Jones. On separating points by lines. Discrete & Computational Geometry, 2019.
  2. S. Gaspers, J. Gudmundsson, M. Jones, J. Mestre, and S. Rummele. Turbocharging treewidth heuristics. Algorithmica, 81(2): 439–475, 2019.
  3. D. M. Budden and M. Jones. Cautionary tales of inapproximability. Journal of Computational Biology, 24(3): 213–216, 2017.
  4. S. Canzar, K. M. Elbassioni, M. Jones, and J. Mestre. Resolving conflicting predictions from multimapping reads. Journal of Computational Biology, 23(3): 203–217, 2016. [Preprint]

Current submissions & other manuscripts

  1. S. Har-Peled and M. Jones. Some geometric applications of anti-chains. 2019
  2. S. Har-Peled and M. Jones. Computing the egg and its yolk in near-linear time. In preparation. 2019.
  3. S. Har-Peled, M. Jones, and R. Saladi. Active learning a convex body in low dimensions. 2019. [SoCG YRF slides] [UIUC slides]
  4. S. Har-Peled and M. Jones. Few Cuts Meet Many Point Sets. Submitted. 2019.
  5. M. Jones. The Maximum Facility Location Problem. Undergraduate honors thesis, University of Sydney. 2015.

Teaching

University of Illinois at Urbana-Champaign

Course Role Semester Instructor(s)
Algorithms (CS473) TA Fall, 2019 Chandra Chekuri & Michael Forbes
Intro to Algorithms & Models of Computation (CS374) Head TA Spring, 2019 Sariel Har-Peled, Timothy Chan & Haitham Hassanieh
Algorithms (CS473) TA Fall, 2017 Timothy Chan

University of Sydney

Course Role Semester Instructor(s)
Formal Languages & Logic (COMP2022) TA Semester 1, 2016 Kalina Yacef
Algorithms & Complexity (COMP2007/2907) Head TA Semester 2, 2015 Julian Mestre
Formal Languages & Logic (COMP2022) TA Semester 1, 2015 Kalina Yacef
Algorithms & Complexity (COMP2007/2907) TA Semester 2, 2014 Julian Mestre
Formal Languages & Logic (COMP2022) TA Semester 1, 2014 Kalina Yacef
Database Systems I (INFO2120) TA Semester 1, 2014 Bryn Jeffries
Data Structures (INFO1105) TA Semester 2, 2013 Kalina Yacef

Miscellaneous

  1. R. Andrews, M. Jones, P. Lin, and the UIUC Theory CS group. Need more RAM? Just invent time travel!. Special Interest Group on Harry Q. Bovik! (SIGBOVIK 2019), 188-192, 2019.