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="Yuan, Hao"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Average-case complexity of the min-sum matrix product problem
Ken Fong
,
Minming Li
,
Hongyu Liang
,
Linji Yang
,
Hao Yuan
Lecture Notes in Computer Science
8889
, 2014, pp. 41-52
A faster CREW PRAM algorithm for computing Cartesian trees
Chung Keung Poon
,
Hao Yuan
Lecture Notes in Computer Science
7878
, 2013, pp. 336-344
Longest increasing subsequences in windows based on canonical antichain partition
Erdong Chen
,
Linji Yang
,
Hao Yuan
Theoretical Computer Science
378
(3), 2007, pp. 223-236
Longest increasing subsequences in windows based on canonical antichain partition
Erdong Chen
,
Hao Yuan
,
Linji Yang
Lecture Notes in Computer Science
3827
, 2005, pp. 1153-1162
Improved algorithms for largest cardinality 2-interval pattern problem
Hao Yuan
,
Linji Yang
,
Erdong Chen
Lecture Notes in Computer Science
3827
, 2005, pp. 412-421