M. Aigner, Combinatorial Search, 1988.

N. Alon and V. Asodi, Learning a Hidden Subgraph, SIAM Journal on Discrete Mathematics, vol.18, issue.4, pp.697-712, 2005.
DOI : 10.1137/S0895480103431071

N. Alon, R. Beigel, S. Kasif, S. Rudich, and B. Sudakov, Learning a Hidden Matching, SIAM Journal on Computing, vol.33, issue.2, pp.487-501, 2004.
DOI : 10.1137/S0097539702420139

D. Angluin and J. Chen, 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

D. Angluin and J. Chen, Learning a Hidden Hypergraph, Journal of Machine Learning Research, vol.7, pp.2215-2236, 2006.
DOI : 10.1007/11503415_38

E. Biglieri and L. Györfi, Multiple Access Channels Theory and Practice, NATO Security through Science Series -D: Information and Communication Security, 2007.

M. Bouvel, V. Grebinski, and G. Kucherov, 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

N. H. Bshouty, Optimal Algorithms for the Coin Weighing Problem with a Spring Scale, COLT, 2009.

N. H. Bshouty and H. Mazzawi, Reconstructing Weighted Graphs with Minimal Query Complexity, 2009.

N. H. Bshouty and H. Mazzawi, On Parity Check (0, 1)-Matrix over Zp, 2009.

S. Choi and J. H. Kim, Optimal Query Complexity Bounds for Finding Graphs, STOC, pp.749-758, 2008.

S. Choi, K. Jung, and J. H. Kim, 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

A. G. Djackov, On a search model of false coins, Topics in Information Theory, pp.163-170, 1975.

A. G. D-'yachkov and V. V. Rykov, On a Coding Model for a Multiple-Access Adder Channel, Probl. Peredachi Inf, vol.17, issue.2, p.2638, 1981.

D. Du and F. K. Hwang, Combinatorial group testing and its application, of Series on applied mathematics. World Science, 1993.
DOI : 10.1142/4252

P. Erdös, On a lemma of Littlewood and Offord. Bulletin of the, pp.898-902, 1945.

V. Grebinski and G. Kucherov, 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

V. Grebiniski and G. Kucherov, 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

V. Grebinski, On the Power of, Additive Combinatorial Search Model. COCOON, pp.194-203, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00098615

P. Indyk and M. Ruzic, 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

J. E. Littlewood and A. C. Offord, On the number of real roots of a random algebraic equation, III. Mat. Sbornik, vol.12, pp.277-285, 1943.

H. Mazzawi, Optimally Reconstructing Weighted Graphs Using Queries. SODA, 2010.
DOI : 10.1137/1.9781611973075.51

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

L. Reyzin and N. Srivastava, Learning and Verifying Graphs Using Queries with a Focus on Edge Counting, 2007.
DOI : 10.1016/j.ipl.2006.08.013