Unique perfect matchings and proof nets. - Lê Thành Dung Nguyên (FSCD, 2018)

Coherent Interaction Graphs. - Lê Thành Dung Nguyên; Thomas Seiller (Linearity-TLLA@FLoC, 2018)

From Normal Functors to Logarithmic Space Queries. - Lê Thành Dung Nguyên; Cécilia Pradic (ICALP, 2019)

Constrained path-finding and structure from acyclicity. - Lê Thành Dung Nguyên (CoRR, 2019)

Unique perfect matchings, edge-colored graphs and proof nets for linear logic with Mix. - Lê Thành Dung Nguyên (CoRR, 2019)

Finite semantics of polymorphism, complexity and the power of type fixpoints. - Lê Thành Dung Nguyên; Paolo Pistone; Thomas Seiller; Lorenzo Tortora de Falco (CoRR, 2019)

Typed lambda-calculi and superclasses of regular functions. - Lê Thành Dung Nguyên (CoRR, 2019)

On the Elementary Affine Lambda-Calculus with and Without Fixed Points. - Lê Thành Dung Nguyên (DICE-FOPARA@ETAPS, 2019)

When lattice cubes meet affine subspaces: a short note. - Lê Thành Dung Nguyên (CoRR, 2019)

Implicit Automata in Typed λ-Calculi I: Aperiodicity in a Non-Commutative Logic. - Lê Thành Dung Nguyên; Cécilia Pradic (ICALP, 2020)

Implicit automata in typed λ-calculi II: streaming transducers vs categorical semantics. - Lê Thành Dung Nguyên; Camille Noûs; Cécilia Pradic (CoRR, 2020)

Unique perfect matchings, forbidden transitions and proof nets for linear logic with Mix. - Lê Thành Dung Nguyên (Log. Methods Comput. Sci., 2020)

Comparison-Free Polyregular Functions. - Lê Thành Dung Nguyên; Camille Noûs; Cécilia Pradic (ICALP, 2021)

Automates implicites en logique linéaire et théorie catégorique des transducteurs. (Implicit automata in linear logic and categorical transducer theory). - Lê Thành Dung Nguyên (2021)

BV and Pomset Logic Are Not the Same. - Lê Thành Dung Nguyên; Lutz Straßburger (CSL, 2022)

Algebraic Recognition of Regular Functions. - Mikolaj Bojanczyk; Lê Thành Dung Nguyên (ICALP, 2023)

Revisiting the growth of polyregular functions: output languages, weighted automata and unary inputs. - Sandra Kiefer; Lê Thành Dung Nguyên; Cécilia Pradic (CoRR, 2023)

Two-way automata and transducers with planar behaviours are aperiodic. - Lê Thành Dung Nguyên; Camille Noûs; Cécilia Pradic (CoRR, 2023)

Syntactically and semantically regular languages of lambda-terms coincide through logical relations. - Vincent Moreau 001; Lê Thành Dung Nguyên (CoRR, 2023)

A System of Interaction and Structure III: The Complexity of BV and Pomset Logic. - Lê Thành Dung Nguyên; Lutz Straßburger (Log. Methods Comput. Sci., 2023)

Syntactically and Semantically Regular Languages of λ-Terms Coincide Through Logical Relations. - Vincent Moreau 001; Lê Thành Dung Nguyên (CSL, 2024)

Function Spaces for Orbit-Finite Sets. - Mikolaj Bojanczyk; Lê Thành Dung Nguyên; Rafal Stefanski (ICALP, 2024)

On the complexity of normalization for the planar λ-calculus. - Anupam Das; Damiano Mazza; Lê Thành Dung Nguyên; Noam Zeilberger (CoRR, 2024)

Two or three things I know about tree transducers. - Lê Thành Dung Nguyên (CoRR, 2024)

Simply typed convertibility is TOWER-complete even for safe lambda-terms. - Lê Thành Dung Nguyên (Log. Methods Comput. Sci., 2024)

Slightly Non-Linear Higher-Order Tree Transducers. - Lê Thành Dung Nguyên; Gabriele Vanoni (STACS, 2025)

The structure of polynomial growth for tree automata/transducers and MSO set queries. - Paul Gallot; Nathan Lhote; Lê Thành Dung Nguyên (CoRR, 2025)