Eric Ruppert
Associate Professor, EECS Department
General Member, IC@L
Member, Theory of Computing
Website | Email
2023 – 2024 Research Highlights
Overview
Dr. Eric Ruppert was educated at the University of Toronto. He has taught computer science at York University since 2000. He has also spent time as a postdoctoral fellow at Brown University and as a visiting professor at the École Polytechnique Fédérale de Lausanne.
His research interests are in the theory of distributed computing, including both algorithm design and lower bound proofs. Lately, his research has been focused on the design and analysis of shared-memory data structures that can be used to exploit the power of multi-core architectures.
At York, he teaches courses on the foundations of computer science and enjoys coaching students for the annual ACM programming contest.
Research Interests
- Distributed computing
- Dhared-memory
- Algorithms
- Data structures
- Lower bounds
Selected Publications
- Aggregating Funnels for Faster Fetch&Add and Queues. Y. Roh, Y. Wei, E. Ruppert, P. Fatourou, S. Jayanti, & J. Shun. arXiv preprint arXiv:2411.14420, 2024.
- Lock-Free Augmented Trees. P. Fatourou & E. Ruppert. arXiv preprint arXiv:2405.10506, 3, 2024.
- A Wait-Free Deque with Polylogarithmic Step Complexity. S. M. Asbell & E. Ruppert. 27th International Conference on Principles of Distributed Systems (OPODIS 2023), 2, 2024.
- A Wait-Free Queue with Polylogarithmic Step Complexity. H. Naderibeni & E. Ruppert. Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 4, 2023.
- Practically and Theoretically Efficient Garbage Collection for Multiversioning. Y. Wei, G. E. Blelloch, P. Fatourou, & E. Ruppert. Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and …, 2024.