vix.ing · top · new · best · stats · spec

Uitto, Jara

  1. A Lower Bound for the Distributed Lovász Local Lemma
    2015/11/03 by Brandt, Sebastian, Fischer, Orr, Hirvonen, Juho +5 · 7 citations
    #Computational Complexity (cs.CC) #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
  2. Deterministic Distributed Edge-Coloring with Fewer Colors
    2017/11/15 by Ghaffari, Mohsen, Kuhn, Fabian, Maus, Yannic +1 · 3 citations
    #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
  3. Deterministic (1+ε)-Approximate Maximum Matching with poly(1/ε) Passes in the Semi-Streaming Model and Beyond
    2021/06/08 by Manuela Fischer, Fischer, Manuela, Slobodan Mitrović +3 · 3 citations
    Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems
  4. Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation
    2018/07/17 by Mohsen Ghaffari, Ghaffari, Mohsen, Jara Uitto +1 · 2 citations
    Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Parallel #Stochastic Gradient Optimization Techniques #and Cluster Computing (cs.DC)
  5. Efficient CONGEST Algorithms for the Lovasz Local Lemma
    2021/08/05 by Maus, Yannic, Uitto, Jara · 2 citations
    #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
  6. A Sharp Threshold Phenomenon for the Distributed Complexity of the\n Lov 'asz Local Lemma
    2019/08/17 by Sebastian Brandt, Yannic Maus, Brandt, Sebastian +3 · 2 citations
    Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Machine Learning and Algorithms #Optimization and Search Problems #Parallel #and Cluster Computing (cs.DC)
  7. Local algorithms in (weakly) coloured graphs
    2010/01/31 by Matti Åstrand, Åstrand, Matti, Valentin Polishchuk +7 · 1 citation
    Computer Science · #Complexity and Algorithms in Graphs #Optimization and Search Problems #Cooperative Communication and Network Coding
  8. The Complexity of Distributed Edge Coloring with Small Palettes
    2017/08/14 by Yi‐Jun Chang, Chang, Yi-Jun, Qizheng He +7 · 1 citation
    Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Parallel #Privacy-Preserving Technologies in Data #and Cluster Computing (cs.DC)
  9. Efficient Load-Balancing through Distributed Token Dropping
    2020/05/15 by Brandt, Sebastian, Keller, Barbara, Rybicki, Joel +2 · 1 citation
    #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
  10. On the Locality of Hall's Theorem
    2025/01/07 by Sebastian Brandt, Brandt, Sebastian, Yannic Maus +6 · 3 citations
    Computer Science · #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Matrix Theory and Algorithms #Parallel #and Cluster Computing (cs.DC)