• Accueil »
  • Programmes »
  • Les programmes thématiques

  • Accueil

  • Programmes

    • Publications

    Codes couleurs

    1. rouge : postdocs LMH
    2. bleu : doctorants LMH
    3. vert : membres des projets de recherches subventionnés par le LMH
    4. violet : chercheurs invités sur des programmes du LMH

     

    Avant 2015

    • S. Clémençon, J. Jakubowicz, and E. Sibony, Multiresolution analysis of incomplete rankings [arxiv.org], ArXiv 1403.1994, 2014 IEEE International Conference on BigData.
    • F. Roueff, A. Sanchez Perez, Numerical cost for time series prediction via aggregation. In Colloque Gretsi, Brest, France, September 2013. http://biblio.telecomparistech. fr/cgi-bin/download.cgi?id=13995
    • F. Roueff, A. Sanchez Perez, Online adaptive forecasting of a locally stationary time varying autoregressive process. The second Workshop on Industry & Practices for Forecasting, Paris, France, June 2013;
    • F. Roueff, A. Sanchez Perez, C. Giraud, Adaptive online forecasting of a locally stationary time varying autoregressive process. In Statistical Inference for Complex Time Series Data, number 48 in Mathematisches Forschungsinstitut Oberwolfach, September 2013
    • A. Sanchez Perez, Time series prediction via aggregation : an oracle bound including numerical cost. Lecture Notes in Statistics 217, Springer Verlag, 2014, 243-265.
    • L. Oudre, Automatic Detection and Removal of Impulsive Noise in Audio Signals, IPOL J. Image Process. Online 5 (2015), 267–281.
    • F. Picard, F. Tilquin, and L. Oudre, Audio files realignment by Dynamic Time Warping (DTW) methods. IPOL, 2013

     

    2015-2016

    • S. Ballet, J. Pieltant, M. Rambaud, J. Sisjling, On some bounds for symmetric tensor rank of multiplication in finite fields. In Arithmetic, geometry, cryptography and coding theory, 93–121, Contemp. Math., 686, Amer. Math. Soc., Providence, RI, 2017.
    • S. Ballet, J. Pieltant, Tower of algebraic function fields with maximal Hasse-Witt invariant and tensor rank of multiplication in any extension of F2 and F3. J. Pure Appl. Algebra 222 (2018), no. 5, 1069–1086.
    • M. MacCaig. On scaling to an integer matrix and graphs with integer weighted cycles. Linear Algebra Appl. 498 (2016), 490-520.
    • J. Pieltant, H. Randriam. New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields. Math. Comp. 84 (2015), no. 294, 2023–2045.

     

    2016-2017

    • X. Allamigeon, S. Gaubert, and M. Skomra, Tropical spectralhedra. arXiv:1610.06746, hal-01676701 October 2016.
    • C. Boura , A. Chakraborti , G. Leurent, G. Paul, D. Saha , H. Soleimany, V. Suder, Key Recovery Attack against 2.5-round pi-Cipher. Fast Software Encryption - 23rd International Conference, FSE 2016 . T. 9783. Lecture Notes in Computer Science. Springer, 2016, p. 535-553.
    • C. Boura , A. Canteaut , V. Suder et J. Jean, Two notions of differential equivalence on Sboxes . In : Workshop on Coding and Cryptography - WCC 2017. 2017.
    • Benjamin Doerr, Carola Doerr, and Jing Yang. k-bit mutation with self-adjusting k outperforms standard bit mutation. In Proc. of Parallel Problem Solving from Nature (PPSN'16), volume 9921 of Lecture Notes in Computer Science, pages 824-834. Springer, 2016.
    • Benjamin Doerr and Carola Doerr, Optimal static and Self-Adjusting Parameter Choices or the $(1+ (\lambda,\lambda))$ Genetic Algorithm, Algorithmica 80 (2018), no. 5, 1658–1709.
    • J. Kwon and P. Mertikopoulos, A continuous-time approach to online optimization, J. Dyn. Games 4 (2017), no. 2, 125–148.
    • J. Kwon and V. Perchet, Online learning with partial monitoring: optimal convergence rates, à paraître dans JMLR Workshop Conf. Proc. (AISTATS 2017) 
    • V. Suder, Antiderivative functions over F_2. Designs, Codes and Cryptography 82.1-2 (2017), 435-447.

     

    2017-2018

    • R. Alessi, V. Crismale, G. Orlando, Fatigue effects in elastic materials with variational damage models : Avanishing viscosity appraoch, Preprint https://arxiv.org/pdf/1807.04675.pdf.
    • X. Allamigeon, P. Benchimol, S. Gaubert, and M. Joswig, Log-barier interior and point methods are not strongly polynomial, SIAM J. Appl. Alg. Geom., 2, (2018 140-178.
    • X. Allamigeon, V. Boeuf, and S. Gaubert, Stationary solutions of discrete and continuous petri nets with priorities. Performance Evaluation, 113 :1--12, 2017.
    • X. Allamigeon, S. Gaubert, and M. Skomra, Solving generic nonarchimedean semidefinite programs using stochastic game algorithms.Journal of Symbolic Computation, 85, (2018) 25-54.
    • X. Allamigeon, S. Gaubert, and M. Skomra, The tropical analogue of the Helton-Nie conjecture is true, Journal of Symbolic Computation, (2018) (in press).
    • X. Allamigeon, X. Katz, D. Ricardo, Tropicalisation of facets of polytopes, Linear Alg. Appl., 523, (2017) 79-101.
    • F. Boarotto, M. Sigalotti, Time-Optimal Trajectories of Generic Control-Affine Systems Have at Worst Iterated Fuller Singularities, Annales IHP, Anal. Non linéaire, (to appear) (arXiv:1705.10055).
    • U. Boscain, R. Chertovskih, J.-P. Gauthier, D. Prandi, A. Remizov, Cortical-inspired image reconstruction via sub-Riemannian geometry and hypoelliptic diffusion. arXiv:1801.03800
    • C. Boura, A. Canteaut, J. Jean et V. Suder, Two Notions of Differential Equivalence on SBoxes, Design, Codes and Cryptography, Springer (Soumis).
    • D. Brockoff, A. Auger, N. Hansen, T. Tuar, Quantitative Performance Assessment of Multiobjective Optimizers: The Average Runtime Attainment Function, Evolutionary Multi-Criterion Optimization, LNCS, (2017) 103—109.
    • A. Chambolle, V. Crismale, Compactness and lower semicontinuity in GSDB, Preprint https://arxiv.org/abs/1802.03302.
    • A. Chambolle, V. Crismale, A density result in GSBDp with applications to the approximation of brittle fracture energies, Preprint hal-01573936, Soumis à Comm. Pure Appl. Math.
    • V. Crismale, On the approximation by SDB functions and some applications, Preprint http://cvgmt.sns.it/media/doc/paper/3892/DensitySBD.pdf
    • V. Crismale, G. Lazzaroni, G. Orlando, Cohesive fracture with irreversibility : quasistatic evolution for a model subject to fatigue, Math. Mod. Meth. Appl. Sci., 28, (2018) 1371-1412.
    • V. Crismale, G. Orlando, A Reshetnyak-type lower semicontinuity result for linearised elasto-plasticity coupled with damage in W^{1,n}, Nonl. Diff. Eqns. Appl. (NoDEA) 25, (2018) Article 16, (hal-01573938).
    • B. Doerr, C. Doerr, and T. Kützing, Static and self-adjusting mutation strengths for multi-valued decision variables, Algorithmica 80 (2018), no. 5, 1732–1768.
    • O. Fercoq, Q Van Nguyen and B Cong Vu. Smoothing technique for nonsmooth composite minimization with linear operator, Preprint arxiv 1706.05837.
    • O. Fercoq and Z Qu. 2016, Restarting accelerated gradient methods with a rough strong convexity estimate. https://arxiv.org/abs/1609.07358
    • O. Fercoq and Zheng Qu, Adaptive restart of accelerated gradient methods under local quadratic growth condition, https://arxiv.org/abs/1709.02300
    • S. Gaubert and M. MacCaig, 2017. Approximating the Volume of Tropical Polytopes is Difficult. arxiv :1706.06467
    • P. Ciarlet, E. Jamelot, F. Kpadonou, Domain decomposition methods for the diffusion equation with low-regularity solution. Computers & Mathematics with Applications 74, (2017), 2369-2384.
    • J. Kwon and V. Perchet, Gains and losses are fundamentally different in regret minimization: the sparse case, J. Mach. Learn. Res. 17(229):1-32, 2016.
    • J. Kwon, A universal bound on the variations of bounded convex functions, J. Convex Anal. 24(1):67-73, 2017.
    • A. Lionnet, Adapted time steps explicit scheme for monotone BSDEs. Submitted.) arXiv:1612.00077
    • A. Lionnet, G. dos Reis and L. Szpruch. 2017. Full-Projection scheme for monotone BSDEs with polynomial growth. (Submitted.) arXiv:1612.00078
    • C. Rapine, B. Penz, C. Gicquel, A. Akbalik, Capacity acquisition for the single-item lot sizing problem under energy constraints, Omega (2018) 112-122.
    • C. Rapine, G. Goisque, A. Akbalik, Energy-aware lot sizing problem: Complexity analysis and exact algorithms,Int. J. Prod. Economics, (2018) 254-263.