default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWidad Machmouchi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j2]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:
Report on the First HIPstIR Workshop on the Future of Information Retrieval. SIGIR Forum 53(2): 62-75 (2019)- [i8]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:
Report on the First HIPstIR Workshop on the Future of Information Retrieval. CoRR abs/1912.09910 (2019) - 2017
- [c6]Widad Machmouchi, Ahmed Hassan Awadallah, Imed Zitouni, Georg Buscher:
Beyond Success Rate: Utility as a Search Quality Metric for Online Experiments. CIKM 2017: 757-765 - 2016
- [c5]Widad Machmouchi, Georg Buscher:
Principles for the Design of Online A/B Metrics. SIGIR 2016: 589-590 - 2013
- [b1]Widad Machmouchi:
Time-Space Tradeoffs and Query Complexity in Statistics, Coding Theory, and Quantum Computing. University of Washington, USA, 2013 - [c4]Paul Beame
, Raphaël Clifford, Widad Machmouchi:
Element Distinctness, Frequency Moments, and Sliding Windows. FOCS 2013: 290-299 - [i7]Paul Beame, Raphaël Clifford, Widad Machmouchi:
Element Distinctness, Frequency Moments, and Sliding Windows. CoRR abs/1309.3690 (2013) - [i6]Paul Beame, Raphaël Clifford, Widad Machmouchi:
Element Distinctness, Frequency Moments, and Sliding Windows. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j1]Paul Beame, Widad Machmouchi:
The quantum query complexity of AC0. Quantum Inf. Comput. 12(7-8): 670-676 (2012) - [i5]Paul Beame, Raphaël Clifford, Widad Machmouchi:
Sliding Windows with Limited Storage. CoRR abs/1212.4372 (2012) - [i4]Paul Beame, Raphaël Clifford, Widad Machmouchi:
Sliding Windows With Limited Storage. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c3]Paul Beame, Widad Machmouchi:
Making Branching Programs Oblivious Requires Superlogarithmic Overhead. CCC 2011: 12-22 - 2010
- [c2]Widad Machmouchi:
Local-testability and self-correctability of q-ary sparse linear codes. ISIT 2010: 1203-1207 - [i3]Paul Beame, Widad Machmouchi:
The Quantum Query Complexity of AC0. CoRR abs/1008.2422 (2010) - [i2]Widad Machmouchi:
Local-Testability and Self-Correctability of q-ary Sparse Linear Codes. CoRR abs/1012.3506 (2010) - [i1]Paul Beame, Widad Machmouchi:
Making RAMs Oblivious Requires Superlogarithmic Overhead. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2008
- [c1]Venkatesan Guruswami, Widad Machmouchi:
Explicit interleavers for a Repeat Accumulate Accumulate (RAA) code construction. ISIT 2008: 1968-1972
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
