His scientific interests lie mostly in Distributed computing, Theoretical computer science, Mobile robot, Distributed algorithm and Robot. His Distributed computing study combines topics in areas such as Wireless sensor network, Computer network, Scheduling and Wireless ad hoc network. His research in Theoretical computer science intersects with topics in Fault tolerance, Network topology and Connectivity.
Mobile robot and Ring are two areas of study in which Sébastien Tixeuil engages in interdisciplinary research. He has included themes like Algorithm, Time division multiple access, Communications protocol and Wireless network in his Distributed algorithm study. His work carried out in the field of Robot brings together such families of science as Convergence, Asynchronous communication and Crash.
His primary areas of investigation include Distributed computing, Robot, Mobile robot, Distributed algorithm and Theoretical computer science. His biological study spans a wide range of topics, including Protocol and Transient. His study focuses on the intersection of Robot and fields such as Asynchronous communication with connections in the field of Topology, Scheduling, Set and Scheme.
In his study, which falls under the umbrella issue of Mobile robot, Code is strongly linked to Correctness. The Distributed algorithm study combines topics in areas such as Algorithm, Theory of computation and Wireless sensor network, Computer network. In Theoretical computer science, Sébastien Tixeuil works on issues like Probabilistic logic, which are connected to Coprime integers and Mathematical optimization.
His primary areas of study are Mobile robot, Robot, Asynchronous communication, Certification and Theoretical computer science. His Mobile robot study frequently draws connections between related disciplines such as Distributed algorithm. His study in Robot is interdisciplinary in nature, drawing from both Finite time and Distributed computing.
His Distributed computing research is multidisciplinary, relying on both Token ring, Dijkstra's algorithm, Theory of computation and State. His studies in Asynchronous communication integrate themes in fields like Node, Set, Real-time computing, Algorithm and Topology. His Theoretical computer science study integrates concerns from other disciplines, such as Euclidean space and Graph.
Sébastien Tixeuil mainly investigates Mobile robot, Robot, Theoretical computer science, Proof assistant and Certification. His Mobile robot research includes themes of Discrete mathematics, Asynchronous communication and Matching. Sébastien Tixeuil has researched Asynchronous communication in several fields, including Set, Node and Topology.
Sébastien Tixeuil combines Robot and Impossibility in his research. His Theoretical computer science study combines topics from a wide range of disciplines, such as Data aggregator, Wireless sensor network, Dynamic problem, Graph and Distributed algorithm. Throughout his Proof assistant studies, Sébastien Tixeuil incorporates elements of other sciences such as Euclidean space, Correctness and Distributed computing.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks
Ted Herman;Sébastien Tixeuil.
algorithmic aspects of wireless sensor networks (2004)
Self-stabilizing Vertex Coloring of Arbitrary Graphs
Maria Gradinariu;Sébastien Tixeuil.
international conference on principles of distributed systems (2000)
Self-stabilization in self-organized multihop wireless networks
N. Mitton;E. Fleury;I.G. Lassous;S. Tixeuil.
international conference on distributed computing systems workshops (2005)
Self-Stabilizing Systems
Sébastien Tixeuil;Ted Herman.
(1997)
Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks
F. Greve;S. Tixeuil.
dependable systems and networks (2007)
Gathering of Mobile Robots Tolerating Multiple Crash Faults
Zohir Bouzid;Shantanu Das;Sebastien Tixeuil.
international conference on distributed computing systems (2013)
A new self-stabilizing maximal matching algorithm
Fredrik Manne;Morten Mjelde;Laurence Pilard;Sébastien Tixeuil.
Theoretical Computer Science (2009)
Self-Stabilization with r-Operators revisited
Sylvie Delaët;Bertrand Ducourthial;Sébastien Tixeuil.
Journal of Aerospace Computing Information and Communication (2006)
Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection
Sayaka Kamei;Anissa Lamani;Fukuhito Ooshita;Sébastien Tixeuil.
international conference on structural information and communication complexity (2011)
Exclusive perpetual ring exploration without chirality
Lélia Blin;Alessia Milani;Maria Potop-Butucaru;Sébastien Tixeuil.
international symposium on distributed computing (2010)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Ben-Gurion University of the Negev
Kyushu University
Tel Aviv University
Technion – Israel Institute of Technology
Michigan State University
Missouri University of Science and Technology
National Autonomous University of Mexico
Institut de Recherche en Informatique et Systèmes Aléatoires
Argonne National Laboratory
University of Pennsylvania
University of Seville
Commonwealth Scientific and Industrial Research Organisation
Hewlett-Packard (United States)
Stanford University
University of Science and Technology of China
University of North Carolina at Chapel Hill
University of Cape Town
University of Jinan
Bielefeld University
Yale University
University of Palermo
University of California, Los Angeles
National Institutes of Health
The University of Texas at Austin
University at Albany, State University of New York
Loughborough University