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
Next revision		Previous revision
research [2021/11/22 21:33] – ruppertresearch [2024/01/05 23:06] (current) – eruppert
Line 3: Line 3:
 ==== Recent Publications ==== ==== Recent Publications ====
  
-Many of the papers listed below may be downloaded from the authors' web pages. 
  
-=== 2021 ===+=== 2023 ===
  
-  * Sushant Agarwal, Nivasini Ananthakrishnan, Shai Ben-David, Tosca Lechner, [[http://www.cse.yorku.ca/~ruth|Ruth Urner]].  Open Problem: Are all VC-classes CPAC learnable? In //Proc. 33rd Conference on Learning Theory//, 2021.+  * Spyros Angelopoulos, [[https://www.eecs.yorku.ca/~kamalis|Shahin Kamali]].  Contract Scheduling with Predictions. //Journal of Artificial Intelligence Research//, 77, 2023.
  
-  * Nivasini Ananthakrishnan, Shai Ben-David, Tosca Lechner, [[http://www.cse.yorku.ca/~ruth|Ruth Urner]]. Identifying Regions of Trusted Predictions. In //Proc. 37th Conference on Uncertainty in Artificial Intelligence//, 2021.+  * 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.
  
-  * Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare, Qiyi Tang, [[http://www.cse.yorku.ca/~franck|Franck van Breugel]].  Computing Probabilistic Bisimilarity Distances for Probabilistic Automata.  //Logical Methods in Computer Science//, 17(1), 2021.+  * 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.
  
-  * Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, [[http://www.cse.yorku.ca/~ruppert|Eric Ruppert]], Yihan Sun, Yuanhao Wei.  Space and Time Bounded Multiversion Garbage Collection. In Proc. //Proc. 35th International Symposium on Distributed Computing//, 2021.+  * Hassan Ashtiani, Vinayak Pathak, [[https://www.eecs.yorku.ca/~uruth|Ruth Urner]].  Adversarially Robust Learning with Tolerance. In //Proc. International Conference on Algorithmic Learning Theory//, 2023.
  
-  * Syyeda Zainab Fatmi, Xiang Chen, Yash Dhamija, Maeve Wildes, Qiyi Tang, [[http://www.cse.yorku.ca/~franck|Franck van Breugel]].  Probabilistic Model Checking of Randomized Java Code.  In //Proc. 27th International Symposium on Model Checking Software - 27th International Symposium (SPIN)//, 2021.+  * Paul Bastide, Marthe Bonamy, Anthony Bonato, Pierre Charbit, [[https://www.eecs.yorku.ca/~kamalis|Shahin Kamali]], Théo Pierron, Mikaël Rabie.  Improved Pyrotechnics: Closer to the Burning Number Conjecture. //Electronic Journal of Combinatorics//, 30(4), 2023.
  
-  * Yunge Hao, [[http://www.cse.yorku.ca/~gt|George Tourlakis]], An arithmetically complete predicate modal logic, Bulletin of the Section of Logic, 2021.  To appear.+  * 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.
  
-  * [[http://www.cse.yorku.ca/~gt|George Tourlakis]], //Computability//, Springer, 2021.+  * [[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.
  
-  * Yuanhao Wei, Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, [[http://www.cse.yorku.ca/~ruppert|Eric Ruppert]], Yihan Sun.  Constant-time snapshots with applications to concurrent data structures. In //Proc. 26th ACM Symposium on Principles and Practice of Parallel Programming//, 2021.+  * 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.
  
-=== 2020 ===+  * 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.
  
-  * Sushant Agarwal, Nivasini Ananthakrishnan, Shai Ben-David, Tosca Lechner, [[http://www.cse.yorku.ca/~ruth|Ruth Urner]].  On Learnability wih Computable Learners. In //Proc. 31st International Conference on Algorithmic Learning Theory//, 2020.+  * 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.
  
-  * Hassan Ashtiani, Vinayak Pathak, [[http://www.cse.yorku.ca/~ruth|Ruth Urner]].  Black-box Certification and Learning under Adversarial Perturbations.  In //Proc. 37th International Conference on Machine Learning//, 2020.+  * Hossein Naderibeni, [[https://www.eecs.yorku.ca/~ruppert|Eric Ruppert]].  A Wait-free Queue with Polylogarithmic Step Complexity.  In //Proc. ACM Symposium on Principles of Distributed Computing//, 2023.
  
-  * Qiyi Tang, [[http://www.cse.yorku.ca/~franck|Franck van Breugel]].  Deciding probabilistic bisimilarity distance one for probabilistic automata.  //Journal of Computer and System Sciences// 111: 57-84, 2020.+  * Amgad Rady, [[http://www.eecs.yorku.ca/~franck|Franck van Breugel]].  Explainability of Probabilistic Bisimilarity Distances for Labelled Markov Chains. In //Proc. 26th International Conference on Foundations of Software Science and Computation Structures//, 2023.
  
-=== 2019 ===+  * Matt Walker, Parssa Khazra, Anto Nanah Ji, Hongru Wang, [[http://www.eecs.yorku.ca/~franck|Franck van Breugel]].  jpf-logic: a Framework for Checking Temporal Logic Properties of Java Code. //ACM SIGSOFT Software Engineering Notes// 48(1), 2023.
  
-  * Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare, Qiyi Tang, [[http://www.cse.yorku.ca/~franck|Franck van Breugel]].  Computing Probabilistic Bisimilarity Distances for Probabilistic Automata.  In //Proc. 30th International Conference on Concurrency Theory//, 2019.+  * Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, [[https://www.eecs.yorku.ca/~ruppert|Eric Ruppert]].  Practically and Theoretically Efficient Garbage Collection for Multiversioning.  In //Proc. 28th ACM Symposium on Principles and Practice of Parallel Programming//, 2023.
  
-  * Panagiota Fatourou, Elias Papavasileiou, [[http://www.cse.yorku.ca/~ruppert|Eric Ruppert]].  Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries. In //Proc. 31st ACM Symposium on Parallelism in Algorithms and Architectures//, 2019.+=== 2022 ===
  
-  * Christina Göpfert, Shai Ben-David, Olivier Bousquet, Sylvain Gelly, Ilya O. Tolstikhin, [[http://www.cse.yorku.ca/~ruth|Ruth Urner]].  When can unlabeled data improve the learning rate?  In //Proc. 32nd Conference on Learning Theory//, 2019.+  * Spyros Angelopoulos, [[http://www.eecs.yorku.ca/~kamalis|Shahin Kamali]], Kimia Shadkami.  Online Bin Packing with Predictions.  In //Proc. International Joint Conference on Artificial Intelligence//, 2022.
  
-  * Niloufar Shafiei.  Non-blocking Patricia tries with replace operations.  //Distributed Computing//, 32(5): 423-442, 2019.+  * Spyros Angelopoulos, [[http://www.eecs.yorku.ca/~kamalis|Shahin Kamali]], Dehou Zhang. Online Search with Best-Price and Query-Based Predictions. In //Proc. 36th AAAI Conference on Artificial Intelligence//, 2022.
  
-=== 2018 ===+  * Hans-Joachim Böckenhauer, [[http://www.cse.yorku.ca/~burjons|Elisabet Burjons]]. Martin Raszyk, Peter Rossmanith, Reoptimization of Parameterized Problems.  //Acta Informatica// 59, 2022.
  
-  * [[http://www.cse.yorku.ca/~jeff|Jeff Edmonds]], Venkatesh Medabalimi, Toniann Pitassi.  Hardness of Function Composition for Semantic Read once Branching Programs.  In //Proc. Computational Complexity Conference//, 2018.+  * [[http://www.cse.yorku.ca/~burjons|Elisabet Burjons]], Janosch Fuchs, Henri Lotze. The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs. In //Proc. 33rd International Workshop on Combinatorial Algorithms//, 2022.
  
-  * Qiyi Tang, [[http://www.cse.yorku.ca/~franck|Franck van Breugel]].  Deciding Probabilistic Bisimilarity Distance One for Labelled Markov Chains.  In //Proc. 30th International Conference on Computer Aided Verification// Part 1, 2018.+  * Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, [[https://www.adityapotukuchi.com|Aditya Potukuchi]], Corrine Yap.  Algorithms for the ferromagnetic Potts model on expanders. In //Proc. 63rd IEEE Symposium on Foundations of Computer Science//, 2022.
  
-  * Qiyi Tang, [[http://www.cse.yorku.ca/~franck|Franck van Breugel]].  Deciding Probabilistic Bisimilarity Distance One for Probabilistic Automata.  In //Proc. 29th International Conference on Concurrency Theory//, 2018.+  * Sadia Chowdhury, [[https://www.eecs.yorku.ca/~uruth|Ruth Urner]]. Robustness Should Not Be at Odds with Accuracy. In //Proc. 3rd Symposium on Foundations of Responsible Computing//, 2022.
  
-=== 2017 ===+  * Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, [[http://www.cse.yorku.ca/~ruppert|Eric Ruppert]].  When Is Recoverable Consensus Harder Than Consensus?  In //Proc. ACM Symposium on Principles of Distributed Computing//, 2022.
  
-  * [[http://www.cse.yorku.ca/~franck|Franck van Breugel]].  Probabilistic bisimilarity distances.  In //ACM SIGLOG News// 4(4): 33-51, 2017.+  * Saulo dos Santos, Japjeet Singh, Ruppa K. Thulasiram, [[http://www.eecs.yorku.ca/~kamalis|Shahin Kamali]], Louis Sirico, Lisa Loud.  A New Era of Blockchain-Powered Decentralized Finance (DeFi) - A Review. In //Proc. 46th IEEE Computers, Software and Applications Conference//, 2022.
  
-  * Stefan Dobrev, [[http://www.cse.yorku.ca/~jeff|Jeff Edmonds]], Dennis Komm, Rastislav Královic, Richard Královic, Sacha Krug, Tobias Mömke.  Improved analysis of the online set cover problem with advice.  //Theoretical Computer Science//, 689: 96-107, 2017.+  * James Freitag, Neshat Mohammadi, [[https://www.adityapotukuchi.com|Aditya Potukuchi]], Lev Reyzin.  On the Geometry of Stable Steiner Tree Instances. In //Proc. 34th Canadian Conference on Computational Geometry//, 2022.
  
-  * Aryeh Kontorovich, Sivan Sabato, [[http://www.cse.yorku.ca/~ruth|Ruth Urner]].  Active Nearest-Neighbor Learning in Metric Spaces. //Journal of Machine Learning Research//, 18: 195:1-195:38, 2017.+  * Matthew Jenssen, Will Perkins, [[https://www.adityapotukuchi.com|Aditya Potukuchi]]. Independent sets of a given size and structure in the hypercube. //Combinatorics, Probability and Computing//, 31(4), 2022.
  
-  * [[http://www.cse.yorku.ca/~ruppert|Eric Ruppert]].  Brief Announcement: Readers of Wait-Free Unbounded Registers Must Write. In //Proc. ACM Symposium on Principles of Distributed Computing//, 2017.+  * Matthew Jenssen, [[https://www.adityapotukuchi.com|Aditya Potukuchi]], Will Perkins. Approximately counting independent sets in bipartite graphs via graph containers.  In //Proc. 33rd ACM-SIAM Symposium on Discrete Algorithms//, 2022.
  
-  * Ben Spencer, Michael Benedikt, Anders Møller, [[http://www.cse.yorku.ca/~franck|Franck van Breugel]].  ArtForm: a tool for exploring the codebase of form-based websites.  In //Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis //, 2017.+  * [[http://www.eecs.yorku.ca/~kamalis|Shahin Kamali]].  Compact representation of graphs with bounded bandwidth or treedepth. //Information and Computation//, 285, 2022.
  
-  * Qiyi Tang, [[http://www.cse.yorku.ca/~franck|Franck van Breugel]].  Algorithms to Compute Probabilistic Bisimilarity Distances for Labelled Markov Chains.  In //Proc. 28th International Conference on Concurrency Theory//, 2017.+  * [[http://www.eecs.yorku.ca/~kamalis|Shahin Kamali]], Pooya Nikbakht.  Online Square Packing with Rotation.  In //Proc. 34th Canadian Conference on Computational Geometry//, 2022.
  
-=== 2016 ===+  * [[http://www.eecs.yorku.ca/~kamalis|Shahin Kamali]], Pooya Nikbakht, Arezoo Sajadpour.  A Randomized Algorithm for Non-crossing Matching of Online Points. In //Proc. 34th Canadian Conference on Computational Geometry//, 2022.
  
-  * James Aspnes, [[http://www.cse.yorku.ca/~ruppert|Eric Ruppert]].  Depth of a random binary search tree with concurrent insertions.  In //Proc. International Conference on Distributed Computing//, 2016.+  * Tosca Lechner, [[http://www.cse.yorku.ca/~ruth|Ruth Urner]].  Learning Losses for Strategic Classification.  In //Proc. 36th AAAI Conference on Artificial Intelligence//,  2022.
  
-  * Arkadev Chattopadhyay, [[http://www.cse.yorku.ca/~jeff|Jeff Edmonds]], Faith Ellen, Toniann Pitassi.  Upper and Lower Bounds on the Power of Advice. //SIAM Journal on Computing//, 45(4): 1412-1432, 2016.+  * [[http://www.cse.yorku.ca/~gt|George Tourlakis]], //Computability//, Springer, 2021.
  
-  * Stephen A. Cook, [[http://www.cse.yorku.ca/~jeff|Jeff Edmonds]], Venkatesh Medabalimi, Toniann Pitassi.  Lower bounds for nondeterministic semantic read-once branching programs.  In //Proc. International Colloquium on Automata, Languages, and Programming//, 2016.+=== 2021 ===
  
-  * Qiyi Tang, [[http://www.cse.yorku.ca/~franck|Franck van Breugel]].  Computing probabilistic bisimilarity distances via policy iteration. In //Proc. International Conference on Concurrency Theory//, 2016.+  * Sushant Agarwal, Nivasini Ananthakrishnan, Shai Ben-David, Tosca Lechner, [[http://www.cse.yorku.ca/~ruth|Ruth Urner]].  Open Problem: Are all VC-classes CPAC learnable? In //Proc. 33rd Conference on Learning Theory//, 2021.
  
-  * [[http://www.cse.yorku.ca/~gt|George Tourlakis]].  A new arithmetically incomplete first-order extension of GL all theorems of which have cut free proofs.  In //Bulletin of the Section of Logic//, 45(1):17-31, 2016.+  * Nivasini Ananthakrishnan, Shai Ben-David, Tosca Lechner, [[http://www.cse.yorku.ca/~ruth|Ruth Urner]]. Identifying Regions of Trusted Predictions. In //Proc. 37th Conference on Uncertainty in Artificial Intelligence//, 2021.
  
-=== 2015 ===+  * Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare, Qiyi Tang, [[http://www.cse.yorku.ca/~franck|Franck van Breugel]].  Computing Probabilistic Bisimilarity Distances for Probabilistic Automata.  //Logical Methods in Computer Science//, 17(1), 2021.
  
-  * Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov, [[http://www.cse.yorku.ca/~ruppert|Eric Ruppert]].  On the space complexity of set agreement.  In //Proc. ACM Symposium on Principles of Distributed Computing//, 2015.+  * Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, [[http://www.cse.yorku.ca/~ruppert|Eric Ruppert]], Yihan Sun, Yuanhao Wei.  Space and Time Bounded Multiversion Garbage Collection. In Proc. //Proc. 35th International Symposium on Distributed Computing//, 2021.
  
-  * Feng Gao, [[http://www.cse.yorku.ca/~gt|George Tourlakis]].  A short and readable proof of cut elimination for two first-order modal logics.  In //Bulletin of Section of Logic//, 44(3-4):131-148, 2015.+  * Syyeda Zainab Fatmi, Xiang Chen, Yash Dhamija, Maeve Wildes, Qiyi Tang, [[http://www.cse.yorku.ca/~franck|Franck van Breugel]].  Probabilistic Model Checking of Randomized Java Code.  In //Proc. 27th International Symposium on Model Checking Software - 27th International Symposium (SPIN)//, 2021.
  
-  * Md. Kowsar Hossain, [[http://www.eecs.yorku.ca/~datta|Suprakash Datta]], [[http://www.eecs.yorku.ca/~jeff|Jeff Edmonds]].  Ad-ATMA: An efficient MAC protocol for wireless sensor and ad hoc networks.  In //Proc. International Conference on Ambient Systems, Networks and Technologies//, 2015.+  * Yunge Hao, [[http://www.cse.yorku.ca/~gt|George Tourlakis]], An arithmetically complete predicate modal logic, Bulletin of the Section of Logic, 2021.  To appear. 
 + 
 +  * Yuanhao Wei, Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, [[http://www.cse.yorku.ca/~ruppert|Eric Ruppert]], Yihan Sun.  Constant-time snapshots with applications to concurrent data structures. In //Proc. 26th ACM Symposium on Principles and Practice of Parallel Programming//, 2021. 
 + 
 +=== 2020 === 
 + 
 +  * Sushant Agarwal, Nivasini Ananthakrishnan, Shai Ben-David, Tosca Lechner, [[http://www.cse.yorku.ca/~ruth|Ruth Urner]].  On Learnability wih Computable Learners. In //Proc. 31st International Conference on Algorithmic Learning Theory//, 2020. 
 + 
 +  * Hassan Ashtiani, Vinayak Pathak, [[http://www.cse.yorku.ca/~ruth|Ruth Urner]].  Black-box Certification and Learning under Adversarial Perturbations.  In //Proc. 37th International Conference on Machine Learning//, 2020. 
 + 
 +  * Qiyi Tang, [[http://www.cse.yorku.ca/~franck|Franck van Breugel]].  Deciding probabilistic bisimilarity distance one for probabilistic automata.  //Journal of Computer and System Sciences// 111: 57-84, 2020.
  
-  * [[http://www.eecs.yorku.ca/~niloo|Niloufar Shafiei]].  Doubly-linked lists with good amortized complexity.  In //Proc. 19th International Conference on Principles of Distributed Systems//, 2015.  This paper won the conference's **best paper award**. 
  
 === Publications in Previous Years === === Publications in Previous Years ===
  
-  * [[2014]] +  * [[2015-2019|2015-2019]] 
-  * [[2013]] +  * [[2010-2014|2010-2014]] 
-  * [[2012]] +  * [[2006-2009|2006-2009]]
-  * [[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 101: Line 103:
  
 ==== 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 155: Line 159:
  
 ==== 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.1637616788.txt.gz · Last modified: 2021/11/22 21:33 by ruppert