☰

Mordecai J. Golin - Publications

Affiliations: 
Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong 
Area:
Computer Science, Mathematics
Tree Info Similar researchers PubMed Report error

43 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2019 Chen Z, Golin MJ, Yong X. The transfer matrices and the capacity of the 2-dimensional (1,∞)-runlength limited constraint Discrete Mathematics. 342: 975-987. DOI: 10.1016/J.Disc.2018.11.014  0.558
2019 Arumugam GP, Augustine JE, Golin MJ, Srikanthan P. Minmax Regret k -Sink Location on a Dynamic Path Network with Uniform Capacities Algorithmica. 81: 3534-3585. DOI: 10.1007/S00453-019-00589-2  0.375
2016 Golin M, Iacono J, Krizanc D, Raman R, Satti SR, Shende S. Encoding 2D range maximum queries Theoretical Computer Science. 609: 316-327. DOI: 10.1016/J.Tcs.2015.10.012  0.326
2016 Wang C, Yong X, Golin M. The channel capacity of read/write isolated memory Discrete Applied Mathematics. 198: 264-273. DOI: 10.1016/J.Dam.2015.05.027  0.518
2015 Higashikawa Y, Golin MJ, Katoh N. Multiple sink location problems in dynamic path networks Theoretical Computer Science. 607: 2-15. DOI: 10.1016/J.Tcs.2015.05.053  0.4
2015 Higashikawa Y, Augustine J, Cheng SW, Golin MJ, Katoh N, Ni G, Su B, Xu Y. Minimax regret 1-sink location problem in dynamic path networks Theoretical Computer Science. 588: 24-36. DOI: 10.1016/J.Tcs.2014.02.010  0.388
2014 Higashikawa Y, Golin MJ, Katoh N. Minimax regret sink location problem in dynamic tree networks with uniform capacity Journal of Graph Algorithms and Applications. 18: 539-555. DOI: 10.7155/Jgaa.00336  0.44
2012 Golin MJ, Mathieu C, Young NE. Huffman coding with letter costs: A linear-time approximation scheme Siam Journal On Computing. 41: 684-713. DOI: 10.1137/100794092  0.356
2010 Golin M, Zhang Y. A Dynamic Programming Approach to Length-Limited Huffman Coding: Space Reduction With the Monge Property Ieee Transactions On Information Theory. 56: 3918-3929. DOI: 10.1109/Tit.2010.2050947  0.368
2009 Bein W, Golin MJ, Larmore LL, Zhang Y. The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity Acm Transactions On Algorithms. 6. DOI: 10.1145/1644015.1644032  0.314
2008 Golin M, Li J. More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding Ieee Transactions On Information Theory. 54: 3412-3424. DOI: 10.1109/Tit.2008.926326  0.301
2008 Yong X, Zhang Y, Golin MJ. The number of spanning trees in a class of double fixed-step loop networks Networks. 52: 69-77. DOI: 10.1002/Net.V52:2  0.626
2007 Golin MJ, Yong X, Zhang Y. The asymptotic number of spanning trees in circulant graphs Proceedings of the 9th Workshop On Algorithm Engineering and Experiments and the 4th Workshop On Analytic Algorithms and Combinatorics. 242-249. DOI: 10.1016/J.Disc.2009.09.008  0.678
2007 Bar-Noy A, Golin MJ, Zhang Y. Online dynamic programming speedups Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4368: 43-54. DOI: 10.1007/S00224-009-9166-X  0.396
2007 Golin MJ, Zhang Y. The two-median problem on Manhattan meshes Networks. 49: 226-233. DOI: 10.1002/Net.V49:3  0.375
2006 Bein WW, Golin MJ, Larmore LL, Zhang Y. The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 31-40. DOI: 10.1145/1644015.1644032  0.415
2006 Golin MJ, Leung YC, Wang Y. Permanents of circulants: A transfer matrix approach Proceedings of the 8th Workshop On Algorithm Engineering and Experiments and the 3rd Workshop On Analytic Algorithms and Combinatorics. 2006: 263-272.  0.658
2005 Zhang Y, Yong X, Golin MJ. Chebyshev polynomials and spanning tree formulas for circulant and related graphs Discrete Mathematics. 298: 334-364. DOI: 10.1016/J.Disc.2004.10.025  0.681
2005 Golin MJ, Leung YC, Wang Y, Yong X. Counting structures in grid graphs, cylinders and tori using transfer matrices: Survey and new results Proceedings of the Seventh Workshop On Algorithm Engineering and Experiments and the Second Workshop On Analytic Algorithms and Combinatorics. 250-258.  0.71
2004 Ahn HK, Cheng SW, Cheong O, Golin M, Van Oostrum R. Competitive facility location: The Voronoi game Theoretical Computer Science. 310: 457-467. DOI: 10.1016/J.Tcs.2003.09.004  0.329
2004 Golin MJ, Yong X, Zhang Y, Sheng L. New upper and lower bounds on the channel capacity of read/write isolated memory Discrete Applied Mathematics. 140: 35-48. DOI: 10.1016/J.Dam.2003.02.001  0.53
2004 Fleischer R, Golin MJ, Yan Z. Online maintenance of k-medians and k-covers on a line Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3111: 102-113. DOI: 10.1007/S00453-005-1195-5  0.343
2004 Golin MJ, Leung YC, Wang Y. Counting spanning trees and other structures in non-constant-jump circulant graphs (extended abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3341: 508-521.  0.691
2004 Golin MJ, Leung YC. Unhooking circulant graphs: A combinatorial method for counting spanning trees and other parameters Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3353: 296-307.  0.682
2003 Ding C, Golin M, Kløve T. Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets Designs, Codes and Cryptography. 30: 73-84. DOI: 10.1023/A:1024759310058  0.313
2003 Golin MJ, Na HS. On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes Computational Geometry: Theory and Applications. 25: 197-231. DOI: 10.1016/S0925-7721(02)00123-2  0.384
2002 Bradford P, Golin MJ, Larmore LL, Rytter W. Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property Journal of Algorithms. 42: 277-303. DOI: 10.1006/Jagm.2002.1213  0.335
2002 Yong X, Golin MJ. Algebraic and combinatorial properties of the transfer matrix of the 2-dimensional (1, ∞) Runlength Limited constraint Ieee International Symposium On Information Theory - Proceedings. 354.  0.459
2001 Golin MJ. A combinatorial approach to Golomb forests Theoretical Computer Science. 263: 283-304. DOI: 10.1016/S0304-3975(00)00250-4  0.304
2001 Choi V, Golin MJ. Lopsided trees, I: Analyses Algorithmica (New York). 31: 240-290. DOI: 10.1007/S00453-001-0063-1  0.434
2000 Vigneron A, Gao L, Golin MJ, Italiano GF, Li B. An algorithm for finding a k-median in a directed tree Information Processing Letters. 74: 81-88. DOI: 10.1016/S0020-0190(00)00026-0  0.377
2000 Zhang Y, Yong X, Golin MJ. The number of spanning trees in circulant graphs Discrete Mathematics. 223: 337-350. DOI: 10.1016/S0012-365X(99)00414-8  0.665
1999 Golin M, Schuster A. Optimal point-to-point broadcast algorithms via lopsided trees Discrete Applied Mathematics. 93: 233-263. DOI: 10.1016/S0166-218X(99)00107-9  0.315
1998 Devillers O, Golin MJ. Dog bites postman: Point location in the moving voronoi diagram and related problems International Journal of Computational Geometry and Applications. 8: 321-342. DOI: 10.1142/S0218195998000163  0.4
1998 Golin M, Raman R, Schwarz C, Smid M. Randomized Data Structures for the Dynamic Closest-Pair Problem Siam Journal On Computing. 27: 1036-1072. DOI: 10.1137/S0097539794277718  0.416
1998 Golin MJ, Rote G. A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs Ieee Transactions On Information Theory. 44: 1770-1781. DOI: 10.1109/18.705558  0.356
1998 Golin M, Zaks S. Labelled trees and pairs of input-output permutations in priority queues Theoretical Computer Science. 205: 99-114. DOI: 10.1016/S0304-3975(97)00037-6  0.435
1996 Golin MJ, Young N. Prefix codes: Equiprobable words, unequal letter costs Siam Journal On Computing. 25: 1281-1292. DOI: 10.1137/S0097539794268388  0.374
1996 Devillers O, Golin M, Kedem K, Schirra S. Queries on Voronoi diagrams of moving points Computational Geometry: Theory and Applications. 6: 315-327. DOI: 10.1016/0925-7721(95)00053-4  0.34
1995 Devillers O, Golin MJ. Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas Information Processing Letters. 56: 157-164. DOI: 10.1016/0020-0190(95)00132-V  0.396
1994 Golin MJ. A provably fast linear-expected-time maxima-finding algorithm Algorithmica. 11: 501-524. DOI: 10.1007/Bf01189991  0.366
1994 Flajolet P, Golin M. Mellin transforms and asymptotics Acta Informatica. 31: 673-696. DOI: 10.1007/Bf01177551  0.324
1993 Golin MJ. How many maxima can there be? Computational Geometry: Theory and Applications. 2: 335-353. DOI: 10.1016/0925-7721(93)90014-W  0.397
Show low-probability matches.