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="Leiss, Ernst L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the role of complementation in implicit language equations and relations
Adrian Ionescu
,
Ernst L. Leiss
Journal of Computer and System Sciences
80
(2), 2014, pp. 457-467
The worst Hanoi graphs
Ernst L. Leiss
Theoretical Computer Science
498
, 2013, pp. 100-106
Data dependent loop scheduling based on genetic algorithms for distributed and shared memory systems
Jose L. Aguilar
,
Ernst L. Leiss
Journal Parallel Distributed Computing
64
(5), 2004, pp. 578-590
Solving systems of explicit language relations
Ernst L. Leiss
Theoretical Computer Science
186
(1-2), 1997, pp. 83-105
Implicit language equations: Existence and uniqueness of solutions
Ernst L. Leiss
Theoretical Computer Science
145
(1-2), 1995, pp. 71-93
A heuristic scheduling of independent tasks with bottleneck resource constraints
Qingzhou Wang
,
Ernst L. Leiss
SIAM Journal on Computing
24
(2), 1995, pp. 235-241
Language equations over a one-letter alphabet with union, concatenation and star: A complete solution
Ernst L. Leiss
Theoretical Computer Science
131
(2), 1994, pp. 311-330
Embedding complete binary trees into hypercubes
Ernst L. Leiss
,
Hari N. Reddy
Information Processing Letters
38
, 1991, pp. 197-199
On the degree of dominator trees
Ernst L. Leiss
Information Processing Letters
29
, 1988, pp. 199-200
On solving star equations
Ernst L. Leiss
Theoretical Computer Science
39
(2-3), 1985, pp. 327-332