A
Ari Trachtenberg
Researcher at Boston University
Publications - 95
Citations - 2238
Ari Trachtenberg is an academic researcher from Boston University. The author has contributed to research in topics: Communication complexity & Wireless sensor network. The author has an hindex of 22, co-authored 89 publications receiving 2074 citations.
Papers
More filters
Journal ArticleDOI
Set reconciliation with nearly optimal communication complexity
TL;DR: The problem of efficiently reconciling two similar sets held by different hosts while minimizing the communication complexity is considered, and an approach based on the encoding of sets as polynomials is described, exhibiting tractable computational complexity and nearly optimal communication complexity.
Proceedings ArticleDOI
Rateless Deluge: Over-the-Air Programming of Wireless Sensor Networks Using Random Linear Codes
TL;DR: Two rateless OAP protocols are designed and implemented, both of which replace the data transfer mechanism of the established OAP Deluge protocol with rateless analogs, which significantly improve OAP in such environments by drastically reducing the need for packet rebroadcasting.
Set Reconciliation with N early Optimal Communication Complexity
TL;DR: In this paper, the problem of reconciling two similar sets held by different hosts while minimizing the communication complexity is considered, based on the encoding of sets as polynomials.
Journal ArticleDOI
Which codes have cycle-free Tanner graphs?
TL;DR: It is proved that binary codes which have cycle-free Tanner graphs belong to the class of graph-theoretic codes, known as cut-set codes of a graph, and that this bound is tight for all values of n and k.
Proceedings ArticleDOI
Robust location detection in emergency sensor networks
TL;DR: A new framework for providing robust location detection in emergency response systems, based on the theory of identifying codes, is proposed and a new polynomial-time algorithm for generating irreducible codes for arbitrary topologies is analyzed.