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: Series=LNCS AND YEAR=1986
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An improved upper bound on covering radius
H.F., Jr. Mattson
Lecture Notes in Computer Science
228
, 1986, pp. 90-106
Association schemes and difference sets defined on two weight codes
Llorenç Huguet
,
Mercè Griera
Lecture Notes in Computer Science
228
, 1986, pp. 107-111
Automorphisms of two families of extended non binary cyclic Goppa codes
J.A. Thiong-Ly
Lecture Notes in Computer Science
228
, 1986, pp. 112-121
Some quasi-perfect cyclic codes
J.L. Dornstetter
Lecture Notes in Computer Science
228
, 1986, pp. 122-129
Explicit Kerdock codes over
GF(2)
D.A. Leonard
,
C.A. Rödger
Lecture Notes in Computer Science
228
, 1986, pp. 130-135
Une classe de codes 2-correcteurs adaptés aux systèmes d'information formatés
Courteau Bernard
,
Goulet Jean
Lecture Notes in Computer Science
228
, 1986, pp. 136-144
Lousticc simulation software : Experimental results of coding systems
M.C. Gennero
Lecture Notes in Computer Science
228
, 1986, pp. 145-153
An algorithm of complete decoding of double-error-correcting Goppa codes
G.L. Feng
,
K.K. Tzeng
Lecture Notes in Computer Science
228
, 1986, pp. 154-160
On the number of divisors of a polynomial over
GF(2)
Ph. Piret
Lecture Notes in Computer Science
228
, 1986, pp. 161-168
Multivariate polynomial factoring and detection of true factors
Denis Lugiez
Lecture Notes in Computer Science
228
, 1986, pp. 169-177
Discriminants and the irreducibility of a class of polynomials
Oscar Moreno de Ayala
Lecture Notes in Computer Science
228
, 1986, pp. 178-181
Computational aspects of reduction strategies to construct resolutions of monomial ideals
H. Michael Möller
,
Ferdinando Mora
Lecture Notes in Computer Science
228
, 1986, pp. 182-197
Designs arising from symplectic geometry
Lucien Bénéteau
,
Jacqueline Lacaze
Lecture Notes in Computer Science
228
, 1986, pp. 198-205
Distance-transitive graphs and the problem of maximal subgroups of symmetric groups
A. Astie-Vidal
,
J. Chifflet
Lecture Notes in Computer Science
228
, 1986, pp. 206-214
Can a fast signature scheme without secret key be secure?
Paul Camion
Lecture Notes in Computer Science
228
, 1986, pp. 215-241
Manipulation of recurrence relations in computer algebra
Jacques Calmet
Lecture Notes in Computer Science
228
, 1986, pp. 242-252
Some design principles for a mathematical knowledge representation system: A new approach to scientific calculation
Jacques Calmet
,
Marc Bergman
Lecture Notes in Computer Science
228
, 1986, pp. 253-265
Digital filtering in VLSI
G. Bilardi
,
F.P. Preparata
Lecture Notes in Computer Science
227
, 1986, pp. 1-11
Two processor scheduling is in
NC
D. Helmbold
,
E.W. Mayr
Lecture Notes in Computer Science
227
, 1986, pp. 12-25
Breaking symmetry in synchronous networks
G.N. Frederickson
,
N. Santoro
Lecture Notes in Computer Science
227
, 1986, pp. 26-33
Parallel ear decomposition search (EDS) and st-numbering
Y. Maon
,
B. Schieber
,
U. Vishkin
Lecture Notes in Computer Science
227
, 1986, pp. 34-45
A unifying framework for systolic designs
Concettina Guerra
Lecture Notes in Computer Science
227
, 1986, pp. 46-56
Optimal tradeoffs for addition on systolic arrays
A. Aggarwal
,
J.L. Carter
,
S.R. Kosaraju
Lecture Notes in Computer Science
227
, 1986, pp. 57-69
On the connection between hexagonal and unidirectional rectangular systolic arrays
G. Rote
Lecture Notes in Computer Science
227
, 1986, pp. 70-83
Lower bounds for sorting on mesh-connected architectures
M. Kunde
Lecture Notes in Computer Science
227
, 1986, pp. 84-95
Seiten
<
1
2
3
4
5
6
7
>