Zobrazeno 1 - 10
of 3 591
pro vyhledávání: '"Grunau A"'
Autor:
Ghaffari, Mohsen, Grunau, Christoph
A recent work by Christiansen, Nowicki, and Rotenberg provides dynamic algorithms for coloring sparse graphs, concretely as a function of the arboricity alpha of the input graph. They give two randomized algorithms: O({alpha} log {alpha}) implicit co
Externí odkaz:
http://arxiv.org/abs/2410.19536
Autor:
Ghaffari, Mohsen, Grunau, Christoph
This paper improves and in two cases nearly settles, up to logarithmically lower-order factors, the deterministic complexity of some of the most central problems in distributed graph algorithms, which have been studied for over three decades: Near-Op
Externí odkaz:
http://arxiv.org/abs/2410.19516
Autor:
Ghaffari, Mohsen, Grunau, Christoph
We present an efficient parallel derandomization method for randomized algorithms that rely on concentrations such as the Chernoff bound. This settles a classic problem in parallel derandomization, which dates back to the 1980s. Consider the \textit{
Externí odkaz:
http://arxiv.org/abs/2311.13771
We present a novel technique for work-efficient parallel derandomization, for algorithms that rely on the concentration of measure bounds such as Chernoff, Hoeffding, and Bernstein inequalities. Our method increases the algorithm's computational work
Externí odkaz:
http://arxiv.org/abs/2311.13764
Autor:
Mahsa Khalili, Saud Lingawi, Jacob Hutton, Christopher B. Fordyce, Jim Christenson, Babak Shadgan, Brian Grunau, Calvin Kuo
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-16 (2024)
Abstract Out-of-hospital cardiac arrest (OHCA) is a global health problem affecting approximately 4.4 million individuals yearly. OHCA has a poor survival rate, specifically when unwitnessed (accounting for up to 75% of cases). Rapid recognition can
Externí odkaz:
https://doaj.org/article/9c466d358e794dac88461b6b99c0546b
We show the first conditionally optimal deterministic algorithm for $3$-coloring forests in the low-space massively parallel computation (MPC) model. Our algorithm runs in $O(\log \log n)$ rounds and uses optimal global space. The best previous algor
Externí odkaz:
http://arxiv.org/abs/2308.00355
We study the consistent k-center clustering problem. In this problem, the goal is to maintain a constant factor approximate $k$-center solution during a sequence of $n$ point insertions and deletions while minimizing the recourse, i.e., the number of
Externí odkaz:
http://arxiv.org/abs/2307.13747
The $k$-means++ algorithm by Arthur and Vassilvitskii [SODA 2007] is a classical and time-tested algorithm for the $k$-means problem. While being very practical, the algorithm also has good theoretical guarantees: its solution is $O(\log k)$-approxim
Externí odkaz:
http://arxiv.org/abs/2307.13685
We present the first parallel depth-first search algorithm for undirected graphs that has near-linear work and sublinear depth. Concretely, in any $n$-node $m$-edge undirected graph, our algorithm computes a DFS in $\tilde{O}(\sqrt{n})$ depth and usi
Externí odkaz:
http://arxiv.org/abs/2304.09774
Autor:
Julia Konrad, Ting Guo, Steven Ufkes, Thiviya Selvanathan, Min Sheng, Eiman Al‐Ajmi, Helen M. Branson, Vann Chau, Linh G. Ly, Edmond N. Kelly, Ruth E. Grunau, Steven P. Miller
Publikováno v:
Annals of Clinical and Translational Neurology, Vol 11, Iss 9, Pp 2499-2513 (2024)
Abstract Objective The hippocampus plays a critical role in cognitive networks. The anterior hippocampus is vulnerable to early‐life stress and socioeconomic status (SES) with alterations persisting beyond childhood. How SES modifies the relationsh
Externí odkaz:
https://doaj.org/article/cac05b5728404656990e9c3483de13da