Ari Trachtenberg

Infobox Scientist
name = Ari Trachtenberg
birth_date =
birth_place = Haifa, Israel
work_institution = Boston University
field = Coding theory, data synchronization
prizes = NSF CAREER (2002), Kuck Outstanding Thesis (2000) Ari Trachtenberg ( _he. ארי טרכטנברג) is an associate professor of electrical and computer engineeringat Boston University.He received his Ph.D. (2000) and M.S. (1996) in computer science fromthe University of Illinois at Urbana-Champaign, working with advisorsAlexander Vardy (de facto), Edward Reingold (de jure), and C.L. Liu (de jure), andhis S.B. (1994) from MIT [http://ipsit.bu.edu/documents/cvAri.pdf] . His research mainly concerns:

# theory and applications of coding theory, for example lexicodes and identifying codes
# 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).

Selected papers

* cite paper
author = S. Agarwal, V. Chauhan and A. Trachtenberg,
title = Bandwidth Efficient String Reconciliation Using Puzzles
journal = IEEE Transactions on Parallel and Distributed Systems
volume=17
number=11
date = November 2006
url = http://ipsit.bu.edu/documents/puzzles_journal.pdf
page = 1217-1226
* cite paper
author = S. Ray, D. Starobinski, A. Trachtenberg, and R. Ungrangsi
title = Robust Location Detection with Sensor Networks
journal = IEEE Journal on Selected Areas in Communication (Special Issue on Fundamental Performance Limits of Wireless Sensor Networks)
date = August, 2004
url = http://ipsit.bu.edu/documents/jsac_web.pdf
volume=22
number=6
* cite paper
author = A. Trachtenberg and A. Vardy
title = Full-rank tilings of F_2^8 do not exist
journal = SIAM Journal of Discrete Math
url = http://ipsit.bu.edu/documents/8tiling_web.pdf
volume = 16
number = 3
date = 2003
* cite paper
author = Y. Minsky, A Trachtenberg, and R. Zippel
title = Set reconciliation with nearly optimal communication complexity
journal = IEEE Transactions on Information Theory
date = September2003
volume = 48
number = 9
url = http://ipsit.bu.edu/documents/ieee-it3-web.pdf
* cite paper
author = S. Agarwal, D. Starobinski, and A Trachtenberg
title = Efficient PDA synchronization
journal = IEEE Transactions on Mobile Computing
date = January-March 2003
volume = 2
number = 1
url = http://ipsit.bu.edu/documents/efficient_pda_web.pdf
* cite paper
author = Y. Minsky and A. Trachtenberg,
title = Scalable Set Reconciliation,
journal = Proceedings of the 40^th Allerton Conference on Communication, Control, and Computing
date = October, 2002
url = http://ipsit.bu.edu/documents/BUTR2002-01.pdf
* cite paper
author = A Trachtenberg
title = Designing Lexicographic Codes with a Given Trellis Complexity
journal = IEEE Transactions on Information Theory
date = January 2002
volume = 48
number = 1
url = http://ipsit.bu.edu/documents/lexi_preprint.pdf
* cite paper
author= T. Etzion, A. Trachtenberg, and A. Vardy
title = Which codes have cycle-free Tanner graphs?
journal = IEEE Transactions on Information Theory
date = September 1999
volume = 45
number = 6
url = http://ipsit.bu.edu/documents/tanner.pdf

References

External links

* [http://people.bu.edu/trachten Ari Trachtenberg's personal web page]
* [http://www.bu.edu/eng/catalyst/ece/trachtenberg.html Profile]
* [http://ipsit.bu.edu/documents/phdthesis.pdf PhD Thesis]