Articles by LIP | Synthical

Synthical

Your space

Profile

Activity

Favorites

Folders

Feeds

Contacts

About

Claim page

LIP

Follow

Activity

Articles

121

Authors

Folders

The supersingular endomorphism ring problem given one endomorphism

24 February 2025 by Arthur Herlédan Le Merdy and Benjamin Wesolowski

Cryptography and Security, Number Theory

Holonomic equations and efficient random generation of binary trees

23 January 2024 by Pierre Lescanne at

Data Structures and Algorithms, Computational Complexity

Heavy quarks and jets as probes of the QGP

29 July 2022 by Liliana Apolinário and others at

High Energy Physics, Nuclear Experiment

Eager Functions as Processes (long version)

7 February 2022 by Adrien Durier and others at

Logic in Computer Science

L-types for resource aware languages: an implicit name approach

27 February 2025 by Silvia Ghilezan and others

Logic in Computer Science, Logic

Sized Types with Usages for Parallel Complexity of Pi-Calculus Processes

19 October 2021 by Patrick Baillot and others at

Computational Complexity, Distributed, Parallel, and Cluster Computing

Zaionc paradox revisited

26 April 2021 by Pierre Lescanne at

Logic in Computer Science, Logic

Extensive Infinite Games and Escalation, an exercise in Agda

19 June 2020 by Pierre Lescanne at

Logic in Computer Science, Logic

Orbits of monomials and factorization into products of linear forms

10 July 2018 by Pascal Koiran and Nicolas Ressayre at

Computational Complexity, Symbolic Computation

Robustness of classifiers to uniform \ell\_p and Gaussian noise

22 February 2018 by Jean-Yves Franceschi and others at

Machine Learning, Computer Vision and Pattern Recognition

Root Separation for Trinomials

13 December 2017 by Pascal Koiran at

Symbolic Computation, Computational Complexity

On the Spectral Properties of Symmetric Functions

11 April 2017 by Anil Ada and others at

Computational Complexity, Functional Analysis

Quantitative aspects of linear and affine closed lambda terms

16 February 2017 by Pierre Lescanne at

Discrete Mathematics, Logic in Computer Science

Dependent Types for Extensive Games

31 January 2017 by Pierre Lescanne at

Computer Science and Game Theory, Logic

Games and Strategies as Event Structures

6 January 2017 by Simon Castellan and others at

Logic, Logic in Computer Science

The risk of divergence

22 December 2015 by Pierre Lescanne at

Computer Science and Game Theory

An encoding of array verification problems into array-free Horn clauses

30 September 2015 by David Monniaux and Laure Gonnord at

Programming Languages, Logic in Computer Science

Lower Bounds by Birkhoff Interpolation

8 July 2015 by Ignacio Garcia-Marco and Pascal Koiran at

Computational Complexity

Orienting edges to fight fire in graphs

24 June 2015 by Julien Bensmail and Nick Brettell at

Discrete Mathematics

Intelligent escalation and the principle of relativity

27 May 2015 by Pierre Lescanne at

Computer Science and Game Theory

Log-concavity and lower bounds for arithmetic circuits

26 March 2015 by Ignacio García-Marco and others at

Computational Complexity, Discrete Mathematics

Hilbert-Post completeness for the state and the exception effects

5 June 2015 by Jean-Guillaume Dumas and others at

Logic in Computer Science

Strong edge-coloring of (3, Δ)-bipartite graphs

18 August 2015 by Julien Bensmail and others at

Discrete Mathematics, Combinatorics

Resource control and intersection types: an intrinsic connection

6 December 2014 by S. Ghilezan and others at

Logic in Computer Science, Logic

Concurrent Hyland-Ong games

6 January 2017 by Simon Castellan and others at

Logic in Computer Science, Logic

Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests

9 July 2014 by Damien Pous at

Formal Languages and Automata Theory, Logic in Computer Science

Boltzmann samplers for random generation of lambda terms

28 April 2014 by Pierre Lescanne at

Data Structures and Algorithms, Logic in Computer Science

Coinduction up to in a fibrational setting

15 May 2014 by Filippo Bonchi and others at

Logic in Computer Science, Discrete Mathematics

On the intersection of a sparse curve and a low-degree curve: A polynomial version of the lost theorem

23 July 2014 by Pascal Koiran and others at

Computational Complexity, Algebraic Geometry

A tau-conjecture for Newton polygons

13 May 2014 by Pascal Koiran and others at

Computational Complexity

Load more

This is an AI-generated summary

Key points

Topics

Logic in Computer Science Computational Complexity Computer Science and Game Theory Logic Discrete Mathematics Symbolic Computation Programming Languages Data Structures and Algorithms Distributed, Parallel, and Cluster Computing Numerical Analysis Mathematical Software Combinatorics Networking and Internet Architecture Number Theory Commutative Algebra