default search action
Florent Becker
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Franck Scuiller
, Florent Becker
Sensorless Control for a Nonsinusoidal Seven-Phase Surface-Mounted PM Machine. IEEE Trans. Ind. Electron. 71(11): 13492-13502 (2024) - [i8]Florent Becker:
Strict Self-Assembly of Discrete Self-Similar Fractal Shapes. CoRR abs/2405.08548 (2024) - 2023
- [c14]Florent Becker, Shahrzad Heydarshahi:
DNA Tile Self-Assembly for 3D-Surfaces: Towards Genus Identification. DNA 2023: 2:1-2:21 - 2022
- [i7]Florent Becker, Shahrzad Heydarshahi:
DNA tile self-assembly for 3D-surfaces and genus identification. CoRR abs/2210.13094 (2022) - 2021
- [j7]Florent Becker, Pedro Montealegre
The role of randomness in the broadcast congested clique model. Inf. Comput. 281: 104669 (2021) - [j6]Florent Becker, Tom Besson, Jérôme Durand-Lose
Abstract Geometrical Computation 10: An Intrinsically Universal Family of Signal Machines. ACM Trans. Comput. Theory 13(1): 4:1-4:31 (2021) - 2020
- [j5]Florent Becker, Pedro Montealegre
The Impact of Locality in the Broadcast Congested Clique Model. SIAM J. Discret. Math. 34(1): 682-700 (2020) - [c13]Florent Becker, Franck Scuiller
Fault-tolerant control of a 7-Phase Surface-mounted PM Machine with tooth-concentrated winding. ICIT 2020: 1044-1049
2010 – 2019
- 2018
- [j4]Florent Becker, Mathieu Chapelle, Jérôme Durand-Lose
Abstract geometrical computation 8: Small machines, accumulations & rationality. J. Comput. Syst. Sci. 97: 182-198 (2018) - [c12]Florent Becker, Diego Maldonado
Universality in Freezing Cellular Automata. CiE 2018: 50-59 - [c11]Florent Becker, Pedro Montealegre
The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model. LATIN 2018: 134-145 - [i6]Florent Becker, Jérôme Durand-Lose, Mohammad-Hadi Foroughmand-Araabi, Sama Goliaei:
An Intrinsically Universal Family of Signal Machines. CoRR abs/1804.09018 (2018) - [i5]Florent Becker, Diego Maldonado, Nicolas Ollinger, Guillaume Theyssier:
Universality in Freezing Cellular Automata. CoRR abs/1805.00059 (2018) - 2016
- [c10]Florent Becker, Antonio Fernández Anta
The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model. COCOON 2016: 182-193 - 2015
- [j3]Florent Becker, Adrian Kosowski, Martín Matamala
Allowing each node to communicate only once in a distributed system: shared whiteboard models. Distributed Comput. 28(3): 189-200 (2015) - [c9]Florent Becker, Antonio Fernández Anta, Ivan Rapaport, Eric Rémila:
Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to Unicast. PODC 2015: 167-169 - [i4]Florent Becker, Pierre-Étienne Meunier:
It's a Tough Nanoworld: in Tile Assembly, Cooperation is not (strictly) more Powerful than Competition. CoRR abs/1502.05558 (2015) - 2014
- [c8]Florent Becker, Pedro Montealegre
The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism. SIROCCO 2014: 83-95 - 2013
- [i3]Florent Becker, Mathieu Chapelle, Jérôme Durand-Lose, Vincent Levorato, Maxime Senot:
Abstract Geometrical Computation 8: Small Machines, Accumulations and Rationality. CoRR abs/1307.6468 (2013) - 2012
- [c7]Philippe Weber
Reliability Analysis of Fault Tolerant Wind Energy Conversion System with Doubly Fed Induction Generator. ICIRA (1) 2012: 483-492 - [c6]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 2012: 11-17 - 2011
- [c5]Florent Becker, Martín Matamala
Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round. IPDPS 2011: 508-514 - [i2]Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan:
Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power. CoRR abs/1109.6534 (2011) - 2010
- [j2]Florent Becker, Sergio Rajsbaum
Average long-lived binary consensus: Quantifying the stabilizing role played by memory. Theor. Comput. Sci. 411(14-15): 1558-1566 (2010) - [i1]Florent Becker, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca:
Adding a referee to an interconnection network: What can(not) be computed in one round. CoRR abs/1009.4447 (2010)
2000 – 2009
- 2009
- [j1]Florent Becker:
Pictures worth a thousand tiles, a geometrical programming language for self-assembly. Theor. Comput. Sci. 410(16): 1495-1515 (2009) - 2008
- [c4]Florent Becker, Eric Rémila, Nicolas Schabanel:
Time Optimal Self-assembly for 2D and 3D Shapes: The Case of Squares and Cubes. DNA 2008: 144-155 - [c3]Florent Becker:
Transformations and Preservation of Self-assembly Dynamics through Homotheties. LATA 2008: 101-112 - [c2]Florent Becker, Sergio Rajsbaum
Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory. SIROCCO 2008: 48-60 - 2006
- [c1]Florent Becker, Ivan Rapaport, Eric Rémila:
Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time. FSTTCS 2006: 45-56
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 23:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: