Skip to Main content Skip to Navigation
New interface

Search by documents

hal-02286807v1  Journal articles
Hugues RandriambololonaL. SokPatrick Solé. Lower bounds on the minimum distance of long codes in the Lee metric
Designs, Codes and Cryptography, 2015, 74 (2), pp.441-452
hal-02286931v1  Conference papers
Irène CharonI. HonkalaOlivier HudryAntoine Lobstein. Variations of identifying codes in graphs obained by adding or removing one vertex
9th International colloquium on graph theory and combinatorics (ICGT 2014), Jul 2014, Grenoble, France. pp.1-4
hal-02288521v1  Conference papers
Fatima Zohra KaddourPhilippe MartinsLaurent DecreusefondEmmanuelle VivierLina Mroueh. Outage probability upper bound for multi-class QoS in the uplink of LTE networks
2013 IEEE Global Communications Conference, GLOBECOM 2013, Atlanta, GA, USA, December 9-13, 2013, Mar 2013, Atlanta, United States. pp.4129-4134, ⟨10.1109/GLOCOM.2013.6831720⟩
hal-02287274v1  Conference papers
Olivier Hudry. Computation of the winner of an election
Decision making and Social Choice, Apr 2015, Bruxelles, Belgium
hal-02287584v1  Journal articles
Rahul VazeMarceau Coupechoux. Online Budgeted Truthful Matching
ACM SIGMETRICS Performance Evaluation , 2016, 44 (3), pp.3-6
hal-02287727v1  Conference papers
Amrit Singh BediKetan RejawatMarceau Coupechoux. An Online Approach to D2D Trajectory Utility Maximization Problem
IEEE International Conference on Computer Communications (INFOCOM), Apr 2018, Honolulu, United States. pp.1-9
hal-02287622v1  Conference papers
David GrimsmanMohammed Shabbir AliJoao P. HespanhaJason R. Marden. Impact of Information in Greedy Submodular Maximization
IEEE Conference on Decision and Control (CDC), Dec 2017, Melbourne, Australia. pp.1-7
hal-02287479v1  Conference papers
Ivan DavydovMarceau CoupechouxStefano Iellamo. Tabu Search Approach for the Bi-Level Competitive Base Station Location Problem
Int. Conf. on Discrete Optimization and Operation Research (DOOR), Sep 2016, Vladivostok, Russia
hal-02288050v1  Conference papers
Marie Al-GhosseinTalel AbdessalemAnthony Barré. Exploiting Contextual and External Data for Hotel Recommendation
Adjunct Publication of the 26th Conference on User Modeling, Adaptation and Personalization (UMAP 2018), Jul 2018, Singapore, Singapore. pp.323-328, ⟨10.1145/3213586.3225245⟩
hal-02286501v1  Journal articles
Hugues Randriambololona. Asymptotically good binary linear codes with asymptotically good self-intersection spans
IEEE Transactions on Information Theory, 2013, 59 (5), pp.3038-3045
hal-02287379v1  Conference papers
Matthieu Rambaud. optimal Chudnovsky Chudnovsky multiplication algorithms
WAIFI 2014, Jul 2015, gebze, Turkey
hal-02292454v1  Conference papers
Avranas ApostolosAnastasios Giovanidis. Performance of spatial Multi-LRU caching under traffic with temporal locality
9th International Symposium on Turbo Codes & Iterative Information Processing (ISTC) 2016, Sep 2016, Brest, France
hal-03023517v1  Conference papers
Sihem MesnagerA. Sinak. Regular graphs from weakly regular plateaued functions
Proceedings of 2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA 2019), Oct 2019, Dongguan, China
hal-03023235v1  Journal articles
Sihem MesnagerClaude CarletC. Li. Linear codes with small hulls in semi-primitive case
Designs, Codes and Cryptography, 2019
hal-02287136v1  Reports
Jean-Louis Dessalles. Ex-Post Algorithmic Probability
[Research Report] 2011-D-009, Télécom ParisTech. 2011
hal-02287134v1  Journal articles
Olivier HudryAntoine Lobstein. More Results on the Complexity of Identifying Problems in Graphs
Theoretical Computer Science, 2016, 626, pp.1-12
hal-02286316v1  Conference papers
Olivier Hudry. Majority graphs of profiles of equivalence relations and complexity of Régnier’s problem
11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2012), May 2012, Munich, Germany. pp.147-150
hal-02286382v1  Journal articles
Irène CharonI. HonkalaOlivier HudryAntoine Lobstein. Minimum Sizes of Identifying Codes in Graphs Differing by One Vertex
Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences, 2013, 5, pp.119-136
hal-00753801v1  Journal articles
Laurent DecreusefondIan Flint. Moment formulae for general point processes
Journal of Functional Analysis, Elsevier, 2014, 267 (2), pp.452-476
hal-00586775v1  Journal articles
Laurent Decreusefond. L'intégrale
Images des Mathématiques, CNRS, 2010,
hal-00160001v1  Journal articles
Laurent DecreusefondPascal Moyal. A functional central limit theorem for the M/GI/infinity queue
Annals of Applied Probability, Institute of Mathematical Statistics (IMS), 2008, 18 (6), pp.2156-2178. ⟨10.1214/08-AAP518⟩
hal-03035600v1  Conference papers
Sihem MesnagerK. KaytannciFerruh Ozbudak. On Plateaued Functions, Linear Structures, and Permutation Polynomials
International Conference on Codes, Cryptology and Information Security C2SI 2019, 2019, Rabat, Morocco
hal-02098892v1  Journal articles
Laure CoutinLaurent Decreusefond. Donsker's theorem in {Wasserstein}-1 distance
Electronic Communications in Probability, 2020, 25, pp.1--13
hal-01702966v1  Journal articles
Olivier HudryAntoine Lobstein. The Compared Costs of Domination, Location-Domination and Identification
Discussiones Mathematicae Graph Theory, 2020, 40 (1), pp.127-147. ⟨10.7151/dmgt.2129⟩
hal-00986189v1  Journal articles
Laure CoutinLaurent Decreusefond. Higher order approximations via Stein's method
Communications on Stochastic Analysis, 2014, pp.~
hal-00979218v1  Conference papers
Gerard CohenSihem MesnagerAlain Patey. On Minimal and Quasi-minimal Linear Codes
14th IMA International Conference, IMACC 2013, Dec 2013, Oxford, United Kingdom. pp.85-98, ⟨10.1007/978-3-642-45239-0_6⟩