Explicit interleavers for a Repeat Accumulate Accumulate (RAA) code construction. - Venkatesan Guruswami; Widad Machmouchi (ISIT, 2008)

Local-testability and self-correctability of q-ary sparse linear codes. - Widad Machmouchi (ISIT, 2010)

The Quantum Query Complexity of AC0 - Paul Beame; Widad Machmouchi (CoRR, 2010)

Making RAMs Oblivious Requires Superlogarithmic Overhead. - Paul Beame; Widad Machmouchi (Electron. Colloquium Comput. Complex., 2010)

Making Branching Programs Oblivious Requires Superlogarithmic Overhead. - Paul Beame; Widad Machmouchi (CCC, 2011)

Sliding Windows With Limited Storage. - Paul Beame; Raphaël Clifford; Widad Machmouchi (Electron. Colloquium Comput. Complex., 2012)

The quantum query complexity of AC0. - Paul Beame; Widad Machmouchi (Quantum Inf. Comput., 2012)

Element Distinctness, Frequency Moments, and Sliding Windows. - Paul Beame; Raphaël Clifford; Widad Machmouchi (Electron. Colloquium Comput. Complex., 2013)

Time-Space Tradeoffs and Query Complexity in Statistics, Coding Theory, and Quantum Computing. - Widad Machmouchi (2013)

Principles for the Design of Online A/B Metrics. - Widad Machmouchi; Georg Buscher (SIGIR, 2016)

Beyond Success Rate: Utility as a Search Quality Metric for Online Experiments. - Widad Machmouchi; Ahmed Hassan Awadallah; Imed Zitouni; Georg Buscher (CIKM, 2017)

Report on the First HIPstIR Workshop on the Future of Information Retrieval. - Laura Dietz; Bhaskar Mitra 001; Jeremy Pickens; Hana Anber; Sandeep Avula; Asia Biega; Adrian Boteanu; Shubham Chatterjee; Jeff Dalton 001; Shiri Dori-Hacohen; John Foley; Henry Feild; et al. (SIGIR Forum, 2019)