Antoine Lobstein Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2008
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIrène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein: Discriminating codes in (bipartite) planar graphs. Eur. J. Comb. 29(5): 1353-1364 (2008)
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYael Ben-Haim, Sylvain Gravier, Antoine Lobstein, Julien Moncel: Adaptive identification in graphs. J. Comb. Theory, Ser. A 115(7): 1114-1126 (2008)
2007
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIrène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein: Links Between Discriminating and Identifying Codes in the Binary Hamming Space. AAECC 2007: 267-270
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIrène Charon, Olivier Hudry, Antoine Lobstein: Extremal cardinalities for identifying and locating-dominating codes in graphs. Discrete Mathematics 307(3-5): 356-366 (2007)
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIrène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein: Structural Properties of Twin-Free Graphs. Electr. J. Comb. 14(1): (2007)
2006
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIrène Charon, Sylvain Gravier, Olivier Hudry, Antoine Lobstein, Michel Mollard, Julien Moncel: A linear algorithm for minimum 1-identifying codes in oriented trees. Discrete Applied Mathematics 154(8): 1246-1253 (2006)
2005
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIrène Charon, Olivier Hudry, Antoine Lobstein: On the Structure of Identifiable Graphs. Electronic Notes in Discrete Mathematics 22: 491-495 (2005)
2004
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIrène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein: The minimum density of an identifying code in the king lattice. Discrete Mathematics 276(1-3): 95-109 (2004)
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein: Identifying and locating-dominating codes on chains and cycles. Eur. J. Comb. 25(7): 969-987 (2004)
2003
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIiro S. Honkala, Antoine Lobstein: On Identification in ZZ2 Using Translates of Given Patterns. J. UCS 9(10): 1204-1219 (2003)
28no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIrène Charon, Olivier Hudry, Antoine Lobstein: Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard. Theor. Comput. Sci. 290(3): 2109-2120 (2003)
2002
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIiro S. Honkala, Antoine Lobstein: On the complexity of the identification problem in Hamming spaces. Acta Inf. 38(11/12): 839-845 (2002)
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIrène Charon, Olivier Hudry, Antoine Lobstein: Identifying Codes with Small Radius in Some Infinite Regular Graphs. Electr. J. Comb. 9(1): (2002)
25no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIrène Charon, Olivier Hudry, Antoine Lobstein: Identifying and locating-dominating codes: NP-Completeness results for directed graphs. IEEE Transactions on Information Theory 48(8): 2192-2200 (2002)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIiro S. Honkala, Antoine Lobstein: On Identifying Codes in Binary Hamming Spaces. J. Comb. Theory, Ser. A 99(2): 232-243 (2002)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIiro S. Honkala, Antoine Lobstein: On the Density of Identifying Codes in the Square Lattice. J. Comb. Theory, Ser. B 85(2): 297-306 (2002)
2001
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIrène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein: General Bounds for Identifying Codes in Some Infinite Regular Graphs. Electr. J. Comb. 8(1): (2001)
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor: On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals. IEEE Trans. Computers 50(2): 174-176 (2001)
20no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSergey V. Avgustinovich, Antoine Lobstein, Faina I. Solov'eva: Intersection matrices for partitions by binary perfect codes. IEEE Transactions on Information Theory 47(4): 1621-1624 (2001)
2000
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor: Bounds for Codes Identifying Vertices in the Hexagonal Grid. SIAM J. Discrete Math. 13(4): 492-504 (2000)
1999
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor: New Bounds for Codes Identifying Vertices in Graphs. Electr. J. Comb. 6: (1999)
1998
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGérard D. Cohen, Antoine Lobstein, David Naccache, Gilles Zémor: How to Improve an Exponentiation Black-Box. EUROCRYPT 1998: 211-220
1997
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGérard D. Cohen, Simon Litsyn, Antoine Lobstein, H. F. Mattson Jr.: Covering Radius 1985-1994. Appl. Algebra Eng. Commun. Comput. 8(3): 173-239 (1997)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAntoine Lobstein, Victor Zinoviev: On New Perfect Binary Nonlinear Codes. Appl. Algebra Eng. Commun. Comput. 8(5): 415-420 (1997)
1993
14no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGérard D. Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zémor: Algebraic Coding, First French-Israeli Workshop, Paris, France, July 19-21, 1993, Proceedings Springer 1993
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGregory Kabatianskii, Antoine Lobstein: On Plotkin-Elias Type Bounds for Binary Arithmetic Codes. Algebraic Coding 1993: 263-269
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAntoine Lobstein, Vera Pless: The Length Function: A Revised Table. Algebraic Coding 1993: 51-55
1992
11no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGérard D. Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zémor: Algebraic Coding, First French-Soviet Workshop, Paris, France, July 22-24, 1991, Proceedings Springer 1992
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAntoine Lobstein: On perfect arithmetic codes. Discrete Mathematics 106-107: 333-336 (1992)
1991
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAntoine Lobstein, Patrick Solé: Arithmetic Codes - Survey, Recent and New Results. AAECC 1991: 246-258
1990
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAntoine Lobstein: The hardness of solving subset sum with preprocessing. IEEE Transactions on Information Theory 36(4): 943- (1990)
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAntoine Lobstein, Gerhard J. M. van Wee: Correction to 'On normal and subnormal q-ary codes' (Nov 89 1291-1295). IEEE Transactions on Information Theory 36(6): 1498- (1990)
1989
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAntoine Lobstein, Gerhard J. M. van Wee: On normal and subnormal q-ary codes. IEEE Transactions on Information Theory 35(6): 1291- (1989)
1988
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAntoine Lobstein: Comments on 'A note on perfect arithmetic codes' by J. Astola. IEEE Transactions on Information Theory 34(3): 589- (1988)
1987
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAntoine Lobstein, Gérard D. Cohen: Sur La Complexité D'un Problème De Codage. ITA 21(1): 25-32 (1987)
1986
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAntoine Lobstein: On Modular Weights in Arithmetic Codes. Coding Theory and Applications 1986: 56-67
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane: Further results on the covering radius of codes. IEEE Transactions on Information Theory 32(5): 680-694 (1986)
1984
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane: On a conjecture concerning coverings of Hamming space. AAECC 1984: 79-89

Coauthor Index

1Sergey V. Avgustinovich [20]
2Yael Ben-Haim [37]
3Nathalie Bertrand [30]
4Irène Charon [22] [25] [26] [28] [30] [31] [32] [33] [34] [35] [36] [38]
5Gérard D. Cohen [1] [2] [4] [11] [14] [16] [17] [18] [19] [21] [36] [38]
6Sylvain Gravier [33] [37]
7Iiro S. Honkala [18] [19] [21] [22] [23] [24] [27] [29] [31] [34]
8Olivier Hudry [22] [25] [26] [28] [30] [31] [32] [33] [34] [35] [36] [38]
9Gregory Kabatianskii [13]
10Simon Litsyn [11] [14] [16]
11H. F. Mattson Jr. [16]
12Michel Mollard [33]
13Julien Moncel [33] [37]
14David Naccache [17]
15Vera Pless [12]
16Neil J. A. Sloane (N. J. A. Sloane) [1] [2]
17Patrick Solé [9]
18Faina I. Solov'eva [20]
19Gerhard J. M. van Wee [6] [7]
20Gilles Zémor [11] [14] [17] [18] [19] [21]
21Victor Zinoviev (Victor A. Zinoviev) [15]

Colors in the list of coauthors

Copyright © Wed Nov 11 17:18:37 2009 by Michael Ley (ley@uni-trier.de)