Widad Machmouchi

According to our database, Widad Machmouchi authored at least 12 papers between 2008 and 2019.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2019

Report on the First HIPstIR Workshop on the Future of Information Retrieval.

Laura Dietz, Bhaskar Mitra, Jeremy Pickens, Hana Anber, Sandeep Avula, Asia Biega, Adrian Boteanu, Shubham Chatterjee, Jeff Dalton, Shiri Dori-Hacohen, John Foley, Henry Feild, Ben Gamari, Rosie Jones, Pallika Kanani, Sumanta Kashyapi, Widad Machmouchi, Matthew Mitsui, Steve Nole, Alexandre Tachard Passos, Jordan Ramsdell, Adam Roegiest, David Smith, Alessandro Sordoni

SIGIR Forum, 2019

2017

Beyond Success Rate: Utility as a Search Quality Metric for Online Experiments.

Widad Machmouchi, Ahmed Hassan Awadallah, Imed Zitouni, Georg Buscher

Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, 2017

2016

Principles for the Design of Online A/B Metrics.

Widad Machmouchi, Georg Buscher

Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, 2016

2013

Time-Space Tradeoffs and Query Complexity in Statistics, Coding Theory, and Quantum Computing.

Widad Machmouchi

PhD thesis, 2013

Element Distinctness, Frequency Moments, and Sliding Windows.

Paul Beame, Raphaël Clifford, Widad Machmouchi

Electron. Colloquium Comput. Complex., 2013

2012

The quantum query complexity of AC⁰.

Paul Beame, Widad Machmouchi

Quantum Inf. Comput., 2012

Sliding Windows With Limited Storage.

Paul Beame, Raphaël Clifford, Widad Machmouchi

Electron. Colloquium Comput. Complex., 2012

2011

Making Branching Programs Oblivious Requires Superlogarithmic Overhead.

Paul Beame, Widad Machmouchi

Proceedings of the 26th Annual IEEE Conference on Computational Complexity, 2011

2010

Making RAMs Oblivious Requires Superlogarithmic Overhead.

Paul Beame, Widad Machmouchi

Electron. Colloquium Comput. Complex., 2010

The Quantum Query Complexity of AC0

Paul Beame, Widad Machmouchi

CoRR, 2010

Local-testability and self-correctability of q-ary sparse linear codes.

Widad Machmouchi

Proceedings of the IEEE International Symposium on Information Theory, 2010

2008

Explicit interleavers for a Repeat Accumulate Accumulate (RAA) code construction.

Venkatesan Guruswami, Widad Machmouchi

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008