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=1982
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Compositional complexity of Boolean functions
Harold Abelson
,
Andrzej Ehrenfeucht
,
James Fickett
,
Jan Mycielski
Discrete Applied Mathematics
4
, 1982, pp. 1-10
Basic formulas and languages, part II. Applications to E0L systems and forms
A. Ehrenfeucht
,
G. Rozenberg
,
R. Verraedt
Discrete Applied Mathematics
4
, 1982, pp. 11-22
A new algorithm to find the shortest paths between all pairs of nodes
G. Gallo
,
S. Pallottino
Discrete Applied Mathematics
4
, 1982, pp. 23-35
Les dérivées partielles des fonctions pseudo-booléennes géneralisées
Coriolan Ghilezan
Discrete Applied Mathematics
4
, 1982, pp. 37-45
Signed graphs
Thomas Zaslavsky
Discrete Applied Mathematics
4
, 1982, pp. 47-74
On the complexity of finding the convex hull of a set of points
David Avis
Discrete Applied Mathematics
4
, 1982, pp. 81-86
Segmental solutions of Boolean equations
Frank Markham Brown
Discrete Applied Mathematics
4
, 1982, pp. 87-96
Group testing with two defectives
G.J. Chang
,
F.K. Hwang
,
S. Lin
Discrete Applied Mathematics
4
, 1982, pp. 97-102
Colouring Steiner quadruple systems
Charles J. Colbourn
,
Marlene J. Colbourn
,
Kevin T. Phelps
,
Vojtȇch Rödl
Discrete Applied Mathematics
4
, 1982, pp. 103-111
An analysis of the greedy algorithm for partially ordered sets
Cornelius Croitoru
Discrete Applied Mathematics
4
, 1982, pp. 113-117
Monotonicity paradoxes in the theory of elections
Peter C. Fishburn
Discrete Applied Mathematics
4
, 1982, pp. 119-134
A finitely convergent procedure for facial disjunctive programs
Hanif D. Sherali
,
C.M. Shetty
Discrete Applied Mathematics
4
, 1982, pp. 135-148
A homomorphic characterization of regular languages
Karel Culik II
,
Faith E. Fich
,
Arto Salomaa
Discrete Applied Mathematics
4
, 1982, pp. 149-152
On equivalent sets of functions
Jaak Henno
Discrete Applied Mathematics
4
, 1982, pp. 153-156
Grammars with valuations - A discrete model for self-organization of biopolymers
Jürgen Dassow
Discrete Applied Mathematics
4
, 1982, pp. 161-174
Maximizing a lower bound on the computational complexity
Georg Gati
Discrete Applied Mathematics
4
, 1982, pp. 175-180
Characterization and algorithms of curve map graphs
Fȃnicȃ Gavril
,
Johanan Schönheim
Discrete Applied Mathematics
4
, 1982, pp. 181-191
An algorithm for a merge recognition problem
Anthony Mansfield
Discrete Applied Mathematics
4
, 1982, pp. 193-197
Cycle structure in discrete-density models
Thomas D. Rogers
,
J.R. Pounder
Discrete Applied Mathematics
4
, 1982, pp. 199-210
A note on minimal triangulations of an
n
-cube
John F. Sallee
Discrete Applied Mathematics
4
, 1982, pp. 211-215
Minimizing irregularities in sports schedules using graph theory
D. de Werra
Discrete Applied Mathematics
4
, 1982, pp. 217-226
A note on perfect Lee-codes over small alphabets
Jaakko Astola
Discrete Applied Mathematics
4
, 1982, pp. 227-228
Unique representation in number systems and L codes
Juha Honkala
Discrete Applied Mathematics
4
, 1982, pp. 229-232
A result concerning the trios generated by commutative SLIP-languages
Juha Kortelainen
Discrete Applied Mathematics
4
, 1982, pp. 233-236
A note on the similarity depth
G. Rozenberg
,
R. Verraedt
Discrete Applied Mathematics
4
, 1982, pp. 237-241
Seiten 1
2
>