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="Lam, Tak Wah"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Concurrent threads and optimal parallel minimum spanning trees algorithm
Ka Wong Chong
,
Yijie Han
,
Tak Wah Lam
Journal of the ACM
48
(2), 2001, pp. 297-323
Selecting the
k
largest elements with parity tests
Tak Wah Lam
,
Hing Fung Ting
Discrete Applied Mathematics
101
(1-3), 2000, pp. 187-196
Improving parallel computation with fast integer sorting
Ka Wong Chong
,
Yijie Han
,
Yoshihide Igarashi
,
Tak Wah Lam
Lecture Notes in Computer Science
1627
, 1999, pp. 452-461
On the parallel time complexity of undirected connectivity and minimum spanning trees
Ka Wong Chong
,
Yijie Han
,
Tak Wah Lam
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 225-234
Trade-offs between speed and processor in hard-deadline scheduling
Tak Wah Lam
,
Kar Keung To
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 623-632
Approximating biconnectivity in parallel
Wong Chong Ka
,
Tak Wah Lam
Algorithmica
21
(4), 1998, pp. 395-410
An improved scheme for set equality testing and updating
Tak Wah Lam
,
Ka Hing Lee
Theoretical Computer Science
201
(1-2), 1998, pp. 85-97
Selecting the
k
largest elements with parity tests
Tak Wah Lam
,
Hing Fung Ting
Lecture Notes in Computer Science
1533
, 1998, pp. 189-198
Edge ranking of graphs is hard
Tak Wah Lam
,
Fung Ling Yue
Discrete Applied Mathematics
85
(1), 1998, pp. 71-86
Optimal edge ranking of trees in linear time
Tak Wah Lam
,
Fung Ling Yue
Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'98 (San Francisco, California, January 25-27, 1998)
, 1998, pp. 436-445
All-cavity maximum matchings
Ming-Yang Kao
,
Tak Wah Lam
,
Wing Kin Sung
,
Hing Fung Ting
Lecture Notes in Computer Science
1350
, 1997, pp. 364-373
Two-dimensional dynamic dictionary matching
Ying Choi
,
Tak Wah Lam
Lecture Notes in Computer Science
1178
, 1996, pp. 85-94
Towards more precise parallel biconnectivity approximation
Ka Wong Chong
,
Tak Wah Lam
Lecture Notes in Computer Science
1178
, 1996, pp. 223-232
Improving biconnectivity approximation via local optimization
Ka Wong Chong
,
Tak Wah Lam
Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996)
, 1996, pp. 26-35
Finding connected components in
O(\log n\log\log n)
time on the EREW PRAM
Ka Wong Chong
,
Tak Wah Lam
Journal of Algorithms
18
(3), 1995, pp. 378-402
Approximating biconnectivity in parallel
Ka Wong Chong
,
Tak Wah Lam
Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'95 (Santa Barbara, California, July 17-19, 1995)
, 1995, pp. 224-233
On set equality-testing
Tak Wah Lam
,
Ka Hing Lee
Lecture Notes in Computer Science
778
, 1994, pp. 179-191
Finding connected components in
O(\log n \log\log n)
time on the EREW PRAM
Ka Wong Chong
,
Tak Wah Lam
Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93 (Austin, Texas, January 25-27, 1993)
, 1993, pp. 11-20
Finding least-weight subsequences with fewer processors
Tak Wah Lam
,
Kwong-fai Chan
Algorithmica
9
, 1993, pp. 615-628
The implicit dictionary problem revisited
Tak Wah Lam
,
Ka Hing Lee
Lecture Notes in Computer Science
650
, 1992, pp. 479-488
Results on communication complexity classes
Tak Wah Lam
,
Walter L. Ruzzo
Journal of Computer and System Sciences
44
, 1992, pp. 324-342
An on-line algorithm for navigating in unknown terrain
Kwong-fai Chan
,
Tak Wah Lam
Lecture Notes in Computer Science
557
, 1991, pp. 127-136