Search the dblp DataBase
Ari Trachtenberg :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Sachin Agarwal , Moshe Laifenfeld , Ari Trachtenberg , Murat Alanyali Fast data access over asymmetric channels using fair and secure bandwidth sharing. [Citation Graph (0, 0)][DBLP ] ICDCS, 2006, pp:58- [Conf ] Saikat Ray , Rachanee Ungrangsi , Francesco De Pellegrini , Ari Trachtenberg , David Starobinski Robust Location Detection in Emergency Sensor Networks. [Citation Graph (0, 0)][DBLP ] INFOCOM, 2003, pp:- [Conf ] Ari Trachtenberg , David Starobinski , Sachin Agarwal Fast PDA Synchronization Using Characteristic Polynomial Interpolation. [Citation Graph (0, 0)][DBLP ] INFOCOM, 2002, pp:- [Conf ] Rachanee Ungrangsi , Ari Trachtenberg , David Starobinski An Implementation of Indoor Location Detection Systems Based on Identifying Codes. [Citation Graph (0, 0)][DBLP ] INTELLCOMM, 2004, pp:175-189 [Conf ] Andrew Hagedorn , David Starobinski , Ari Trachtenberg Rateless codes for data dissemination in sensor networks. [Citation Graph (0, 0)][DBLP ] SenSys, 2006, pp:393-394 [Conf ] Sachin Agarwal , Avi Yaar , David Starobinski , Ari Trachtenberg Fast network synchronization. [Citation Graph (0, 0)][DBLP ] Computer Communication Review, 2002, v:32, n:3, pp:14- [Journal ] Ari Trachtenberg , Alexander Vardy Full-Rank Tilings of $\mathbbF^8_\!2$ Do Not Exist. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2003, v:16, n:3, pp:390-392 [Journal ] Tuvi Etzion , Ari Trachtenberg , Alexander Vardy Which codes have cycle-free Tanner graphs? [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1999, v:45, n:6, pp:2173-2181 [Journal ] Mark G. Karpovsky , Lev B. Levitin , Ari Trachtenberg Data verification and reconciliation with generalized error-control cod. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2003, v:49, n:7, pp:1788-1793 [Journal ] Yaron Minsky , Ari Trachtenberg , Richard Zippel Set reconciliation with nearly optimal communication complexity. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2003, v:49, n:9, pp:2213-2218 [Journal ] Ari Trachtenberg Designing lexicographic codes with a given trellis complexity. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2002, v:48, n:1, pp:89-100 [Journal ] David Starobinski , Ari Trachtenberg , Sachin Agarwal Efficient PDA Synchronization. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Mob. Comput., 2003, v:2, n:1, pp:40-51 [Journal ] Sachin Agarwal , Vikas Chauhan , Ari Trachtenberg Bandwidth Efficient String Reconciliation Using Puzzles. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Parallel Distrib. Syst., 2006, v:17, n:11, pp:1217-1225 [Journal ] David Starobinski , Weiyao Xiao , Xiangping Qin , Ari Trachtenberg Near-Optimal Data Dissemination Policies for Multi-Channel, Single Radio Wireless Sensor Networks. [Citation Graph (0, 0)][DBLP ] INFOCOM, 2007, pp:955-963 [Conf ] Joint monitoring and routing in wireless sensor networks using robust identifying codes. [Citation Graph (, )][DBLP ] Rateless Coding with Feedback. [Citation Graph (, )][DBLP ] Reliable Wireless Broadcasting with Near-Zero Feedback. [Citation Graph (, )][DBLP ] Rateless Deluge: Over-the-Air Programming of Wireless Sensor Networks Using Random Linear Codes. [Citation Graph (, )][DBLP ] Near Optimal Update-Broadcast of Data Sets. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.003secs