2005 CS Technical Reports

• CS-2005-01 Ron M. Roth, Vitaly Skachek: Improved nearly-MDS expander codes
• CS-2005-02 Ami Litman, Shiri Moran-Schein: On Smooth Sets of Integers
• CS-2005-03 Ami Litman, Shiri Moran-Schein: On Distributed Smooth Scheduling
• CS-2005-04 Ami Litman, Shiri Moran-Schein: On Centralized Smooth Scheduling
• CS-2005-05 Roy Friedman Guy Korland: Timed Grid Routing (TIGR) Bites off Energy
• CS-2005-06 Roy Friedman and Guy Korland: RLISE: Relative Location with Incomplete Stationary Emitters
• CS-2005-07 Eran Eden, Dan Waisman, Michael Rudzsky, Haim Bitterman, Vera Brod, and Ehud Rivlin: An Automated Method for Analysis of Flow Characteristics of Circulating Particles from In-Vivo Video
• CS-2005-08 Yair Koren, Irad Yavneh, Alon Spira: A Multigrid Approach to the 1-D Quantization Problem
• CS-2005-09 Erez Louidor, Ron M. Roth: Lowest-density MDS codes over extension alphabets
• CS-2005-10 Vadim Drabkin, Roy Friedman, Marc Segal: Efficient Byzantine Broadcast in Wireless Ad-Hoc Networks
• CS-2005-11 Eli Biham and Jennifer Seberry: Py (Roo): A Fast and Secure Stream Cipher using Rolling Arrays
• CS-2005-12 Yaniv Altshuler and Vladimir Yanovski: Dynamic Cooperative Cleaners - Various Remarks
• CS-2005-13 Ron Begleiter, Ran El-Yaniv: Superior Guarantees for Sequential Prediction and Lossless Compression via Alphabet Decomposition
• CS-2005-14 Eli Biham, Orr Dunkelman, Nathan Keller: A Related-Key Rectangle Attack on the Full KASUMI
• CS-2005-15 Yair Koren, Irad Yavneh: Greedy Aggregation for Vector Quantization
• CS-2005-16 Alex Gontmakher, Avi Mendelson, Assaf Schuster and Gregory Shklover: Inthreads -- a new computational model to enhance ILP of sequential programs
• CS-2005-17 Vadim Drabkin, Roy Friedman, Alon Kama: Practical Byzantine Group Communication
• CS-2005-18 Roy Friedman and Erez Hadad: A Case for Efficient Portable Serialization in CORBA