History

Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 331 total

On security of statistical databases. (English)
SIAM J. Discrete Math. 25, No. 4, 1778-1791 (2011).
1
Interactive communication, diagnosis and error control in networks. (English)
Lerner, Jürgen (ed.) et al., Algorithmics of large and complex networks. Design, analysis, and simulation. Berlin: Springer (ISBN 978-3-642-02093-3/pbk). Lecture Notes in Computer Science 5515, 197-226 (2009).
2
Two batch search with Lie cost (English)
IEEE Transactions on Information Theory 55, No. 4, 1433-1439 (2009).
3
Interactive communication, diagnosis and error control in networks (English)
Algorithmics of Large and Complex Networks, 197-226 (2009).
4
On diagnosability of large multiprocessor networks. (English)
Discrete Appl. Math. 156, No. 18, 3464-3474 (2008).
5
Error control codes for parallel asymmetric channels. (English)
IEEE Trans. Inf. Theory 54, No. 2, 831-836 (2008).
6
Special issue: General theory of information transfer and combinatorics. Based on a research project, Bielefeld, Germany, October 1, 2001‒September 30, 2004. (English)
Discrete Appl. Math. 156, No. 9, 1343-1566 (2008).
7
A diametric theorem in ${\mathbb Z}^n_m$ for Lee and related distances. (English)
Barbero, Ángela (ed.), Coding theory and applications. Second international castle meeting, ICMCTA 2008, Castillo de La Mota, Medina del Campo, Spain, September 15‒19, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87447-8/pbk). Lecture Notes in Computer Science 5228, 1-10 (2008).
8
On the correlation of binary sequences. (English)
Discrete Appl. Math. 156, No. 9, 1478-1487 (2008).
9
T-shift synchronization codes. (English)
Discrete Appl. Math. 156, No. 9, 1461-1468 (2008).
10
Searching with lies under error cost constraints. (English)
Discrete Appl. Math. 156, No. 9, 1444-1460 (2008).
11
Ratewise-optimal non-sequential search strategies under constraints on the tests. (English)
Discrete Appl. Math. 156, No. 9, 1431-1443 (2008).
12
General theory of information transfer: Updated. (English)
Discrete Appl. Math. 156, No. 9, 1348-1388 (2008).
13
Lectures on advances in combinatorics. (English)
Universitext. Berlin: Springer (ISBN 978-3-540-78601-6). xiii, 314~p. EUR~42.75 (2008).
14
A diametric theorem in Z $^{n}_{m}$ for Lee and related distances (English)
ICMCTA, 1-10 (2008).
15
The final form of Tao’s inequality relating conditional expectation and conditional mutual information. (English)
Adv. Math. Commun. 1, No. 2, 239-242 (2007).
16
Classical capacity of classical-quantum arbitrarily varying channels. (English)
IEEE Trans. Inf. Theory 53, No. 2, 526-533 (2007).
17
Intersection graphs of rectangles and segments. (English)
Ahlswede, Rudolf (ed.) et al., General theory of information transfer and combinatorics. Berlin: Springer (ISBN 978-3-540-46244-6/pbk). Lecture Notes in Computer Science 4123, 1064-1065 (2006).
18
Finding $C_{\text{NRI}}({\mathcal W})$, the identification capacity of the AVC ${\mathcal W}$, if randomization in the encoding is excluded. (English)
Ahlswede, Rudolf (ed.) et al., General theory of information transfer and combinatorics. Berlin: Springer (ISBN 978-3-540-46244-6/pbk). Lecture Notes in Computer Science 4123, 1063 (2006).
19
Sparse asymmetric connectors in communication networks. (English)
Ahlswede, Rudolf (ed.) et al., General theory of information transfer and combinatorics. Berlin: Springer (ISBN 978-3-540-46244-6/pbk). Lecture Notes in Computer Science 4123, 1056-1062 (2006).
20
first | previous | 1 21 41 61 81 101 | next | last

Result 1 to 20 of 331 total