Theory Group

User Tools

Site Tools

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

Differences

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

Link to this comparison view

Both sides previous revisionPrevious revision
research [2024/11/13 21:53] – eruppertresearch [2024/11/13 21:54] (current) – eruppert
Line 31: Line 31:
   * 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.   * 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//, published online 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.   * 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.
research.txt · Last modified: by eruppert