Nombre de documents

14

Publications de Florent Becker


Article dans une revue4 documents

  • Becker Florent, Antonio Fernández Anta, Ivan Rapaport, Eric Rémila. The effect of range and bandwidth on the round complexity in the congested clique model. Lecture notes in computer science, springer, 2016, 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings, 9797, pp 182-193. 〈halshs-01417273〉
  • Florent Becker, Adrian Kosowski, Martin Matamala, Nicolas Nisse, Ivan Rapaport, et al.. Allowing each node to communicate only once in a distributed system: shared whiteboard models. Distributed Computing, Springer Verlag, 2015, 28 (3), pp.189-200. 〈10.1007/s00446-014-0221-8〉. 〈hal-01163186〉
  • Florent Becker, Ivan Rapaport, Sergio Rajsbaum, Éric Rémila. Average long-lived binary consensus: Quantifying the stabilizing role played by memory. Theoretical Computer Science, Elsevier, 2010, 411 (14-15), pp.1558-1566. 〈10.1016/j.tcs.2010.01.005〉. 〈hal-00458941〉
  • Florent Becker. Pictures worth a thousand tiles, a geometrical programming language for self-assembly. Theoretical Computer Science, Elsevier, 2009, 410 (16), pp.1495-1515. 〈10.1016/j.tcs.2008.12.011〉. 〈ensl-00248419v3〉

Communication dans un congrès7 documents

  • Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca. The simultaneous number-in-hand communication model on graphs: private coins, public coins and determinism. ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France. 〈hal-01148013〉
  • Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan. Allowing Each Node to Communicate Only Once in a Distributed System: Shared Whiteboard Models. SPAA - 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012, United States. pp.7, 2012. 〈hal-00704200〉
  • Florent Becker, Martin Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, et al.. Adding a referee to an interconnection network: What can(not) be computed in one round.. 25th IEEE International Symposium on Parallel & Distributed Processing (IPDPS), 2011, Anchorage, United States. pp.508-514, 2011. 〈inria-00622976〉
  • Florent Becker, Martin Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, et al.. Reconstruire un graphe en une ronde. Ducourthial, Bertrand et Felber, Pascal. 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France. 2011. 〈inria-00587250〉
  • Florent Becker. Transformations and Preservation of Self-assembly Dynamics through Homotheties. LATA Language and Automata Theory and Applications, 2008, Spain. pp.113-124, 2008. 〈hal-00465643〉
  • Florent Becker, Éric Rémila, Nicolas Schabanel. Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes.. 14th International Meeting on DNA Computing, Jun 2008, Prague, Czech Republic. pp.0, 2008, 〈10.1007/978-3-642-03076-5〉. 〈inria-00448556〉
  • Florent Becker, Éric Rémila, Ivan Rapaport. Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time. FSTTCS, 2006, Kolkota, India. 4337/2006, pp.45-56, 2006, LNCS. 〈10.1007/11944836_7〉. 〈hal-00460570〉

Chapitre d'ouvrage1 document

  • Florent Becker, Jérôme Durand-Lose. Construire et calculer dans un monde 2D. Nicolas Ollinger. Informatique Mathématique --- une photographie en 2015, CNRS édition, pp.135-177, 2015. 〈hal-01251468〉

Rapport2 documents

  • Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan. Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power. [Research Report] RR-7746, INRIA. 2011. 〈inria-00627910〉
  • Florent Becker, Martin Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, et al.. Adding a referee to an interconnection network: What can(not) be computed in one round.. [Research Report] 2010, pp.14. 〈inria-00528733〉