Theory Group

User Tools

Site Tools

You are here: Theory of Computing Group » Research
Trace: • Research
research

Differences

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

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
research [2023/12/14 19:24] – eruppertresearch [2024/11/13 21:54] (current) – eruppert
Line 3: Line 3:
 ==== Recent Publications ==== ==== Recent Publications ====
  
 +=== 2025 ===
 +
 +  * Younghun Roh, Panagiota Fatourou, Siddhartha Jayanti, [[https://www.eecs.yorku.ca/~eruppert|Eric Ruppert]], Julian Shun, Yuanhao Wei.  Aggregating Funnels for Faster Fetch&Add and Queues.  To appear in //Proc. ACM Symposium on Principles and Practice of Parallel Programming//, 2025.
 +
 +=== 2024 ===
 +
 +  * Spyros Angelopoulos, Christoph Dürr, Shendan Jin, [[https://www.eecs.yorku.ca/~kamalis|Shahin Kamali]], Marc P. Renault.  Online computation with untrusted advice. //Journal of Computer and System Sciences//, 144, 2024.
 + 
 +  * Magnus Berg, [[https://www.eecs.yorku.ca/~kamalis|Shahin Kamali]].  Online Bin Covering with Frequency Predictions. In //Proc. Scandinavian Symposium and Workshops on Algorithm Theory//, 10:1-10:17, 2024.
 +
 +  * Magnus Berg, [[https://www.eecs.yorku.ca/~kamalis|Shahin Kamali]], Katherine Ling, Cooper Sigrist.  Space-Efficient Data Structures for Polyominoes and Bar Graphs. In //Proc. Data Compression Conference//, 253-262, 2024.
 +
 +  * Joan Boyar, [[https://www.eecs.yorku.ca/~kamalis|Shahin Kamali]], Kim S. Larsen, Ali Mohammad Lavasani, Yaqiao Li, Denis Pankratov.  On the Online Weighted Non-Crossing Matching Problem. In //Proc. Scandinavian Symposium and Workshops on Algorithm Theory//, 16:1-16:19, 2024.
 +
 +  * [[https://www.eecs.yorku.ca/~burjons|Elisabet Burjons]], Fabian Frei, Edith Hemaspaandra, Dennis Komm, David Wehner.  Finding Optimal Solutions with Neighborly Help. //Algorithmica//, 86(6): 1921-1947, 2024.
 +
 +  * Charlie Carlson, Ewan Davies, Alexandra Kolla, [[https://www.adityapotukuchi.com|Aditya Potukuchi]]. A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs. In //Proc. 51st International Colloquium on Automata, Languages, and Programming//, 35:1-35:18, 2024.
 +
 +  * Panagiota Fatourou, [[https://www.eecs.yorku.ca/~ruppert|Eric Ruppert]].  Lock-Free Augmented Trees, In //Proc. International Symposium on Distributed Computing//, 2024.
 +
 +  * Pascale Gourdeau, Tosca Lechner, [[https://www.eecs.yorku.ca/~uruth|Ruth Urner]].  On the Computability of Robust PAC Learning. In //Proc. 37th Conference on Learning Theory//, 2092-2121, 2024.
 +
 +  * Matthew Jenssen, Will Perkins, [[https://www.adityapotukuchi.com|Aditya Potukuchi]], Michael Simkin.  Sampling, counting, and large deviations for triangle-free graphs near the critical density.  To appear in //Proc. 65th IEEE Symposium on Foundations of Computer Science//, 2024.
 +
 +  * Jeffrey Kam, [[https://www.eecs.yorku.ca/~kamalis|Shahin Kamali]], Avery Miller, Naomi Nishimura.  Reconfiguration of Multisets with Applications to Bin Packing. In //Proc. 18th International Conference and Workshops on Algorithms and Computation//, 212-226, 2024.
 +
 +  * Adam Lechowicz, Rik Sengupta, Bo Sun, [[https://www.eecs.yorku.ca/~kamalis|Shahin Kamali]], Mohammad Hajiesmaili.  Time Fairness in Online Knapsack Problems. In //Proc. 12th International Conference on Learning Representations//, 2024.
 +
 +  * Hossein Naderibeni, [[https://www.eecs.yorku.ca/~ruppert|Eric Ruppert]].  A Wait-free Queue with Polylogarithmic Step Complexity.  //Distributed Computing// 37(4):309-334, 2024.
 +
 +  * Alireza Torabian, [[https://www.eecs.yorku.ca/~uruth|Ruth Urner]]. Investigating Calibrated Classification Scores Through the Lens of Interpretability.  In //Proc. Second World Conference on eXplainable Artificial Intelligence//, 2024.
 +
 +  * Chester Wyke, [[https://www.eecs.yorku.ca/~uruth|Ruth Urner]]. An Axiomatic Perspective on Anomaly Detection.  To appear in //Proc. European Conference on Artificial Intelligence//, 2024.
  
 === 2023 === === 2023 ===
Line 9: Line 42:
  
   * Spyros Angelopoulos, [[https://www.eecs.yorku.ca/~kamalis|Shahin Kamali]].  Rényi-Ulam Games and Online Computation with Imperfect Advice. In //Proc. 48th International Symposium on Mathematical Foundations of Computer Science//, 2023.   * Spyros Angelopoulos, [[https://www.eecs.yorku.ca/~kamalis|Shahin Kamali]].  Rényi-Ulam Games and Online Computation with Imperfect Advice. In //Proc. 48th International Symposium on Mathematical Foundations of Computer Science//, 2023.
 +
 +  * Spyros Angelopoulos, [[https://www.eecs.yorku.ca/~kamalis|Shahin Kamali]], Kimia Shadkami.  Online Bin Packing with Predictions. //Journal of Artificial Intelligence Research//, 78: 1111-1141, 2023.
  
   * Shalom Asbell, [[https://www.eecs.yorku.ca/~ruppert|Eric Ruppert]].  A Wait-Free Deque with Polylogarithmic Step Complexity.  In //Proc. International Conference on Principles of Distributed Systems//, 2023.   * Shalom Asbell, [[https://www.eecs.yorku.ca/~ruppert|Eric Ruppert]].  A Wait-Free Deque with Polylogarithmic Step Complexity.  In //Proc. International Conference on Principles of Distributed Systems//, 2023.
Line 17: Line 52:
  
   * Joan Boyar, Lene M. Favrholdt, [[https://www.eecs.yorku.ca/~kamalis|Shahin Kamali]], Kim S. Larsen.  Online Interval Scheduling with Predictions. In //Proc. 18th International Symposium on Algorithms and Data Structures//, 2023.   * Joan Boyar, Lene M. Favrholdt, [[https://www.eecs.yorku.ca/~kamalis|Shahin Kamali]], Kim S. Larsen.  Online Interval Scheduling with Predictions. In //Proc. 18th International Symposium on Algorithms and Data Structures//, 2023.
 +
 +  * [[https://www.eecs.yorku.ca/~burjons|Elisabet Burjons]], Fabian Frei, Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith.  Delaying Decisions and Reservation Costs. In //Proc. 29th International Conference on Computing and Combinatorics//, Part 1, 371-383, 2023.
  
   * [[https://www.eecs.yorku.ca/~burjons|Elisabet Burjons]], Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith.  The Online Simple Knapsack Problem with Reservation and Removability.  In //Proc. 48th International Symposium on Mathematical Foundations of Computer Science//, 2023.   * [[https://www.eecs.yorku.ca/~burjons|Elisabet Burjons]], Matthias Gehnen, Henri Lotze, Daniel Mock, Peter Rossmanith.  The Online Simple Knapsack Problem with Reservation and Removability.  In //Proc. 48th International Symposium on Mathematical Foundations of Computer Science//, 2023.
  
   * 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.   * 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.
 +
 +  * Stephane Durocher, [[https://www.eecs.yorku.ca/~kamalis|Shahin Kamali]], Myroslav Kryven, Fengyi Liu, Amirhossein Mashghdoust, Avery Miller, Pouria Zamani Nezhad, Ikaro Penha Costa, Timothy Zapp.  Cops and Robbers on 1-Planar Graphs. In //Proc. 31st International Symposium on Graph Drawing and Network Visualization//, Part 2, 3-17, 2023.
 +
 +  * Stephane Durocher, [[https://www.eecs.yorku.ca/~kamalis|Shahin Kamali]], Pouria Zamani Nezhad.  Online Square Packing with Predictions. In //Proc. 35th Canadian Conference on Computational Geometry//, 9-18, 2023.
 +
 +  * Matthew Jenssen, Will Perkins, [[https://www.adityapotukuchi.com|Aditya Potukuchi]].  Approximately counting independent sets in bipartite graphs via graph containers. //Random Structures and Algorithms//, 63(1): 215-241, 2023.
 +
 +  * [[https://www.eecs.yorku.ca/~kamalis|Shahin Kamali]], Mohammadmasoud Shabanijou.  Improved Algorithms for Burning Planar Point Sets. In //Proc. 35th Canadian Conference on Computational Geometry//, 161-167, 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.   * 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 94: Line 141:
  
   * [[2015-2019|2015-2019]]   * [[2015-2019|2015-2019]]
-  * [[2014]] +  * [[2010-2014|2010-2014]] 
-  * [[2013]] +  * [[2006-2009|2006-2009]]
-  * [[2012]] +
-  * [[2011]] +
-  * [[2010]] +
-  * [[2009]] +
-  * [[2008]] +
-  * [[2007]] +
-  * [[2006]]+
   * [[http://www.cse.yorku.ca/tg/2005-pub.html|2005]]    * [[http://www.cse.yorku.ca/tg/2005-pub.html|2005]] 
   * [[http://www.cse.yorku.ca/tg/2004-pub.html|2004]]   * [[http://www.cse.yorku.ca/tg/2004-pub.html|2004]]
Line 108: Line 148:
  
 ==== Graduate Theses ==== ==== 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.   * Sadia Chowdhury, Novel Examinations of Interpretable Surrogates and Adversarial Robustness in Machine Learning, M.Sc. thesis, 2021.
Line 162: Line 204:
  
 ==== Undergraduate Research Projects ==== ==== 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.   * Koko NanahJi and Jordan Malek, Lock-free Bag Data Structures, 2020-21.
research.1702581847.txt.gz · Last modified: 2023/12/14 19:24 by eruppert
Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki