Widad Machmouchi

17 papers A* 2A 2B 2Journal 10
YearRankTypeTitle / Venue / Authors
2019 J jnl
Report on the First HIPstIR Workshop on the Future of Information Retrieval.
CoRR
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
2019 J jnl
Report on the First HIPstIR Workshop on the Future of Information Retrieval.
SIGIR Forum
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
2017 A conf
Beyond Success Rate: Utility as a Search Quality Metric for Online Experiments.
CIKM
Widad Machmouchi, Ahmed Hassan Awadallah, Imed Zitouni, Georg Buscher
2016 A* conf
Principles for the Design of Online A/B Metrics.
SIGIR
Widad Machmouchi, Georg Buscher
2013 A* conf
Element Distinctness, Frequency Moments, and Sliding Windows.
FOCS
Paul Beame, Raphaël Clifford, Widad Machmouchi
2013 J jnl
Element Distinctness, Frequency Moments, and Sliding Windows.
CoRR
Paul Beame, Raphaël Clifford, Widad Machmouchi
2013 J jnl
Element Distinctness, Frequency Moments, and Sliding Windows.
Electron. Colloquium Comput. Complex.
Paul Beame, Raphaël Clifford, Widad Machmouchi
2013 — —
Time-Space Tradeoffs and Query Complexity in Statistics, Coding Theory, and Quantum Computing.
Widad Machmouchi
2012 J jnl
Sliding Windows With Limited Storage.
Electron. Colloquium Comput. Complex.
Paul Beame, Raphaël Clifford, Widad Machmouchi
2012 J jnl
Sliding Windows with Limited Storage
CoRR
Paul Beame, Raphaël Clifford, Widad Machmouchi
2012 J jnl
The quantum query complexity of AC
Quantum Inf. Comput.
Paul Beame, Widad Machmouchi
2011 A conf
Making Branching Programs Oblivious Requires Superlogarithmic Overhead.
CCC
Paul Beame, Widad Machmouchi
2010 J jnl
Local-Testability and Self-Correctability of q-ary Sparse Linear Codes
CoRR
Widad Machmouchi
2010 B conf
Local-testability and self-correctability of q-ary sparse linear codes.
ISIT
Widad Machmouchi
2010 J jnl
Making RAMs Oblivious Requires Superlogarithmic Overhead.
Electron. Colloquium Comput. Complex.
Paul Beame, Widad Machmouchi
2010 J jnl
The Quantum Query Complexity of AC0
CoRR
Paul Beame, Widad Machmouchi
2008 B conf
Explicit interleavers for a Repeat Accumulate Accumulate (RAA) code construction.
ISIT
Venkatesan Guruswami, Widad Machmouchi