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="Ting, H.F."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Online pricing for multi-type of items
H.F. Ting
,
Xiangzhong Xiang
Theoretical Computer Science
572
, 2015, pp. 66-82
Equilibria of GSP for range auction
H.F. Ting
,
Xiangzhong Xiang
Lecture Notes in Computer Science
7434
, 2012, pp. 580-591
Multi-unit auctions with budgets and non-uniform valuations
H.F. Ting
,
Xiangzhong Xiang
Lecture Notes in Computer Science
7676
, 2012, pp. 669-678
A constant-competitive algorithm for online OVSF code assignment
F.Y.L. Chin
,
H.F. Ting
,
Y. Zhang
Algorithmica
56
(1), 2010, pp. 89-104
Finding frequent items over sliding windows with constant update time
Regant Y.S. Hung
,
Lap-Kei Lee
,
H.F. Ting
Information Processing Letters
110
(7), 2010, pp. 257-260
A near-optimal broadcasting protocol for mobile video-on-demand
Regant Y.S. Hung
,
H.F. Ting
International Journal of Foundations of Computer Science
20
(1), 2009, pp. 45-55
From constrained to unconstrained maximum agreement subtree in linear time
V. Berry
,
Z.S. Peng
,
H.F. Ting
Algorithmica
50
(3), 2008, pp. 369-385
Competitive analysis of most-request-first for scheduling broadcasts with start-up delay
Regant Y.S. Hung
,
H.F. Ting
Theoretical Computer Science
396
(1-3), 2008, pp. 200-211
A constant-competitive algorithm for online OVSF code assignment
F.Y.L. Chin
,
H.F. Ting
,
Y. Zhang
Lecture Notes in Computer Science
4835
, 2007, pp. 452-463
A tight analysis of most-requested-first for on-demand data broadcast
Regant Y.S. Hung
,
H.F. Ting
Lecture Notes in Computer Science
4112
, 2006, pp. 330-339
An efficient algorithm for online square detection
H.F. Leung
,
Z.S. Peng
,
H.F. Ting
Theoretical Computer Science
363
(1), 2006, pp. 69-75
An
O(n \log n)
-time algorithm for the maximum constrained agreement subtree problem for binary trees
Z.S. Peng
,
H.F. Ting
Information Processing Letters
100
(4), 2006, pp. 137-144
An efficient reduction from constrained to unconstrained maximum agreement subtree
Z.S. Peng
,
H.F. Ting
LNCS/LNBI
3692
, 2005, pp. 104-115
An efficient algorithm for optimizing whole genome alignment with noise
Prudence W.H. Wong
,
T.W. Lam
,
N. Lu
,
H.F. Ting
,
S.M. Yiu
Bioinformatics
20
(16), 2004, pp. 2676-2684
Efficient algorithms for optimizing whole genome alignment with noise
T.W. Lam
,
N. Lu
,
H.F. Ting
,
Prudence W.H. Wong
,
S.M. Yiu
Lecture Notes in Computer Science
2906
, 2003, pp. 364-374
The greedier the better: An efficient algorithm for approximating maximum independent set
H.Y. Lau
,
H.F. Ting
Lecture Notes in Computer Science
1627
, 1999, pp. 483-492
Computing the unrooted maximum agreement subtree in sub-quadratic time
T.W. Lam
,
W.K. Sung
,
H.F. Ting
Lecture Notes in Computer Science
1097
, 1996, pp. 124-135
Improving the time complexity of message-optimal distributed algorithms for minimum-weight spanning trees
F. Chin
,
H.F. Ting
SIAM Journal on Computing
19
, 1990, pp. 612-626
An improved algorithm for finding the median distributively
Francis Chin
,
H.F. Ting
Algorithmica
2
, 1987, pp. 235-249
An almost linear time and
O(n\log n + e)
messages distributed algorithm for minimum-weight spanning trees
F. Chin
,
H.F. Ting
Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, FOCS'85 (Portland, OR, October 21-23, 1985)
, 1985, pp. 257-266