Bagchi, Susmit

The control and termination detection of a distributed computation involving large-scale distributed database is difficult in the presence of concurrency, random network delays, and varying reliability of computing nodes. The formal modeling and analysis of controllability as well as termination detection of such systems are required to design reli...

Bagchi, Susmit

The control and termination detection of a distributed computation involving large-scale distributed database is difficult in the presence of concurrency, random network delays, and varying reliability of computing nodes. The formal modeling and analysis of controllability as well as termination detection of such systems are required to design reli...

Bagchi, Susmit

The control and termination detection of a distributed computation involving large-scale distributed database is difficult in the presence of concurrency, random network delays, and varying reliability of computing nodes. The formal modeling and analysis of controllability as well as termination detection of such systems are required to design reli...

Bagchi, Susmit

The control and termination detection of a distributed computation involving large-scale distributed database is difficult in the presence of concurrency, random network delays, and varying reliability of computing nodes. The formal modeling and analysis of controllability as well as termination detection of such systems are required to design reli...

Ducas, L. (Léo)

Asymptotically, the best known algorithms for solving the Shortest Vector Problem (SVP) in a lattice of dimension n are sieve algorithms, which have heuristic complexity estimates ranging from (4/3)n+o(n) down to (3/2)n/2+o(n) when Locality Sensitive Hashing techniques are used. Sieve algorithms are however outperformed by pruned enumeration algori...

Santocanale, Luigi Wehrung, Friedrich

It is well-known that the weak Bruhat order on the symmetric group on a finite number n of letters is a lattice, denoted by P(n) and often called the permutohedron on n letters, of which the Tamari lattice A(n) is a lattice retract. The equational theory of a class of lattices is the set of all lattice identities satisfied by all members of that cl...

Miquel, Sebastien

Soit G un groupe algébrique réel simple de rang réel au moins 2 et P un sous-groupe parabolique de G. On montre que tout sous-groupe discret de G intersectant le radical unipotent de P en un réseau est un réseau aritmétique de G, sauf éventuellement lorsque G = SO(2,4n+2) et P est le stabilisateur d'un 2-plan isotrope. Ceci répond partiellement à u...

Miquel, Sebastien

Soit G un groupe algébrique réel simple de rang réel au moins 2 et P un sous-groupe parabolique de G. On montre que tout sous-groupe discret de G intersectant le radical unipotent de P en un réseau est un réseau aritmétique de G, sauf éventuellement lorsque G = SO(2,4n+2) et P est le stabilisateur d'un 2-plan isotrope. Ceci répond partiellement à u...

Grémy, Laurent

The security of public-key cryptography relies mainly on the difficulty to solve some mathematical problems, among which the discrete logarithm problem on finite fields GF(p^n). In this thesis, we study the variants of the number field sieve (NFS) algorithm, which solve the most efficiently this problem, in the case where the characteristic of the ...

Grémy, Laurent

The security of public-key cryptography relies mainly on the difficulty to solve some mathematical problems, among which the discrete logarithm problem on finite fields GF(p^n). In this thesis, we study the variants of the number field sieve (NFS) algorithm, which solve the most efficiently this problem, in the case where the characteristic of the ...