Ari Trachtenberg
From Wikipedia, the free encyclopedia
Dr. Ari Trachtenberg is an associate professor of electrical and computer engineering at Boston University and the coordinator for its computer systems group. He received his Ph.D. (2000) and M.S. (1996) in computer science from the University of Illinois at Urbana-Champaign, working with advisors Alexander Vardy (de facto), Edward Reingold (de jure), and C.L. Liu (de jure), and his S.B. (1994) from MIT[1]. His research mainly concerns:
- theory and applications of coding theory, for example lexicodes
- data synchronization in weakly connected devices
- location detection in sensor networks
- algorithm design
- security and cryptography
Dr. Trachtenberg is the recipient of the Boston University ECE faculty excellence in teaching award (2003), the National Science Foundation CAREER award (2002), and the UIUC Kuck outstanding thesis award (2000) and Mavis memorial fund scholarship award (1999).
[edit] Selected papers
- S. Agarwal, V. Chauhan and A. Trachtenberg, (November 2006). "Bandwidth Efficient String Reconciliation Using Puzzles".
- S. Ray, D. Starobinski, A. Trachtenberg, and R. Ungrangsi (August, 2004). "Robust Location Detection with Sensor Networks".
- A. Trachtenberg and A. Vardy (2003). "Full-rank tilings of F_2^8 do not exist".
- Y. Minsky, A Trachtenberg, and R. Zippel (September2003). "Set reconciliation with nearly optimal communication complexity".
- S. Agarwal, D. Starobinski, and A Trachtenberg (January-March 2003). "Efficient PDA synchronization".
- Y. Minsky and A. Trachtenberg, (October, 2002). "Scalable Set Reconciliation,".
- A Trachtenberg (January 2002). "Designing Lexicographic Codes with a Given Trellis Complexity".
- T. Etzion, A. Trachtenberg, and A. Vardy (September 1999). "Which codes have cycle-free Tanner graphs?".
