https://wiki.eecs.yorku.ca/lab/tg/ 2026-04-22T05:54:42+00:00 https://wiki.eecs.yorku.ca/lab/tg/ https://wiki.eecs.yorku.ca/lab/tg/_media/wiki:dokuwiki-128.png text/html 2023-12-14T19:31:24+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/lab/tg/2006-2009?rev=1702582284&do=diff 2009 * James Aspnes and Eric Ruppert. An introduction to population protocols. In Middleware for Network Eccentric and Mobile Applications, pages 97-120, Springer, 2009. * Ho-Leung Chan, Jeff Edmonds, Tak-Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela and Kirk Pruhs. Nonclairvoyant speed scaling for flow and energy. In text/html 2010-06-12T15:55:09+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/lab/tg/2006?rev=1276358109&do=diff 2006 * James Aspnes, Faith Ellen Fich and Eric Ruppert. Relationships between broadcast and shared memory in reliable anonymous distributed systems. Distributed Computing, 18(3), pages 209-219, 2006. * Franck van Breugel and James Worrell. Approximating and computing behavioural distances in probabilistic transition systems. text/html 2014-08-19T15:55:54+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/lab/tg/2007?rev=1408463754&do=diff 2007 * Dana Angluin, James Aspnes, David Eisenstat and Eric Ruppert. The computational power of population protocols. Distributed Computing, 20(4), pages 279-304, 2007. * Franck van Breugel, Claudio Hermida, Michael Makkai and James Worrell. Recursively defined metric spaces without contraction. text/html 2014-08-19T15:56:21+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/lab/tg/2008?rev=1408463781&do=diff 2008 * Hagit Attiya, Rachid Guerraoui and Eric Ruppert. Partial snapshot objects. In Proc. 20th ACM Symposium on parallelism in Algorithms and Architectures, pages 336-343, 2008. * Franck van Breugel, Babita Sharma and James Worrell. Approximating a behavioural pseudometric without discount. text/html 2014-08-19T15:56:46+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/lab/tg/2009?rev=1408463806&do=diff 2009 * James Aspnes and Eric Ruppert. An introduction to population protocols. In Middleware for Network Eccentric and Mobile Applications, pages 97-120, Springer, 2009. * Ho-Leung Chan, Jeff Edmonds, Tak-Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela and Kirk Pruhs. Nonclairvoyant speed scaling for flow and energy. In text/html 2023-12-14T19:27:57+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/lab/tg/2010-2014?rev=1702582077&do=diff 2014 * Tareq Adnan, Suprakash Datta, Stuart MacLean. Efficient and accurate sensor network localization. Personal and Ubiquitous Computing, 18(4): 821-833, 2014 * Franck van Breugel, James Worrell. The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata. In text/html 2021-11-22T21:28:47+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/lab/tg/2010?rev=1637616527&do=diff 2010 * S. Chakraborty and Jeff Edmonds, Bounding Variance and Expectation of Longest Path Lengths in DAGs from Variance and Expectation of Edge Lengths, In SODA, ACM Symp. on Discrete Algorithms, 2010. * Suprakash Datta, Patrick Dymond and Jeff Edmonds. TCP is competitive with Resource Augmentation (against a limited adversary). In text/html 2021-11-22T21:26:32+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/lab/tg/2011?rev=1637616392&do=diff 2011 * Tareq Adnan, Suprakash Datta, Stuart MacLean. Effcient and Accurate Range-based Sensor Network Localization. In Proc. 3rd International Conference on Ambient Systems, Networks and Technologies and 9th International Conference on Mobile Web Information Systems text/html 2021-11-22T21:36:42+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/lab/tg/2012?rev=1637617002&do=diff 2012 * Franck van Breugel. On behavioural pseudometrics and closure ordinals. Information Processing Letters, 112(19): 715-718, 2012. * Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, and Toniann Pitassi. A little advice can be very helpful. In Proc. ACM-SIAM Symposium on Discrete Algorithms text/html 2021-11-22T21:29:29+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/lab/tg/2013?rev=1637616569&do=diff 2013 * Tareq Adnan, Suprakash Datta. AdAMAC: A New MAC Protocol for High Traffic Wireless Networks. In Proc. 4th International Conference on Ambient Systems, Networks and Technologies and 3rd International Conference on Sustainable Energy Information Technology text/html 2021-11-22T21:29:55+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/lab/tg/2014?rev=1637616595&do=diff 2014 * Tareq Adnan, Suprakash Datta, Stuart MacLean. Efficient and accurate sensor network localization. Personal and Ubiquitous Computing, 18(4): 821-833, 2014 * Franck van Breugel, James Worrell. The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata. In text/html 2023-12-14T19:22:41+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/lab/tg/2015-2019?rev=1702581761&do=diff 2019 * Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare, Qiyi Tang, Franck van Breugel. Computing Probabilistic Bisimilarity Distances for Probabilistic Automata. In Proc. 30th International Conference on Concurrency Theory, 2019. * Panagiota Fatourou, Elias Papavasileiou, text/html 2007-08-15T19:05:25+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/lab/tg/contact?rev=1187204725&do=diff Contact Lab Managers * user1 * user2 Lab Staff * user1 * user2 text/html 2024-08-27T00:21:55+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/lab/tg/courses?rev=1724718115&do=diff Courses Senior-level Theory Courses Offered During 2024-25 * EECS4101/5101 Advanced Data Structures (Fall, Winter) * EECS4141 Introduction to Quantum Computing (Fall) * EECS4171 Advanced Topics in Algorithms (Fall) * EECS6111 Advanced Algorithm Design and Analysis (Fall) text/html 2025-03-16T18:59:28+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/lab/tg/members?rev=1742151568&do=diff Members Faculty * Franck van Breugel (concurrency theory) * Suprakash Datta (modelling and performance evaluation of computer networks, algorithms for parallel and distributed systems, simulation methodology) * Jeff Edmonds (complexity, lower bounds, algorithms) * Shahin Kamali (online & approximation algorithms, algorithms with predictions, graph algorithms, compact data structures, blockchain technology & cryptocurrencies) text/html 2026-02-01T02:31:17+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/lab/tg/research?rev=1769913077&do=diff Research Recent Publications 2026 * Jeff Edmonds. A Physical Framework for Algorithmic Entropy. Entropy 2026, 28(1), 61, Special Issue Kolmogorov Complexity and Applications. Dedicated to Professor Paul Vitanyi's 80th Birthday. * Jeff Edmonds. Why Turing's Computable Numbers Are Only Non-Constructively Closed Under Addition. Entropy 2026, 28(1), 71, Special Issue. text/html 2021-10-15T18:51:13+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/lab/tg/resources?rev=1634323873&do=diff Resources * York's Algorithmics Animation Workshop * The Fields Institute for Research in Mathematical Sciences (sometimes runs events relevant to Theoretical CS in Toronto) * Theory Matters, a collection of surveys and blogs about theoretical computer science * Theory of Computing Blog Aggregator * DBLP, database of computer science publications * Collection of Computer Science Bibliographies * Arxiv collection of scientific papers text/html 2024-03-06T16:11:32+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/lab/tg/sidebar?rev=1709741492&do=diff * Members * Research * Courses * Resources text/html 2024-09-21T00:43:37+00:00 Anonymous (anonymous@undisclosed.example.com) https://wiki.eecs.yorku.ca/lab/tg/start?rev=1726879417&do=diff Theory of Computing Group The Theory of Computing Group is a part of the Department of Electrical Engineering and Computer Science at York University in Toronto, Canada. Theoretical computer science uses mathematical techniques to prove theorems about computation. This area includes * Computability, * Complexity Theory,