Devan Sohier

According to our database1, Devan Sohier authored at least 41 papers between 2003 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Stochastic Rounding Variance and Probabilistic Bounds: A New Approach.
SIAM J. Sci. Comput., October, 2023

Bounds on non-linear errors for variance computation with stochastic rounding.
CoRR, 2023

2022
The Positive Effects of Stochastic Rounding in Numerical Algorithms.
Proceedings of the 29th IEEE Symposium on Computer Arithmetic, 2022

2021
Confidence Intervals for Stochastic Arithmetic.
ACM Trans. Math. Softw., 2021

2020
High-Quality Fault Resiliency in Fat Trees.
IEEE Micro, 2020

2019
Space-Optimal Naming in Population Protocols.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

High-Quality Fault-Resiliency in Fat-Tree Networks (Extended Abstract).
Proceedings of the 2019 IEEE Symposium on High-Performance Interconnects, 2019

2018
A Self-Stabilizing Algorithm for Maximal Matching in Link-Register Model.
Proceedings of the Structural Information and Communication Complexity, 2018

Brief Announcement: Space-Optimal Naming in Population Protocols.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Scalable Work-Stealing Load-Balancer for HPC Distributed Memory Systems.
Proceedings of the Euro-Par 2018: Parallel Processing Workshops, 2018

2017
A self-stabilizing algorithm for maximal matching in link-register model in $O(nΔ^3)$ moves.
CoRR, 2017

2016
A Self-Stabilizing Algorithm for Maximal Matching in Anonymous Networks.
Parallel Process. Lett., 2016

Self-Stabilizing Maximal Matching and Anonymous Networks.
CoRR, 2016

Time and Space Optimal Counting in Population Protocols.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

2015
Space-Optimal Counting in Population Protocols.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Distributed Hierarchy of Clusters in the Presence of Topological Changes.
Proceedings of the Advanced Computational Methods for Knowledge Engineering - Proceedings of 3rd International Conference on Computer Science, Applied Mathematics and Applications, 2015

2014
Clustering and communications scheduling in WSNs using mixed integer linear programming.
J. Commun. Networks, 2014

2013
Nested clusters with intercluster routing.
J. Supercomput., 2013

Universal adaptive self-stabilizing traversal scheme: Random walk and reloading wave.
J. Parallel Distributed Comput., 2013

A distributed hierarchical clustering algorithm for large-scale dynamic networks.
Proceedings of the 8th ACM Workshop on Performance Monitoring and Measurement of Heterogeneous Wireless and Wired Networks, 2013

Optimization of a self-converging algorithm at assembly level to improve SEU fault-tolerance.
Proceedings of the 4th IEEE Latin American Symposium on Circuits and Systems, 2013

2012
An Adaptive Random Walk Based Distributed Clustering Algorithm.
Int. J. Found. Comput. Sci., 2012

A distributed clustering algorithm for large-scale dynamic networks.
Clust. Comput., 2012

Physarum-Inspired Self-biased Walkers for Distributed Clustering.
Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

2011
Self-stabilizing Hierarchical Construction of Bounded Size Clusters.
Proceedings of the Structural Information and Communication Complexity, 2011

Robustness with respect to SEUs of a self-converging algorithm.
Proceedings of the 12th Latin American Test Workshop, 2011

Distributed Construction of Nested Clusters with Inter-cluster Routing.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Meeting of Randomly Moving Messages in a Mobile ad-hoc Network.
Proceedings of the International Conference on Complex, 2011

2010
A Distributed Clustering Algorithm for Dynamic Networks
CoRR, 2010

A random walk based clustering with local recomputations for mobile ad hoc networks.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

2009
A Fully Distributed Clustering Algorithm Based on Random Walks.
Proceedings of the Eighth International Symposium on Parallel and Distributed Computing, 2009

2008
Token Loss Detection for Random Walk based Algorithm.
Proceedings of the 7th International Symposium on Parallel and Distributed Computing (ISPDC 2008), 2008

2007
How to Compute Times of Random Walks Based Distributed Algorithms.
Fundam. Informaticae, 2007

Stabilization Time for Token Replications in Self-Stabilizing Random Walk Based Distributed Algorithms.
Proceedings of the 2007 IEEE International Conference on Research, 2007

2006
Optimal path planning for air traffic flow management under stochastic weather and capacity constraints.
Proceedings of the 4th International Confernce on Computer Sciences: Research, 2006

2005
On Time Analysis of Random Walk Based Token Circulation Algorithms.
Proceedings of the Advanced Distributed Systems: 5th International School and Symposium, 2005

2004
Towards an Algortihm to Compute Safe Aircraft Trajectories.
Proceedings of the Actes de la Deuxieme Conference Internationale Associant Chercheurs Vietnamiens et Francophones en Informatique, 2004

Hitting Times Computation for Theoretically Studying Peer-to-Peer Distributed System.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

Random Walks in Distributed Computing: A Survey.
Proceedings of the Innovative Internet Community Systems, 4th InternationalWorkshop, 2004

2003
A New Method to Automatically Compute Processing Times for Random Walks Based Distributed Algorithms.
Proceedings of the 2nd International Symposium on Parallel and Distributed Computing (ISPDC 2003), 2003

Randomly Distributed Tasks in Bounded Time.
Proceedings of the Innovative Internet Community Systems, Third International Workshop, 2003


  Loading...