Sublogarithmic Distributed Algorithms for Lovasz Local Lemma, and t...
... Complexity: number of rounds to solve the problem Chang, Pettie [FOCS’17] Completeness of Lovász Local Lemma ... complexity 𝒐 𝐥𝐨𝐠 𝐧 can be automatically sped up to run in 𝑶 𝐓𝑳𝑳𝑳(𝒏) rounds. Chang, Pettie [FOCS’17 ... Complexity: number of rounds to solve the problem Chang, Pettie [FOCS’17] Completeness of Lovász Local Lemma ... complexity 𝒐 𝐥𝐨𝐠 𝐧 can be automatically sped up to run in 𝑶 𝐓𝑳𝑳𝑳(𝒏) rounds. Chang, Pettie [FOCS’17 ...
An Exponential Separation Between Randomized and Deterministic Comp...
... , Pettie, Schneider (FOCS 2012) Harris, Schneider, Su (STOC 2016) Pre-shattering Post-shattering Chang, Li ... , Pettie (STOC 2018) (There are many more!) (Δ+1)-coloring in the LOCAL Model • (Rand.) 𝑂(log 𝑛) • (Det ... , Pettie, Schneider (FOCS 2012) Harris, Schneider, Su (STOC 2016) Pre-shattering Post-shattering Chang, Li ... , Pettie (STOC 2018) (There are many more!) (Δ+1)-coloring in the LOCAL Model • (Rand.) 𝑂(log 𝑛) • (Det ...
The ETH-ITS welcomes three new Junior Fellows – Institute for Theor...
... Engineering from University of Michigan in May 2019 under the supervision of Seth Pettie. He is broadly ... Science and Engineering from University of Michigan in May 2019 under the supervision of Seth Pettie. He ...
Local Algorithms for Classic Graph Problems - Research Collection
... , Fabian Examiner: Peleg, David Examiner: Pettie, Seth Publisher ETH Zurich Organisational unit 09587 ...
6.S899 Distributed Graph Algorithms, Fall 2014
... : Luby's algorithm, and the algorithm of Barenboim, Elkin, Pettie & Schneider via graph shattering. [Notes ... of Barenboim, Elkin, Pettie & Schneider via graph shattering. [Notes] (10/03) Lecture 4: Network ...
https://n.ethz.ch/~rozhonv/presentations/decomposition-stoclong.pdf
... , randomized poly(log log n) MPC, randomized Δ+1 coloring shattering [Chang, Li, Pettie STOC’18] + network ... , randomized Δ+1 coloring shattering [Chang, Li, Pettie STOC’18] + network decomposition [R Ghaffari STOC’20 ... , randomized poly(log log n) MPC, randomized Δ+1 coloring shattering [Chang, Li, Pettie STOC’18] + network ... , randomized Δ+1 coloring shattering [Chang, Li, Pettie STOC’18] + network decomposition [R Ghaffari STOC’20 ...
balliu-wola-pdf
... , Kopelowitz, Pettie [FOCS 2016] • Ghaffari, Su [SODA 2017] • Brandt, Hirvonen, Korhonen, Lempiäinen, Östergård ... , Purcell, Rybicki, Suomela, Uznański [PODC 2017] • Fischer, Ghaffari [DISC 2017] • Chang, Pettie [FOCS 2017 ... , Kopelowitz, Pettie [FOCS 2016] • Ghaffari, Su [SODA 2017] • Brandt, Hirvonen, Korhonen, Lempiäinen, Östergård ... , Purcell, Rybicki, Suomela, Uznański [PODC 2017] • Fischer, Ghaffari [DISC 2017] • Chang, Pettie [FOCS 2017 ...
slide_olivetti
... Stockmeyer 1995] [Chang and Pettie 2017] The Ω(log log* n) lower bound • Naor & Stockmeyer proved that any ... , weak 2-coloring can not be solved by an order invariant algorithm • Chang and Pettie lifted the gap up ... Stockmeyer 1995] [Chang and Pettie 2017] The Ω(log log* n) lower bound • Naor & Stockmeyer proved that any ... , weak 2-coloring can not be solved by an order invariant algorithm • Chang and Pettie lifted the gap up ...
https://people.inf.ethz.ch/emo/ESA07/CfpEsa07.pdf
... Yossi Matias, Google and Tel-Aviv U. Jiˇr´ı Matousˇek, Charles U., Prague Seth Pettie, U. of Michigan ... Yossi Matias, Google and Tel-Aviv U. Jiˇr´ı Matousˇek, Charles U., Prague Seth Pettie, U. of Michigan ...
https://people.inf.ethz.ch/gmohsen/DGA14/Notes/L03.pdf
... Barenboim, Michael Elkin, Seth Pettie and Johannes Schneider, The Locality of Distributed Symmetry Breaking ... Barenboim, Michael Elkin, Seth Pettie and Johannes Schneider, The Locality of Distributed Symmetry Breaking ...
