Combinatorial Search, 1988. ,
Learning a Hidden Subgraph, SIAM Journal on Discrete Mathematics, vol.18, issue.4, pp.697-712, 2005. ,
DOI : 10.1137/S0895480103431071
Learning a Hidden Matching, SIAM Journal on Computing, vol.33, issue.2, pp.487-501, 2004. ,
DOI : 10.1137/S0097539702420139
Learning a Hidden Graph Using O(log n) Queries Per Edge, COLT, pp.210-223, 2004. ,
DOI : 10.1007/978-3-540-27819-1_15
Learning a Hidden Hypergraph, Journal of Machine Learning Research, vol.7, pp.2215-2236, 2006. ,
DOI : 10.1007/11503415_38
Multiple Access Channels Theory and Practice, NATO Security through Science Series -D: Information and Communication Security, 2007. ,
Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey, pp.16-27, 2005. ,
DOI : 10.1007/11604686_2
URL : https://hal.archives-ouvertes.fr/inria-00000885
Optimal Algorithms for the Coin Weighing Problem with a Spring Scale, COLT, 2009. ,
Reconstructing Weighted Graphs with Minimal Query Complexity, 2009. ,
On Parity Check (0, 1)-Matrix over Zp, 2009. ,
Optimal Query Complexity Bounds for Finding Graphs, STOC, pp.749-758, 2008. ,
Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions, Journal of Computer and System Sciences, vol.77, issue.6, pp.123-134, 2008. ,
DOI : 10.1016/j.jcss.2010.08.011
On a search model of false coins, Topics in Information Theory, pp.163-170, 1975. ,
On a Coding Model for a Multiple-Access Adder Channel, Probl. Peredachi Inf, vol.17, issue.2, p.2638, 1981. ,
Combinatorial group testing and its application, of Series on applied mathematics. World Science, 1993. ,
DOI : 10.1142/4252
On a lemma of Littlewood and Offord. Bulletin of the, pp.898-902, 1945. ,
Optimal Reconstruction of Graphs under the Additive Model, Algorithmica, vol.28, issue.1, pp.104-124, 2000. ,
DOI : 10.1007/s004530010033
URL : https://hal.archives-ouvertes.fr/inria-00073517
Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping, Discrete Applied Mathematics, vol.88, issue.1-3, pp.147-165, 1998. ,
DOI : 10.1016/S0166-218X(98)00070-5
On the Power of, Additive Combinatorial Search Model. COCOON, pp.194-203, 1998. ,
URL : https://hal.archives-ouvertes.fr/inria-00098615
Near-Optimal Sparse Recovery in the L1 Norm, 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp.199-207, 2008. ,
DOI : 10.1109/FOCS.2008.82
On the number of real roots of a random algebraic equation, III. Mat. Sbornik, vol.12, pp.277-285, 1943. ,
Optimally Reconstructing Weighted Graphs Using Queries. SODA, 2010. ,
DOI : 10.1137/1.9781611973075.51
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.2588
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting, 2007. ,
DOI : 10.1016/j.ipl.2006.08.013