09 Apr 2024 » My pictures: hardware
02 Apr 2024 » A drawing step-by-step
12 Mar 2024 » Submissions by PC members
06 Mar 2024 » Certifying a perfect matching in a planar graph
05 Mar 2024 » Compiling old latex with latexrelease
23 Feb 2024 » 2023 Travel footprint
20 Feb 2024 » The Environmental Cost of Our Conferences
19 Feb 2024 » pdfoutput = 1
15 Nov 2023 » Pronouns on name tags
10 Nov 2023 » About an annotated bibliography
03 Nov 2023 » Six workshops at DISC
06 Sep 2023 » List of DISC 2023 accepted papers with links
23 Mar 2023 » Algorithms office hours
08 Mar 2023 » CNRS application files and slides
02 Mar 2023 » Perfect matchings with optional vertices
20 Jan 2023 » Quick read: Low crossing numbers
12 Dec 2022 » About thanking reviewers
07 Dec 2022 » Comics: Nice reject
06 Dec 2022 » Quick read: Counting paths
19 Oct 2022 » About mandatory attendance
05 Oct 2022 » Quick read: Testability and local certification
31 Jul 2022 » List of DISC 2022 accepted papers with links
13 May 2022 » List of PODC 2022 accepted papers with links
15 Apr 2022 » More spring cleaning notes
22 Mar 2022 » Spring cleaning notes
12 Mar 2022 » Impossibility proof techniques: from distributed to online
02 Feb 2022 » Tools for indistinguishability proofs
19 Nov 2021 » Contraction sequences
03 Nov 2021 » Notes: journals, conferences and cie
07 Oct 2021 » The PODC/DISC community in France
30 Jun 2021 » Teaser: The secretary problem with independent sampling
11 Jun 2021 » The small-ID technique (3)
10 Jun 2021 » The small-ID technique (2)
09 Jun 2021 » The small-ID technique (1)
19 May 2021 » Comics: Extinction
30 Apr 2021 » Notes: Graph-related stuff
19 Apr 2021 » Comics: Speed of journals
16 Apr 2021 » Diameter lower bound in local certification (3)
15 Apr 2021 » Diameter lower bound in local certification (2)
13 Apr 2021 » Diameter lower bound in local certification (1)
26 Mar 2021 » A distributed computing view of plants
25 Feb 2021 » Notes for February 21
25 Feb 2021 » Comics: A nice theorem
26 Nov 2020 » SSS 2020 report 2: Compression of programmable matter
24 Nov 2020 » SSS 2020 report 1: Pulse distribution and a nice open problem
13 Nov 2020 » Rake-and-compress and 3-coloring trees
02 Nov 2020 » A pile of autumn notes
20 Oct 2020 » Can we always build and certify at the same time? (Maybe not.)
06 Oct 2020 » Can we always build and certify at the same time? (MST with fragments)
01 Oct 2020 » Can we always build and certify at the same time? (Introduction)
15 Sep 2020 » A research story about patterns in graphs (2)
09 Sep 2020 » A research story about patterns in graphs (1)
27 Aug 2020 » Teaser for distributed certification of planarity
03 Jun 2020 » How to glue a double torus?
21 May 2020 » Network decomposition 5: The algorithm
11 May 2020 » Notes for (rainy) May
05 May 2020 » Network decomposition 4: Weak and strong decompositions
29 Apr 2020 » About online conferences
21 Apr 2020 » About journal fees
20 Apr 2020 » Network decomposition 3: Centralized construction
14 Apr 2020 » Online talks
10 Apr 2020 » Network decomposition 2: Impact on distributed algorithms
09 Apr 2020 » Network decomposition 1: Local algorithms
08 Apr 2020 » Network decomposition: Introduction
01 Apr 2020 » Notes from pre-COVID19 times
22 Jan 2020 » First 2020 notes
13 Jan 2020 » Smoothed analysis in distributed computing
11 Dec 2019 » A cute “open” problem on polygons
05 Dec 2019 » Price of anarchy for dynamic flows
21 Nov 2019 » Bayesian mechanism design and Yao’s principle
18 Nov 2019 » More November notes
12 Nov 2019 » Mid-November (non-technical) notes
07 Nov 2019 » October 2019 notes: distances and moving stuff
17 Oct 2019 » Teaser: Graph classes and forbidden patterns
17 Sep 2019 » Summer-winter notes
02 Jul 2019 » June notes
20 Jun 2019 » Material on distributed graph algorithms
23 May 2019 » April-May notes
09 May 2019 » Algorithms and natural history
09 Apr 2019 » March notes II.
26 Mar 2019 » Lightning and search algorithms
25 Mar 2019 » March notes I.
13 Mar 2019 » STOC and SOCG picks
05 Mar 2019 » February notes
15 Feb 2019 » Simulation argument IV. Maximal matching
13 Feb 2019 » Simulation argument III. Sinkless orientation
12 Feb 2019 » Simulation argument II. Edge-labelings on 2-colored trees, and polynomials
11 Feb 2019 » Simulation argument I. General technique
30 Jan 2019 » January notes
24 Jan 2019 » October batch, forgotten notions
18 Dec 2018 » December notes
30 Nov 2018 » November notes
13 Nov 2018 » Popular matchings
24 Sep 2018 » Start