按年被提到
20092020 · 2 次2026
算法与数据结构›经典算法与数据结构·arXiv:0909.2859 · cs.DM

Electric routing and concurrent flow cutting

Jonathan Kelner, Petar Maymounkov · 2009
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2020-01-06 · 最近 2020-04-13
2不同的人
2活跃月份
2讨论串
0被引(OpenAlex)
arXiv 摘要(候选层不写导读)

We investigate an oblivious routing scheme, amenable to distributed computation and resilient to graph changes, based on electrical flow. Our main technical contribution is a new rounding method which we use to obtain a bound on the L1->L1 operator norm of the inverse graph Laplacian. We show how this norm reflects both latency and congestion of electric routing.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论tombert · 2020-01

“I don't think the risk of child porn is why FreeNet hasn't really taken off; I think it's due to the fact that it's slow and its content is incredibly limited, largely existing for hobbyists. I'm not 100% sure how you'd be able to evict offensive/illegal content in a fully distributed and decentralized way, especially while keeping free-speech guarantees…”

Ask HN: Thoughts on censorship resistance vs. offensive content?原评论 ↗
被提交为 story · 1 次