research
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionNext revisionBoth sides next revision | ||
research [2015/08/20 18:18] – ruppert | research [2023/12/14 19:28] – eruppert | ||
---|---|---|---|
Line 3: | Line 3: | ||
==== Recent Publications ==== | ==== Recent Publications ==== | ||
- | Many of the papers listed below may be downloaded from the authors' | ||
- | === 2015 === | + | === 2023 === |
- | * Carole Delporte-Gallet, | + | * Spyros Angelopoulos, [[https://www.eecs.yorku.ca/~kamalis|Shahin Kamali]]. |
- | === 2014 === | + | * Spyros Angelopoulos, |
- | * Tareq Adnan, [[http://www.cse.yorku.ca/~datta|Suprakash Datta]], Stuart MacLean. | + | * Shalom Asbell, [[https://www.eecs.yorku.ca/~ruppert|Eric Ruppert]]. |
- | * [[http://www.cse.yorku.ca/~franck|Franck van Breugel]], James Worrell. | + | * Hassan Ashtiani, Vinayak Pathak, |
- | * [[http://www.cse.yorku.ca/~franck|Franck van Breugel]], Elham Kashefi, Catuscia Palamidessi, | + | * Paul Bastide, Marthe Bonamy, Anthony Bonato, Pierre Charbit, |
- | * Trevor Brown, Faith Ellen, [[http://www.cse.yorku.ca/~ruppert|Eric Ruppert]]. A general technique for non-blocking trees. In // | + | * Joan Boyar, Lene M. Favrholdt, [[https://www.eecs.yorku.ca/~kamalis|Shahin Kamali]], Kim S. Larsen. |
- | * Faith Ellen, Panagiota Fatourou, Joanna Helga, | + | * [[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 // |
- | * Rachid Guerraoui, [[http://www.cse.yorku.ca/~ruppert|Eric Ruppert]]. A paradox of eventual linearizability in shared memory. In // | + | * Fasil Cheema, [[https://www.eecs.yorku.ca/~uruth|Ruth Urner]]. |
- | * Rachid Guerraoui, [[http://www.cse.yorku.ca/~ruppert|Eric Ruppert]]. Linearizability Is Not Always a Safety Property. In // | + | * 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. |
- | * Stuart MacLean, [[http://www.cse.yorku.ca/~datta|Suprakash Datta]]. Reducing the Positional Error of Connectivity-Based Positioning Algorithms Through Cooperation Between Neighbors. //IEEE Transactions | + | * Hossein Naderibeni, [[https://www.eecs.yorku.ca/~ruppert|Eric Ruppert]]. A Wait-free Queue with Polylogarithmic Step Complexity. |
- | * Nastaran Shafiei, [[http:// | + | * Amgad Rady, [[http:// |
- | === 2013 === | + | * Matt Walker, Parssa Khazra, Anto Nanah Ji, Hongru Wang, [[http:// |
- | * Tareq Adnan, Suprakash Datta. AdAMAC: A New MAC Protocol | + | * Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, [[https:// |
- | * [[http:// | + | === 2022 === |
- | * Carole Delporte-Gallet, | + | * Spyros Angelopoulos, [[http:// |
- | * Stuart MacLean, [[http:// | + | * Spyros Angelopoulos, [[http:// |
- | * Hui Wang, Michael Jenkin, [[http:// | + | * Hans-Joachim Böckenhauer, [[http:// |
- | === 2012 === | + | * [[http:// |
- | * [[http://www.cse.yorku.ca/ | + | * Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, |
- | * Arkadev Chattopadhyay, [[http://www.cse.yorku.ca/~jeff|Jeff Edmonds]], Faith Ellen, and Toniann Pitassi. A little advice can be very helpful. In // | + | * Sadia Chowdhury, [[https://www.eecs.yorku.ca/~uruth|Ruth Urner]]. Robustness Should Not Be at Odds with Accuracy. In // |
- | * Di Chen, [[http:// | + | * Carole Delporte-Gallet, |
- | * Elise Cormie-Bowins, [[http:// | + | * Saulo dos Santos, Japjeet Singh, Ruppa K. Thulasiram, [[http:// |
- | * [[http://www.cse.yorku.ca/ | + | * James Freitag, Neshat Mohammadi, |
- | * [[http://www.cse.yorku.ca/ | + | * Matthew Jenssen, Will Perkins, |
- | * Hui Wang, Michael Jenkin, [[http://www.cse.yorku.ca/ | + | * Matthew Jenssen, [[https://www.adityapotukuchi.com|Aditya Potukuchi]], Will Perkins. Approximately counting independent sets in bipartite graphs via graph containers. In // |
- | === 2011 === | + | * [[http:// |
- | * Tareq Adnan, | + | * [[http:// |
- | * Anton Belov, Matti Järvisalo, | + | * [[http:// |
- | * Trevor Brown and Joanna Helga. | + | * Tosca Lechner, [[http://www.cse.yorku.ca/~ruth|Ruth Urner]]. |
- | * Trevor Brown, Faith Ellen, | + | * [[http:// |
- | * Ho-Leung Chan, [[http:// | + | === 2021 === |
- | * Ho-Leung Chan, [[http:// | + | * Sushant Agarwal, Nivasini Ananthakrishnan, |
- | * Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, [[http:// | + | * Nivasini Ananthakrishnan, |
- | * [[http:// | + | * Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare, Qiyi Tang, [[http:// |
- | * [[http:// | + | * Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, |
- | * Stuart MacLean, [[http:// | + | * Syyeda Zainab Fatmi, Xiang Chen, Yash Dhamija, Maeve Wildes, Qiyi Tang, [[http:// |
- | * Stuart MacLean, [[http:// | + | * Yunge Hao, [[http:// |
- | * Hui Wang, Michael Jenkin, [[http:// | + | * Yuanhao Wei, Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, [[http:// |
+ | |||
+ | === 2020 === | ||
+ | |||
+ | * Sushant Agarwal, Nivasini Ananthakrishnan, | ||
+ | |||
+ | * Hassan Ashtiani, Vinayak Pathak, [[http:// | ||
+ | |||
+ | * Qiyi Tang, [[http:// | ||
- | * Xin Zhang, [[http:// | ||
=== Publications in Previous Years === | === Publications in Previous Years === | ||
- | * [[2010]] | + | * [[2015-2019|2015-2019]] |
- | * [[2009]] | + | * [[2010-2014|2010-2014]] |
+ | * [[2006-2009|2006-2009]] | ||
* [[2008]] | * [[2008]] | ||
* [[2007]] | * [[2007]] | ||
Line 96: | Line 103: | ||
* [[http:// | * [[http:// | ||
- | ==== Recent | + | ==== Graduate Theses ==== |
+ | |||
+ | * Sadia Chowdhury, Novel Examinations of Interpretable Surrogates and Adversarial Robustness in Machine Learning, M.Sc. thesis, 2021. | ||
+ | |||
+ | * Yunge Hao, On Solovay' | ||
+ | |||
+ | * Karan Singh, Ensuring Fairness Despite Differences in Environment, | ||
+ | |||
+ | * Kowsar Hossain, An Efficient MAC Protocol for Wireless Sensor and Ad Hoc Networks, M.Sc. thesis, 2017. | ||
+ | |||
+ | * Amgad Rady, Characterizing Implementations that Preserve Properties of Concurrent Randomized Algorithms, M.Sc. thesis, 2017. | ||
+ | |||
+ | * Feng Gao, A short and readable proof of cut elimination for two 1st-order modal logics, M.Sc. thesis, 2016. | ||
* Niloufar Shafiei, Non-Blocking Data Structures Handling Multiple Changes Atomically, Ph.D. thesis, 2015. | * Niloufar Shafiei, Non-Blocking Data Structures Handling Multiple Changes Atomically, Ph.D. thesis, 2015. | ||
+ | |||
+ | * Stephen Voland, Random Polyhedral Scenes, M.Sc. thesis, 2015. | ||
* Nastaran Shafiei, Model-Checking of Distributed Multithreaded Java Applications, | * Nastaran Shafiei, Model-Checking of Distributed Multithreaded Java Applications, | ||
Line 108: | Line 129: | ||
* Elise Cormie-Bowins, | * Elise Cormie-Bowins, | ||
- | * Rahul Chaturvedi, Electing and Maintaining Leaders in Populations of Autonomous Agents, 2012. | + | * Rahul Chaturvedi, Electing and Maintaining Leaders in Populations of Autonomous Agents, M.Sc. thesis, 2012. |
+ | |||
+ | * Yehuda Schwartz, Some Results in Computability and the Proof Theory of Predicate Modal Logic, Ph.D. thesis, 2012. | ||
+ | |||
+ | * Joanna Helga, Complexity Analysis of Non-blocking Binary Search Trees, M.Sc. project, 2011. | ||
* Xin Zhang, Measuring Progress of Model Checking Randomized Algorithms, M.Sc. thesis, 2010. | * Xin Zhang, Measuring Progress of Model Checking Randomized Algorithms, M.Sc. thesis, 2010. | ||
- | *[[http:// | + | * [[http:// |
* Nassim Nasser, [[http:// | * Nassim Nasser, [[http:// | ||
- | * [[http:// | + | * [[http:// |
- | * [[http:// | + | * [[http:// |
* Babita Sharma, An Algorithm to Quantify Behavioural Similarity between Probabilistic Systems, 2006. (Winner of York University' | * Babita Sharma, An Algorithm to Quantify Behavioural Similarity between Probabilistic Systems, 2006. (Winner of York University' | ||
Line 132: | Line 157: | ||
* Mikhail Fomitchev, Lock-Free Linked Lists and Skip Lists, M.Sc. thesis, 2003. (Winner of York University' | * Mikhail Fomitchev, Lock-Free Linked Lists and Skip Lists, M.Sc. thesis, 2003. (Winner of York University' | ||
- | ==== Recent | + | ==== Undergraduate |
+ | |||
+ | * Koko NanahJi and Jordan Malek, Lock-free Bag Data Structures, 2020-21. | ||
* Trevor Brown, Non-blocking Search Trees, 2010. | * Trevor Brown, Non-blocking Search Trees, 2010. | ||
Line 140: | Line 167: | ||
* Soheil Pourhashemi, | * Soheil Pourhashemi, | ||
- | *Daniel Natapov, [[http:// | + | * Daniel Natapov, [[http:// |
* Zhenyu Pan, [[http:// | * Zhenyu Pan, [[http:// |
research.txt · Last modified: 2024/08/27 01:26 by eruppert