activity
20112020
most citedOptimal Metastability-Containing Sorting Networks

2 citations · 3 across the 4 of their papers we have counts for

collaborators

9 papers

cs.AR20201 cited

Synchronizer-Free Digital Link Controller

Johannes Bund, Matthias Függer, Christoph Lenzen +1

This work presents a producer-consumer link between two independent clock domains. The link allows for metastability-free, low-latency, high-throughput communication by slight adju…

cs.DC2020

PALS: Plesiochronous and Locally Synchronous Systems

Johannes Bund, Matthias Függer, Christoph Lenzen +2

Consider an arbitrary network of communicating modules on a chip, each requiring a local signal telling it when to execute a computational step. There are three common solutions to…

cs.DS2020

Distributed Testing of Graph Isomorphism in the CONGEST model

Reut Levi, Moti Medina

In this paper we study the problem of testing graph isomorphism (GI) in the CONGEST distributed model. In this setting we test whether the distributive network, , is isomorphi…

cs.DC2019

Optimal Metastability-Containing Sorting via Parallel Prefix Computation

Johannes Bund, Christoph Lenzen, Moti Medina

Friedrichs et al. (TC 2018) showed that metastability can be contained when sorting inputs arising from time-to-digital converters, i.e., measurement values can be correctly sorted…

cs.DC2018

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…

cs.DC20182 cited

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…