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: Journal=Discrete Appl.~Math. AND YEAR=1991
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Constructive complexity
Karl Abrahamson
,
Michael R. Fellows
,
Michael A. Langston
,
Bernard M.E. Moret
Discrete Applied Mathematics
34
, 1991, pp. 3-16
q
-functional equations and some partition identities
A.K. Agarwal
Discrete Applied Mathematics
34
, 1991, pp. 17-26
On doing Todd-Coxeter coset enumeration in parallel
S. Akl
,
G. Labonté
,
M. Leeder
,
K. Qiu
Discrete Applied Mathematics
34
, 1991, pp. 27-35
The mapmaker's dilemma
Richard Beigel
,
William I. Gasarch
Discrete Applied Mathematics
34
, 1991, pp. 37-48
Computation of the expected number of leaves in a tree having a given automorphism, and related topics
F. Bergeron
,
G. Labelle
,
P. Leroux
Discrete Applied Mathematics
34
, 1991, pp. 49-66
Generalized flags in finite Abelian
p
-groups
Lynne M. Butler
Discrete Applied Mathematics
34
, 1991, pp. 67-81
Threshold functions for local properties of graphs: triangles
L.H. Clark
,
R.C. Entringer
,
L.A. Székely
Discrete Applied Mathematics
34
, 1991, pp. 83-105
Brick tabloids and the connection matrices between bases of symmetric functions
ömer Eg̃eciog̃lu
,
Jeffrey B. Remmel
Discrete Applied Mathematics
34
, 1991, pp. 107-120
Matchings and cycle covers in random digraphs
John Gimbel
,
E.M. Palmer
Discrete Applied Mathematics
34
, 1991, pp. 121-128
Semigroup automaton structure by homomorphism and domain partition
Bruce Greenblatt
,
William R., Jr. Edwards
Discrete Applied Mathematics
34
, 1991, pp. 129-143
Linear and nonlinear inequalities concerning a certain combinatorial sequence which arises from counting the number of chains of a finite distributive lattice
Takayuki Hibi
Discrete Applied Mathematics
34
, 1991, pp. 145-150
On a unique tree representation for
P_4
-extendible graphs
B. Jamison
,
S. Olariu
Discrete Applied Mathematics
34
, 1991, pp. 151-164
An introduction to randomized algorithms
Richard M. Karp
Discrete Applied Mathematics
34
, 1991, pp. 165-201
Improved bounds for harmonic-based bin packing algorithms
Michael B. Richey
Discrete Applied Mathematics
34
, 1991, pp. 203-227
The Riordan group
Louis W. Shapiro
,
Seyoum Getu
,
Wen-Jin Woan
,
Leon C. Woodson
Discrete Applied Mathematics
34
, 1991, pp. 229-239
Some applications of algebra to combinatorics
Richard P. Stanley
Discrete Applied Mathematics
34
, 1991, pp. 241-277
The maximum number of winning 2-sets
Douglas B. West
Discrete Applied Mathematics
34
, 1991, pp. 279-284
A note on the covering radius of optimum codes
M.C. Bhandari
,
M.S. Garg
Discrete Applied Mathematics
33
(1-3), 1991, pp. 3-9
Equations for the projective closure and effective Nullstellensatz
L. Caniglia
,
A. Galligo
,
J. Heintz
Discrete Applied Mathematics
33
(1-3), 1991, pp. 11-23
Equations for the projective closure and effective Nullstellensatz
L. Caniglia
,
A. Galligo
,
J. Heintz
Discrete Applied Mathematics
33
, 1991, pp. 11-23
Efficient
q
-ary immutable codes
Renato M. Capocelli
,
Luisa Gargano
,
Ugo Vaccaro
Discrete Applied Mathematics
33
(1-3), 1991, pp. 25-41
Efficient
q
-ary immutable codes
Renato M. Capocelli
,
Luisa Gargano
,
Ugo Vaccaro
Discrete Applied Mathematics
33
, 1991, pp. 25-41
New approaches to reduced-complexity decoding
John T. Coffey
,
Rodney M. Goodman
,
Patrick G. Farrell
Discrete Applied Mathematics
33
(1-3), 1991, pp. 43-60
New approaches to reduced-complexity decoding
John T. Coffey
,
Rodney M. Goodman
,
Patrick G. Farrell
Discrete Applied Mathematics
33
, 1991, pp. 43-60
Computing the conductor of an integral extension
Pasqualina Conti
,
Carlo Traverso
Discrete Applied Mathematics
33
(1-3), 1991, pp. 61-72
Seiten 1
2
3
4
5
>