Abstract:
This talk will explore the question of whether and by how much operations on data structures can be sped up by using multiple unsynchronized processes. Taking advantage of concurrency in this setting is a challenge. The talk will describe work by Siddhartha Jayanti and the speaker on the efficiency of concurrent disjoint set union algorithms, including recent unpublished work that uses new ideas to eliminate the need for randomization.
Short bio:
Robert E. Tarjan is the James S. McDonnell Distinguished University Professor of Computer Science at Princeton University. He has held academic positions at Cornell, Berkeley, Stanford, and NYU, and industrial research positions at Bell Labs, NEC, HP, Microsoft, and Intertrust Technologies. He has invented or co-invented many of the most efficient known data structures and graph algorithms. He was awarded the first Nevanlinna Prize from the International Mathematical Union in 1982 for “for outstanding contributions to mathematical aspects of information science,”the Turing Award in 1986 with John Hopcroft for “fundamental achievements in the design and analysis of algorithms and data structures,” and the Paris Kanellakis Award in Theory and Practice in 1999 with Daniel Sleator for the invention of splay trees. He is a member of the U.S. National Academy of Sciences, the U. S. National Academy of Engineering, the American Academy of Arts and Sciences, and the American Philosophical Society. He has published more than 200 papers in high-quality refereed journals, more than 100 papers in refereed conference proceedings, and holds 38 U.S. Patents.
Abstract:
Distributed systems have long suffered from malicious behavior and adversarial attacks. The growth of blockchains and cryptocurrencies has only intensified the problem, especially given the amount of money at stake. A promising response is accountability: the ability of a system to reliably identify participants that misbehave. Accountability can incentivize good behavior, for example, by “slashing” deposits. Or it can support external enforcement via legal or government bodies. Overall, accountability can be a powerful tool for deterring disruption and making systems more robust. An interesting question remains: can accountability also make Byzantine Agreement protocols faster and more efficient? In this talk, I will describe two recent results showing that weak forms of accountability can enable faster agreement. First, I will show how we can iteratively exclude malicious participants, yielding a multi-shot Byzantine Agreement protocol with O(1) average time complexity. Second, I will discuss how to use unreliable “predictions” (derived from any accountability mechanism) to guide an agreement protocol toward faster outcomes—reducing the time for consensus to O(1) when the predictions are good. These results suggest that accountability is not merely a tool for robustness, but can also improve performance. Joint work with: Pierre Civit, Naama Ben-David, Muhammad Ayaz Dzulfikar, Faith Ellen, Rachid Guerraoui, Jovan Komatovic, and Manuel Vidigueira.
Short bio:
Seth Gilbert is a Professor of Computer Science at the National University of Singapore, where he works on distributed algorithms, fault tolerance, and the challenges that arise in designing reliable distributed systems. His research spans classical distributed computing, Byzantine agreement, blockchains, and the real-world robustness issues that appear in modern distributed infrastructures. More broadly, Seth’s work focuses on the algorithmic foundations of robustness and scalability, wherever they may arise.
Abstract:
This talk presents an overview of the requirements and enabling technologies for 6G, with a focus on non-terrestrial networks (NTN). The talk begins with an introduction to key 6G performance targets, architectural trends, and emerging use cases. It then highlights our long-term research on drone-based networks, which we have been developing since 2018 as a representative NTN use case. I will discuss system design challenges, network control, and communication efficiency in aerial environments. The talk also introduces semantic communication as a promising paradigm for future 6G systems, highlighting how meaning-aware and task-oriented transmission can improve efficiency and robustness in drone and NTN scenarios.
Short bio:
Kaoru Ota received her B.S. and Ph.D. degrees from the University of Aizu, Japan, in 2006 and 2012, respectively, and her M.S. degree from Oklahoma State University, USA, in 2008. She is a Distinguished Professor at the Graduate School of Information Sciences, Tohoku University, Japan, and a Professor at the Center for Computer Science (CCS), Muroran Institute of Technology, Japan, where she served as the founding director. She has been recognized as a Highly Cited Researcher by Clarivate Analytics in 2019, 2021, and 2022, a Fellow of the Engineering Academy of Japan (EAJ) in 2022, and a Fellow of the Asia-Pacific Artificial Intelligence Association (AAIA) in 2025.