default search action
TheoretiCS, Volume 2
Volume 2, 2023
- Patricia Bouyer, Mickael Randour, Pierre Vandenhove:
Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs. - Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep:
Conditional Dichotomy of Boolean Ordered Promise CSPs. - Pierre Ohlmann:
Characterizing Positionality in Games of Infinite Duration over Infinite Graphs. - Tamajit Banerjee, Rupak Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck, Sadegh Soudjani:
Fast Symbolic Algorithms for Omega-Regular Games under Strong Transition Fairness. - Srikanth Srinivasan:
A Robust Version of Hegedűs's Lemma, with Applications. - Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup:
Fully Dynamic Connectivity in O(log n(loglog n)2) Amortized Expected Time. - Weiming Feng, Heng Guo, Mark Jerrum, Jiaheng Wang:
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions. - Noga Alon, Alon Gonen, Elad Hazan, Shay Moran:
Boosting Simple Learners. - Sepehr Assadi, Pankaj Kumar, Parth Mittal:
Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for Δ-Coloring. - David Eppstein:
The Complexity of Iterated Reversible Computation. - Thomas Place, Marc Zeitoun:
All about unambiguous polynomial closure. - Oded Goldreich, Dana Ron:
Testing Distributions of Huge Objects.
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.