Mordecai Golin
Mordecai Golin
Professor: Department of Computer Science & Engineering, HKUST
Bestätigte E-Mail-Adresse bei - Startseite
Zitiert von
Zitiert von
On the optimal placement of web proxies in the internet
B Li, MJ Golin, GF Italiano, X Deng, K Sohraby
IEEE INFOCOM'99. Conference on Computer Communications. Proceedings …, 1999
Competitive facility location: the Voronoi game
HK Ahn, SW Cheng, O Cheong, M Golin, R Van Oostrum
Theoretical Computer Science 310 (1-3), 457-467, 2004
A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
MJ Golin, G Rote
IEEE Transactions on Information Theory 44 (5), 1770-1781, 1998
The number of spanning trees in circulant graphs
Y Zhang, X Yong, MJ Golin
Discrete Mathematics 223 (1-3), 337-350, 2000
Chebyshev polynomials and spanning tree formulas for circulant and related graphs
Y Zhang, X Yong, MJ Golin
Discrete Mathematics 298 (1-3), 334-364, 2005
Mellin transforms and asymptotics: the mergesort recurrence
P Flajolet, M Golin
Acta Informatica 31, 673-696, 1994
Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets
C Ding, M Golin, T Kløve
Designs, Codes and Cryptography 30, 73-84, 2003
Curve reconstruction from noisy samples
SW Cheng, S Funke, M Golin, P Kumar, SH Poon, E Ramos
Proceedings of the nineteenth annual symposium on Computational geometry …, 2003
On the average complexity of 3d-Voronoi diagrams of random points on convex polytopes
MJ Golin, HS Na
Computational Geometry 25 (3), 197-231, 2003
Huffman coding with unequal letter costs
MJ Golin, C Kenyon, NE Young
Proceedings of the thiry-fourth annual ACM symposium on theory of computing …, 2002
On the optimal placement of web proxies in the internet: The linear topology
B Li, X Deng, MJ Golin, K Sohraby
High Performance Networking: IFIP TC-6 Eighth International Conference on …, 1998
An algorithm for finding a k-median in a directed tree
A Vigneron, L Gao, MJ Golin, GF Italiano, B Li
Information Processing Letters 74 (1-2), 81-88, 2000
Simple randomized algorithms for closest pair problems
MJ Golin, R Raman, C Schwarz, M Smid
Max-Planck-Institut für Informatik, 1992
Competitive facility location along a highway
HK Ahn, SW Cheng, O Cheong, M Golin, R Van Oostrum
Computing and Combinatorics: 7th Annual International Conference, COCOON …, 2001
Expected case analysis of-skeletons with applications to the construction of minimum weight triangulations
SW Cheng, MJ Golin, JCF Tsang
Proc. 7th Canad. Conf. Comput. Geom, 1995
Randomized data structures for the dynamic closest-pair problem
M Golin, R Raman, C Schwarz, M Smid
SIAM journal on computing 27 (4), 1036-1072, 1998
Minimax regret sink location problem in dynamic tree networks with uniform capacity
Y Higashikawa, MJ Golin, N Katoh
Algorithms and Computation: 8th International Workshop, WALCOM 2014, Chennai …, 2014
Maximum residual energy routing with reverse energy cost
Q Xie, CT Lea, MJ Golin, R Fleischer
GLOBECOM'03. IEEE Global Telecommunications Conference (IEEE Cat. No …, 2003
Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property
P Bradford, MJ Golin, LL Larmore, W Rytter
Journal of Algorithms 42 (2), 277-303, 2002
Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas
O Devillers, MJ Golin
Information Processing Letters 56 (3), 157-164, 1995
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20