| 2024 | ISIT | Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes. | Mordecai J. Golin, Reza Hosseini Dolatabadi, Arian Zamani |
| 2024 | ISIT | A (Weakly) Polynomial Algorithm for AIVF Coding. | Mordecai J. Golin, Reza Hosseini Dolatabadi, Arian Zamani |
| 2022 | ISIT | Speeding Up AIFV-m Dynamic Programs by m-1 Orders of Magnitude. | Mordecai J. Golin, Albert John L. Patupat |
| 2019 | DCC | Polynomial Time Algorithms for Constructing Optimal AIFV Codes. | Mordecai J. Golin, Elfarouk Harb |
| 2018 | ESA | Dynamic Trees with Almost-Optimal Access Cost. | Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich |
| 2017 | ISAAC | Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems. | Mordecai J. Golin, Hadi Khodabande, Bo Qin |
| 2017 | WADS | Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks. | Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh |
| 2016 | ISAAC | Sink Evacuation on Trees with Dynamic Confluent Flows. | Di Chen, Mordecai J. Golin |
| 2015 | CIAC | Scheduling with Gaps: New Models and Algorithms. | Marek Chrobak, Mordecai J. Golin, Tak Wah Lam, Dorian Nogneng |
| 2015 | ISAAC | Optimal Search Trees with 2-Way Comparisons. | Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young |
| 2014 | AAIM | Multiple Sink Location Problems in Dynamic Path Networks. | Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh |
| 2014 | WALCOM | Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity. | Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh |
| 2012 | ISAAC | Vehicle Scheduling on a Graph Revisited. | Wei Yu, Mordecai J. Golin, Guochuan Zhang |
| 2011 | ISAAC | Encoding 2D Range Maximum Queries. | Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao |
| 2009 | SODA | A generic top-down dynamic-programming approach to prefix-free coding. | Mordecai J. Golin, Xiaoming Xu, Jiajin Yu |
| 2007 | INFOCOM | Paging Mobile Users Efficiently and Optimally. | Amotz Bar-Noy, Yi Feng, Mordecai J. Golin |
| 2007 | ISAAC | More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. | Mordecai J. Golin, Jian Li |
| 2006 | SODA | The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity. | Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang |
| 2006 | WAOA | Online Dynamic Programming Speedups. | Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang |
| 2005 | ALENEX | 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 |
| 2005 | DCC | Generalizing the Kraft-McMillan Inequality to Restricted Languages. | Mordecai J. Golin, Hyeon-Suk Na |
| 2005 | WADS | The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case. | Mordecai J. Golin, Zhenming Liu |
| 2004 | ISAAC | Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs. | Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang |
| 2004 | SODA | Algorithms for infinite huffman-codes. | Mordecai J. Golin, Kin Keung Ma |
| 2004 | WG | Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters. | Mordecai J. Golin, Yiu-Cho Leung |
| 2003 | DCC | 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 |
| 2003 | GLOBECOM | Maximum residual energy routing with reverse energy cost. | Qiling Xie, Chin-Tau A. Lea, Mordecai J. Golin, Rudolf Fleischer |
| 2002 | DCC | New Techniques for Bounding the Channel Capacity of Read/Write Isolated Memor. | Xuerong Yong, Mordecai J. Golin |
| 2002 | STOC | Huffman coding with unequal letter costs. | Mordecai J. Golin, Claire Kenyon, Neal E. Young |
| 2001 | COCOON | Competitive Facility Location along a Highway. | Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, Ren van Oostrum |
| 2001 | DCC | Optimal Prefix-Free Codes That End in a Specified Pattern and Similar Problems: The Uniform Probability Case. | Mordecai J. Golin, Hyeon-Suk Na |
| 2001 | SP | Protection of Keys against Modification Attack. | Wai W. Fung, Mordecai J. Golin, James W. Gray III |
| 1999 | INFOCOM | On the Optimal Placement of Web Proxies in the Internet. | Bo Li, Mordecai J. Golin, Giuseppe F. Italiano, Xin Deng, Kazem Sohraby |
| 1998 | ESA | 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 |
| 1996 | ICALP | Lopsided Trees: Analyses, Algorithms, and Applications. | Vicky Siu-Ngan Choi, Mordecai J. Golin |
| 1996 | SODA | Limit Theorems for Minimum-Weight Triangulations, Other Euclidean Functionals, and Probabilistic Recurrence Relations (Extended Abstract). | Mordecai J. Golin |
| 1995 | COCOON | The Multi-Weighted Spanning Tree Problem (Extended Abstract). | Joseph L. Ganley, Mordecai J. Golin, Jeffrey S. Salowe |
| 1995 | ICALP | A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs. | Mordecai J. Golin, Gnter Rote |
| 1994 | ICALP | Prefix Codes: Equiprobable Words, Unequal Letter Costs. | Mordecai J. Golin, Neal E. Young |
| 1994 | WG | Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. | Mordecai J. Golin, Shmuel Zaks |
| 1993 | ESA | Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems. | Olivier Devillers, Mordecai J. Golin |
| 1993 | ICALP | Exact Asymptotics of Divide-and-Conquer Recurrences. | Philippe Flajolet, Mordecai J. Golin |
| 1993 | SODA | Maxima in Convex Regions. | Mordecai J. Golin |
| 1993 | SODA | Randomized Data Structures for the Dynamic Closest-Pair Problem. | Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid |