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
[1]
Hilfe
Suche: Author="Perl, Y."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The periodic balanced sorting network
M. Dowd
,
Y. Perl
,
L. Rudolph
,
M. Saks
Journal of the ACM
36
(4), 1989, October, pp. 738-757
A linear recognition algorithm for cographs
D.G. Corneil
,
Y. Perl
,
L.K. Stewart
SIAM Journal on Computing
14
(4), 1985, November, pp. 926-934
Clustering and domination in perfect graphs
D.G. Corneil
,
Y. Perl
Discrete Applied Mathematics
9
, 1984, pp. 27-39
Optimum split trees
Y. Perl
Journal of Algorithms
5
(3), 1984, pp. 367-374
A shifting algorithm for min-max tree partitioning
R.L. Becker
,
Y. Perl
,
S.R. Schach
Journal of the ACM
29
(1), 1982, pp. 58-67
On the complexity of edge labelings for trees
Y. Perl
,
S. Zaks
Theoretical Computer Science
19
, 1982, pp. 1-16
The complexity of identifying redundant and essential elements
S. Moran
,
Y. Perl
Journal of Algorithms
2
(1), 1981, March, pp. 22-30
Max-min tree partitioning
Y. Perl
,
S.R. Schach
Journal of the ACM
28
(1), 1981, pp. 5-15
A shifting algorithm for min-max tree partitioning
R.I. Becker
,
Y. Perl
,
S.R. Schach
Lecture Notes in Computer Science
85
, 1980, pp. 64-75
Finding two disjoint paths between two pairs of vertices in a graph
Y. Perl
,
Y. Shiloach
Journal of the ACM
25
, 1978, pp. 1-9
Efficient generation of optimal prefix code: Equiprobable words using unequal cost letters
Y. Perl
,
M.R. Garey
,
S. Even
Journal of the ACM
22
, 1975, pp. 202-214