Time, Space, and Energy in Reversible Computing

Time-Space Trade-Offs for Predecessor Search

Topological approach to solve P versus NP

Towards a characterization of the star-free sets of integers

Towards a Dichotomy for the Possible Winner Problem in Elections Based on Scoring Rules

Towards an Optimal Separation of Space and Length in Resolution

Towards Analog Reverse Time Computation

Towards Robust Quantum Computation

Towards the Notion of an Abstract Quantum Automaton

Trading GRH for algebra: algorithms for factoring polynomials and related structures

Traveling Salesmen in the Presence of Competition

Tree Automata and Essential Input Variables

Tree Automata and Essential Subtrees

Tree automata and separable sets of input variables

Tron, a combinatorial Game on abstract Graphs

Turing degrees of multidimensional SFTs

Turing Machines and Understanding Computational Complexity

Two conjectures such that the proof of any one of them will lead to the proof that P = NP

Two graph isomorphism polytopes

Two Hands Are Better Than One (up to constant factors)