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="Chin, F.Y."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
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
On embedding rectangular grids in hypercubes
M.Y. Chan
,
F.Y.L. Chin
Interconnection Networks for Multiprocessors and Multicomputers: Theory and Practice, 1994, pp. 437-440
Consecutive interval query and dynamic programming on intervals
Alok Aggarwal
,
Takeshi Tokuyama
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 466-475
An improved algorithm for the traveler's problem
Alok Aggarwal
,
Takeshi Tokuyama
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 476-485
Number theory helps line detection in digital images
Tetsuo Asano
,
Naoki Katoh
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 313-322
Graphical degree sequence problems with connectivity requirements
Takao Asano
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 38-47
Multicommodity Flows: A survey of recent research
Baruch Awerbuch
,
Tom Leighton
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 297-302
Optimal linear broadcast routing with capacity limitations
S. Bitan
,
S. Zaks
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 287-296
Relativizing complexity classes with random oracles
Ronald V. Book
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 250-258
Time space tradeoffs. (Getting closer to the barrier?)
Allan Borodin
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 209-220
Finding the shortest watchman route in a simple polygon
Svante Carlsson
,
HÃ¥kan Jonsson
,
Bengt J. Nilsson
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 58-67
Optimal resilient distributed algorithms for ring election
M.Y. Chan
,
F.Y.L. Chin
IEEE Transactions on Parallel and Distributed Systems
4
(4), 1993, pp. 475-480
Weighted independent perfect domination on cocomparability graphs
Gerard J. Chang
,
C. Pandu Rangan
,
Satyan R. Coorg
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 506-514
A framework for constructing heap-like structures in-place
Jingsen Chen
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 118-127
Optimally computing the shortest weakly visible subedge of a simple polygon
Danny Z. Chen
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 323-332
Optimal rectilinear Steiner tree for extremal point sets
Siu-Wing Cheng
,
Andrew Lim
,
Ching-Ting Wu
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 523-532
Scheduling algorithms for a chain-like task system
Chan Chi-Lok
,
Gilbert Young
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 496-505
Page migration algorithms using work functions
Marek Chrobak
,
Lawrence L. Larmore
,
Nick Reingold
,
Jeffery Westbrook
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 406-415
Permutation routing on reconfigurable meshes
J.C. Cogolludo
,
S. Rajasekaran
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 157-166
How to treat delete requests in semi-online problems
Yang Dai
,
Hiroshi Imai
,
Kazuo Iwano
,
Naoki Katoh
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 48-57
Constructing degree-3 spanners with other sparsenenss properties
Gautam Das
,
Paul J. Heffernan
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 11-20
Robot mapping: Foot-prints vs tokens
Xiaotie Deng
,
Andy Mirzaian
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 353-362
The maximum
k
-dependent and
f
-dependent set problem
Anders Dessmark
,
Klaus Jansen
,
Andrzej Lingas
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 88-97
Remembering conflicts in history yields dynamic algorithms
Katrin Dobrindt
,
Mariette Yvinec
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 21-30
Seiten 1
2
3
>