Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Cohen, G{\'e}rard"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Connector families of graphs
Gérard Cohen
,
Emanuela Fachini
,
János Körner
Graphs and Combinatorics
30
(6), 2014, pp. 1417-1425
Permutation capacities of families of oriented infinite paths
Graham Brightwell
,
Gérard Cohen
,
Emanuela Fachini
,
Marianne Fairthorne
,
János Körner
,
Gábor Simonyi
,
Ágnes Tóth
SIAM Journal on Discrete Mathematics
24
(2), 2010, pp. 441-456
Links between discriminating and identifying codes in the binary Hamming space
Irène Charon
,
Gérard Cohen
,
Olivier Hudry
,
Antoine Lobstein
Lecture Notes in Computer Science
4851
, 2007, pp. 267-270
Nested codes for constrained memory and for dirty paper
Hans Georg Schaathun
,
Gérard D. Cohen
Lecture Notes in Computer Science
3857
, 2006, pp. 307-316
Generalized hashing and parent-identifying codes
Noga Alon
,
Gérard Cohen
,
Michael Krivelevich
,
Simon Litsyn
Journal of Combinatorial Theory Series A
104
(3), 2003, pp. 207-215
Copyright control and separating systems
Sylvia Encheva
,
Gérard Cohen
Lecture Notes in Computer Science
2643
, 2003, pp. 79-86
A hypergraph approach to the identifying parent property: The case of multiple parents
Alexander Barg
,
Gérard Cohen
,
Sylvia Encheva
,
Gregory Kabatiansky
,
Gilles Zémor
SIAM Journal on Discrete Mathematics
14
(3), 2001, pp. 423-431
Partially identifying codes for copyright protection
Sylvia Encheva
,
Gérard Cohen
Lecture Notes in Computer Science
2227
, 2001, pp. 260-267
Bounds for codes identifying vertices in the hexagonal grid
Gérard D. Cohen
,
Iiro Honkala
,
Antoine Lobstein
,
Gilles Zémor
SIAM Journal on Discrete Mathematics
13
(4), 2000, pp. 492-504
The discovery of simple 7-designs with automorphism group
P \Gamma L(2,32)
Anton Betten
,
Adalbert Kerber
,
Axel Kohnert
,
Reinhard Laue
,
Alfred Wassermann
Lecture Notes in Computer Science
948
, 1995, pp. 131-145
Triangular systems and factorized Gröbner bases
Hans-Gert Gräbe
Lecture Notes in Computer Science
948
, 1995, pp. 248-261
How lower and upper complexity bounds meet in elimination theory
Luis M. Pardo
Lecture Notes in Computer Science
948
, 1995, pp. 33-69
A ``Divide and Conquer'' algorithm for Hilbert-Poincaré series, multiplicity and dimension of monomial ideals
Anna Maria Bigatti
,
Pasqualina Conti
,
Lorenzo Robbiano
,
Carlo Traverso
Lecture Notes in Computer Science
673
, 1993, pp. 76-88
Sequence based methods for data transmission and source compression
A.R. Calderbank
,
P.C. Fishburn
,
A. Rabinovich
Lecture Notes in Computer Science
673
, 1993, pp. 1-12
An efficient algorithm for the sparse mixed resultant
John Canny
,
Ioannis Emiris
Lecture Notes in Computer Science
673
, 1993, pp. 89-104
Some features of binary block codes for correcting asymmetric errors
G. Fang
,
H.C.A. van Tilborg
,
F.W. Sun
,
I.S. Honkala
Lecture Notes in Computer Science
673
, 1993, pp. 105-120
Fixed-parameter complexity and cryptography
Michael R. Fellows
,
Neal Koblitz
Lecture Notes in Computer Science
673
, 1993, pp. 121-131
A class of algebraic geometric codes from curves in high-dimensional projective spaces
G.L. Feng
,
T.R.N. Rao
Lecture Notes in Computer Science
673
, 1993, pp. 132-146
A new class of sequences: Mapping sequences
Guang Gong
Lecture Notes in Computer Science
673
, 1993, pp. 147-161
A zero-test and an interpolation algorithm for the shifted sparse polynomials
Dima Grigoriev
,
Marek Karpinski
Lecture Notes in Computer Science
673
, 1993, pp. 162-169
On the apparent duality of the Kerdock and Preparata codes
A. Roger, Jr. Hammons
,
P. Vijay Kumar
,
A.R. Calderbank
,
N.J.A. Sloane
,
Patrick Solé
Lecture Notes in Computer Science
673
, 1993, pp. 13-24
Parallelization of quantifier elimination on a workstation network
Hoon Hong
Lecture Notes in Computer Science
673
, 1993, pp. 170-179
Hyperplane sections of Fermat varieties in
P^3
in char.\ 2 and some applications to cyclic codes
H. Janwa
,
R.M. Wilson
Lecture Notes in Computer Science
673
, 1993, pp. 180-194
Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems
Erich Kaltofen
Lecture Notes in Computer Science
673
, 1993, pp. 195-212
Relations among Lie formal series and constructions of symplectic integrators
P.-V. Koseleff
Lecture Notes in Computer Science
673
, 1993, pp. 213-230
Seiten 1
2
>