Tootfinder

Physical Memory Attacks and a Memory Safe Management System for Memory Defense
Alon Hillel-Tuch, Aspen Olmstead
https://arxiv.org/abs/2403.08656 https://…

Physical Memory Attacks and a Memory Safe Management System for Memory Defense
Programming errors, defective hardware components (such as hard disk spindle defects), and environmental hazards can lead to invalid memory operations. In addition, less predictable forms of environmental stress, such as radiation, thermal influence, and energy fluctuations, can induce hardware faults. Sometimes, a soft error can occur instead of a complete failure, such as a bit-flip. The 'natural' factors that can cause bit-flips are replicable through targeted attacks that result in signific…

Large Red Alert [19:55:49] - 16 Alerts:• Confrontation Line — Kibutz Dan, Beit Hillel, Dafna, Ghajar, Snir, HaGoshrim, Ma'ayan Baruch, Shear Yeshuv, Kfar Yuval
#Israel #Lebanon #Gaza

Anthony M. Kennedy to reflect on his life and his years on the Supreme Court in two-volume memoir (Hillel Italie/Associated Press)
https://apnews.com/article/supreme-court-anthony-kennedy-memoir-991d5d34b400efe88a1067f561b81a7c
http://www.memeorandum.com/240402/p44#a240402p44

Ayo nobody told me writing an #AprilCools gets you a lovely note from Hillel Wayne in your email

10 Fragen, auf die ich Antworten suche. #Israel #Hamas https://heplev.wordpress.com/2024/03/2

Content-Oblivious Leader Election on Rings
Fabian Frei, Ran Gelles, Ahmed Ghazy, Alexandre Nolin
https://arxiv.org/abs/2405.03646 https://

Content-Oblivious Leader Election on Rings
In content-oblivious computation, n nodes wish to compute a given task over an asynchronous network that suffers from an extremely harsh type of noise, which corrupts the content of all messages across all channels. In a recent work, Censor-Hillel, Cohen, Gelles, and Sela (Distributed Computing, 2023) showed how to perform arbitrary computations in a content-oblivious way in 2-edge connected networks but only if the network has a distinguished node (called root) to initiate the computation. O…

Ayo nobody told me writing an #AprilCools gets you a lovely note from Hillel Wayne in your email

10 Fragen, auf die ich Antworten suche. #Israel #Hamas https://heplev.wordpress.com/2024/03/2

On Distributed Computation of the Minimum Triangle Edge Transversal
Keren Censor-Hillel, Majd Khoury
https://arxiv.org/abs/2402.13985 https://

On Distributed Computation of the Minimum Triangle Edge Transversal
The distance of a graph from being triangle-free is a fundamental graph parameter, counting the number of edges that need to be removed from a graph in order for it to become triangle-free. Its corresponding computational problem is the classic minimum triangle edge transversal problem, and its normalized value is the baseline for triangle-freeness testing algorithms. While triangle-freeness testing has been successfully studied in the distributed setting, computing the distance itself in a dis…

🔊 #NowPlaying on BBCRadio1's #Radio1sFutureArtistsWithSianEleri
Chappell Roan:
🎵 Casual
#BBCR1 #ChappellRoan
https://open.spotify.com/track/4cEVbTyE1o7ZcgKU3wK8gH
https://zephyrdear.bandcamp.com/track/chappell-roan-casual-2023-dir-hadley-hillel-with-mika-lesha-as-the-siren

Even-Cycle Detection in the Randomized and Quantum CONGEST Model
Pierre Fraigniaud, Mael Luce, Frederic Magniez, Ioan Todinca
https://arxiv.org/abs/2402.12018

Even-Cycle Detection in the Randomized and Quantum CONGEST Model
We show that, for every $k\geq 2$, $C_{2k}$-freeness can be decided in $O(n^{1-1/k})$ rounds in the \CONGEST{} model by a randomized Monte-Carlo distributed algorithm with one-sided error probability $1/3$. This matches the best round-complexities of previously known algorithms for $k\in\{2,3,4,5\}$ by Drucker et al. [PODC'14] and Censor-Hillel et al. [DISC'20], but improves the complexities of the known algorithms for $k>5$ by Eden et al. [DISC'19], which were essentially of the form $\tilde O…