Faculty Profiles - GOLIN Mordecai Jay | The Hong Kong University of Science and Technology

Mordecai Jay GOLIN
高可齡

PhD in Computer Science
Princeton University, 1990

Professor
Department of Computer Science and Engineering

(852) 2358 6993
golin@ust.hk
Room 3559
Personal Web

ORCID

0000-0002-1260-6574

Scopus ID

7005521910

Research Interest Publications Projects Teaching Assignment RPG Supervision Space used

Research Interest

Computational geometry and topology
Algorithms
Information theory
Combinatorics

Publications

All Years 123 2023 0 2022 5 2021 4 2020 0 2019 4 2018 1 2017 109

2022 5

A Simple Algorithm for Optimal Search Trees with Two-way Comparisons

ACM Transactions on Algorithms, v. 18, (1), January 2022, article number 2, p. 1-11
Chrobak, Marek; Golin, Mordecai Jay; Munro, J. Ian; Young, Neal E.
Article

Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows

Algorithmica, December 2022
Chen, Di; Golin, Mordecai Jay
Article

Minmax regret for sink location on dynamic flow paths with general capacities

Discrete Applied Mathematics, v. 315, July 2022, p. 1-26
Golin, Mordecai J.; Sandeep, Sai
Article

On Huang and Wong’s algorithm for generalized binary split trees

Acta Informatica, 14 February 2022
Chrobak, Marek; Golin, Mordecai Jay; Munro, J. Ian; Young, Neal E.
Article

Speeding Up AIFV-m Dynamic Programs by m-1 Orders of Magnitude

IEEE International Symposium on Information Theory - Proceedings, v. 2022-June, 2022, article number 9834477, p. 246-251
Golin, Mordecai Jay; Patupat, Albert John Lalim
Conference paper

2021 4

On the cost of unsuccessful searches in search trees with two-way comparisons

Information and Computation, v. 281, 10 March 2021, article number 104707
Chrobak, Marek; Golin, Mordecai Jay; Munro, J. Ian; Young, Neal E.
Article

Scheduling on a graph with release times

Journal of Scheduling, 19 March 2021
Yu, Wei; Golin, Mordecai Jay; Zhang, Guochuan
Article

Scheduling with gaps: new models and algorithms

Journal of Scheduling, 21 July 2021
Chrobak, Marek; Golin, Mordecai Jay; Lam, Tak-Wah; Nogneng, Doroian
Article

Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries

Theoretical Computer Science, v. 865, April 2021, p. 99-118
Golin, Mordecai Jay; Harb, Elfarouk Yasser Farouk M. A.
Article

2019 4

Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform Capacities

Algorithmica, v. 81, (9), September 2019, p. 3534-3585
Arumugam, Guru Prakash; Augustine, John E.; Golin, Mordecai Jay; Srikanthan, Prashanth
Article

The Transfer Matrices and The Capacity of the 2-dimensional (1,∞)-runlength Limited Constraint

Discrete Mathematics, v. 342, (4), April 2019, p. 975-987
Chen, Zhibing; Golin, Mordecai Jay; Yong, Xuerong
Article

Polynomial Time Algorithms for Constructing Optimal AIFV Codes

Data Compression Conference Proceedings, v. 2019-March, May 2019, article number 8712620, p. 231-240
Harb, Elfarouk Yasser Farouk M. A.; Golin, Mordecai Jay
Conference paper

The expected number of maximal points of the convolution of two 2-D distributions

Leibniz International Proceedings in Informatics, LIPIcs, v.145, September 2019, article number 35
Díaz, Jesús Ildelfonso; Golin, Mordecai Jay
Conference paper

2018 1

Dynamic Trees with Almost-Optimal Access Cost

Leibniz International Proceedings in Informatics, LIPIcs, v. 112, 1 August 2018
Golin, Mordecai Jay; Iacono, John; Langeman, Stefan; Munro, Ian; Nekrich, Y.
Conference paper

2017 2

Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 10389 LNCS, 2017, p. 133-144
Bhattacharya, Binay; Golin, Mordecai Jay; Higashikawa, Yuya; Kameda, Tsunehiko; Katoh, Naoki
Conference paper

Non-Approximability and Polylogarithmic Approximations of the Single-sink Unsplittable and Confluent Dynamic Flow Problems

Leibniz International Proceedings in Informatics, LIPIcs, v. 92, December 2017
Golin, Mordecai J.; Khodabande, Hadi; Qin, Bo
Conference paper

2016 3

Encoding 2D range maximum queries

Theoretical Computer Science, v. 609, January 2016, p. 316-327
Golin, Mordecai Jay; Iacono, John; Krizanc, Danny; Raman, Rajeev; Satti, Srinivasa Rao; Shende, Sunil M.
Article

The channel capacity of read/write isolated memory

Discrete Applied Mathematics, v. 198, January 2016, p. 264-273
Wang, Chuanlong; Yong, Xuerong; Golin, Mordecai Jay
Article

Sink Evacuation on Trees with Dynamic Confluent Flows

Leibniz International Proceedings in Informatics, LIPIcs, v. 64, December 2016, p. 25.1-25.13
Chen, Di; Golin, Mordecai Jay
Conference paper

2015 4

Minimax regret 1-sink location problem in dynamic path networks

Theoretical Computer Science, v. 588, July 2015, p. 24-36
Higashikawa, Yuya; Augustine, John; Cheng, Siu-Wing; Golin, Mordecai Jay; Katoh, Naoki; Ni, Guanqun; Su, Bing; Xu, Yinfeng
Article

Multiple Sink Location Problems in Dynamic Path Networks

Theoretical Computer Science, v. 607, (Part 1), November 2015, p. 2-15
Higashikawa, Yuya; Golin, Mordecai J.; Katoh, Naoki
Article

Optimal Search Trees with 2-Way Comparisons

Algorithms and Computation: 26th International Symposium, ISAAC 2015, Proceedings, Editors: Khaled Elbassioni, Kazuhisa Makino. Berlin, Heidelberg : Springer-Verlag, 2015, p. 71-82, Part of the Lecture Notes in Computer Science book series (LNCS, volume 9472)
Chrobak, Marek; Golin, Mordecai J.; Ian munro, J.; Young, Neal
Conference paper

Scheduling with Gaps: New Models and Algorithms

Algorithms and Complexity: Proceedings, Editors: Vangelis Th. Paschos, Peter Widmayer. Cham : Springer International Publishing, 2015, p. 114-126
Chrobak, Marek; Golin, Mordecai; Lam, Tak Wah; Nogneng, Dorian
Conference paper

2014 3

Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity

Journal of Graph Algorithms and Applications, v. 18, (4), 2014, p. 539-555
Higashikawa, Yuya; Golin, Mordecai Jay; Katoh, Naoki
Article

Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 8344, 2014, p. 125-137
Higashikawa, Yuya; Golin, Mordecai Jay; Katoh, Naoki
Conference paper

Multiple Sink Location Problems in Dynamic Path Networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 8546 LNCS, 2014, p. 149-161
Higashikawa, Yuya; Golin, Mordecai J.; Katoh, Naoki
Conference paper

2013 1

Paging Mobile Users in Cellular Networks: Optimality versus Complexity and Simplicity

Theoretical Computer Science, v. 470, January 2013, p. 23-35
Bar-Noy, Amotz; Cheilaris, Panagiotis; Feng, Yi; Golin, Mordecai Jay
Article

2012 2

HUFFMAN CODING WITH LETTER COSTS: A LINEAR-TIME APPROXIMATION SCHEME

SIAM journal on computing, v. 41, (3), 2012, p. 670-713
Golin, Mordecai J.; Mathieu, Claire; Young, Neal E.
Article

Vehicle scheduling on a graph revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 7676 LNCS, 2012, p. 362-371
Yu, Wei; Golin, Mordecai Jay; Zhang, Guochuan
Conference paper

2011 1

Encoding 2D range maximum queries

22nd International Symposium on Algorithms and Computation (ISAAC'11), Yokohama, Japan, December 5-8, 2011, Article number 6033377, p. 180-189
Golin, Mordecai Jay; Iacono, John; Krizanc, Danny; Raman, Rajeev; Rao, Sattisrinivasa
Conference paper

2010 2

A dynamic programming approach to length-limited huffman coding: Space reduction with the monge property

IEEE Transactions on Information Theory, v. 56, (8), 2010, p. 3918-3929
Golin, Mordecai J.; Zhang, Yan
Article

The asymptotic number of spanning trees in circulant graphs

Discrete mathematics, v. 310, (4), 2010, p. 792-803
Golin, M.J.; Yong, X.; Zhang, Y.
Article

2009 6

Online dynamic programming speedups

Theory of Computing Systems, v. 45, (3), 2009, p. 429-445
Bar-Noy, A.; Golin, M.J.; Zhang, Y.
Article

The Knuth-Yao Quadrangle-Inequality Speedup is a Consequence of Total Monotonicity

ACM transactions on algorithms, v. 6, (1), 2009, DEC
Bein, Wolfgang; Golin, Mordecai J.; Larmore, Lawrence L.; Zhang, Yan
Article

构造移动通信中降低能耗的前缀码的动态规划加速

计算机工程与科学=Computer Engineering and Science, v. 31, (2), 2009, p. 134-137
余佳晉; 徐曉明; Golin, Mordecai Jay
Article

A generic top-down dynamic-programming approach to prefix-free coding

Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 2009, p. 758-767
Golin, Mordecai; Xu, Xiaoming; Yu, Jiajin
Conference paper

Multidimensional divide-and-conquer and weighted digital sums

11th Workshop on Algorithm Engineering and Experiments and 6th Workshop on Analytic Algorithmics and Combinatorics 2009, ALENEX 2009/ANALCO 2009, 2009, p. 232-239
Cheung, Y.K.; Flajolet, Philippe; Golin, Mordecai; Lee, C. Y. James
Conference paper

Multidimensional Divide-and-Conquer and Weighted Digital Sums

Proceedings of ANALCO 2009, 2008, December
Cheung, Y. K.; Flajolet, Philippe; Golin, Mordecai J.; Lee, James C.Y.
Conference paper

2008 2

More efficient algorithms and analyses for unequal letter cost prefix-free coding

IEEE transactions on information theory, v. 54, (8), 2008, AUG, p. 3412-3424
Golin, Mordecai; Li, Jian
Article

The number of spanning trees in a class of double fixed-step loop networks

Networks, v. 52, (2), 2008, SEP, p. 69-77
Yong, Xuerong; Zhang, Yuanping; Golin, Mordecai J.
Article

2007 5

The two-median problem on Manhattan meshes

Networks, v. 49, (3), 2007, MAY, p. 226-233
Golin, Mordecai J.; Zhang, Yan
Article

More efficient algorithms and analyses for unequal letter cost prefix-free coding

Lecture Notes in Computer Science, v. 4835, 2007, p. 329-340
Golin, Mordecai Jay; Li, J.
Conference paper

Online dynamic programming speedups

Lecture Notes in Computer Science, v. 4368, 2007, p. 43-54
Bar-Noy, A.; Golin, M.J.; Zhang, Y.
Conference paper

Paging Mobile Users Efficiently and Optimally

Proceedings of the 26th IEEE International Conference on Computer Communications (INFOCOM 2007), 1910-1918, 6-12 May 2007, Anchorage, Alaska, USA
Bar-Noy, Amotz; Feng, Yi; Golin, Mordecai
Conference paper

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 Algorithmics and Combinations, 2007, p. 242-249
Golin, Mordecai J.; Yong, Xuerong; Zhang, Yuanping
Conference paper

2006 4

Online maintenance of k-medians and k-covers on a line

Algorithmica, v. 45, (4), 2006, p. 549-567
Fleischer, R.; Golin, M.J.; Zhang, Y.
Article

Online Dynamic Programming Speedups

Proceedings of Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, pp. 43-54, September 14-15
Bar-Noy, Amotz; Golin, Mordecai; Zhang, Yan
Conference paper

Permanents of Circulants: a Transfer Matrix Approach

Proceedings of the The Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO06), Janury 2006
Golin, Mordecai; Leung, Yiu Cho; Wang, Yajun
Conference paper

The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity

Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 2006, p. 31-40
Bein, W.W.; Golin, M.J.; Larmore, L.L.; Zhang, Y.
Conference paper

2005 5

Chebyshev polynomials and spanning tree formulas for circulant and related graphs

Discrete mathematics, v. 298, (1-3, Sp. Iss. SI), 2005, AUG 6, p. 334-364
Zhang, YP; Yong, XR; Golin, MJ
Article

Curve reconstruction from noisy samples

COMPUTATIONAL geometry-theory and APPLICATIONS, v. 31, (1-2), 2005, MAY, p. 63-100
Cheng, SW; Funke, S.; Golin, M.; Kumar, P.; Poon, SH; Ramos, E.
Article

The structure of optimal prefix-free codes in restricted languages: The uniform probability case

Lecture Notes in Computer Science, v. 3608, 2005, p. 372-384
Golin, Mordecai J.; Liu, ZM
Article

Counting Structures in Grid-Graphs, Cylinders and Tori using Transfer Matrices: Survey and New Results

The Proceedings of the The Second Workshop on Analytic Algorithmics and Combinatorics (ANALCO05), January 2005
Golin, Mordecai; Leung, Yiu-Cho; Wang, Yajun; Yong, Xuerong
Conference paper

Generalizing the Kraft-McMillan Inequality to restricted languages

Data Compression Conference Proceedings, 2005, p. 163-172
Golin, Mordecai J.; Na, H.S.
Conference paper

2004 9

Competitive facility location: the Voronoi game

Theoretical Computer Science, v. 310, (1-3), 2004, JAN 1, p. 457-467
Ahn, HK; Cheng, SW; Cheong, O.; Golin, M.; van Oostrum, R.
Article

Counting spanning trees and other structures in non-constant-jump circulant graphs

Lecture Notes in Computer Science, v. 3341, 2004, p. 508-521
Golin, Mordecai J.; Leung, YC; Wang, YJ
Article

Finding optimal paths in MREP routing

Information Processing Letters, v. 89, (2), 2004, JAN 31, p. 57-63
Fleischer, Rudolf; Golin, Mordecai Jay; Lea, Chin Tau; Wong, Steven
Article

Fun-Sort - or the chaos of unordered binary search

Discrete applied mathematics, v. 144, (3), 2004, DEC 15, p. 231-236
Biedl, T.; Chan, T.; Demaine, ED; Fleischer, R.; Golin, M.; King, JA; Munro, JI
Article

Maximum residual energy routing algorithms

Information Processing Letter, Vol 89, issue 2, Jan, pp. 57-63
Fleisher, Rudolf; Golin, Mordecai; Lea, Chin Tau
Article

New upper and lower bounds on capacity of read/write isolated the channel memory

Discrete applied mathematics, v. 140, (1-3), 2004, MAY 15, p. 35-48
Golin, MJ; Yong, XR; Zhang, YP; Sheng, L.
Article

Online maintenance of k-medians and k-covers on a line

Lecture Notes in Computer Science, v. 3111, 2004, p. 102-113
Fleischer, R.; Golin, MJ; Yan, Z.
Article

Unhooking circulant graphs: A combinatorial method for counting spanning trees and other parameters

Lecture Notes in Computer Science, v. 3353, 2004, p. 296-307
Golin, Mordecai J.; Leung, YC
Article

Online Maintenance of k-Medians and k-Covers on a Line

Proceedings of SWAT 2004, pp. 102-113
Fleischer, Rudolf; Golin, Mordecai; Zhang, Yan
Conference paper

2003 8

Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets

Designs Codes and Cryptography, v. 30, (1), 2003, AUG, p. 73-84
Ding, CS; Golin, M.; Klove, T.
Article

On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes

COMPUTATIONAL geometry-theory and APPLICATIONS, v. 25, (3), 2003, JUL, p. 197-231
Golin, Mordecai J.; Na, HS
Article

Algorithms for Infinite Huffman-Codes

Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA'04). 2004
Golin, Mordecai; Ma, Kin-Keung
Conference paper

Curve reconstruction from noisy samples

Proceedings of the Annual Symposium on Computational Geometry, 2003, p. 302-311
Cheng, S.W.; Funke, S.; Golin, M.; Kumar, P.; Poon, S.H.; Ramos, E.
Conference paper

Maximum Residual Energy Routing with Reverse Energy Cost

Conference Record / IEEE Global Telecommunications Conference, v. 1, 2003, p. 564-569
Xie, Qiling; Lea, Chin Tau; Golin, Mordecai Jay; Fleischer, Rudolf
Conference paper

Maximum residual routing with backward energy cost

IEEE Globecom 2003, San Francisco, USA, Dec
Sieh, Chris; Lea, Chin Tau; Golin, Mordecai; Fleish, Rudolf
Conference paper

Recurrence relations on transfer matrices yield good lower and upper bounds on the channel capacity of some 2-dimensional constrained systems

DCC, 2003, p. 430
Golin, Mordecai J.; Leung, YC
Conference paper

Residual Energy Routing with Reverse Energy Cost

Proceedings of IEEE Globecom 2003
Lea, C.T.; Xie, Q.; Fleischer, R.; Golin, Mordecai J.
Conference paper

2002 8

Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property

Journal of algorithms, v. 42, (2), 2002, FEB, p. 277-303
Bradford, P.; Golin, Mordecai; Larmore, LL; Rytter, W.
Article

Protection of keys against modification attack

Quality and Reliability Engineering International, v. 18, (3), 2002, MAY-JUN, p. 217-230
Fung, WW; Golin, MJ; Gray, JW
Article

The convex hull for random lines in the plane

Proceedings of the Japan Conference on Discrete and Computational Geometry, Tokyo, JCDCG, Tokyo, Japan, v. 2866, 6-9 December 2002, p. 172-175
Golin, Mordecai; Langerman, S.; Steiger, W.
Article

Algebraic and combinatorial properties of the transfer matrix of the 2-dimensional (1, infinity) Runlength Limited constraint

ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, p. 354
Yong, XR; Golin, Mordecai J.
Conference paper

Further applications of Chebyshev polynomials in the derivation of spanning tree formulas for circulant graphs

Proceedings of The International Colloquium on Mathematics and Computer Science, Versailles, France, September 16-19, 541-552
Golin, Mordecai; Zhang, Yuanping
Conference paper

Huffman coding with unequal letter costs

Conference proceedings of the annual ACM Symposium on Theory of Computing, 2002, p. 785-791
Golin, M.J.; Kenyon, C.; Young, N.E.
Conference paper

New Techniques for Bounding the Channel Capacity of Read/Write Isolated Memory

Proceedings of the 2002 IEEE Data Compression Conference (Poster), 482
Yong, Xuerong; Golin, Mordecai
Conference paper

The probabilistic complexity of the Voronoi diagram of points on a polyhedron

Proceedings of the eighteenth annual symposium on Computational geometry; 05-07 June 2002
Golin, Mordecai J.; Na, Hyeon-Suk
Conference paper

2001 6

A combinatorial approach to Golomb forests

Theoretical Computer Science, v. 263, (1-2), 2001, JUL 28, p. 283-304
Golin, Mordecai J.
Article

Competitive facility location along a highway

Lecture Notes in Computer Science, v. 2108, 2001, p. 237-246
Ahn, HK; Cheng, SW; Cheong, O.; Golin, M.; van Ostrum, R.
Article

Lopsided trees, I: Analyses

Algorithmica, v. 31, (3), 2001, NOV, p. 240-290
Choi, V.; Golin, Mordecai J.
Article

Competitive facility location: the Voronoi game

Computing and Combinatorics, Proc 7th Annual International Conference (COCOON 2001), v. 2108, 2001, p. 237-246
van Oostrum, R.; Ahn, Hee-Kap; Cheng, Siu Wing; Cheong, O.; Golin, Mordecai Jay
Conference paper

Optimal prefix-free codes that end in a specified pattern and similar problems: The uniform probability case (extended abstract)

Data Compression Conference Proceedings, 2001, p. 143-152
Golin, Mordecai J.; Na, H.S.
Conference paper

Protection of keys against modification attack

Proceedings - IEEE Symposium on Security and Privacy, 2001, p. 26-36
Fung, Wai W.; Golin, Mordecai Jay; Gray, JW
Conference paper

2000 4

A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes

IEEE Transactions on Information Theory, v. 46, (4), 2000, p. 1637-1644
Chan, S.L.; Golin, M.J.
Article

An algorithm for finding a k-median in a directed tree

Information Processing Letters, v. 74, (1-2), 2000, APR 30, p. 81-88
Vigneron, Antoine; Gao, Lixin; Golin, Mordecai J.; Italiano, Giuseppe Francesco; Li, Bo
Article

The number of spanning trees in circulant graphs

Discrete mathematics, v. 223, (1-3), 2000, AUG 28, p. 337-350
Zhang, YP; Yong, XR; Golin, Mordecai J.
Article

New upper and lower bounds on the channel capacity of read/write isolated memory

IEEE International Symposium on Information Theory - Proceedings, 2000, p. 280
Golin, Mordecai; Yong, X.R.; Sheng, L.; Zhang, Y.P.
Conference paper

1999 3

On the expected depth of random circuits

COMBINATORICS Probability & COMPUTING, v. 8, (3), 1999, MAY, p. 209-227
Arya, Sunil; Golin, Mordecai Jay; Mehlhorn, Kurt
Article

Optimal point-to-point broadcast algorithms via lopsided trees

Discrete applied mathematics, v. 93, (2-3), 1999, JUL 20, p. 233-263
Golin, Mordecai Jay; Schuster, Assaf
Article

On the optimal placement of Web proxies in the Internet

Proceedings - IEEE INFOCOM, v. 3, 1999, p. 1282-1290
Li, Bo; Golin, Mordecai Jay; Italiano, Giuseppe F.; Deng, Xin; Sohraby, Kazem
Conference paper

1998 8

A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs

IEEE transactions on information theory, v. 44, (5), 1998, SEP, p. 1770-1781
Golin, Mordecai J.; Rote, G.
Article

Dog bites postman: Point location in the moving Voronoi diagram and related problems

International journal of computational geometry & applications, v. 8, (3), 1998, JUN, p. 321-342
Devillers, O.; Golin, Mordecai Jay
Article

Labelled Trees and Pairs of Input-Output Permutations in Priority Queues

Theoretical Computer Science, v. 205, (1-2), 1998, SEP 28, p. 99-114
Golin, Mordecai J; Zaks, Shmuel
Article

Randomized data structures for the dynamic closest-pair problem

SIAM journal on computing, v. 27, (4), 1998, AUG, p. 1036-1072
Golin, Moedecai Jay; Raman, R.; Schwarz, C.; Smid, M.
Article

A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes

1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, p. 45
Chan, Szelok; Golin, Mordecai Jay
Conference paper

Convergence and construction of minimal-cost infinite trees

1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, p. 227
Chow, T.; Golin, M.
Conference paper

Dynamic and distributed Web caching in active networks

WEB TECHNOLOGIES AND APPLICATIONS, 1998, p. 113-121
Li, Bo; Deng, X.; Golin, MJ; Sohraby, K.
Conference paper

On the optimal placement of web proxies in the Internet: The linear topology

IFIP International Federation for Information Processing, v. 8, 1998, p. 485-495
Li, Bo; Deng, X.; Golin, MJ; Sohraby, K.
Conference paper

1997 1

Optimal point-to-point broadcast algorithms via lopsided trees

PROCEEDINGS OF THE FIFTH ISRAELI SYMPOSIUM ON THEORY OF COMPUTING AND SYSTEMS, 1997, p. 63-73
Golin, Mordecai J.; Schuster, A.
Conference paper

1996 4

Prefix codes: Equiprobable words, unequal letter costs

SIAM journal on computing, v. 25, (6), 1996, DEC, p. 1281-1292
Golin, MJ; Young, N.
Article

Queries on Voronoi diagrams of moving points

COMPUTATIONAL geometry-theory and APPLICATIONS, v. 6, (5), 1996, SEP, p. 315-327
Devillers, O.; Golin, Mordecai, J.; Kedem, K.; Schirra, S.
Article

Limit theorems for minimum-weight triangulations, other Euclidean Functionals, and probabilistic recurrence relations

PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1996, p. 252-260
Golin, Mordecai J.
Conference paper

Lopsided trees: Analyses, Algorithms, and Applications

Lecture Notes in Computer Science, v. 1099, 1996, p. 538-549
Choi, Vicky Siu Ngan; Golin, Mordecai
Conference paper

1995 5

A Simple Randomized Closest Pair Algorithm

Nordic Journal on Computing, v. 2, 1995, p. 3-27
Golin, Mordecai J.; Raman, R.; Schwarz, C.; Smid, M.
Article

Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas

Information Processing Letters, v. 56, (3), p. 157-164
Devillers, Olivier; Golin, Mordecai J.
Article

The Multi-Weighted Spanning Tree Problem

Lecture Notes in Computer Science, v. 959, 1995, p. 141-150
Ganley, Joseph L.; Golin, Mordecai J; Salowe, Jeffrey S.
Article

A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes for Unequal Letter Costs

Lecture Notes in Computer Science, v. 944, 1995, p. 257-267
Golin, Mordecai J; Rote, Gunter
Conference paper

Mimimum Spanning Trees forMultiplyWeighted Graphs

Proceedings of the First International Computing and Combinatorics Conference, 1995, p. 141-150
Ganley, J.; Golin, Mordecai J.; Salowe, J.
Conference paper

1994 4

A provably fast linear-expected-time maxima-finding algorithm

Algorithmica, v. 11, (6), 1994, p. 501-524
Golin, Mordecai J.
Article

MELLIN TRANSFORMS AND ASYMPTOTICS - THE MERGESORT RECURRENCE

Acta Informatica, v. 31, (7), 1994, OCT, p. 673-696
FLAJOLET, P.; GOLIN, M.
Article

Newton"s Method for Quadratics and Nested Intervals

Complex Systems, v. 8, 1994, p. 161-180
Golin, Mordecai J.; Supowit, K.
Article

Prefix Codes: Equiprobable Words, Unequal Letter Costs

Proceedings of the 21st International Colloquim on Automata Languages and Programming, 1994, p. 605-617
Golin, Mordecai J.; Young, N.
Conference paper

1993 6

How many maxima can there be?

Computational geometry, v. 2, (6), 1993, p. 335-353
Golin, Mordecai J.
Article

QUEUE-MERGESORT

Information Processing Letters, v. 48, (5), 1993, DEC 10, p. 253-259
GOLIN, MJ; SEDGEWICK, R.
Article

Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems

Proceedings of the First Annual European Symposium on Algorithms, 1993, p. 133-144
Devillers, O.; Golin, Mordecai J.
Conference paper

Exact Asymptotics of Divide-and-Conquer Recurrences

Proceedings of the 20th International Colloquim on Automata Languages and Programming, 1993, p. 137-149
Flajolet, P.; Golin, Mordecai J.
Conference paper

Maxima in convex regions

Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms; 25-27 Jan. 1993
Golin, Mordecai J.
Conference paper

Randomized data structures for the dynamic closest-pair problem

Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1993, p. 301-310
Golin, Mordecai; Raman, Rajeev; Schwarz, Christian; Smid, Michiel
Conference paper

1992 2

Dynamic Closest Pairs: A Probabilistic Approach

Proceedings of the Third Scandinavian Workshop on Algorithm Theory, 1992, p. 340-351
Golin, Mordecai J.
Conference paper

Further Dynamic Computational Geometry

Proceedings of the Third Scandinavian Workshop on Algorithm Theory (SWAT '92), 1992
Golin, Mordecai J.; Smid, M.
Conference paper

1988 1

Analysis of a Simple yet Efficient Convex Hull Algorithm

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988, p. 153-163
Golin, Mordecai J.; Sedgewick, R.
Conference paper

Article 4

A Simple Algorithm for Optimal Search Trees with Two-way Comparisons

ACM Transactions on Algorithms, v. 18, (1), January 2022, article number 2, p. 1-11
Chrobak, Marek; Golin, Mordecai Jay; Munro, J. Ian; Young, Neal E.

Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows

Algorithmica, December 2022
Chen, Di; Golin, Mordecai Jay

Minmax regret for sink location on dynamic flow paths with general capacities

Discrete Applied Mathematics, v. 315, July 2022, p. 1-26
Golin, Mordecai J.; Sandeep, Sai

On Huang and Wong’s algorithm for generalized binary split trees

Acta Informatica, 14 February 2022
Chrobak, Marek; Golin, Mordecai Jay; Munro, J. Ian; Young, Neal E.

Conference paper 1

Speeding Up AIFV-m Dynamic Programs by m-1 Orders of Magnitude

IEEE International Symposium on Information Theory - Proceedings, v. 2022-June, 2022, article number 9834477, p. 246-251
Golin, Mordecai Jay; Patupat, Albert John Lalim

Article 4

On the cost of unsuccessful searches in search trees with two-way comparisons

Information and Computation, v. 281, 10 March 2021, article number 104707
Chrobak, Marek; Golin, Mordecai Jay; Munro, J. Ian; Young, Neal E.

Scheduling on a graph with release times

Journal of Scheduling, 19 March 2021
Yu, Wei; Golin, Mordecai Jay; Zhang, Guochuan

Scheduling with gaps: new models and algorithms

Journal of Scheduling, 21 July 2021
Chrobak, Marek; Golin, Mordecai Jay; Lam, Tak-Wah; Nogneng, Doroian

Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries

Theoretical Computer Science, v. 865, April 2021, p. 99-118
Golin, Mordecai Jay; Harb, Elfarouk Yasser Farouk M. A.

Article 2

Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform Capacities

Algorithmica, v. 81, (9), September 2019, p. 3534-3585
Arumugam, Guru Prakash; Augustine, John E.; Golin, Mordecai Jay; Srikanthan, Prashanth

The Transfer Matrices and The Capacity of the 2-dimensional (1,∞)-runlength Limited Constraint

Discrete Mathematics, v. 342, (4), April 2019, p. 975-987
Chen, Zhibing; Golin, Mordecai Jay; Yong, Xuerong

Conference paper 2

Polynomial Time Algorithms for Constructing Optimal AIFV Codes

Data Compression Conference Proceedings, v. 2019-March, May 2019, article number 8712620, p. 231-240
Harb, Elfarouk Yasser Farouk M. A.; Golin, Mordecai Jay

The expected number of maximal points of the convolution of two 2-D distributions

Leibniz International Proceedings in Informatics, LIPIcs, v.145, September 2019, article number 35
Díaz, Jesús Ildelfonso; Golin, Mordecai Jay

Conference paper 1

Dynamic Trees with Almost-Optimal Access Cost

Leibniz International Proceedings in Informatics, LIPIcs, v. 112, 1 August 2018
Golin, Mordecai Jay; Iacono, John; Langeman, Stefan; Munro, Ian; Nekrich, Y.

Conference paper 2

Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 10389 LNCS, 2017, p. 133-144
Bhattacharya, Binay; Golin, Mordecai Jay; Higashikawa, Yuya; Kameda, Tsunehiko; Katoh, Naoki

Non-Approximability and Polylogarithmic Approximations of the Single-sink Unsplittable and Confluent Dynamic Flow Problems

Leibniz International Proceedings in Informatics, LIPIcs, v. 92, December 2017
Golin, Mordecai J.; Khodabande, Hadi; Qin, Bo

Article 2

Encoding 2D range maximum queries

Theoretical Computer Science, v. 609, January 2016, p. 316-327
Golin, Mordecai Jay; Iacono, John; Krizanc, Danny; Raman, Rajeev; Satti, Srinivasa Rao; Shende, Sunil M.

The channel capacity of read/write isolated memory

Discrete Applied Mathematics, v. 198, January 2016, p. 264-273
Wang, Chuanlong; Yong, Xuerong; Golin, Mordecai Jay

Conference paper 1

Sink Evacuation on Trees with Dynamic Confluent Flows

Leibniz International Proceedings in Informatics, LIPIcs, v. 64, December 2016, p. 25.1-25.13
Chen, Di; Golin, Mordecai Jay

Article 2

Minimax regret 1-sink location problem in dynamic path networks

Theoretical Computer Science, v. 588, July 2015, p. 24-36
Higashikawa, Yuya; Augustine, John; Cheng, Siu-Wing; Golin, Mordecai Jay; Katoh, Naoki; Ni, Guanqun; Su, Bing; Xu, Yinfeng

Multiple Sink Location Problems in Dynamic Path Networks

Theoretical Computer Science, v. 607, (Part 1), November 2015, p. 2-15
Higashikawa, Yuya; Golin, Mordecai J.; Katoh, Naoki

Conference paper 2

Optimal Search Trees with 2-Way Comparisons

Algorithms and Computation: 26th International Symposium, ISAAC 2015, Proceedings, Editors: Khaled Elbassioni, Kazuhisa Makino. Berlin, Heidelberg : Springer-Verlag, 2015, p. 71-82, Part of the Lecture Notes in Computer Science book series (LNCS, volume 9472)
Chrobak, Marek; Golin, Mordecai J.; Ian munro, J.; Young, Neal

Scheduling with Gaps: New Models and Algorithms

Algorithms and Complexity: Proceedings, Editors: Vangelis Th. Paschos, Peter Widmayer. Cham : Springer International Publishing, 2015, p. 114-126
Chrobak, Marek; Golin, Mordecai; Lam, Tak Wah; Nogneng, Dorian

Article 1

Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity

Journal of Graph Algorithms and Applications, v. 18, (4), 2014, p. 539-555
Higashikawa, Yuya; Golin, Mordecai Jay; Katoh, Naoki

Conference paper 2

Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 8344, 2014, p. 125-137
Higashikawa, Yuya; Golin, Mordecai Jay; Katoh, Naoki

Multiple Sink Location Problems in Dynamic Path Networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 8546 LNCS, 2014, p. 149-161
Higashikawa, Yuya; Golin, Mordecai J.; Katoh, Naoki

Article 1

Paging Mobile Users in Cellular Networks: Optimality versus Complexity and Simplicity

Theoretical Computer Science, v. 470, January 2013, p. 23-35
Bar-Noy, Amotz; Cheilaris, Panagiotis; Feng, Yi; Golin, Mordecai Jay

Article 1

HUFFMAN CODING WITH LETTER COSTS: A LINEAR-TIME APPROXIMATION SCHEME

SIAM journal on computing, v. 41, (3), 2012, p. 670-713
Golin, Mordecai J.; Mathieu, Claire; Young, Neal E.

Conference paper 1

Vehicle scheduling on a graph revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 7676 LNCS, 2012, p. 362-371
Yu, Wei; Golin, Mordecai Jay; Zhang, Guochuan

Conference paper 1

Encoding 2D range maximum queries

22nd International Symposium on Algorithms and Computation (ISAAC'11), Yokohama, Japan, December 5-8, 2011, Article number 6033377, p. 180-189
Golin, Mordecai Jay; Iacono, John; Krizanc, Danny; Raman, Rajeev; Rao, Sattisrinivasa

Article 2

A dynamic programming approach to length-limited huffman coding: Space reduction with the monge property

IEEE Transactions on Information Theory, v. 56, (8), 2010, p. 3918-3929
Golin, Mordecai J.; Zhang, Yan

The asymptotic number of spanning trees in circulant graphs

Discrete mathematics, v. 310, (4), 2010, p. 792-803
Golin, M.J.; Yong, X.; Zhang, Y.

Article 3

Online dynamic programming speedups

Theory of Computing Systems, v. 45, (3), 2009, p. 429-445
Bar-Noy, A.; Golin, M.J.; Zhang, Y.

The Knuth-Yao Quadrangle-Inequality Speedup is a Consequence of Total Monotonicity

ACM transactions on algorithms, v. 6, (1), 2009, DEC
Bein, Wolfgang; Golin, Mordecai J.; Larmore, Lawrence L.; Zhang, Yan

构造移动通信中降低能耗的前缀码的动态规划加速

计算机工程与科学=Computer Engineering and Science, v. 31, (2), 2009, p. 134-137
余佳晉; 徐曉明; Golin, Mordecai Jay

Conference paper 3

A generic top-down dynamic-programming approach to prefix-free coding

Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 2009, p. 758-767
Golin, Mordecai; Xu, Xiaoming; Yu, Jiajin

Multidimensional divide-and-conquer and weighted digital sums

11th Workshop on Algorithm Engineering and Experiments and 6th Workshop on Analytic Algorithmics and Combinatorics 2009, ALENEX 2009/ANALCO 2009, 2009, p. 232-239
Cheung, Y.K.; Flajolet, Philippe; Golin, Mordecai; Lee, C. Y. James

Multidimensional Divide-and-Conquer and Weighted Digital Sums

Proceedings of ANALCO 2009, 2008, December
Cheung, Y. K.; Flajolet, Philippe; Golin, Mordecai J.; Lee, James C.Y.

Article 2

More efficient algorithms and analyses for unequal letter cost prefix-free coding

IEEE transactions on information theory, v. 54, (8), 2008, AUG, p. 3412-3424
Golin, Mordecai; Li, Jian

The number of spanning trees in a class of double fixed-step loop networks

Networks, v. 52, (2), 2008, SEP, p. 69-77
Yong, Xuerong; Zhang, Yuanping; Golin, Mordecai J.

Article 1

The two-median problem on Manhattan meshes

Networks, v. 49, (3), 2007, MAY, p. 226-233
Golin, Mordecai J.; Zhang, Yan

Conference paper 4

More efficient algorithms and analyses for unequal letter cost prefix-free coding

Lecture Notes in Computer Science, v. 4835, 2007, p. 329-340
Golin, Mordecai Jay; Li, J.

Online dynamic programming speedups

Lecture Notes in Computer Science, v. 4368, 2007, p. 43-54
Bar-Noy, A.; Golin, M.J.; Zhang, Y.

Paging Mobile Users Efficiently and Optimally

Proceedings of the 26th IEEE International Conference on Computer Communications (INFOCOM 2007), 1910-1918, 6-12 May 2007, Anchorage, Alaska, USA
Bar-Noy, Amotz; Feng, Yi; Golin, Mordecai

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 Algorithmics and Combinations, 2007, p. 242-249
Golin, Mordecai J.; Yong, Xuerong; Zhang, Yuanping

Article 1

Online maintenance of k-medians and k-covers on a line

Algorithmica, v. 45, (4), 2006, p. 549-567
Fleischer, R.; Golin, M.J.; Zhang, Y.

Conference paper 3

Online Dynamic Programming Speedups

Proceedings of Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, pp. 43-54, September 14-15
Bar-Noy, Amotz; Golin, Mordecai; Zhang, Yan

Permanents of Circulants: a Transfer Matrix Approach

Proceedings of the The Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO06), Janury 2006
Golin, Mordecai; Leung, Yiu Cho; Wang, Yajun

The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity

Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 2006, p. 31-40
Bein, W.W.; Golin, M.J.; Larmore, L.L.; Zhang, Y.

Article 3

Chebyshev polynomials and spanning tree formulas for circulant and related graphs

Discrete mathematics, v. 298, (1-3, Sp. Iss. SI), 2005, AUG 6, p. 334-364
Zhang, YP; Yong, XR; Golin, MJ

Curve reconstruction from noisy samples

COMPUTATIONAL geometry-theory and APPLICATIONS, v. 31, (1-2), 2005, MAY, p. 63-100
Cheng, SW; Funke, S.; Golin, M.; Kumar, P.; Poon, SH; Ramos, E.

The structure of optimal prefix-free codes in restricted languages: The uniform probability case

Lecture Notes in Computer Science, v. 3608, 2005, p. 372-384
Golin, Mordecai J.; Liu, ZM

Conference paper 2

Counting Structures in Grid-Graphs, Cylinders and Tori using Transfer Matrices: Survey and New Results

The Proceedings of the The Second Workshop on Analytic Algorithmics and Combinatorics (ANALCO05), January 2005
Golin, Mordecai; Leung, Yiu-Cho; Wang, Yajun; Yong, Xuerong

Generalizing the Kraft-McMillan Inequality to restricted languages

Data Compression Conference Proceedings, 2005, p. 163-172
Golin, Mordecai J.; Na, H.S.

Article 8

Competitive facility location: the Voronoi game

Theoretical Computer Science, v. 310, (1-3), 2004, JAN 1, p. 457-467
Ahn, HK; Cheng, SW; Cheong, O.; Golin, M.; van Oostrum, R.

Counting spanning trees and other structures in non-constant-jump circulant graphs

Lecture Notes in Computer Science, v. 3341, 2004, p. 508-521
Golin, Mordecai J.; Leung, YC; Wang, YJ

Finding optimal paths in MREP routing

Information Processing Letters, v. 89, (2), 2004, JAN 31, p. 57-63
Fleischer, Rudolf; Golin, Mordecai Jay; Lea, Chin Tau; Wong, Steven

Fun-Sort - or the chaos of unordered binary search

Discrete applied mathematics, v. 144, (3), 2004, DEC 15, p. 231-236
Biedl, T.; Chan, T.; Demaine, ED; Fleischer, R.; Golin, M.; King, JA; Munro, JI

Maximum residual energy routing algorithms

Information Processing Letter, Vol 89, issue 2, Jan, pp. 57-63
Fleisher, Rudolf; Golin, Mordecai; Lea, Chin Tau

New upper and lower bounds on capacity of read/write isolated the channel memory

Discrete applied mathematics, v. 140, (1-3), 2004, MAY 15, p. 35-48
Golin, MJ; Yong, XR; Zhang, YP; Sheng, L.

Online maintenance of k-medians and k-covers on a line

Lecture Notes in Computer Science, v. 3111, 2004, p. 102-113
Fleischer, R.; Golin, MJ; Yan, Z.

Unhooking circulant graphs: A combinatorial method for counting spanning trees and other parameters

Lecture Notes in Computer Science, v. 3353, 2004, p. 296-307
Golin, Mordecai J.; Leung, YC

Conference paper 1

Online Maintenance of k-Medians and k-Covers on a Line

Proceedings of SWAT 2004, pp. 102-113
Fleischer, Rudolf; Golin, Mordecai; Zhang, Yan

Article 2

Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets

Designs Codes and Cryptography, v. 30, (1), 2003, AUG, p. 73-84
Ding, CS; Golin, M.; Klove, T.

On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes

COMPUTATIONAL geometry-theory and APPLICATIONS, v. 25, (3), 2003, JUL, p. 197-231
Golin, Mordecai J.; Na, HS

Conference paper 6

Algorithms for Infinite Huffman-Codes

Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA'04). 2004
Golin, Mordecai; Ma, Kin-Keung

Curve reconstruction from noisy samples

Proceedings of the Annual Symposium on Computational Geometry, 2003, p. 302-311
Cheng, S.W.; Funke, S.; Golin, M.; Kumar, P.; Poon, S.H.; Ramos, E.

Maximum Residual Energy Routing with Reverse Energy Cost

Conference Record / IEEE Global Telecommunications Conference, v. 1, 2003, p. 564-569
Xie, Qiling; Lea, Chin Tau; Golin, Mordecai Jay; Fleischer, Rudolf

Maximum residual routing with backward energy cost

IEEE Globecom 2003, San Francisco, USA, Dec
Sieh, Chris; Lea, Chin Tau; Golin, Mordecai; Fleish, Rudolf

Recurrence relations on transfer matrices yield good lower and upper bounds on the channel capacity of some 2-dimensional constrained systems

DCC, 2003, p. 430
Golin, Mordecai J.; Leung, YC

Residual Energy Routing with Reverse Energy Cost

Proceedings of IEEE Globecom 2003
Lea, C.T.; Xie, Q.; Fleischer, R.; Golin, Mordecai J.

Article 3

Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property

Journal of algorithms, v. 42, (2), 2002, FEB, p. 277-303
Bradford, P.; Golin, Mordecai; Larmore, LL; Rytter, W.

Protection of keys against modification attack

Quality and Reliability Engineering International, v. 18, (3), 2002, MAY-JUN, p. 217-230
Fung, WW; Golin, MJ; Gray, JW

The convex hull for random lines in the plane

Proceedings of the Japan Conference on Discrete and Computational Geometry, Tokyo, JCDCG, Tokyo, Japan, v. 2866, 6-9 December 2002, p. 172-175
Golin, Mordecai; Langerman, S.; Steiger, W.

Conference paper 5

Algebraic and combinatorial properties of the transfer matrix of the 2-dimensional (1, infinity) Runlength Limited constraint

ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, p. 354
Yong, XR; Golin, Mordecai J.

Further applications of Chebyshev polynomials in the derivation of spanning tree formulas for circulant graphs

Proceedings of The International Colloquium on Mathematics and Computer Science, Versailles, France, September 16-19, 541-552
Golin, Mordecai; Zhang, Yuanping

Huffman coding with unequal letter costs

Conference proceedings of the annual ACM Symposium on Theory of Computing, 2002, p. 785-791
Golin, M.J.; Kenyon, C.; Young, N.E.

New Techniques for Bounding the Channel Capacity of Read/Write Isolated Memory

Proceedings of the 2002 IEEE Data Compression Conference (Poster), 482
Yong, Xuerong; Golin, Mordecai

The probabilistic complexity of the Voronoi diagram of points on a polyhedron

Proceedings of the eighteenth annual symposium on Computational geometry; 05-07 June 2002
Golin, Mordecai J.; Na, Hyeon-Suk

Article 3

A combinatorial approach to Golomb forests

Theoretical Computer Science, v. 263, (1-2), 2001, JUL 28, p. 283-304
Golin, Mordecai J.

Competitive facility location along a highway

Lecture Notes in Computer Science, v. 2108, 2001, p. 237-246
Ahn, HK; Cheng, SW; Cheong, O.; Golin, M.; van Ostrum, R.

Lopsided trees, I: Analyses

Algorithmica, v. 31, (3), 2001, NOV, p. 240-290
Choi, V.; Golin, Mordecai J.

Conference paper 3

Competitive facility location: the Voronoi game

Computing and Combinatorics, Proc 7th Annual International Conference (COCOON 2001), v. 2108, 2001, p. 237-246
van Oostrum, R.; Ahn, Hee-Kap; Cheng, Siu Wing; Cheong, O.; Golin, Mordecai Jay

Optimal prefix-free codes that end in a specified pattern and similar problems: The uniform probability case (extended abstract)

Data Compression Conference Proceedings, 2001, p. 143-152
Golin, Mordecai J.; Na, H.S.

Protection of keys against modification attack

Proceedings - IEEE Symposium on Security and Privacy, 2001, p. 26-36
Fung, Wai W.; Golin, Mordecai Jay; Gray, JW

Article 3

A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes

IEEE Transactions on Information Theory, v. 46, (4), 2000, p. 1637-1644
Chan, S.L.; Golin, M.J.

An algorithm for finding a k-median in a directed tree

Information Processing Letters, v. 74, (1-2), 2000, APR 30, p. 81-88
Vigneron, Antoine; Gao, Lixin; Golin, Mordecai J.; Italiano, Giuseppe Francesco; Li, Bo

The number of spanning trees in circulant graphs

Discrete mathematics, v. 223, (1-3), 2000, AUG 28, p. 337-350
Zhang, YP; Yong, XR; Golin, Mordecai J.

Conference paper 1

New upper and lower bounds on the channel capacity of read/write isolated memory

IEEE International Symposium on Information Theory - Proceedings, 2000, p. 280
Golin, Mordecai; Yong, X.R.; Sheng, L.; Zhang, Y.P.

Article 2

On the expected depth of random circuits

COMBINATORICS Probability & COMPUTING, v. 8, (3), 1999, MAY, p. 209-227
Arya, Sunil; Golin, Mordecai Jay; Mehlhorn, Kurt

Optimal point-to-point broadcast algorithms via lopsided trees

Discrete applied mathematics, v. 93, (2-3), 1999, JUL 20, p. 233-263
Golin, Mordecai Jay; Schuster, Assaf

Conference paper 1

On the optimal placement of Web proxies in the Internet

Proceedings - IEEE INFOCOM, v. 3, 1999, p. 1282-1290
Li, Bo; Golin, Mordecai Jay; Italiano, Giuseppe F.; Deng, Xin; Sohraby, Kazem

Article 4

A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs

IEEE transactions on information theory, v. 44, (5), 1998, SEP, p. 1770-1781
Golin, Mordecai J.; Rote, G.

Dog bites postman: Point location in the moving Voronoi diagram and related problems

International journal of computational geometry & applications, v. 8, (3), 1998, JUN, p. 321-342
Devillers, O.; Golin, Mordecai Jay

Labelled Trees and Pairs of Input-Output Permutations in Priority Queues

Theoretical Computer Science, v. 205, (1-2), 1998, SEP 28, p. 99-114
Golin, Mordecai J; Zaks, Shmuel

Randomized data structures for the dynamic closest-pair problem

SIAM journal on computing, v. 27, (4), 1998, AUG, p. 1036-1072
Golin, Moedecai Jay; Raman, R.; Schwarz, C.; Smid, M.

Conference paper 4

A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes

1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, p. 45
Chan, Szelok; Golin, Mordecai Jay

Convergence and construction of minimal-cost infinite trees

1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, p. 227
Chow, T.; Golin, M.

Dynamic and distributed Web caching in active networks

WEB TECHNOLOGIES AND APPLICATIONS, 1998, p. 113-121
Li, Bo; Deng, X.; Golin, MJ; Sohraby, K.

On the optimal placement of web proxies in the Internet: The linear topology

IFIP International Federation for Information Processing, v. 8, 1998, p. 485-495
Li, Bo; Deng, X.; Golin, MJ; Sohraby, K.

Conference paper 1

Optimal point-to-point broadcast algorithms via lopsided trees

PROCEEDINGS OF THE FIFTH ISRAELI SYMPOSIUM ON THEORY OF COMPUTING AND SYSTEMS, 1997, p. 63-73
Golin, Mordecai J.; Schuster, A.

Article 2

Prefix codes: Equiprobable words, unequal letter costs

SIAM journal on computing, v. 25, (6), 1996, DEC, p. 1281-1292
Golin, MJ; Young, N.

Queries on Voronoi diagrams of moving points

COMPUTATIONAL geometry-theory and APPLICATIONS, v. 6, (5), 1996, SEP, p. 315-327
Devillers, O.; Golin, Mordecai, J.; Kedem, K.; Schirra, S.

Conference paper 2

Limit theorems for minimum-weight triangulations, other Euclidean Functionals, and probabilistic recurrence relations

PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1996, p. 252-260
Golin, Mordecai J.

Lopsided trees: Analyses, Algorithms, and Applications

Lecture Notes in Computer Science, v. 1099, 1996, p. 538-549
Choi, Vicky Siu Ngan; Golin, Mordecai

Article 3

A Simple Randomized Closest Pair Algorithm

Nordic Journal on Computing, v. 2, 1995, p. 3-27
Golin, Mordecai J.; Raman, R.; Schwarz, C.; Smid, M.

Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas

Information Processing Letters, v. 56, (3), p. 157-164
Devillers, Olivier; Golin, Mordecai J.

The Multi-Weighted Spanning Tree Problem

Lecture Notes in Computer Science, v. 959, 1995, p. 141-150
Ganley, Joseph L.; Golin, Mordecai J; Salowe, Jeffrey S.

Conference paper 2

A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes for Unequal Letter Costs

Lecture Notes in Computer Science, v. 944, 1995, p. 257-267
Golin, Mordecai J; Rote, Gunter

Mimimum Spanning Trees forMultiplyWeighted Graphs

Proceedings of the First International Computing and Combinatorics Conference, 1995, p. 141-150
Ganley, J.; Golin, Mordecai J.; Salowe, J.

Article 3

A provably fast linear-expected-time maxima-finding algorithm

Algorithmica, v. 11, (6), 1994, p. 501-524
Golin, Mordecai J.

MELLIN TRANSFORMS AND ASYMPTOTICS - THE MERGESORT RECURRENCE

Acta Informatica, v. 31, (7), 1994, OCT, p. 673-696
FLAJOLET, P.; GOLIN, M.

Newton"s Method for Quadratics and Nested Intervals

Complex Systems, v. 8, 1994, p. 161-180
Golin, Mordecai J.; Supowit, K.

Conference paper 1

Prefix Codes: Equiprobable Words, Unequal Letter Costs

Proceedings of the 21st International Colloquim on Automata Languages and Programming, 1994, p. 605-617
Golin, Mordecai J.; Young, N.

Article 2

How many maxima can there be?

Computational geometry, v. 2, (6), 1993, p. 335-353
Golin, Mordecai J.

QUEUE-MERGESORT

Information Processing Letters, v. 48, (5), 1993, DEC 10, p. 253-259
GOLIN, MJ; SEDGEWICK, R.

Conference paper 4

Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems

Proceedings of the First Annual European Symposium on Algorithms, 1993, p. 133-144
Devillers, O.; Golin, Mordecai J.

Exact Asymptotics of Divide-and-Conquer Recurrences

Proceedings of the 20th International Colloquim on Automata Languages and Programming, 1993, p. 137-149
Flajolet, P.; Golin, Mordecai J.

Maxima in convex regions

Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms; 25-27 Jan. 1993
Golin, Mordecai J.

Randomized data structures for the dynamic closest-pair problem

Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1993, p. 301-310
Golin, Mordecai; Raman, Rajeev; Schwarz, Christian; Smid, Michiel

Conference paper 2

Dynamic Closest Pairs: A Probabilistic Approach

Proceedings of the Third Scandinavian Workshop on Algorithm Theory, 1992, p. 340-351
Golin, Mordecai J.

Further Dynamic Computational Geometry

Proceedings of the Third Scandinavian Workshop on Algorithm Theory (SWAT '92), 1992
Golin, Mordecai J.; Smid, M.

Conference paper 1

Analysis of a Simple yet Efficient Convex Hull Algorithm

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988, p. 153-163
Golin, Mordecai J.; Sedgewick, R.

2017 2

Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 10389 LNCS, 2017, p. 133-144
Bhattacharya, Binay; Golin, Mordecai Jay; Higashikawa, Yuya; Kameda, Tsunehiko; Katoh, Naoki
Conference paper

Non-Approximability and Polylogarithmic Approximations of the Single-sink Unsplittable and Confluent Dynamic Flow Problems

Leibniz International Proceedings in Informatics, LIPIcs, v. 92, December 2017
Golin, Mordecai J.; Khodabande, Hadi; Qin, Bo
Conference paper

2016 3

Encoding 2D range maximum queries

Theoretical Computer Science, v. 609, January 2016, p. 316-327
Golin, Mordecai Jay; Iacono, John; Krizanc, Danny; Raman, Rajeev; Satti, Srinivasa Rao; Shende, Sunil M.
Article

The channel capacity of read/write isolated memory

Discrete Applied Mathematics, v. 198, January 2016, p. 264-273
Wang, Chuanlong; Yong, Xuerong; Golin, Mordecai Jay
Article

Sink Evacuation on Trees with Dynamic Confluent Flows

Leibniz International Proceedings in Informatics, LIPIcs, v. 64, December 2016, p. 25.1-25.13
Chen, Di; Golin, Mordecai Jay
Conference paper

2015 4

Minimax regret 1-sink location problem in dynamic path networks

Theoretical Computer Science, v. 588, July 2015, p. 24-36
Higashikawa, Yuya; Augustine, John; Cheng, Siu-Wing; Golin, Mordecai Jay; Katoh, Naoki; Ni, Guanqun; Su, Bing; Xu, Yinfeng
Article

Multiple Sink Location Problems in Dynamic Path Networks

Theoretical Computer Science, v. 607, (Part 1), November 2015, p. 2-15
Higashikawa, Yuya; Golin, Mordecai J.; Katoh, Naoki
Article

Optimal Search Trees with 2-Way Comparisons

Algorithms and Computation: 26th International Symposium, ISAAC 2015, Proceedings, Editors: Khaled Elbassioni, Kazuhisa Makino. Berlin, Heidelberg : Springer-Verlag, 2015, p. 71-82, Part of the Lecture Notes in Computer Science book series (LNCS, volume 9472)
Chrobak, Marek; Golin, Mordecai J.; Ian munro, J.; Young, Neal
Conference paper

Scheduling with Gaps: New Models and Algorithms

Algorithms and Complexity: Proceedings, Editors: Vangelis Th. Paschos, Peter Widmayer. Cham : Springer International Publishing, 2015, p. 114-126
Chrobak, Marek; Golin, Mordecai; Lam, Tak Wah; Nogneng, Dorian
Conference paper

2014 3

Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity

Journal of Graph Algorithms and Applications, v. 18, (4), 2014, p. 539-555
Higashikawa, Yuya; Golin, Mordecai Jay; Katoh, Naoki
Article

Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 8344, 2014, p. 125-137
Higashikawa, Yuya; Golin, Mordecai Jay; Katoh, Naoki
Conference paper

Multiple Sink Location Problems in Dynamic Path Networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 8546 LNCS, 2014, p. 149-161
Higashikawa, Yuya; Golin, Mordecai J.; Katoh, Naoki
Conference paper

2013 1

Paging Mobile Users in Cellular Networks: Optimality versus Complexity and Simplicity

Theoretical Computer Science, v. 470, January 2013, p. 23-35
Bar-Noy, Amotz; Cheilaris, Panagiotis; Feng, Yi; Golin, Mordecai Jay
Article

2012 2

HUFFMAN CODING WITH LETTER COSTS: A LINEAR-TIME APPROXIMATION SCHEME

SIAM journal on computing, v. 41, (3), 2012, p. 670-713
Golin, Mordecai J.; Mathieu, Claire; Young, Neal E.
Article

Vehicle scheduling on a graph revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 7676 LNCS, 2012, p. 362-371
Yu, Wei; Golin, Mordecai Jay; Zhang, Guochuan
Conference paper

2011 1

Encoding 2D range maximum queries

22nd International Symposium on Algorithms and Computation (ISAAC'11), Yokohama, Japan, December 5-8, 2011, Article number 6033377, p. 180-189
Golin, Mordecai Jay; Iacono, John; Krizanc, Danny; Raman, Rajeev; Rao, Sattisrinivasa
Conference paper

2010 2

A dynamic programming approach to length-limited huffman coding: Space reduction with the monge property

IEEE Transactions on Information Theory, v. 56, (8), 2010, p. 3918-3929
Golin, Mordecai J.; Zhang, Yan
Article

The asymptotic number of spanning trees in circulant graphs

Discrete mathematics, v. 310, (4), 2010, p. 792-803
Golin, M.J.; Yong, X.; Zhang, Y.
Article

2009 6

Online dynamic programming speedups

Theory of Computing Systems, v. 45, (3), 2009, p. 429-445
Bar-Noy, A.; Golin, M.J.; Zhang, Y.
Article

The Knuth-Yao Quadrangle-Inequality Speedup is a Consequence of Total Monotonicity

ACM transactions on algorithms, v. 6, (1), 2009, DEC
Bein, Wolfgang; Golin, Mordecai J.; Larmore, Lawrence L.; Zhang, Yan
Article

构造移动通信中降低能耗的前缀码的动态规划加速

计算机工程与科学=Computer Engineering and Science, v. 31, (2), 2009, p. 134-137
余佳晉; 徐曉明; Golin, Mordecai Jay
Article

A generic top-down dynamic-programming approach to prefix-free coding

Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 2009, p. 758-767
Golin, Mordecai; Xu, Xiaoming; Yu, Jiajin
Conference paper

Multidimensional divide-and-conquer and weighted digital sums

11th Workshop on Algorithm Engineering and Experiments and 6th Workshop on Analytic Algorithmics and Combinatorics 2009, ALENEX 2009/ANALCO 2009, 2009, p. 232-239
Cheung, Y.K.; Flajolet, Philippe; Golin, Mordecai; Lee, C. Y. James
Conference paper

Multidimensional Divide-and-Conquer and Weighted Digital Sums

Proceedings of ANALCO 2009, 2008, December
Cheung, Y. K.; Flajolet, Philippe; Golin, Mordecai J.; Lee, James C.Y.
Conference paper

2008 2

More efficient algorithms and analyses for unequal letter cost prefix-free coding

IEEE transactions on information theory, v. 54, (8), 2008, AUG, p. 3412-3424
Golin, Mordecai; Li, Jian
Article

The number of spanning trees in a class of double fixed-step loop networks

Networks, v. 52, (2), 2008, SEP, p. 69-77
Yong, Xuerong; Zhang, Yuanping; Golin, Mordecai J.
Article

2007 5

The two-median problem on Manhattan meshes

Networks, v. 49, (3), 2007, MAY, p. 226-233
Golin, Mordecai J.; Zhang, Yan
Article

More efficient algorithms and analyses for unequal letter cost prefix-free coding

Lecture Notes in Computer Science, v. 4835, 2007, p. 329-340
Golin, Mordecai Jay; Li, J.
Conference paper

Online dynamic programming speedups

Lecture Notes in Computer Science, v. 4368, 2007, p. 43-54
Bar-Noy, A.; Golin, M.J.; Zhang, Y.
Conference paper

Paging Mobile Users Efficiently and Optimally

Proceedings of the 26th IEEE International Conference on Computer Communications (INFOCOM 2007), 1910-1918, 6-12 May 2007, Anchorage, Alaska, USA
Bar-Noy, Amotz; Feng, Yi; Golin, Mordecai
Conference paper

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 Algorithmics and Combinations, 2007, p. 242-249
Golin, Mordecai J.; Yong, Xuerong; Zhang, Yuanping
Conference paper

2006 4

Online maintenance of k-medians and k-covers on a line

Algorithmica, v. 45, (4), 2006, p. 549-567
Fleischer, R.; Golin, M.J.; Zhang, Y.
Article

Online Dynamic Programming Speedups

Proceedings of Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, pp. 43-54, September 14-15
Bar-Noy, Amotz; Golin, Mordecai; Zhang, Yan
Conference paper

Permanents of Circulants: a Transfer Matrix Approach

Proceedings of the The Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO06), Janury 2006
Golin, Mordecai; Leung, Yiu Cho; Wang, Yajun
Conference paper

The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity

Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 2006, p. 31-40
Bein, W.W.; Golin, M.J.; Larmore, L.L.; Zhang, Y.
Conference paper

2005 5

Chebyshev polynomials and spanning tree formulas for circulant and related graphs

Discrete mathematics, v. 298, (1-3, Sp. Iss. SI), 2005, AUG 6, p. 334-364
Zhang, YP; Yong, XR; Golin, MJ
Article

Curve reconstruction from noisy samples

COMPUTATIONAL geometry-theory and APPLICATIONS, v. 31, (1-2), 2005, MAY, p. 63-100
Cheng, SW; Funke, S.; Golin, M.; Kumar, P.; Poon, SH; Ramos, E.
Article

The structure of optimal prefix-free codes in restricted languages: The uniform probability case

Lecture Notes in Computer Science, v. 3608, 2005, p. 372-384
Golin, Mordecai J.; Liu, ZM
Article

Counting Structures in Grid-Graphs, Cylinders and Tori using Transfer Matrices: Survey and New Results

The Proceedings of the The Second Workshop on Analytic Algorithmics and Combinatorics (ANALCO05), January 2005
Golin, Mordecai; Leung, Yiu-Cho; Wang, Yajun; Yong, Xuerong
Conference paper

Generalizing the Kraft-McMillan Inequality to restricted languages

Data Compression Conference Proceedings, 2005, p. 163-172
Golin, Mordecai J.; Na, H.S.
Conference paper

2004 9

Competitive facility location: the Voronoi game

Theoretical Computer Science, v. 310, (1-3), 2004, JAN 1, p. 457-467
Ahn, HK; Cheng, SW; Cheong, O.; Golin, M.; van Oostrum, R.
Article

Counting spanning trees and other structures in non-constant-jump circulant graphs

Lecture Notes in Computer Science, v. 3341, 2004, p. 508-521
Golin, Mordecai J.; Leung, YC; Wang, YJ
Article

Finding optimal paths in MREP routing

Information Processing Letters, v. 89, (2), 2004, JAN 31, p. 57-63
Fleischer, Rudolf; Golin, Mordecai Jay; Lea, Chin Tau; Wong, Steven
Article

Fun-Sort - or the chaos of unordered binary search

Discrete applied mathematics, v. 144, (3), 2004, DEC 15, p. 231-236
Biedl, T.; Chan, T.; Demaine, ED; Fleischer, R.; Golin, M.; King, JA; Munro, JI
Article

Maximum residual energy routing algorithms

Information Processing Letter, Vol 89, issue 2, Jan, pp. 57-63
Fleisher, Rudolf; Golin, Mordecai; Lea, Chin Tau
Article

New upper and lower bounds on capacity of read/write isolated the channel memory

Discrete applied mathematics, v. 140, (1-3), 2004, MAY 15, p. 35-48
Golin, MJ; Yong, XR; Zhang, YP; Sheng, L.
Article

Online maintenance of k-medians and k-covers on a line

Lecture Notes in Computer Science, v. 3111, 2004, p. 102-113
Fleischer, R.; Golin, MJ; Yan, Z.
Article

Unhooking circulant graphs: A combinatorial method for counting spanning trees and other parameters

Lecture Notes in Computer Science, v. 3353, 2004, p. 296-307
Golin, Mordecai J.; Leung, YC
Article

Online Maintenance of k-Medians and k-Covers on a Line

Proceedings of SWAT 2004, pp. 102-113
Fleischer, Rudolf; Golin, Mordecai; Zhang, Yan
Conference paper

2003 8

Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets

Designs Codes and Cryptography, v. 30, (1), 2003, AUG, p. 73-84
Ding, CS; Golin, M.; Klove, T.
Article

On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes

COMPUTATIONAL geometry-theory and APPLICATIONS, v. 25, (3), 2003, JUL, p. 197-231
Golin, Mordecai J.; Na, HS
Article

Algorithms for Infinite Huffman-Codes

Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA'04). 2004
Golin, Mordecai; Ma, Kin-Keung
Conference paper

Curve reconstruction from noisy samples

Proceedings of the Annual Symposium on Computational Geometry, 2003, p. 302-311
Cheng, S.W.; Funke, S.; Golin, M.; Kumar, P.; Poon, S.H.; Ramos, E.
Conference paper

Maximum Residual Energy Routing with Reverse Energy Cost

Conference Record / IEEE Global Telecommunications Conference, v. 1, 2003, p. 564-569
Xie, Qiling; Lea, Chin Tau; Golin, Mordecai Jay; Fleischer, Rudolf
Conference paper

Maximum residual routing with backward energy cost

IEEE Globecom 2003, San Francisco, USA, Dec
Sieh, Chris; Lea, Chin Tau; Golin, Mordecai; Fleish, Rudolf
Conference paper

Recurrence relations on transfer matrices yield good lower and upper bounds on the channel capacity of some 2-dimensional constrained systems

DCC, 2003, p. 430
Golin, Mordecai J.; Leung, YC
Conference paper

Residual Energy Routing with Reverse Energy Cost

Proceedings of IEEE Globecom 2003
Lea, C.T.; Xie, Q.; Fleischer, R.; Golin, Mordecai J.
Conference paper

2002 8

Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property

Journal of algorithms, v. 42, (2), 2002, FEB, p. 277-303
Bradford, P.; Golin, Mordecai; Larmore, LL; Rytter, W.
Article

Protection of keys against modification attack

Quality and Reliability Engineering International, v. 18, (3), 2002, MAY-JUN, p. 217-230
Fung, WW; Golin, MJ; Gray, JW
Article

The convex hull for random lines in the plane

Proceedings of the Japan Conference on Discrete and Computational Geometry, Tokyo, JCDCG, Tokyo, Japan, v. 2866, 6-9 December 2002, p. 172-175
Golin, Mordecai; Langerman, S.; Steiger, W.
Article

Algebraic and combinatorial properties of the transfer matrix of the 2-dimensional (1, infinity) Runlength Limited constraint

ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, p. 354
Yong, XR; Golin, Mordecai J.
Conference paper

Further applications of Chebyshev polynomials in the derivation of spanning tree formulas for circulant graphs

Proceedings of The International Colloquium on Mathematics and Computer Science, Versailles, France, September 16-19, 541-552
Golin, Mordecai; Zhang, Yuanping
Conference paper

Huffman coding with unequal letter costs

Conference proceedings of the annual ACM Symposium on Theory of Computing, 2002, p. 785-791
Golin, M.J.; Kenyon, C.; Young, N.E.
Conference paper

New Techniques for Bounding the Channel Capacity of Read/Write Isolated Memory

Proceedings of the 2002 IEEE Data Compression Conference (Poster), 482
Yong, Xuerong; Golin, Mordecai
Conference paper

The probabilistic complexity of the Voronoi diagram of points on a polyhedron

Proceedings of the eighteenth annual symposium on Computational geometry; 05-07 June 2002
Golin, Mordecai J.; Na, Hyeon-Suk
Conference paper

2001 6

A combinatorial approach to Golomb forests

Theoretical Computer Science, v. 263, (1-2), 2001, JUL 28, p. 283-304
Golin, Mordecai J.
Article

Competitive facility location along a highway

Lecture Notes in Computer Science, v. 2108, 2001, p. 237-246
Ahn, HK; Cheng, SW; Cheong, O.; Golin, M.; van Ostrum, R.
Article

Lopsided trees, I: Analyses

Algorithmica, v. 31, (3), 2001, NOV, p. 240-290
Choi, V.; Golin, Mordecai J.
Article

Competitive facility location: the Voronoi game

Computing and Combinatorics, Proc 7th Annual International Conference (COCOON 2001), v. 2108, 2001, p. 237-246
van Oostrum, R.; Ahn, Hee-Kap; Cheng, Siu Wing; Cheong, O.; Golin, Mordecai Jay
Conference paper

Optimal prefix-free codes that end in a specified pattern and similar problems: The uniform probability case (extended abstract)

Data Compression Conference Proceedings, 2001, p. 143-152
Golin, Mordecai J.; Na, H.S.
Conference paper

Protection of keys against modification attack

Proceedings - IEEE Symposium on Security and Privacy, 2001, p. 26-36
Fung, Wai W.; Golin, Mordecai Jay; Gray, JW
Conference paper

2000 4

A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes

IEEE Transactions on Information Theory, v. 46, (4), 2000, p. 1637-1644
Chan, S.L.; Golin, M.J.
Article

An algorithm for finding a k-median in a directed tree

Information Processing Letters, v. 74, (1-2), 2000, APR 30, p. 81-88
Vigneron, Antoine; Gao, Lixin; Golin, Mordecai J.; Italiano, Giuseppe Francesco; Li, Bo
Article

The number of spanning trees in circulant graphs

Discrete mathematics, v. 223, (1-3), 2000, AUG 28, p. 337-350
Zhang, YP; Yong, XR; Golin, Mordecai J.
Article

New upper and lower bounds on the channel capacity of read/write isolated memory

IEEE International Symposium on Information Theory - Proceedings, 2000, p. 280
Golin, Mordecai; Yong, X.R.; Sheng, L.; Zhang, Y.P.
Conference paper

1999 3

On the expected depth of random circuits

COMBINATORICS Probability & COMPUTING, v. 8, (3), 1999, MAY, p. 209-227
Arya, Sunil; Golin, Mordecai Jay; Mehlhorn, Kurt
Article

Optimal point-to-point broadcast algorithms via lopsided trees

Discrete applied mathematics, v. 93, (2-3), 1999, JUL 20, p. 233-263
Golin, Mordecai Jay; Schuster, Assaf
Article

On the optimal placement of Web proxies in the Internet

Proceedings - IEEE INFOCOM, v. 3, 1999, p. 1282-1290
Li, Bo; Golin, Mordecai Jay; Italiano, Giuseppe F.; Deng, Xin; Sohraby, Kazem
Conference paper

1998 8

A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs

IEEE transactions on information theory, v. 44, (5), 1998, SEP, p. 1770-1781
Golin, Mordecai J.; Rote, G.
Article

Dog bites postman: Point location in the moving Voronoi diagram and related problems

International journal of computational geometry & applications, v. 8, (3), 1998, JUN, p. 321-342
Devillers, O.; Golin, Mordecai Jay
Article

Labelled Trees and Pairs of Input-Output Permutations in Priority Queues

Theoretical Computer Science, v. 205, (1-2), 1998, SEP 28, p. 99-114
Golin, Mordecai J; Zaks, Shmuel
Article

Randomized data structures for the dynamic closest-pair problem

SIAM journal on computing, v. 27, (4), 1998, AUG, p. 1036-1072
Golin, Moedecai Jay; Raman, R.; Schwarz, C.; Smid, M.
Article

A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes

1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, p. 45
Chan, Szelok; Golin, Mordecai Jay
Conference paper

Convergence and construction of minimal-cost infinite trees

1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, p. 227
Chow, T.; Golin, M.
Conference paper

Dynamic and distributed Web caching in active networks

WEB TECHNOLOGIES AND APPLICATIONS, 1998, p. 113-121
Li, Bo; Deng, X.; Golin, MJ; Sohraby, K.
Conference paper

On the optimal placement of web proxies in the Internet: The linear topology

IFIP International Federation for Information Processing, v. 8, 1998, p. 485-495
Li, Bo; Deng, X.; Golin, MJ; Sohraby, K.
Conference paper

1997 1

Optimal point-to-point broadcast algorithms via lopsided trees

PROCEEDINGS OF THE FIFTH ISRAELI SYMPOSIUM ON THEORY OF COMPUTING AND SYSTEMS, 1997, p. 63-73
Golin, Mordecai J.; Schuster, A.
Conference paper

1996 4

Prefix codes: Equiprobable words, unequal letter costs

SIAM journal on computing, v. 25, (6), 1996, DEC, p. 1281-1292
Golin, MJ; Young, N.
Article

Queries on Voronoi diagrams of moving points

COMPUTATIONAL geometry-theory and APPLICATIONS, v. 6, (5), 1996, SEP, p. 315-327
Devillers, O.; Golin, Mordecai, J.; Kedem, K.; Schirra, S.
Article

Limit theorems for minimum-weight triangulations, other Euclidean Functionals, and probabilistic recurrence relations

PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1996, p. 252-260
Golin, Mordecai J.
Conference paper

Lopsided trees: Analyses, Algorithms, and Applications

Lecture Notes in Computer Science, v. 1099, 1996, p. 538-549
Choi, Vicky Siu Ngan; Golin, Mordecai
Conference paper

1995 5

A Simple Randomized Closest Pair Algorithm

Nordic Journal on Computing, v. 2, 1995, p. 3-27
Golin, Mordecai J.; Raman, R.; Schwarz, C.; Smid, M.
Article

Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas

Information Processing Letters, v. 56, (3), p. 157-164
Devillers, Olivier; Golin, Mordecai J.
Article

The Multi-Weighted Spanning Tree Problem

Lecture Notes in Computer Science, v. 959, 1995, p. 141-150
Ganley, Joseph L.; Golin, Mordecai J; Salowe, Jeffrey S.
Article

A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes for Unequal Letter Costs

Lecture Notes in Computer Science, v. 944, 1995, p. 257-267
Golin, Mordecai J; Rote, Gunter
Conference paper

Mimimum Spanning Trees forMultiplyWeighted Graphs

Proceedings of the First International Computing and Combinatorics Conference, 1995, p. 141-150
Ganley, J.; Golin, Mordecai J.; Salowe, J.
Conference paper

1994 4

A provably fast linear-expected-time maxima-finding algorithm

Algorithmica, v. 11, (6), 1994, p. 501-524
Golin, Mordecai J.
Article

MELLIN TRANSFORMS AND ASYMPTOTICS - THE MERGESORT RECURRENCE

Acta Informatica, v. 31, (7), 1994, OCT, p. 673-696
FLAJOLET, P.; GOLIN, M.
Article

Newton"s Method for Quadratics and Nested Intervals

Complex Systems, v. 8, 1994, p. 161-180
Golin, Mordecai J.; Supowit, K.
Article

Prefix Codes: Equiprobable Words, Unequal Letter Costs

Proceedings of the 21st International Colloquim on Automata Languages and Programming, 1994, p. 605-617
Golin, Mordecai J.; Young, N.
Conference paper

1993 6

How many maxima can there be?

Computational geometry, v. 2, (6), 1993, p. 335-353
Golin, Mordecai J.
Article

QUEUE-MERGESORT

Information Processing Letters, v. 48, (5), 1993, DEC 10, p. 253-259
GOLIN, MJ; SEDGEWICK, R.
Article

Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems

Proceedings of the First Annual European Symposium on Algorithms, 1993, p. 133-144
Devillers, O.; Golin, Mordecai J.
Conference paper

Exact Asymptotics of Divide-and-Conquer Recurrences

Proceedings of the 20th International Colloquim on Automata Languages and Programming, 1993, p. 137-149
Flajolet, P.; Golin, Mordecai J.
Conference paper

Maxima in convex regions

Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms; 25-27 Jan. 1993
Golin, Mordecai J.
Conference paper

Randomized data structures for the dynamic closest-pair problem

Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 1993, p. 301-310
Golin, Mordecai; Raman, Rajeev; Schwarz, Christian; Smid, Michiel
Conference paper

1992 2

Dynamic Closest Pairs: A Probabilistic Approach

Proceedings of the Third Scandinavian Workshop on Algorithm Theory, 1992, p. 340-351
Golin, Mordecai J.
Conference paper

Further Dynamic Computational Geometry

Proceedings of the Third Scandinavian Workshop on Algorithm Theory (SWAT '92), 1992
Golin, Mordecai J.; Smid, M.
Conference paper

1988 1

Analysis of a Simple yet Efficient Convex Hull Algorithm

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988, p. 153-163
Golin, Mordecai J.; Sedgewick, R.
Conference paper

No Publications

Teaching Assignment

2022-23 Spring 3 2022-23 Winter 0 2022-23 Fall 4 2021-22 Summer 2 2021-22 Spring 4 2021-22 Winter 0

COMP4900	Academic and Professional Development
COMP4981	Final Year Project
CPEG4901	Computer Engineering Final Year Project in COMP

COMP1021	Introduction to Computer Science
COMP4900	Academic and Professional Development
COMP4981	Final Year Project
UROP1100H	Undergraduate Research Opportunities Series 1

COMP4981	Final Year Project
UROP1100G	Undergraduate Research Opportunities Series 1

COMP4900	Academic and Professional Development
COMP4981	Final Year Project
COMP4981H	Final Year Thesis
CPEG4901	Computer Engineering Final Year Project in COMP

No Teaching Assignments

Research Postgraduate (RPG) Supervision

From January 2020 to December 2023 (As of 31 May 2023)

All Supervisions Current RPGs Graduated RPGs

Current RPGs

Doctor of Philosophy

GAN, Jinxiang
Computer Science and Engineering

Graduated RPGs

Master of Philosophy

CHAN, Siu Chung
Computer Science and Engineering( Completed in 2022 )
NG, Ting Yin (co-supervision)
Social Science( Completed in 2021 )

Projects

From January 2021 to December 2023

All Projects 2

No Projects.
A Geometric Analysis of Almost Instantaneous Codes and Other Markov-Chain Based Coding Problems

近乎即時編碼方法與其他以馬爾可夫鏈為基礎的編碼問題的幾何分析 Leading

RGC - General Research Fund
Project Team (HKUST)
GOLIN Mordecai Jay (Lead)
2022 -
Alphabetic Trees Revisited

重新審視字母樹 Leading

RGC - General Research Fund
Project Team (HKUST)
GOLIN Mordecai Jay (Lead)
2018 - 2022