Article dans une revue
Algorithme et structure de données
Affichage des résultats 13 à 24 sur 38 au total
Articles 13 à 24 sur 38 au total
-
-
Communication dans un congrès
Pierre Bergé, Julien Hemery, Arpad Rimmel, Joanna Tomasik. The Competitiveness of Randomized Strategies for Canadians via Systems of Linear Inequalities. International Symposium on Computer and Information Sciences, Sep 2018, Poznan, Poland. ⟨hal-01896511⟩
-
Ouvrages
Paul Zimmermann, Alexandre Casamayou, Nathann Cohen, Guillaume Connan, Thierry Dumont, et al.. Computational Mathematics with SageMath. SIAM, 2018, 978-1-61197-545-1. ⟨10.1137/1.9781611975468⟩. ⟨hal-01646401⟩
-
Communication dans un congrès
Pierre Bergé, Julien Hemery, Arpad Rimmel, Joanna Tomasik. On the competitiveness of memoryless strategies for the $k$-Canadian Traveller Problem. International Conference Combinatorial Optimization and Applications (COCOA), Dec 2018, Atlanta, United States. ⟨hal-02022459⟩
-
Article dans une revue
Eduardo Cruz, Matthias Diener, Laércio Lima Pilla, Philippe Navaux. EagerMap: A Task Mapping Algorithm to Improve Communication and Load Balancing in Clusters of Multicore Systems. ACM Transactions on Parallel Computing, 2019, 5 (4), pp.17. ⟨10.1145/3309711⟩. ⟨hal-02062952⟩
-
Communication dans un congrès
Renan Netto, Sheiny Fabre, Tiago Fontana, Vinicius Livramento, Laércio Lima Pilla, et al.. How Deep Learning Can Drive Physical Synthesis Towards More Predictable Legalization. International Symposium on Physical Design, Apr 2019, San Francisco, United States. ⟨10.1145/3299902.3309754⟩. ⟨hal-02057042⟩
-
Communication dans un congrès
Pierre Bergé, Benjamin Mouscadet, Arpad Rimmel, Joanna Tomasik. Fixed-parameter tractability of counting small minimum (S,T)-cuts. 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Jun 2019, Vall de Núria, Spain. ⟨hal-02105265⟩
-
Rapport
Pierre Bergé, Benjamin Mouscadet, Arpad Rimmel, Joanna Tomasik. Fixed-parameter tractability of counting small minimum $(S,T)$-cuts. [Research Report] LRI. 2019. ⟨hal-02176346⟩
-
Chapitre d'ouvrage
Pierre Bergé, Benjamin Mouscadet, Arpad Rimmel, Joanna Tomasik. Fixed-Parameter Tractability of Counting Small Minimum (S, T)-Cuts. Graph-Theoretic Concepts in Computer Science, pp.79-92, 2019, ⟨10.1007/978-3-030-30786-8_7⟩. ⟨hal-02343993⟩
-
Communication dans un congrès
Jean-Daniel Fekete, Qing Chen, Yuheng Feng, Jonas Renault. Practical Use Cases for Progressive Visual Analytics. DSIA 2019 - 4th Workshop on Data Systems for Interactive Analysis, Oct 2019, Vancouver, Canada. ⟨hal-02342944⟩
-
Article dans une revue
Pierre Bergé, Jean Desmarchelier, Wen Guo, Aurélie Lefebvre, Arpad Rimmel, et al.. Multiple Canadians on the road: minimizing the distance competitive ratio. Journal of Combinatorial Optimization, 2019, 38 (4), pp.1086-1100. ⟨10.1007/s10878-019-00438-6⟩. ⟨hal-02343983⟩
-
Article dans une revue
Pierre Bergé, Arpad Rimmel, Joanna Tomasik. On the parameterized complexity of separating certain sources from the target. Theoretical Computer Science, 2019, 795, pp.183-193. ⟨10.1016/j.tcs.2019.06.011⟩. ⟨hal-02343987⟩