3 citations · 12 across the 19 of their papers we have counts for
4 papers · 1 filter
Small Hazard-free Transducers
Johannes Bund, Christoph Lenzen, Moti Medina
Ikenmeyer et al. (JACM'19) proved an unconditional exponential separation between the hazard-free complexity and (standard) circuit complexity of explicit functions. This raises th…
Property Testing of Planarity in the CONGEST model
Reut Levi, Moti Medina, Dana Ron
We give a distributed algorithm in the {\sf CONGEST} model for property testing of planarity with one-sided error in general (unbounded-degree) graphs. Following Censor-Hillel et a…
Graph Ranking and the Cost of Sybil Defense
Gwendolyn Farach-Colton, Martin Farach-Colton, Leslie Ann Goldberg +5
Ranking functions such as PageRank assign numeric values (ranks) to nodes of graphs, most notably the web graph. Node rankings are an integral part of Internet search algorithms, s…
Optimal Metastability-Containing Sorting Networks
Johannes Bund, Christoph Lenzen, Moti Medina
When setup/hold times of bistable elements are violated, they may become metastable, i.e., enter a transient state that is neither digital 0 nor 1. In general, metastability cannot…