Analysis of a Simple Yet Efficient Convex Hull Algorithm. - Mordecai J. Golin; Robert Sedgewick (SCG, 1988)

Dynamic Closest Pairs - A Probabilistic Approach. - Mordecai J. Golin (SWAT, 1992)

How Many Maxima Can There Be? - Mordecai J. Golin (Comput. Geom., 1992)

Exact Asymptotics of Divide-and-Conquer Recurrences. - Philippe Flajolet; Mordecai J. Golin (ICALP, 1993)

Maxima in Convex Regions. - Mordecai J. Golin (SODA, 1993)

Queue-Mergesort. - Mordecai J. Golin; Robert Sedgewick (Inf. Process. Lett., 1993)

Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points. - Olivier Devillers; Mordecai J. Golin; Klara Kedem; Stefan Schirra (CCCG, 1994)

Mellin Transforms and Asymptotics: The Mergesort Recurrence. - Philippe Flajolet; Mordecai J. Golin (Acta Informatica, 1994)

A Provably Fast Linear-Expected-Time Maxima-Finding Algorithm. - Mordecai J. Golin (Algorithmica, 1994)

Newton's Method for Quadratics, and Nested Intervals. - Mordecai J. Golin; Kenneth J. Supowit (Complex Syst., 1994)

The Multi-Weighted Spanning Tree Problem (Extended Abstract). - Joseph L. Ganley; Mordecai J. Golin; Jeffrey S. Salowe (COCOON, 1995)

A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs. - Mordecai J. Golin; Günter Rote (ICALP, 1995)

Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. - Olivier Devillers; Mordecai J. Golin (Inf. Process. Lett., 1995)

Simple Randomized Algorithms for Closest Pair Problems. - Mordecai J. Golin; Rajeev Raman; Christian Schwarz 002; Michiel H. M. Smid (Nord. J. Comput., 1995)

Lopsided Trees: Analyses, Algorithms, and Applications. - Vicky Siu-Ngan Choi; Mordecai J. Golin (ICALP, 1996)

Limit Theorems for Minimum-Weight Triangulations, Other Euclidean Functionals, and Probabilistic Recurrence Relations (Extended Abstract). - Mordecai J. Golin (SODA, 1996)

Queries on Voronoi Diagrams of Moving Points. - Olivier Devillers; Mordecai J. Golin; Klara Kedem; Stefan Schirra (Comput. Geom., 1996)

Prefix Codes: Equiprobable Words, Unequal Letter Costs. - Mordecai J. Golin; Neal E. Young (SIAM J. Comput., 1996)

On the Optimal Placement of Web Proxies in the Internet: The Linear Topology. - Bo Li 001; Xin Deng 001; Mordecai J. Golin; Kazem Sohraby (HPN, 1998)

Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems. - Olivier Devillers; Mordecai J. Golin (Int. J. Comput. Geom. Appl., 1998)

Randomized Data Structures for the Dynamic Closest-Pair Problem. - Mordecai J. Golin; Rajeev Raman; Christian Schwarz 002; Michiel H. M. Smid (SIAM J. Comput., 1998)

Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. - Mordecai J. Golin; Shmuel Zaks (Theor. Comput. Sci., 1998)

A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs. - Mordecai J. Golin; Günter Rote (IEEE Trans. Inf. Theory, 1998)

On the Optimal Placement of Web Proxies in the Internet. - Bo Li 001; Mordecai J. Golin; Giuseppe F. Italiano; Xin Deng 001; Kazem Sohraby (INFOCOM, 1999)

Optimal Point-to-point Broadcast Algorithms Via Lopsided Trees. - Mordecai J. Golin; Assaf Schuster (Discret. Appl. Math., 1999)

The number of spanning trees in circulant graphs. - Yuanping Zhang; Xuerong Yong; Mordecai J. Golin (Discret. Math., 2000)

An algorithm for finding a k-median in a directed tree. - Antoine Vigneron; Lixin Gao; Mordecai J. Golin; Giuseppe F. Italiano; Bo Li 001 (Inf. Process. Lett., 2000)

A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes. - Sze-Lok Chan; Mordecai J. Golin (IEEE Trans. Inf. Theory, 2000)

Competitive Facility Location along a Highway. - Hee-Kap Ahn; Siu-Wing Cheng; Otfried Cheong; Mordecai J. Golin; René van Oostrum (COCOON, 2001)

Optimal Prefix-Free Codes That End in a Specified Pattern and Similar Problems: The Uniform Probability Case. - Mordecai J. Golin; Hyeon-Suk Na (Data Compression Conference, 2001)

Protection of Keys against Modification Attack. - Wai W. Fung; Mordecai J. Golin; James W. Gray III (S&P, 2001)

Lopsided Trees, I: Analyses. - Vicky Siu-Ngan Choi; Mordecai J. Golin (Algorithmica, 2001)

A combinatorial approach to Golomb forests. - Mordecai J. Golin (Theor. Comput. Sci., 2001)

The probabilistic complexity of the Voronoi diagram of points on a polyhedron. - Mordecai J. Golin; Hyeon-Suk Na (SCG, 2002)

New Techniques for Bounding the Channel Capacity of Read/Write Isolated Memor. - Xuerong Yong; Mordecai J. Golin (DCC, 2002)

The Convex Hull for Random Lines in the Plane. - Mordecai J. Golin; Stefan Langerman; William L. Steiger (JCDCG, 2002)

Huffman coding with unequal letter costs. - Mordecai J. Golin; Claire Kenyon; Neal E. Young (STOC, 2002)

Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. - Phillip G. Bradford; Mordecai J. Golin; Lawrence L. Larmore; Wojciech Rytter (J. Algorithms, 2002)

Recurrence Relations on Transfer Matrices Yield Good Lower and Upper Bounds on the Channel Capacity of Some 2-Dimensional Constrained Systems (Extended Abstract). - Mordecai J. Golin; Yiu-Cho Leung (DCC, 2003)

Maximum residual energy routing with reverse energy cost. - Qiling Xie; Chin-Tau A. Lea; Mordecai J. Golin; Rudolf Fleischer (GLOBECOM, 2003)

On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes. - Mordecai J. Golin; Hyeon-Suk Na (Comput. Geom., 2003)

Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets. - Cunsheng Ding; Mordecai J. Golin; Torleiv Kløve (Des. Codes Cryptogr., 2003)

Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs. - Mordecai J. Golin; Yiu-Cho Leung; Yajun Wang (ISAAC, 2004)

Algorithms for infinite huffman-codes. - Mordecai J. Golin; Kin Keung Ma (SODA, 2004)

Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters. - Mordecai J. Golin; Yiu-Cho Leung (WG, 2004)

Fun-Sort–or the chaos of unordered binary search. - Therese Biedl; Timothy M. Chan; Erik D. Demaine; Rudolf Fleischer; Mordecai J. Golin; James A. King; J. Ian Munro (Discret. Appl. Math., 2004)

New upper and lower bounds on the channel capacity of read/write isolated memory. - Mordecai J. Golin; Xuerong Yong; Yuanping Zhang; Li Sheng 001 (Discret. Appl. Math., 2004)

Finding optimal paths in MREP routing. - Rudolf Fleischer; Mordecai J. Golin; Chin-Tau A. Lea; Steven Wong (Inf. Process. Lett., 2004)

Competitive facility location: the Voronoi game. - Hee-Kap Ahn; Siu-Wing Cheng; Otfried Cheong; Mordecai J. Golin; René van Oostrum (Theor. Comput. Sci., 2004)

Counting Structures in Grid Graphs, Cylinders and Tori Using Transfer Matrices: Survey and New Results. - Mordecai J. Golin; Yiu-Cho Leung; Yajun Wang; Xuerong Yong (ALENEX/ANALCO, 2005)

Generalizing the Kraft-McMillan Inequality to Restricted Languages. - Mordecai J. Golin; Hyeon-Suk Na (DCC, 2005)

The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case. - Mordecai J. Golin; Zhenming Liu (WADS, 2005)

Curve reconstruction from noisy samples. - Siu-Wing Cheng; Stefan Funke; Mordecai J. Golin; Piyush Kumar; Sheung-Hung Poon; Edgar A. Ramos (Comput. Geom., 2005)

Chebyshev polynomials and spanning tree formulas for circulant and related graphs. - Yuanping Zhang; Xuerong Yong; Mordecai J. Golin (Discret. Math., 2005)

Permanents of Circulants: A Transfer Matrix Approach. - Mordecai J. Golin; Yiu-Cho Leung; Yajun Wang (ANALCO, 2006)

Online Maintenance of k-Medians and k-Covers on a Line. - Rudolf Fleischer; Mordecai J. Golin; Yan Zhang 021 (Algorithmica, 2006)

Paging Mobile Users Efficiently and Optimally. - Amotz Bar-Noy; Yi Feng 002; Mordecai J. Golin (INFOCOM, 2007)

The two-median problem on Manhattan meshes. - Mordecai J. Golin; Yan Zhang 021 (Networks, 2007)

A Dynamic Programming Approach To Length-Limited Huffman Coding - Mordecai J. Golin; Yan Zhang 021 (CoRR, 2008)

The number of spanning trees in a class of double fixed-step loop networks. - Xuerong Yong; Yuanping Zhang; Mordecai J. Golin (Networks, 2008)

More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. - Mordecai J. Golin; Jian Li 015 (IEEE Trans. Inf. Theory, 2008)

Multidimensional Divide-and-Conquer and Weighted Digital Sums. - Yun Kuen Cheung; Philippe Flajolet; Mordecai J. Golin; C. Y. James Lee (ANALCO, 2009)

A generic top-down dynamic-programming approach to prefix-free coding. - Mordecai J. Golin; Xiaoming Xu; Jiajin Yu (SODA, 2009)

Online Dynamic Programming Speedups. - Amotz Bar-Noy; Mordecai J. Golin; Yan Zhang 021 (Theory Comput. Syst., 2009)

The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity. - Wolfgang W. Bein; Mordecai J. Golin; Lawrence L. Larmore; Yan Zhang 021 (ACM Trans. Algorithms, 2009)

The asymptotic number of spanning trees in circulant graphs. - Mordecai J. Golin; Xuerong Yong; Yuanping Zhang (Discret. Math., 2010)

A dynamic programming approach to length-limited Huffman coding: space reduction with the Monge property. - Mordecai J. Golin; Yan Zhang 021 (IEEE Trans. Inf. Theory, 2010)

Encoding 2D Range Maximum Queries. - Mordecai J. Golin; John Iacono; Danny Krizanc; Rajeev Raman; S. Srinivasa Rao 001 (ISAAC, 2011)

Encoding 2-D Range Maximum Queries - Mordecai J. Golin; John Iacono; Danny Krizanc; Rajeev Raman; S. Srinivasa Rao 001 (CoRR, 2011)

Vehicle Scheduling on a Graph Revisited. - Wei Yu 010; Mordecai J. Golin; Guochuan Zhang (ISAAC, 2012)

Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme. - Mordecai J. Golin; Claire Mathieu; Neal E. Young (SIAM J. Comput., 2012)

Paging mobile users in cellular networks: Optimality versus complexity and simplicity. - Amotz Bar-Noy; Panagiotis Cheilaris; Yi Feng 002; Mordecai J. Golin (Theor. Comput. Sci., 2013)

A Polynomial Time Algorithm for Minimax-Regret Evacuation on a Dynamic Path. - Guru Prakash Arumugam; John Augustine; Mordecai J. Golin; Prashanth Srikanthan (CoRR, 2014)

Improved Algorithms for Multiple Sink Location Problems in Dynamic Path Networks. - Yuya Higashikawa; Mordecai J. Golin; Naoki Katoh (CoRR, 2014)

Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity. - Yuya Higashikawa; Mordecai J. Golin; Naoki Katoh (J. Graph Algorithms Appl., 2014)

Optimal Search Trees with 2-Way Comparisons. - Marek Chrobak; Mordecai J. Golin; J. Ian Munro; Neal E. Young (ISAAC, 2015)

Optimal search trees with equality tests. - Marek Chrobak; Mordecai J. Golin; J. Ian Munro; Neal E. Young (CoRR, 2015)

Minimax regret 1-sink location problem in dynamic path networks. - Yuya Higashikawa; John Augustine; Siu-Wing Cheng; Mordecai J. Golin; Naoki Katoh; Guanqun Ni; Bing Su 002; Yin-Feng Xu (Theor. Comput. Sci., 2015)

Multiple sink location problems in dynamic path networks. - Yuya Higashikawa; Mordecai J. Golin; Naoki Katoh (Theor. Comput. Sci., 2015)

Sink Evacuation on Trees with Dynamic Confluent Flows. - Di Chen; Mordecai J. Golin (ISAAC, 2016)

Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities. - Guru Prakash Arumugam; John Augustine; Mordecai J. Golin; Yuya Higashikawa; Naoki Katoh; Prashanth Srikanthan (CoRR, 2016)

Improved Algorithms for Computing k-Sink on Dynamic Path Networks. - Binay K. Bhattacharya; Mordecai J. Golin; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (CoRR, 2016)

Minmax Tree Facility Location and Sink Evacuation with Dynamic Confluent Flows. - Di Chen; Mordecai J. Golin (CoRR, 2016)

The channel capacity of read/write isolated memory. - Chuan-Long Wang; Xuerong Yong; Mordecai J. Golin (Discret. Appl. Math., 2016)

Encoding 2D range maximum queries. - Mordecai J. Golin; John Iacono; Danny Krizanc; Rajeev Raman; Srinivasa Rao Satti; Sunil M. Shende (Theor. Comput. Sci., 2016)

Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems. - Mordecai J. Golin; Hadi Khodabande; Bo Qin (ISAAC, 2017)

Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks. - Binay Bhattacharya; Mordecai J. Golin; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (WADS, 2017)

Dynamic Trees with Almost-Optimal Access Cost. - Mordecai J. Golin; John Iacono; Stefan Langerman; J. Ian Munro; Yakov Nekrich (ESA, 2018)

Minmax-Regret k-Sink Location on a Dynamic Tree Network with Uniform Capacities. - Mordecai J. Golin; Sai Sandeep (CoRR, 2018)

Smoothed Analysis of the Expected Number of Maximal Points in Two Dimensions. - Josep Díaz; Mordecai J. Golin (CoRR, 2018)

The Expected Number of Maximal Points of the Convolution of Two 2-D Distributions. - Josep Díaz; Mordecai J. Golin (APPROX-RANDOM, 2019)

Polynomial Time Algorithms for Constructing Optimal AIFV Codes. - Mordecai J. Golin; Elfarouk Harb (DCC, 2019)

Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform Capacities. - Guru Prakash Arumugam; John Augustine; Mordecai J. Golin; Prashanth Srikanthan (Algorithmica, 2019)

Minmax Regret for sink location on paths with general capacities. - Mordecai J. Golin; Sai Sandeep (CoRR, 2019)

The transfer matrices and the capacity of the 2-dimensional (1, ∞)-runlength limited constraint. - Zhibing Chen; Mordecai J. Golin; Xuerong Yong (Discret. Math., 2019)

Polynomial Time Algorithms for Constructing Optimal Binary AIFV-2 Codes. - Mordecai J. Golin; Elfarouk Harb (CoRR, 2020)

On the cost of unsuccessful searches in search trees with two-way comparisons. - Marek Chrobak; Mordecai J. Golin; J. Ian Munro; Neal E. Young (Inf. Comput., 2021)

Scheduling with gaps: new models and algorithms. - Marek Chrobak; Mordecai J. Golin; Tak Wah Lam; Dorian Nogneng (J. Sched., 2021)

Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries. - Mordecai J. Golin; Elfarouk Harb (Theor. Comput. Sci., 2021)

Speeding Up AIFV-m Dynamic Programs by m-1 Orders of Magnitude. - Mordecai J. Golin; Albert John L. Patupat (ISIT, 2022)

On Huang and Wong's algorithm for generalized binary split trees. - Marek Chrobak; Mordecai J. Golin; J. Ian Munro; Neal E. Young (Acta Informatica, 2022)

Minmax regret for sink location on dynamic flow paths with general capacities. - Mordecai J. Golin; Sai Sandeep (Discret. Appl. Math., 2022)

A Simple Algorithm for Optimal Search Trees with Two-way Comparisons. - Marek Chrobak; Mordecai J. Golin; J. Ian Munro; Neal E. Young (ACM Trans. Algorithms, 2022)

Fully Dynamic k-Center in Low Dimensions via Approximate Furthest Neighbors. - Jinxiang Gan; Mordecai J. Golin (CoRR, 2023)

Fair k-Center: a Coreset Approach in Low Dimensions. - Jinxiang Gan; Mordecai J. Golin; Zonghan Yang; Yuhao Zhang 001 (CoRR, 2023)

Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows. - Di Chen; Mordecai J. Golin (Algorithmica, 2023)

A Polynomial Time Algorithm for Constructing Optimal Binary AIFV-2 Codes. - Mordecai J. Golin; Elfarouk Harb (IEEE Trans. Inf. Theory, 2023)

Scheduling on a graph with release times. - Wei Yu 010; Mordecai J. Golin; Guochuan Zhang (J. Sched., 2023)

Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes. - Mordecai J. Golin; Reza Hosseini Dolatabadi; Arian Zamani (ISIT, 2024)

A (Weakly) Polynomial Algorithm for AIVF Coding. - Mordecai J. Golin; Reza Hosseini Dolatabadi; Arian Zamani (ISIT, 2024)

Fully Dynamic k-Center in Low Dimensions via Approximate Furthest Neighbors. - Jinxiang Gan; Mordecai J. Golin (SOSA, 2024)

The Markov-Chain Polytope with Applications. - Mordecai J. Golin; Albert John Lalim Patupat (CoRR, 2024)

Improved algorithms for optimal k sink location on path networks. - Binay Bhattacharya; Mordecai J. Golin; Yuya Higashikawa; Tsunehiko Kameda; Naoki Katoh (Theor. Comput. Sci., 2025)