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="Dai, H.K."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On
p
-norm based locality measures of space-filling curves
H.K. Dai
,
H.C. Su
Lecture Notes in Computer Science
3341
, 2004, pp. 364-376
On the locality properties of space-filling curves
H.K. Dai
,
H.C. Su
Lecture Notes in Computer Science
2906
, 2003, pp. 385-394
Optimizing a computational method for length lower bounds for reflecting sequences
H.K. Dai
Lecture Notes in Computer Science
2108
, 2001, pp. 228-236
The complexity of deciding strictly non-blocking concentration and generalized-concentration properties
H.K. Dai
International Journal of Foundations of Computer Science
8
, 1997, pp. 237-252
Improved length lower bounds for reflecting sequences
H.K. Dai
,
K E. Flannery
Lecture Notes in Computer Science
1090
, 1996, pp. 56-67
The size complexity of strictly non-blocking fixed ratio concentrators with constant depth
H.K. Dai
Lecture Notes in Computer Science
1123
, 1996, pp. 234-242
An improvement in the size-depth tradeoff for strictly non-blocking generalized-concentration networks
H.K. Dai
Proceedings of the 6th International PARLE Conference. PARLE '94 - Parallel Architectures and Languages Europe (Athens, Greece, July 4-8, 1994)
LNCS 817
, 1994, pp. 214-225
On synchronous strictly non-blocking concentrators and generalized-concentrators
H.K. Dai
Proceedings of the 7th International Parallel Processing Symposium, IPPS'93 (Newport Beach, California, April 13-16, 1993)
, 1993, pp. 406-412