Selected publications

2023

• N. Boskov, S. Simsek, A. Trachtenberg, and D. Starobinski SREP: Out-of-band sync of transaction pools for large-scale blockchains IEEE International Conference on Blockchain and Cryptocurrency (ICBC) May 2023 best paper https://arxiv.org/pdf/2303.16809

2022

• N. Boskov, N. Radami, T. Tiwari, and A. Trachtenberg Union buster: A cross-container covert channel exploiting union mounting CSCML/span> 2022 https://link.springer.com/chapter/10.1007/978-3-031-07689-3_23
• L. Samuels, N. Boskov, A. Francisco Oliveira, EdwinE. Sun, M. Monga, M. Varia, A. Devaiah, G. V. Denis Automated Exposure Notification for COVID-19 Journal of Young Investigators 25 12 2022 https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10321550/
• Novak Boškov, Ari Trachtenberg, David Starobinski Gensync: A new framework for benchmarking and optimizing reconciliation of data IEEE TNSM 2022 https://ieeexplore.ieee.org/abstract/document/9317824
• A. Trachtenberg The Great LinkedIn Purge ... rewriting history, one account at a time Substack 2022 https://arit.substack.com/p/the-great-linkedin-purge

2021

• J. Milligan, S. Scheffler, A. Sellars, T. Tiwari, A. Trachtenberg, and M. Varia Case Study: Disclosure of Indirect Device Fingerprinting in Privacy Policies Socio-Technical Aspects in Security and Trust 2021 https://scholar.google.com/citations?view_op=view_citation&hl=en&user=PpKoYdUAAAAJ&sortby=pubdate&citation_for_view=PpKoYdUAAAAJ:VOx2b1Wkg3QC
• MA. Imtiaz, D. Starobinski, and A. Trachtenberg Investigating Orphan Transactions in the Bitcoin Network IEEE TNSM 2021 https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=9345789
• MA. Imtiaz, D. Starobinski, A. Trachtenberg, and N. Younis Churn in the Bitcoin network IEEE TNSM 2021 https://ieeexplore.ieee.org/iel7/4275028/5699970/09317824.pdf
• A. Trachtenberg COVID Vaccines Must Be Voluntary Substack 2021 https://arit.substack.com/p/covid-vaccines-must-be-voluntary

2020

• N. Boskov, A. Trachtenberg, and D. Starobinski Birdwatching: False Negatives in Cuckoo Filters IEEE TNSM 2020 https://dl.acm.org/doi/pdf/10.1145/3426746.3434063
• MA. Imtiaz, D. Starobinski, and A. Trachtenberg Characterizing orphan transactions in the bitcoin network IEEE ICBC 2020 https://ieeexplore.ieee.org/iel7/9165689/9169389/09169449.pdf
• RL. Rivest, J. Callas, R. Canetti, K. Esvelt, DK. Gillmor, YT. Kalai, A. Lysyanskaya, A. Norige, R. Raskar, A. Shamir, E. Shen, I. Soibelman, M. Specter, V. Teague, A. Trachtenberg, M. Varia, M. Viera, D. Weitzner, J. Wilkinson, M. Zissman The PACT protocol specification MIT PACT 2020 https://people.csail.mit.edu/rivest/pubs/RACCS-2020-PACT.pdf
• R. Canetti, A. Trachtenberg, and M. Varia Anonymous Collocation Discovery: Harnessing Privacy to Tame the Coronavirus arxiv March 2020 https://arxiv.org/pdf/2003.13670
• R. Canetti, YT. Kalai, A. Lysyanskaya, RL. Rivest, A. Shamir, E. Shen, A. Trachtenberg, M. Varia, DJ. Weitzner Privacy-preserving automated exposure notification Cryptology ePrint March 2020 https://eprint.iacr.org/2020/863.pdf
• A. Trachtenberg Censoring Science Substack 2020 https://arit.substack.com/p/censoring-science
• A. Trachtenberg COVID Masks: a social engineering perspective Substack 2020 https://arit.substack.com/p/covid-masks-a-social-engineering
• A. Trachtenberg Controlling COVID through Cellphones Substack 2020 https://arit.substack.com/p/controlling-covid-through-cellphones
• A. Trachtenberg Whom to Quarantine? Substack 2020 https://arit.substack.com/p/whom-to-quarantine

2019

• T. Tiwari and A. Trachtenberg Alternative (ab)uses for HTTP Alternative Services WOOT 2019 https://www.usenix.org/conference/woot19/presentation/tiwari
• A. Trachtenberg Bug Bounties - a Failed Model Substack 2019 https://arit.substack.com/p/bug-bounties-a-failed-model
• D. Gruss, E. Kraft, T. Tiwari, M. Schwarz, A. Trachtenberg, J. Hennessey, A. Ionescu, A. Fogh Page Cache Attacks CCS 2019 https://arxiv.org/pdf/1901.01161
• A. Trachtenberg Why are our undergrads so awesome? Substack 2019 https://arit.substack.com/p/why-are-our-undergrads-so-awesome
• MA. Imtiaz, D. Starobinski, A. Trachtenberg, N. Younis Churn in the Bitcoin Network: Characterization and Impact ICBC 2019
• T. Tiwari, A. Klausner, M. Andreev, A. Trachtenberg, A. Yerukhimovich Location Leakage from Network Access Patterns CNS 2019
• Y. Hu, A. Trachtenberg, P. Ishwar Collaborative Privacy for Web Applications Arxiv 2019 https://arxiv.org/pdf/1901.03383

2018

• T. Tiwari and A. Trachtenberg Cashing in on the File-System Cache CCS 2018 https://dl.acm.org/citation.cfm?id=3278499
• M. Andreev, A. Klausner, T. Tiwari, A. Trachtenberg, A. Yerukhimovich Nothing But Net: Invading Android User Privacy Using Only Network Access Patterns Arxiv 2018 https://arxiv.org/pdf/1807.02719
• T. Tiwari, D. Starobinski, A. Trachtenberg Distributed Web Mining of Ethereum CSCML 2018 https://people.bu.edu/staro/CSCML18-Trishita.pdf
• N. Younis, M.A. Imtiaz, D. Starobinski, A. Trachtenberg Improving Bitcoin's Resilience to Churn Arxiv 2018 https://arxiv.org/pdf/1803.06559
• A. Trachtenberg Empirical Kolmogorov Complexity ITA 2018 https://ieeexplore.ieee.org/iel7/8486613/8502949/08503120.pdf

2017

• A. Trachtenberg Making a living from Torah Substack 2019 https://arit.substack.com/p/making-a-living-from-torah

2016

• A. Trachtenberg Climate science, and other religions Substack 2016 https://ipsit.bu.edu/documents/science.pdf
• A. Yerukhimovich, R. Balebako, A. Boustead, R.K. Cunningham, W. Welser IV, R. Housley, R. Shay, C. Spensky, Karlyn D Stanley, J. Stewart, A. Trachtenberg, Z. Winkelman Can Smartphones and Privacy Coexist? RAND Corporation 2016 https://pdfs.semanticscholar.org/a4d7/7a5f84eb7d77344d43554902f4fb4d2637f3.pdf
• A. Trachtenberg Russians, Hacking, and the CIA Substack 2016 https://arit.substack.com/p/russians-hacking-and-the-cia
• A. Trachtenberg Stein/Clinton end game Substack 2016 https://arit.substack.com/p/steinclinton-end-game
• W. Si, D. Starobinski, M. Hashemi, M. Laifenfeld, A. Trachtenberg Channel sensitivity of lifo-backpressure: Quirks and improvements IEEE TCNS 2016 https://people.bu.edu/staro/TCNS_Wei_2015.pdf
• A. Trachtenberg Extra Time on an Exam: Suitable Accommodation or Legal Cheating? Chronicle of Higher Education 2016 https://www.chronicle.com/article/Extra-Time-on-an-Exam-/237787
• C. Spensky, J. Stewart, A. Yerukhimovich, R. Shay, A. Trachtenberg, R. Housley, R.K. Cunningham SoK: Privacy on Mobile Devices--It's Complicated PETS 2016 https://petsymposium.org/2016/files/papers/SoK__Privacy_on_Mobile_Devices_%E2%80%93_It%E2%80%99s_Complicated.pdf
• M. Hashemi, Y. Cassuto, and A. Trachtenberg Fountain codes with nonuniform selection distributions through feedback IEEE IT 2016

2015

• W. Si, M. Hashemi, L. Xin, D. Starobinski and A. Trachtenberg Teacp: A toolkit for evaluation and analysis of collection protocols in wireless sensor networks IEEE TONS 2015 https://people.bu.edu/staro/TNSM_20150224.pdf
• M. Timchenko and A. Trachtenberg Distributed anonymous data collection and feedback ACM Systor 2015 https://dl.acm.org/citation.cfm?id=2778368
• M. Timchenko and A. Trachtenberg Poster: A Framework for Distributed Anonymous Data Collection and Feedback IEEE S&P 2015 https://www.ieee-security.org/TC/SP2015/posters/paper_32.pdf
• M. Hashemi and A. Trachtenberg CDP: a coded datagram transport protocol bridging UDP and TCP ACM Systor 2015 https://dl.acm.org/citation.cfm?id=2757675
• M. Hashemi, Y. Cassuto and A. Trachtenberg Fountain Codes with Nonuniform Selection Distributions through Feedback Allerton 2015 https://arxiv.org/pdf/1504.01802
• W. Si, D. Starobinski, M. Hashemi, M. Laifenfeld and A. Trachtenberg Channel sensitivity of lifo-backpressure: Quirks and improvements IEEE TCNS 2015 https://www.researchgate.net/profile/Morteza_Hashemi4/publication/277348285_Channel_Sensitivity_of_LIFO-Backpressure_Quirks_and_Improvements/links/55e66d9308aede0b57376ce9.pdf

2014

• M. Hashemi, W. Si, M. Laifenfeld, D. Starobinski and A. Trachtenberg Intra-Car Multi-hop Wireless Sensor Networking:A Case Study IEEE Communications Magazine 2014 October
• M. Hashemi and A. Trachtenberg Near Real-time Rateless Coding with a Constrained Feedback Budget Allerton 2014 October https://ipsit.bu.edu/documents/RLT_web.pdf
• Y. Gilad, A. Herzberg, and A. Trachtenberg Securing Smartphones: A Micro-TCB Approach IEEE Pervasive Computing Magazine 2014 https://ipsit.bu.edu/documents/CellSec_web.pdf
• A. Trachtenberg Say it ain't so - An implementation of deniable encryption Blackhat Asia 2014 https://www.blackhat.com/docs/asia-14/materials/Trachtenberg/WP-Asia-14-Trachtenberg-Say-It-Ain%27t-So-An-Implementation-Of-Deniable-Encryption.pdf

2013

• M. Hashemi, A. Trachtenberg, Y. Cassuto Delete-And-Conquer: Rateless Coding with Constrained Feedback Allerton October 2013 https://ipsit.bu.edu/documents/Allerton2013web.pdf
• W. Si, M. Hashemi, I. Warsawski, M. Laifenfeld, D. Starobinski, and A. Trachtenberg TeaCP: a Toolkit for Evaluation and Analysis of Collection Protocols in Wireless Sensor Networks IEEE COMCAS October 2013
• A. Kontorovich,.A. Trachtenberg Deciding unique decodability of bigram counts via finite automata Journal of Computer and System Sciences September 2013 https://www.sciencedirect.com/science/article/pii/S0022000013001670
• M. Hashemi, W. Si, M. Laifenfeld, D. Starobinski, and A. Trachtenberg Intra-car Wireless Sensors Data Collection: A Multi-hop approach IEEE VTC June 2013 https://ipsit.bu.edu/documents/VTCpaper_web.pdf
• A. Klausner, A. Trachtenberg, D. Starobinski and M. Horenstein An Overview of the Capabilities and Limitations of Smartphone Sensors IJHCR 2013 https://www.igi-global.com/article/an-overview-of-the-capabilities-and-limitations-of-smartphone-sensors/79960
• A Filtser, J. Jin, A. Kontorovich, and A. Trachtenberg Efficient determination of the unique decodability of a string IEEE ISIT 2013
• A. Kontorovich and A. Trachtenberg Unique decodability for string reconciliation ITA February 5-10 2013

2012

• J. Jin, A. Trachtenberg and D. Starobinski Priority-Based Synchronization of Distributed Data MILCOM October 2012 https://ipsit.bu.edu/documents/MILCOM_12_WEB.pdf
• A. Kontorovich and A. Trachtenberg Efficiently decoding strings from their shingles Arxiv preprint arXiv:1204.3293 2012 https://arxiv.org/abs/1204.3293
• A. Kontorovich and A. Trachtenberg String reconciliation with unknown edit distance IEEE ISIT 2012 https://ipsit.bu.edu/documents/isit2012_web.pdf
• K. Lin, D. Starobinski, A. Trachtenberg and S. Agarwal Scheduling Algorithms and Bounds for Rateless Data Dissemination in Dense Wireless Networks CISS March 21-23 2012 https://people.bu.edu/staro/CISS_2012.pdf
• A. Kontorovich and A. Trachtenberg Unique decodability for string reconciliation ITA February 5-10 2012
• W. Xiao, S. Agarwal, D. Starobinski and A. Trachtenberg Reliable wireless broadcasting with near-zero feedback IEEE/ACM Transactions on Networking 2012 https://people.bu.edu/staro/ToN-EVT2.pdf
• N. Fazlollahi, D. Starobinski, and A. Trachtenberg Connected Identifying Codes IEEE Transactions on Information Theory 58 7 4814-4824 July 2012 https://ipsit.bu.edu/documents/CONNECTED_IT_12_WEB.pdf
• A. Kontorovich and A. Trachtenberg Unique decodability of bigram counts by finite automata Arxiv preprint arXiv:1111.6431 2012 https://arxiv.org/abs/1111.6431

2011

• N. Fazlollahi, D. Starobinski and A. Trachtenberg Connected identifying codes for sensor network monitoring IEEE WCNC 1026-1031 2011 IEEE https://ipsit.bu.edu/documents/wcnc11.pdf
• M. Boyle, A. Klausner, D. Starobinski, A. Trachtenberg and H. Wu Poster: gait-based smartphone user identification ACM MOBISYS 395-396 2011 ACM https://ipsit.bu.edu/documents/mobisys11.pdf
• A. Klausner, A. Trachtenberg and D. Starobinski Phones and robots: brains and brawn ACM SenSys 361-362 Seattle, WA November 1-4 2011 https://dl.acm.org/ft_gateway.cfm?id=2070990&ftid=1058814&dwn=1
• N. Fazlollahi, D. Starobinski and A. Trachtenberg Connecting identifying codes and fundamental bounds ITA 1-7 2011 IEEE
• A. Kontorovich and A. Trachtenberg Unique decodability of bigram counts by finite automata Arxiv preprint arXiv:1111.6431 2011 https://arxiv.org/abs/1111.6431

2010

• W. Xiao, S. Agarwal, D. Starobinski and A. Trachtenberg Reliable wireless broadcasting with near-zero feedback IEEE INFOCOM, 2010 1-9 2010 IEEE https://ipsit.bu.edu/documents/INFOCOM2010.pdf

2009

• A. Hagedorn, S. Agarwal, D. Starobinski and A. Trachtenberg Rateless coding with feedback IEEE INFOCOM 2009 1791-1799 2009 IEEE https://ipsit.bu.edu/documents/infocom09.pdf
• M. Laifenfeld, A. Trachtenberg, R. Cohen and D. Starobinski Joint monitoring and routing in wireless sensor Networking using robust identifying codes Mobile Networks and Applications 14 4 415-432 2009 Springer https://www.springerlink.com/content/8386234004837647
• S. Agarwal, M. Laifenfeld, A. Hagedorn, A. Trachtenberg and M. Alanyali Fair and distributed peer-to-peer allocation of a common, refillable resource Journal of Parallel and Distributed Computing 69 12 974-988 2009 https://ipsit.bu.edu/documents/refillable.pdf
• M. Laifenfeld, A. Trachtenberg and D. Starobinski Robust Localization Using Identifying Codes Localization algorithms and strategies for wireless sensor Networking 321 2009 Information Science Publishing https://www.igi-global.com/bookstore/TitleDetails.aspx?TitleId=700

2008

• A. Hagedorn, D. Starobinski and A. Trachtenberg Rateless Deluge: Over-the-air programming of wireless sensor networks using random linear codes IPSN 457-466 2008 IEEE Computer Society https://ipsit.bu.edu/documents/IPSN08.pdf
• M. Laifenfeld and A. Trachtenberg Identifying codes and covering problems IEEE Transactions on Information Theory 54 9 3929-3950 2008 IEEE https://ipsit.bu.edu/documents/IT08.pdf
• S. Agarwal, A. Hagedorn and A. Trachtenberg Adaptive rateless coding under partial information ITA 5-11 2008 IEEE https://ipsit.bu.edu/documents/ITA_08.pdf
• R. Lippmann, E. Kirda and A. Trachtenberg RAID 5230 , Cambridge, MA, USA September 15-17 2008 Springer-Verlag New York Inc
• A. Trachtenberg Closed-form expression for the parameters of binary lexicodes ITA 2008 https://ita.ucsd.edu/workshop/08/files/open_problems/Trachtenberg.pdf

2007

• D. Starobinski, W. Xiao, X. Qin and A. Trachtenberg Near-optimal data dissemination policies for multi-channel, single radio wireless sensor networks INFOCOM 955-963 2007 IEEE https://ipsit.bu.edu/documents/multiChannel.pdf
• S. Agarwal, A. Hagedorn and A. Trachtenberg Near optimal update-broadcast of data sets IEEE International Conference on Mobile Data Management 356-360 2007 IEEE https://ipsit.bu.edu/documents/disn_web.pdf
• M. Laifenfeld, A. Trachtenberg, R. Cohen and D. Starobinski Joint monitoring and routing in wireless sensor Networking using robust identifying codes IEEE Broadnets September 2007 https://ipsit.bu.edu/documents/broadnets_web.pdf

2006

• M. Laifenfeld, A. Trachtenberg and T.Y. Berger-Wolf Identifying codes and the set cover problem Proceedings of the 44th Annual Allerton Conf. on Communication, Control and Computing, Monticello, USA 2006 Citeseer https://ipsit.bu.edu/documents/Allerton_web.pdf
• S. Agarwal, V. Chauhan and A. Trachtenberg Bandwidth efficient string reconciliation using puzzles , IEEE Transactions on Parallel and Distributed Systems 17 11 1217-1225 2006 IEEE https://ipsit.bu.edu/documents/puzzles_journal.pdf
• S. Agarwal, M. Laifenfeld, A. Trachtenberg and M. Alanyali Fast data access over asymmetric channels using fair and secure bandwidth sharing IEEE ICDCS 58-58 2006 https://ipsit.bu.edu/documents/persist-web.pdf
• S. Agarwal, M. Laifenfeld, A. Trachtenberg and M. Alanyali Using bandwidth sharing to fairly overcome channel asymmetry ITA 2006 Citeseer
• S. Agarwal and A. Trachtenberg Approximating the number of differences between remote sets IEEE Information Theory Workshop 217-221 2006 Punta del Este, Uruguay https://ipsit.bu.edu/documents/wrap-web.pdf
• A. Hagedorn, D. Starobinski and A. Trachtenberg Rateless codes for data dissemination in sensor networks SenSys 393-394 2006 ACM

2005

• M. Laifenfeld and A. Trachtenberg Disjoint identifying-codes for arbitrary graphs IEEE ISIT 244-248 2005 https://ipsit.bu.edu/documents/disjoint_web.pdf

2004

• S. Ray, D. Starobinski, A. Trachtenberg and R. Ungrangsi Robust location detection with sensor Networking IEEE Journal on Selected Areas in Communications 22 6 1016-1025 2004 https://ipsit.bu.edu/documents/jsac_web.pdf
• R. Ungrangsi, A. Trachtenberg and D. Starobinski An implementation of indoor location detection systems based on identifying codes Intelligence in Communication Systems 175-189 2004 Springer
• V. Chauhan and A. Trachtenberg Reconciliation puzzles [separately hosted strings reconciliation] IEEE GLOBECOM 2 600-604 2004 https://ipsit.bu.edu/documents/recon_web.pdf
• D. Sumorok, D. Starobinski and A. Trachtenberg Simulation of TinyOS Wireless Sensor Networks Using OPNET OPNETWORK 2004
• D. Starobinski, A. Trachtenberg and R. Ungrangsi An Implementation of Indoor Location Detection Systems Based on Identifying Codes IFIP LNCS 175-189 3283 2004 https://ipsit.bu.edu/documents/web_location.pdf

2003

• S. Ray, R. Ungrangsi, D. Pellegrini, A. Trachtenberg and D. Starobinski Robust location detection in emergency sensor networks IEEE INFOCOM 2 1044-1053 2003 https://ipsit.bu.edu/documents/location_web.pdf
• Y. Minsky, A. Trachtenberg and R. Zippel Set reconciliation with nearly optimal communication complexity IEEE Transactions on Information Theory 49 9 2213-2218 2003 IEEE https://ipsit.bu.edu/documents/ieee-it3-web.pdf
• D. Starobinski, A. Trachtenberg and S. Agarwal Efficient PDA synchronization IEEE Transactions on Mobile Computing 2 1 40-51 2003 https://ipsit.bu.edu/documents/efficient_pda_web.pdf
• M.G. Karpovsky, L.B. Levitin. and A. Trachtenberg Data verification and reconciliation with generalized error-control codes IEEE Transactions on Information Theory 49 7 1788-1793 2003
• A. Trachtenberg and A. Vardy Full-Rank Tilings of $$\backslash$ mathbbF\^ 8\_$\backslash$! 2$ Do Not Exist SIAM Journal on Discrete Mathematics 16 390 2003 https://ipsit.bu.edu/documents/8tiling_web.pdf

2002

• A. Trachtenberg, D. Starobinski and S. Agarwal Fast PDA synchronization using characteristic polynomial interpolation IEEE INFOCOM 2002 3 1510-1519 2002 IEEE https://ipsit.bu.edu/documents/BUtech03.pdf
• Y. Minsky and A. Trachtenberg Scalable set reconciliation 40th Annual Allerton Conference on Communication, Control, and Computing 248 2002 https://ipsit.bu.edu/documents/BUTR2002-01.pdf
• A. Trachtenberg Designing lexicographic codes with a given trellis complexity IEEE Transcations on Information Theory 48 1 89-100 2002 https://ipsit.bu.edu/documents/lexi_preprint.pdf
• S.K. Agarwal, A. Yaar, D. Starobinski and A. Trachtenberg Fast network synchronization (poster) ACM SIGCOMM 32 3 14-14 2002 https://ipsit.bu.edu/documents/sigcomm.pdf
• A. Sachin, D. Starobinski and A. Trachtenberg On the scalability of data synchronization protocols for PDAs and mobile devices IEEE Network 16 4 22-28 2002 https://ipsit.bu.edu/documents/pda_scale.pdf
• Y. Minsky and A. Trachtenberg Practical set reconciliation BU Technical Report ECE--2002-01

2001

• A. Trachtenberg and D. Starobinski Towards global synchronisation Workshop on New Visions for Large-Scale Networks: Research and Applications 2001 https://ipsit.bu.edu/documents/workshop.pdf>pdf
• M.G. Karpovsky and A. Trachtenberg Space-Time Turn Prohibitions for Low Density Parity-Check Codes Allerton October 2001 https://ipsit.bu.edu/documents/allerton01.pdf
• M.G. Karpovsky, L.B. Levitin. and A. Trachtenberg Data verification and reconciliation with generalized error-control codes 39th Annual Allerton Conference on Communication, Control, and Computing October 2001 IEEE https://ipsit.bu.edu/documents/allerton_equiv_short.pdf
• M.G. Karpovsky, L.B. Levitin. and A. Trachtenberg Connections between data reconciliation and error-correcting codes IEEE ISIT June 2001 https://ipsit.bu.edu/documents/equiv_abstract.pdf
• Y. Minsky, A. Trachtenberg and R. Zippel Set reconciliation with nearly optimal communication complexity IEEE ISIT June 2001 https://ipsit.bu.edu/documents/isit2001_short.pdf

2000

• A. Trachtenberg Error-correcting Codes on Graphs: Lexicodes, Trellises and Factor Graphs 2000 University of Illinois at Urbana-Champaign PhD Thesis https://ipsit.bu.edu/documents/phdthesis.pdf
• Y. Minsky, A. Trachtenberg and R. Zippel Set reconciliation with nearly optimal communication complexity 2000 Technical Report TR2000-1813, Cornell University https://dspace.library.cornell.edu/bitstream/1813/5803/1/2000-1813.pdf
• Y. Minsky, A. Trachtenberg and R. Zippel Set reconciliation with nearly optimal communication complexity 2000 Technical Report TR2000-1796, Cornell University https://dspace.library.cornell.edu/bitstream/1813/5788/1/2000-1796.pdf

1999

• T. Etzion, A. Trachtenberg and A. Vardy Which codes have cycle-free Tanner graphs? , IEEE Transactions on Information Theory 45 6 2173-2181 1999 https://ipsit.bu.edu/documents/tanner.pdf
• A. Trachtenberg Error-correcting codes on graphs: lexicodes, trellises and factor graphs 1999 University of Illinois at Urbana-Champaign PhD Thesis https://ipsit.bu.edu/documents/phdthesis.pdf
• Y. Minsky and A. Trachtenberg Set reconciliation with nearly optimal communication complexity 2000 Technical Report TR99-1778, Cornell University https://ecommons.library.cornell.edu/bitstream/1813/7432/1/99-1778.pdf

1998 and earlier

• T. Etzion, A. Trachtenberg and A. Vardy Which codes have cycle-free Tanner graphs? IEEE International Symposium on Information Theory 207 1998
• A. Trachtenberg and A. Vardy Lexicographic Codes: Constructions Bounds and Trellis Complexity IEEE ISIT 1997
• A. Trachtenberg and A. Vardy Lexicographic Codes: Constructions Bounds and Trellis Complexity CISS 1997 https://ipsit.bu.edu/documents/ciss.pdf
• A. Trachtenberg Computational methods in coding theory 1996 University of Illinois at Urbana-Champaign MS Thesis https://ipsit.bu.edu/documents/thesis.pdf