Result 1 to 20 of 56 total
Error graphs and the reconstruction of elements in groups. (English)
J. Comb. Theory, Ser. A 116, No. 4, 795-815 (2009).
1
Error graphs and the reconstruction of elements in groups (English)
J. Comb. Theory, Ser. A 116, No. 4, 795-815 (2009).
2
Reconstruction of a graph from 2-vicinities of its vertices. (English)
Discrete Appl. Math. 156, No. 9, 1399-1406 (2008).
3
A conjecture on the reconstruction of graphs from metric balls of their vertices. (English)
Discrete Math. 308, No. 5-6, 993-998 (2008).
4
Conflict-avoiding codes and cyclic triple systems. (English)
Probl. Inf. Transm. 43, No. 3, 199-212 (2007); translation from Probl. Peredachi Inf. 43, No. 3, 39-53 (2007).
5
Deletion-correcting codes. (English)
Colbourn, Charles J. (ed.) et al., The CRC handbook of combinatorial designs. Boca Raton, FL: Chapman \& Hall/CRC (ISBN 1-58488-506-8/hbk). Discrete Mathematics and its Applications, 385-388 (2007).
6
06201 executive summary ‒ combinatorial and algorithmic foundations of pattern and association discovery (English)
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery (2006).
7
06201 abstracts collection ‒ combinatorial and algorithmic foundations of pattern and association discovery (English)
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery (2006).
8
Combinatorial and algorithmic foundations of pattern and association discovery, 14.05. - 19.05.2006 (English)
Dagstuhl Seminar Proceedings: Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 06201 (2006).
9
Error-correction capability of binary linear codes. (English)
IEEE Trans. Inf. Theory 51, No. 4, 1408-1423 (2005).
10
Reconstruction of a graph from 2-vicinities of its vertices. (English)
Ahlswede, Rudolf (ed.) et al., General theory of information transfer and combinatorics. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 21, 347-351 (2005).
11
New problems of graph reconstruction. (English)
Bayreuther Math. Schr. 74, 239-255 (2005).
12
Reconstruction of a graph from 2-vicinities of its $vertices^{,}$ (English)
Electronic Notes in Discrete Mathematics 21, 347-351 (2005).
13
The simplex codes and other even-weight binary linear codes for error correction. (English)
IEEE Trans. Inf. Theory 50, No. 11, 2818-2823 (2004).
14
Combinatorial problems motivated by comma-free codes. (English)
J. Comb. Des. 12, No. 3, 184-196 (2004).
15
Hypercubic 4 and 5-designs from double-error-correcting BCH codes. (English)
Des. Codes Cryptography 28, No.3, 265-282 (2003).
16
Application of cover-free codes and combinatorial designs to two-stage testing. (English)
Discrete Appl. Math. 128, No. 1, 11-26 (2003).
17
A universal bound for a covering in regular posets and its application to pool testing. (English)
Discrete Math. 266, No.1-3, 293-309 (2003).
18
Asymptotic efficiency of two-stage disjunctive testing. (English)
IEEE Trans. Inf. Theory 48, No. 7, 1741-1749 (2002).
19
Asymptotic efficiency of two-stage disjunctive testing (English)
IEEE Transactions on Information Theory 48, No. 7, 1741-1749 (2002).
20
Result 1 to 20 of 56 total
Start
Contact
Print
General Help
