Abstract. Miller’s algorithm for computing pairings involves performing multiplications between elements that belong to different finite fields. Namely, elements in the full e...
Craig Costello, Colin Boyd, Juan Manuel Gonz&aacut...
Summary: The MolClass toolkit and data portal generates computational models from user-defined small molecule datasets based on structural features identified in hit and non-hit m...
Difference Systems of Sets (DSS) are combinatorial configurations that arise in connection with code synchronization. A method for the construction of DSS from partitions of cycli...
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
Anne Bergeron, Cedric Chauve, Fabien de Montgolfie...