EUVIMED · CrossrefJournal
TheoretiCS
ISSN 2751-4838 · Centre pour la Communication Scientifique Directe (CCSD)
Latest articles
Tight Lower Bound for Multicolor Discrepancy
Query-Efficient Fixpoints of $\ell_p$-Contractions
Succinct Oblivious Tensor Evaluation and Applications: Adaptively-Secure Laconic Function Evaluation and Trapdoor Hashing for All Circuits
Fairness and Incentive Compatibility via Percentage Fees
A Discrete Analog of Tutte's Barycentric Embeddings on Surfaces
Testing Support Size More Efficiently Than Learning Histograms
On Approximability of Satisfiable k-CSPs: V
Improved Hardness Results for Learning Intersections of Halfspaces
Extensional Taylor Expansion
On Approximability of Steiner Tree in $\ell_p$-metrics
A Refined Laser Method and Faster Matrix Multiplication
DeepSec: Deciding Equivalence Properties for Security Protocols -- Improved theory and practice
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing
Perfect Matching in Random Graphs is as Hard as Tseitin
Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs
The Complexity of Iterated Reversible Computation
All about unambiguous polynomial closure
Testing Distributions of Huge Objects
Conditional Dichotomy of Boolean Ordered Promise CSPs
Characterizing Positionality in Games of Infinite Duration over Infinite Graphs
Fast Symbolic Algorithms for Omega-Regular Games under Strong Transition Fairness
A Robust Version of Heged\H{u}s's Lemma, with Applications
Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amortized Expected Time
A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
Boosting Simple Learners
Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $\Delta$-Coloring
Strongly Sublinear Algorithms for Testing Pattern Freeness
On Classifying Continuous Constraint Satisfaction Problems
Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism
EUVIMED