Publications

[1] B. Charron-Bost, “Geometric bounds for convergence rates of averaging algorithms,” Inf. Comput., vol. 285, no. Part, p. 104909, 2022 [Online]. Available: https://doi.org/10.1016/j.ic.2022.104909

[2] B. Charron-Bost and P. Lambein-Monette, “Computing outside the box: Average consensus over dynamic networks,” in 1st symposium on algorithmic foundations of dynamic networks, SAND 2022, march 28-30, 2022, virtual conference, 2022, vol. 221, pp. 10:1–10:16 [Online]. Available: https://doi.org/10.4230/LIPIcs.SAND.2022.10

[3] B. Charron-Bost and L. P. de Monterno, “Self-stabilizing clock synchronization in dynamic networks,” CoRR, vol. abs/2207.06243, 2022 [Online]. Available: https://doi.org/10.48550/arXiv.2207.06243

[4] B. Charron-Bost and S. Moran, “MinMax algorithms for stabilizing consensus,” Distributed Comput., vol. 34, no. 3, pp. 195–206, 2021 [Online]. Available: https://doi.org/10.1007/s00446-021-00392-9

[5] L. P. de Monterno, B. Charron-Bost, and S. Merz, “Synchronization modulo k in dynamic networks,” in Stabilization, safety, and security of distributed systems - 23rd international symposium, SSS 2021, virtual event, november 17-20, 2021, proceedings, 2021, vol. 13046, pp. 425–439 [Online]. Available: https://doi.org/10.1007/978-3-030-91081-5\_28

[6] B. Charron-Bost, “Geometric bounds for convergence rates of averaging algorithms,” CoRR, vol. abs/2007.04837, 2020 [Online]. Available: https://arxiv.org/abs/2007.04837

[7] B. Charron-Bost and P. Lambein-Monette, “Average consensus: A little learning goes A long way,” CoRR, vol. abs/2010.05675, 2020 [Online]. Available: https://arxiv.org/abs/2010.05675

[8] B. Charron-Bost and S. Moran, “The firing squad problem revisited,” Theor. Comput. Sci., vol. 793, pp. 100–112, 2019 [Online]. Available: https://doi.org/10.1016/j.tcs.2019.07.023

[9] B. Charron-Bost and P. Lambein-Monette, “Randomization and quantization for average consensus,” in 57th IEEE conference on decision and control, CDC 2018, miami, fl, usa, december 17-19, 2018, 2018, pp. 3716–3721 [Online]. Available: https://doi.org/10.1109/CDC.2018.8619817

[10] B. Charron-Bost and S. Moran, “The firing squad problem revisited,” in 35th symposium on theoretical aspects of computer science, STACS 2018, february 28 to march 3, 2018, caen, france, 2018, vol. 96, pp. 20:1–20:14 [Online]. Available: https://doi.org/10.4230/LIPIcs.STACS.2018.20

[11] B. Charron-Bost and P. Lambein-Monette, “Randomization and quantization for average consensus,” CoRR, vol. abs/1804.10919, 2018 [Online]. Available: http://arxiv.org/abs/1804.10919

[12] B. Charron-Bost, M. Függer, and T. Nowak, “New transience bounds for max-plus linear systems,” Discret. Appl. Math., vol. 219, pp. 83–99, 2017 [Online]. Available: https://doi.org/10.1016/j.dam.2016.11.003

[13] B. Charron-Bost and S. Moran, “Synchronization in dynamic networks,” CoRR, vol. abs/1706.07831, 2017 [Online]. Available: http://arxiv.org/abs/1706.07831

[14] B. Charron-Bost, M. Függer, and T. Nowak, “Fast, robust, quantizable approximate consensus,” in 43rd international colloquium on automata, languages, and programming, ICALP 2016, july 11-15, 2016, rome, italy, 2016, vol. 55, pp. 137:1–137:14 [Online]. Available: https://doi.org/10.4230/LIPIcs.ICALP.2016.137

[15] B. Charron-Bost and A. Schiper, “Consensus with partial synchrony,” in Encyclopedia of algorithms, 2016, pp. 436–441 [Online]. Available: https://doi.org/10.1007/978-1-4939-2864-4\_91

[16] B. Charron-Bost, M. Függer, and T. Nowak, “Multidimensional asymptotic consensus in dynamic networks,” CoRR, vol. abs/1611.02496, 2016 [Online]. Available: http://arxiv.org/abs/1611.02496

[17] B. Charron-Bost, M. Függer, J. L. Welch, and J. Widder, “Time complexity of link reversal routing,” ACM Trans. Algorithms, vol. 11, no. 3, pp. 18:1–18:39, 2015 [Online]. Available: https://doi.org/10.1145/2644815

[18] M. Függer, T. Nowak, and B. Charron-Bost, “Diffusive clock synchronization in highly dynamic networks,” in 49th annual conference on information sciences and systems, CISS 2015, baltimore, md, usa, march 18-20, 2015, 2015, pp. 1–6 [Online]. Available: https://doi.org/10.1109/CISS.2015.7086841

[19] B. Charron-Bost, M. Függer, and T. Nowak, “Approximate consensus in highly dynamic networks: The role of averaging algorithms,” in Automata, languages, and programming - 42nd international colloquium, ICALP 2015, kyoto, japan, july 6-10, 2015, proceedings, part II, 2015, vol. 9135, pp. 528–539 [Online]. Available: https://doi.org/10.1007/978-3-662-47666-6\_42

[20] B. Charron-Bost, M. Függer, and T. Nowak, “A proof of the convergence of the hegselmann-krause dynamics on the circle,” CoRR, vol. abs/1504.05479, 2015 [Online]. Available: http://arxiv.org/abs/1504.05479

[21] B. Charron-Bost, M. Függer, and T. Nowak, “Amortized averaging algorithms for approximate consensus,” CoRR, vol. abs/1512.04222, 2015 [Online]. Available: http://arxiv.org/abs/1512.04222

[22] T. Nowak and B. Charron-Bost, “An overview of transience bounds in max-plus algebra,” CoRR, vol. abs/1405.3458, 2014 [Online]. Available: http://arxiv.org/abs/1405.3458

[23] B. Charron-Bost, M. Függer, and T. Nowak, “Approximate consensus in highly dynamic networks,” CoRR, vol. abs/1408.0620, 2014 [Online]. Available: http://arxiv.org/abs/1408.0620

[24] B. Charron-Bost, A. Gaillard, J. L. Welch, and J. Widder, “Link reversal routing with binary link labels: Work complexity,” SIAM J. Comput., vol. 42, no. 2, pp. 634–661, 2013 [Online]. Available: https://doi.org/10.1137/110843095

[25] B. Charron-Bost, M. Függer, and T. Nowak, “Transience bounds for distributed algorithms,” in Formal modeling and analysis of timed systems - 11th international conference, FORMATS 2013, buenos aires, argentina, august 29-31, 2013. proceedings, 2013, vol. 8053, pp. 77–90 [Online]. Available: https://doi.org/10.1007/978-3-642-40229-6\_6

[26] B. Charron-Bost, “Orientation and connectivity based criteria for asymptotic consensus,” CoRR, vol. abs/1303.2043, 2013 [Online]. Available: http://arxiv.org/abs/1303.2043

[27] B. Charron-Bost, S. Merz, A. Rybalchenko, and J. Widder, “Formal verification of distributed algorithms (dagstuhl seminar 13141),” Dagstuhl Reports, vol. 3, no. 4, pp. 1–16, 2013 [Online]. Available: https://doi.org/10.4230/DagRep.3.4.1

[28] B. Charron-Bost, M. Függer, and T. Nowak, “New transience bounds for long walks,” CoRR, vol. abs/1209.3342, 2012 [Online]. Available: http://arxiv.org/abs/1209.3342

[29] B. Charron-Bost, M. Függer, J. L. Welch, and J. Widder, “Full reversal routing as a linear dynamical system,” in Structural information and communication complexity - 18th international colloquium, SIROCCO 2011, gdansk, poland, june 26-29, 2011. proceedings, 2011, vol. 6796, pp. 101–112 [Online]. Available: https://doi.org/10.1007/978-3-642-22212-2\_10

[30] B. Charron-Bost, M. Függer, J. L. Welch, and J. Widder, “Partial is full,” in Structural information and communication complexity - 18th international colloquium, SIROCCO 2011, gdansk, poland, june 26-29, 2011. proceedings, 2011, vol. 6796, pp. 113–124 [Online]. Available: https://doi.org/10.1007/978-3-642-22212-2\_11

[31] B. Charron-Bost, M. Függer, J. L. Welch, and J. Widder, “Brief announcement: Full reversal routing as a linear dynamical system,” in SPAA 2011: Proceedings of the 23rd annual ACM symposium on parallelism in algorithms and architectures, san jose, ca, usa, june 4-6, 2011 (co-located with FCRC 2011), 2011, pp. 129–130 [Online]. Available: https://doi.org/10.1145/1989493.1989510

[32] B. Charron-Bost, H. Debrat, and S. Merz, “Formal verification of consensus algorithms tolerating malicious faults,” in Stabilization, safety, and security of distributed systems - 13th international symposium, SSS 2011, grenoble, france, october 10-12, 2011. proceedings, 2011, vol. 6976, pp. 120–134 [Online]. Available: https://doi.org/10.1007/978-3-642-24550-3\_11

[33] B. Charron-Bost, M. Függer, and T. Nowak, “On the transience of linear max-plus dynamical systems,” CoRR, vol. abs/1111.4600, 2011 [Online]. Available: http://arxiv.org/abs/1111.4600

[34] B. Charron-Bost, M. Hutle, and J. Widder, “In search of lost time,” Inf. Process. Lett., vol. 110, no. 21, pp. 928–933, 2010 [Online]. Available: https://doi.org/10.1016/j.ipl.2010.07.017

[35] B. Charron-Bost, F. Pedone, and A. Schiper, Eds., Replication: Theory and practice, vol. 5959. Springer, 2010 [Online]. Available: https://doi.org/10.1007/978-3-642-11294-2

[36] B. Charron-Bost and A. Schiper, “The heard-of model: Computing in distributed systems with benign faults,” Distributed Comput., vol. 22, no. 1, pp. 49–71, 2009 [Online]. Available: https://doi.org/10.1007/s00446-009-0084-6

[37] B. Charron-Bost and S. Merz, “Formal verification of a consensus algorithm in the heard-of model,” Int. J. Softw. Informatics, vol. 3, nos. 2-3, pp. 273–303, 2009 [Online]. Available: http://www.ijsi.org/ch/reader/view\_abstract.aspx?file\_no=273\&\#38;flag=1

[38] B. Charron-Bost, J. L. Welch, and J. Widder, “Link reversal: How to play better to work less,” in Algorithmic aspects of wireless sensor networks, 5th international workshop, ALGOSENSORS 2009, rhodes, greece, july 10-11, 2009. revised selected papers, 2009, vol. 5804, pp. 88–101 [Online]. Available: https://doi.org/10.1007/978-3-642-05434-1\_10

[39] M. Chaouch-Saad, B. Charron-Bost, and S. Merz, “A reduction theorem for the verification of round-based distributed algorithms,” in Reachability problems, 3rd international workshop, RP 2009, palaiseau, france, september 23-25, 2009. proceedings, 2009, vol. 5797, pp. 93–106 [Online]. Available: https://doi.org/10.1007/978-3-642-04420-5\_10

[40] B. Charron-Bost, A. Gaillard, J. L. Welch, and J. Widder, “Routing without ordering,” in SPAA 2009: Proceedings of the 21st annual ACM symposium on parallelism in algorithms and architectures, calgary, alberta, canada, august 11-13, 2009, 2009, pp. 145–153 [Online]. Available: https://doi.org/10.1145/1583991.1584034

[41] B. Charron-Bost, S. Dolev, J. C. Ebergen, and U. Schmid, Eds., Fault-tolerant distributed algorithms on VLSI chips, 07.09. - 10.09.2008, vol. 08371. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2008 [Online]. Available: http://drops.dagstuhl.de/portals/08371/

[42] B. Charron-Bost and A. Schiper, “Consensus with partial synchrony,” in Encyclopedia of algorithms - 2008 edition, M. Kao, Ed. Springer, 2008 [Online]. Available: https://doi.org/10.1007/978-0-387-30162-4\_91

[43] B. Charron-Bost, S. Dolev, J. C. Ebergen, and U. Schmid, “08371 abstracts collection - fault-tolerant distributed algorithms on VLSI chips,” in Fault-tolerant distributed algorithms on VLSI chips, 07.09. - 10.09.2008, 2008, vol. 08371 [Online]. Available: http://drops.dagstuhl.de/opus/volltexte/2009/1928/

[44] B. Charron-Bost, S. Dolev, J. C. Ebergen, and U. Schmid, “08371 summary - fault-tolerant distributed algorithms on VLSI chips,” in Fault-tolerant distributed algorithms on VLSI chips, 07.09. - 10.09.2008, 2008, vol. 08371 [Online]. Available: http://drops.dagstuhl.de/opus/volltexte/2009/1927/

[45] B. Charron-Bost and A. Schiper, “Harmful dogmas in fault tolerant distributed computing,” SIGACT News, vol. 38, no. 1, pp. 53–61, 2007 [Online]. Available: https://doi.org/10.1145/1233481.1233496

[46] M. Biely, J. Widder, B. Charron-Bost, A. Gaillard, M. Hutle, and A. Schiper, “Tolerating corrupted communication,” in Proceedings of the twenty-sixth annual ACM symposium on principles of distributed computing, PODC 2007, portland, oregon, usa, august 12-15, 2007, 2007, pp. 244–253 [Online]. Available: https://doi.org/10.1145/1281100.1281136

[47] B. Charron-Bost and A. Schiper, “Improving fast paxos: Being optimistic with no overhead,” in 12th IEEE pacific rim international symposium on dependable computing (PRDC 2006), 18-20 december, 2006, university of california, riverside, USA, 2006, pp. 287–295 [Online]. Available: https://doi.org/10.1109/PRDC.2006.39

[48] P. Vojtás, M. Bieliková, B. Charron-Bost, and O. Sýkora, Eds., SOFSEM 2005: Theory and practice of computer science, 31st conference on current trends in theory and practice of computer science, liptovský ján, slovakia, january 22-28, 2005, proceedings, vol. 3381. Springer, 2005 [Online]. Available: https://doi.org/10.1007/b105088

[49] B. Charron-Bost and A. Schiper, “Uniform consensus is harder than consensus,” J. Algorithms, vol. 51, no. 1, pp. 15–37, 2004 [Online]. Available: https://doi.org/10.1016/j.jalgor.2003.11.001

[50] B. Charron-Bost and F. L. Fessant, “Validity conditions in agreement problems and time complexity,” in SOFSEM 2004: Theory and practice of computer science, 30th conference on current trends in theory and practice of computer science, merin, czech republic, january 24-30, 2004, 2004, vol. 2932, pp. 196–207 [Online]. Available: https://doi.org/10.1007/978-3-540-24618-3\_16

[51] B. Charron-Bost, “Reductions in distributed computing part I: consensus and atomic commitment tasks,” CoRR, vol. abs/cs/0412115, 2004 [Online]. Available: http://arxiv.org/abs/cs/0412115

[52] B. Charron-Bost, “Reductions in distributed computing part II: k-threshold agreement tasks,” CoRR, vol. abs/cs/0412116, 2004 [Online]. Available: http://arxiv.org/abs/cs/0412116

[53] B. Charron-Bost and R. Cori, “A note on linearizability and the global time axiom,” Parallel Process. Lett., vol. 13, no. 1, pp. 19–24, 2003 [Online]. Available: https://doi.org/10.1142/S0129626403001100

[54] B. Charron-Bost, “Comparing the atomic commitment and consensus problems,” in Future directions in distributed computing, research and position papers, 2003, vol. 2584, pp. 29–34 [Online]. Available: https://doi.org/10.1007/3-540-37795-6\_7

[55] B. Charron-Bost, X. Défago, and A. Schiper, “Broadcasting messages in fault-tolerant distributed systems: The benefit of handling input-triggered and output-triggered suspicions differently,” in 21st symposium on reliable distributed systems (SRDS 2002), 13-16 october 2002, osaka, japan, 2002, pp. 244–249 [Online]. Available: https://doi.org/10.1109/RELDIS.2002.1180193

[56] B. Charron-Bost, “Agreement problems in fault-tolerant distributed systems,” in SOFSEM 2001: Theory and practice of informatics, 28th conference on current trends in theory and practice of informatics piestany, slovak republic, november 24 - december 1, 2001, proceedings, 2001, vol. 2234, pp. 10–32 [Online]. Available: https://doi.org/10.1007/3-540-45627-9\_2

[57] B. Charron-Bost, X. Défago, and A. Schiper, “Time vs. space in fault-tolerant distributed systems,” in 6th workshop on object-oriented real-time dependable systems (WORDS 2001), 8-10 january 2001, rome, italy, 2001, pp. 21–27 [Online]. Available: https://doi.org/10.1109/WORDS.2001.945109

[58] B. Charron-Bost, S. Toueg, and A. Basu, “Revisiting safety and liveness in the context of failures,” in CONCUR 2000 - concurrency theory, 11th international conference, university park, pa, usa, august 22-25, 2000, proceedings, 2000, vol. 1877, pp. 552–565 [Online]. Available: https://doi.org/10.1007/3-540-44618-4\_39

[59] B. Charron-Bost, R. Guerraoui, and A. Schiper, “Synchronous system and perfect failure detector: Solvability and efficiency issue,” in 2000 international conference on dependable systems and networks (DSN 2000) (formerly FTCS-30 and dcca-8), 25-28 june 2000, new york, ny, USA, 2000, pp. 523–532 [Online]. Available: https://doi.org/10.1109/ICDSN.2000.857585

[60] B. Charron-Bost, R. Cori, and A. Petit, “Introduction à l’algorithmique des objets partagés,” RAIRO Theor. Informatics Appl., vol. 31, no. 2, pp. 97–148, 1997 [Online]. Available: https://doi.org/10.1051/ita/1997310200971

[61] B. Charron-Bost and G. Tel, “Calculs approchés de la borne inférieure de valeurs réparties,” RAIRO Theor. Informatics Appl., vol. 31, no. 4, pp. 305–330, 1997 [Online]. Available: https://doi.org/10.1051/ita/1997310403051

[62] B. Charron-Bost, F. Mattern, and G. Tel, “Synchronous, asynchronous, and causally ordered communication,” Distributed Comput., vol. 9, no. 4, pp. 173–191, 1996 [Online]. Available: https://doi.org/10.1007/s004460050018

[63] A. Basu, B. Charron-Bost, and S. Toueg, “Crash failures vs. crash + link failures (abstract),” in Proceedings of the fifteenth annual ACM symposium on principles of distributed computing, philadelphia, pennsylvania, usa, may 23-26, 1996, 1996, p. 246 [Online]. Available: https://doi.org/10.1145/248052.248102

[64] T. D. Chandra, V. Hadzilacos, S. Toueg, and B. Charron-Bost, “On the impossibility of group membership,” in Proceedings of the fifteenth annual ACM symposium on principles of distributed computing, philadelphia, pennsylvania, usa, may 23-26, 1996, 1996, pp. 322–330 [Online]. Available: https://doi.org/10.1145/248052.248120

[65] A. Basu, B. Charron-Bost, and S. Toueg, “Simulating reliable links with unreliable links in the presence of process crashes,” in Distributed algorithms, 10th international workshop, WDAG ’96, bologna, italy, october 9-11, 1996, proceedings, 1996, vol. 1151, pp. 105–122 [Online]. Available: https://doi.org/10.1007/3-540-61769-8\_8

[66] B. Charron-Bost, C. Delporte-Gallet, and H. Fauconnier, “Local and temporal predicates in distributed systems,” ACM Trans. Program. Lang. Syst., vol. 17, no. 1, pp. 157–179, 1995 [Online]. Available: https://doi.org/10.1145/200994.201005

[67] B. Charron-Bost, “Coupling coefficients of a distributed execution,” Theor. Comput. Sci., vol. 110, no. 2, pp. 341–376, 1993 [Online]. Available: https://doi.org/10.1016/0304-3975(93)90012-I

[68] B. Charron-Bost, “Concerning the size of logical clocks in distributed systems,” Inf. Process. Lett., vol. 39, no. 1, pp. 11–16, 1991 [Online]. Available: https://doi.org/10.1016/0020-0190(91)90055-M

[69] B. Charron-Bost, “Concerning the size of clocks,” in Semantics of systems of concurrent processes, LITP spring school on theoretical computer science, la roche posay, france, april 23-27, 1990, proceedings, 1990, vol. 469, pp. 176–184 [Online]. Available: https://doi.org/10.1007/3-540-53479-2\_7

[70] B. Charron-Bost, “Measure of parallelism of distributed computations,” in STACS 89, 6th annual symposium on theoretical aspects of computer science, paderborn, frg, february 16-18, 1989, proceedings, 1989, vol. 349, pp. 434–445 [Online]. Available: https://doi.org/10.1007/BFb0029005

[71] B. Charron-Bost, “Combinatorics and geometry of consistent cuts: Application to concurrency theory,” in Distributed algorithms, 3rd international workshop, nice, france, september 26-28, 1989, proceedings, 1989, vol. 392, pp. 45–56 [Online]. Available: https://doi.org/10.1007/3-540-51687-5\_31