default search action
Theoretical Computer Science, Volume 971
Volume 971, September 2023
- Klaus-Tycho Foerster, Tomasz Jurdzinski, Stefan Schmid:
Guest editorial: Structural Information and Communication Complexity 2021. 113913
- Orna Kupferman, Asaf Petruschka:
Lazy regular sensing. 114057
- Lizhen Nan, Shiying Wang, Lina Zhao:
Fault-tolerant strong Menger connectivity of modified bubble-sort graphs. 114060
- Bogdan Aman, Gabriel Ciobanu:
Relating randomized right-hand sides to communicating rewriting rules. 114062
- Riccardo Bianchini, Francesco Dagnino, Paola Giannini, Elena Zucca:
A Java-like calculus with heterogeneous coeffects. 114063 - Dibyayan Chakraborty, Kshitij Gajjar:
Finding geometric representations of apex graphs is NP-hard. 114064 - Panagiotis Kanellopoulos, Maria Kyropoulou, Alexandros A. Voudouris:
Not all strangers are the same: The impact of tolerance in Schelling games. 114065 - Lv Chen, Lingli Chen, Qin Li:
Practical multi-party quantum homomorphic encryption. 114067 - Virginia Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond:
A lower bound for constant-size local certification. 114068
- Duri Janett, Johannes Lengler:
Two-dimensional drift analysis: Optimizing two functions simultaneously can be hard. 114072 - Van-Giang Trinh, Belaid Benhamou, Sylvain Soliman:
Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding. 114073 - Benjamin Doerr, Martin S. Krejca:
Bivariate estimation-of-distribution algorithms can find an exponential number of optima. 114074
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.