Differences

This shows you the differences between two versions of the page.

--- research [2023/12/14 19:24] – eruppert
+++ research [2024/01/05 23:06] (current) – eruppert
@@ Line 21: / Line 21: @@
   * Fasil Cheema, [[https://www.eecs.yorku.ca/~uruth|Ruth Urner]].  Precision Recall Cover: A Method For Assessing Generative Models.  In //Proc. International Conference on Artificial Intelligence and Statistics//, 2023.
+  * Tosca Lechner, Vinayak Pathak, [[https://www.eecs.yorku.ca/~uruth|Ruth Urner]]. Adversarially Robust Learning with Uncertain Perturbation Sets, In //Proc. Conference on Neural Information Processing Systems//, 2023.
   * Tosca Lechner, [[https://www.eecs.yorku.ca/~uruth|Ruth Urner]], Shai Ben-David. Strategic Classification with Unknown User Manipulations.  In //Proc. International Conference on Machine Learning//, 2023.
@@ Line 95: / Line 97: @@
   * [[2015-2019|2015-2019]]
   * [[2010-2014|2010-2014]]
-  * [[2014]]
+  * [[2006-2009|2006-2009]]
-  * [[2013]]
-  * [[2012]]
-  * [[2011]]
-  * [[2010]]
-  * [[2009]]
-  * [[2008]]
-  * [[2007]]
-  * [[2006]]
   * [[http://www.cse.yorku.ca/tg/2005-pub.html|2005]]
   * [[http://www.cse.yorku.ca/tg/2004-pub.html|2004]]
@@ Line 109: / Line 103: @@
 ==== Graduate Theses ====
+  * Hossein Naderibeni, Lock-free Queues with Polylogarithmic Step Complexity, M.Sc. thesis, 2022.
   * Sadia Chowdhury, Novel Examinations of Interpretable Surrogates and Adversarial Robustness in Machine Learning, M.Sc. thesis, 2021.
@@ Line 163: / Line 159: @@
 ==== Undergraduate Research Projects ====
+  * Shahen Alexanian, Bounds on the Competitive Ratio of the Online n-Knapsack Problem with Reservation Costs (n>2), 2023.
+  * Shalom Asbell, Lock-free Deques, 2023.
+  * Ethan Fifle, Design and Analysis of 3D Algorithms and Data Structures with Industry Applications, 2023.
+  * Katherine Ling, Compact Data Structures for Geometric Graphs, 2023.
   * Koko NanahJi and Jordan Malek, Lock-free Bag Data Structures, 2020-21.