Mordecai J. Golin

147 papers A* 13A 3B 22C 2Misc 2Journal 85Unranked 19

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Improved algorithms for optimal k sink location on path networks. Theor. Comput. Sci. Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2024	B	`conf`	A (Weakly) Polynomial Algorithm for AIVF Coding. ISIT Mordecai J. Golin, Reza Hosseini Dolatabadi, Arian Zamani
2024	J	`jnl`	A (Weakly) Polynomial Algorithm for AIVF Coding. CoRR Reza Hosseini Dolatabadi, Mordecai J. Golin, Arian Zamani
2024	B	`conf`	Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes. ISIT Mordecai J. Golin, Reza Hosseini Dolatabadi, Arian Zamani
2024	J	`jnl`	Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes. CoRR Reza Hosseini Dolatabadi, Mordecai J. Golin, Arian Zamani
2024	—	`conf`	Fully Dynamic SOSA Jinxiang Gan, Mordecai J. Golin
2024	J	`jnl`	The Markov-Chain Polytope with Applications. CoRR Mordecai J. Golin, Albert John Lalim Patupat
2023	J	`jnl`	A Polynomial Time Algorithm for Constructing Optimal Binary AIFV-2 Codes. IEEE Trans. Inf. Theory Mordecai J. Golin, Elfarouk Harb
2023	J	`jnl`	Fair k-Center: a Coreset Approach in Low Dimensions. CoRR Jinxiang Gan, Mordecai J. Golin, Zonghan Yang, Yuhao Zhang
2023	J	`jnl`	Fully Dynamic k-Center in Low Dimensions via Approximate Furthest Neighbors. CoRR Jinxiang Gan, Mordecai J. Golin
2023	J	`jnl`	Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows. Algorithmica Di Chen, Mordecai J. Golin
2023	J	`jnl`	Scheduling on a graph with release times. J. Sched. Wei Yu, Mordecai J. Golin, Guochuan Zhang
2022	J	`jnl`	A Simple Algorithm for Optimal Search Trees with Two-way Comparisons. ACM Trans. Algorithms Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2022	J	`jnl`	Minmax regret for sink location on dynamic flow paths with general capacities. Discret. Appl. Math. Mordecai J. Golin, Sai Sandeep
2022	J	`jnl`	On Huang and Wong's algorithm for generalized binary split trees. Acta Informatica Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2022	B	`conf`	Speeding Up AIFV-m Dynamic Programs by m-1 Orders of Magnitude. ISIT Mordecai J. Golin, Albert John L. Patupat
2021	J	`jnl`	A Simple Algorithm for Optimal Search Trees with Two-Way Comparisons. CoRR Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2021	J	`jnl`	On the Cost of Unsuccessful Searches in Search Trees with Two-way Comparisons. CoRR Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2021	J	`jnl`	On the cost of unsuccessful searches in search trees with two-way comparisons. Inf. Comput. Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2021	J	`jnl`	Scheduling with gaps: new models and algorithms. J. Sched. Marek Chrobak, Mordecai J. Golin, Tak Wah Lam, Dorian Nogneng
2021	J	`jnl`	Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries. Theor. Comput. Sci. Mordecai J. Golin, Elfarouk Harb
2020	J	`jnl`	Polynomial Time Algorithms for Constructing Optimal Binary AIFV-2 Codes. CoRR Mordecai J. Golin, Elfarouk Harb
2020	J	`jnl`	Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries. CoRR Mordecai J. Golin, Elfarouk Harb
2019	J	`jnl`	Minmax Regret for sink location on paths with general capacities. CoRR Mordecai J. Golin, Sai Sandeep
2019	J	`jnl`	Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform Capacities. Algorithmica Guru Prakash Arumugam, John Augustine, Mordecai J. Golin, Prashanth Srikanthan
2019	J	`jnl`	On Huang and Wong's Algorithm for Generalized Binary Split Trees. CoRR Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2019	B	`conf`	Polynomial Time Algorithms for Constructing Optimal AIFV Codes. DCC Mordecai J. Golin, Elfarouk Harb
2019	—	`conf`	The Expected Number of Maximal Points of the Convolution of Two 2-D Distributions. APPROX-RANDOM Josep Díaz, Mordecai J. Golin
2019	J	`jnl`	The transfer matrices and the capacity of the 2-dimensional (1, ∞)-runlength limited constraint. Discret. Math. Zhibing Chen, Mordecai J. Golin, Xuerong Yong
2018	A	`conf`	Dynamic Trees with Almost-Optimal Access Cost. ESA Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich
2018	J	`jnl`	Dynamic Trees with Almost-Optimal Access Cost. CoRR Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich
2018	J	`jnl`	Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows. CoRR Di Chen, Mordecai J. Golin
2018	J	`jnl`	Minmax-Regret k-Sink Location on a Dynamic Tree Network with Uniform Capacities. CoRR Mordecai J. Golin, Sai Sandeep
2018	J	`jnl`	Smoothed Analysis of the Expected Number of Maximal Points in Two Dimensions. CoRR Josep Díaz, Mordecai J. Golin
2017	B	`conf`	Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks. WADS Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2017	B	`conf`	Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems. ISAAC Mordecai J. Golin, Hadi Khodabande, Bo Qin
2017	J	`jnl`	Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems. CoRR Mordecai J. Golin, Hadi Khodabande, Bo Qin
2016	J	`jnl`	Encoding 2D range maximum queries. Theor. Comput. Sci. Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, Srinivasa Rao Satti, Sunil M. Shende
2016	J	`jnl`	Improved Algorithms for Computing k-Sink on Dynamic Path Networks. CoRR Binay K. Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh
2016	J	`jnl`	Minmax Tree Facility Location and Sink Evacuation with Dynamic Confluent Flows. CoRR Di Chen, Mordecai J. Golin
2016	J	`jnl`	Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities. CoRR Guru Prakash Arumugam, John Augustine, Mordecai J. Golin, Yuya Higashikawa, Naoki Katoh, Prashanth Srikanthan
2016	B	`conf`	Sink Evacuation on Trees with Dynamic Confluent Flows. ISAAC Di Chen, Mordecai J. Golin
2016	J	`jnl`	The channel capacity of read/write isolated memory. Discret. Appl. Math. Chuan-Long Wang, Xuerong Yong, Mordecai J. Golin
2015	J	`jnl`	Minimax regret 1-sink location problem in dynamic path networks. Theor. Comput. Sci. Yuya Higashikawa, John Augustine, Siu-Wing Cheng, Mordecai J. Golin, Naoki Katoh, Guanqun Ni, Bing Su, Yin-Feng Xu
2015	J	`jnl`	Multiple sink location problems in dynamic path networks. Theor. Comput. Sci. Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh
2015	B	`conf`	Optimal Search Trees with 2-Way Comparisons. ISAAC Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2015	J	`jnl`	Optimal search trees with equality tests. CoRR Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young
2015	C	`conf`	Scheduling with Gaps: New Models and Algorithms. CIAC Marek Chrobak, Mordecai J. Golin, Tak Wah Lam, Dorian Nogneng
2014	J	`jnl`	A Polynomial Time Algorithm for Minimax-Regret Evacuation on a Dynamic Path. CoRR Guru Prakash Arumugam, John Augustine, Mordecai J. Golin, Prashanth Srikanthan
2014	J	`jnl`	Improved Algorithms for Multiple Sink Location Problems in Dynamic Path Networks. CoRR Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh
2014	B	`conf`	Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity. WALCOM Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh
2014	J	`jnl`	Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity. J. Graph Algorithms Appl. Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh
2014	C	`conf`	Multiple Sink Location Problems in Dynamic Path Networks. AAIM Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh
2014	J	`jnl`	Scheduling with Gaps: New Models and Algorithms. CoRR Marek Chrobak, Mordecai J. Golin, Tak Wah Lam, Dorian Nogneng
2013	J	`jnl`	Paging mobile users in cellular networks: Optimality versus complexity and simplicity. Theor. Comput. Sci. Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng, Mordecai J. Golin
2012	J	`jnl`	Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme. SIAM J. Comput. Mordecai J. Golin, Claire Mathieu, Neal E. Young
2012	B	`conf`	Vehicle Scheduling on a Graph Revisited. ISAAC Wei Yu, Mordecai J. Golin, Guochuan Zhang
2011	J	`jnl`	Encoding 2-D Range Maximum Queries CoRR Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao
2011	B	`conf`	Encoding 2D Range Maximum Queries. ISAAC Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao
2010	J	`jnl`	A dynamic programming approach to length-limited Huffman coding: space reduction with the Monge property. IEEE Trans. Inf. Theory Mordecai J. Golin, Yan Zhang
2010	J	`jnl`	Multidimensional Divide-and-Conquer and Weighted Digital Sums CoRR Yun Kuen Cheung, Philippe Flajolet, Mordecai J. Golin, C. Y. James Lee
2010	—	`ed.`	Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2010, Austin, Texas, USA, January 16, 2010 ANALCO Mordecai J. Golin, Robert Sedgewick
2010	J	`jnl`	The asymptotic number of spanning trees in circulant graphs. Discret. Math. Mordecai J. Golin, Xuerong Yong, Yuanping Zhang
2009	A*	`conf`	A generic top-down dynamic-programming approach to prefix-free coding. SODA Mordecai J. Golin, Xiaoming Xu, Jiajin Yu
2009	—	`conf`	Multidimensional Divide-and-Conquer and Weighted Digital Sums. ANALCO Yun Kuen Cheung, Philippe Flajolet, Mordecai J. Golin, C. Y. James Lee
2009	J	`jnl`	Online Dynamic Programming Speedups. Theory Comput. Syst. Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang
2009	J	`jnl`	The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity. ACM Trans. Algorithms Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang
2008	J	`jnl`	A Dynamic Programming Approach To Length-Limited Huffman Coding CoRR Mordecai J. Golin, Yan Zhang
2008	J	`jnl`	A Generic Top-Down Dynamic-Programming Approach to Prefix-Free Coding CoRR Mordecai J. Golin, Xiaoming Xu, Jiajin Yu
2008	J	`jnl`	More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. IEEE Trans. Inf. Theory Mordecai J. Golin, Jian Li
2008	J	`jnl`	The number of spanning trees in a class of double fixed-step loop networks. Networks Xuerong Yong, Yuanping Zhang, Mordecai J. Golin
2007	J	`jnl`	More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding CoRR Mordecai J. Golin, Jian Li
2007	B	`conf`	More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. ISAAC Mordecai J. Golin, Jian Li
2007	A*	`conf`	Paging Mobile Users Efficiently and Optimally. INFOCOM Amotz Bar-Noy, Yi Feng, Mordecai J. Golin
2007	—	`conf`	The Asymptotic Number of Spanning Trees in Circulant Graphs. ANALCO Mordecai J. Golin, Xuerong Yong, Yuanping Zhang
2007	J	`jnl`	The two-median problem on Manhattan meshes. Networks Mordecai J. Golin, Yan Zhang
2006	B	`conf`	Online Dynamic Programming Speedups. WAOA Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang
2006	J	`jnl`	Online Maintenance of k-Medians and k-Covers on a Line. Algorithmica Rudolf Fleischer, Mordecai J. Golin, Yan Zhang
2006	—	`conf`	Permanents of Circulants: A Transfer Matrix Approach. ANALCO Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang
2006	A*	`conf`	The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity. SODA Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang
2005	J	`jnl`	Chebyshev polynomials and spanning tree formulas for circulant and related graphs. Discret. Math. Yuanping Zhang, Xuerong Yong, Mordecai J. Golin
2005	—	`conf`	Counting Structures in Grid Graphs, Cylinders and Tori Using Transfer Matrices: Survey and New Results. ALENEX/ANALCO Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang, Xuerong Yong
2005	J	`jnl`	Curve reconstruction from noisy samples. Comput. Geom. Siu-Wing Cheng, Stefan Funke, Mordecai J. Golin, Piyush Kumar, Sheung-Hung Poon, Edgar A. Ramos
2005	B	`conf`	Generalizing the Kraft-McMillan Inequality to Restricted Languages. DCC Mordecai J. Golin, Hyeon-Suk Na
2005	B	`conf`	The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case. WADS Mordecai J. Golin, Zhenming Liu
2004	A*	`conf`	Algorithms for infinite huffman-codes. SODA Mordecai J. Golin, Kin Keung Ma
2004	J	`jnl`	Competitive facility location: the Voronoi game. Theor. Comput. Sci. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum
2004	B	`conf`	Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs. ISAAC Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang
2004	J	`jnl`	Finding optimal paths in MREP routing. Inf. Process. Lett. Rudolf Fleischer, Mordecai J. Golin, Chin-Tau A. Lea, Steven Wong
2004	J	`jnl`	Fun-Sort--or the chaos of unordered binary search. Discret. Appl. Math. Therese Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro
2004	J	`jnl`	New upper and lower bounds on the channel capacity of read/write isolated memory. Discret. Appl. Math. Mordecai J. Golin, Xuerong Yong, Yuanping Zhang, Li Sheng
2004	—	`conf`	Online Maintenance of k-Medians and k-Covers on a Line. SWAT Rudolf Fleischer, Mordecai J. Golin, Yan Zhang
2004	B	`conf`	Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters. WG Mordecai J. Golin, Yiu-Cho Leung
2003	—	`conf`	Curve reconstruction from noisy samples. SCG Siu-Wing Cheng, Stefan Funke, Mordecai J. Golin, Piyush Kumar, Sheung-Hung Poon, Edgar A. Ramos
2003	B	`conf`	Maximum residual energy routing with reverse energy cost. GLOBECOM Qiling Xie, Chin-Tau A. Lea, Mordecai J. Golin, Rudolf Fleischer
2003	J	`jnl`	Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets. Des. Codes Cryptogr. Cunsheng Ding, Mordecai J. Golin, Torleiv Kløve
2003	J	`jnl`	On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes. Comput. Geom. Mordecai J. Golin, Hyeon-Suk Na
2003	B	`conf`	Recurrence Relations on Transfer Matrices Yield Good Lower and Upper Bounds on the Channel Capacity of Some 2-Dimensional Constrained Systems (Extended Abstract). DCC Mordecai J. Golin, Yiu-Cho Leung
2002	J	`jnl`	Huffman Coding with Unequal Letter Costs CoRR Mordecai J. Golin, Claire Kenyon, Neal E. Young
2002	A*	`conf`	Huffman coding with unequal letter costs. STOC Mordecai J. Golin, Claire Kenyon, Neal E. Young
2002	B	`conf`	New Techniques for Bounding the Channel Capacity of Read/Write Isolated Memor. DCC Xuerong Yong, Mordecai J. Golin
2002	J	`jnl`	Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. J. Algorithms Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter
2002	J	`jnl`	Prefix Codes: Equiprobable Words, Unequal Letter Costs CoRR Mordecai J. Golin, Neal E. Young
2002	—	`conf`	The Convex Hull for Random Lines in the Plane. JCDCG Mordecai J. Golin, Stefan Langerman, William L. Steiger
2002	—	`conf`	The probabilistic complexity of the Voronoi diagram of points on a polyhedron. SCG Mordecai J. Golin, Hyeon-Suk Na
2001	J	`jnl`	A combinatorial approach to Golomb forests. Theor. Comput. Sci. Mordecai J. Golin
2001	Misc	`conf`	Competitive Facility Location along a Highway. COCOON Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum
2001	J	`jnl`	Lopsided Trees, I: Analyses. Algorithmica Vicky Siu-Ngan Choi, Mordecai J. Golin
2001	B	`conf`	Optimal Prefix-Free Codes That End in a Specified Pattern and Similar Problems: The Uniform Probability Case. Data Compression Conference Mordecai J. Golin, Hyeon-Suk Na
2001	—	`conf`	Protection of Keys against Modification Attack. S&P Wai W. Fung, Mordecai J. Golin, James W. Gray III
2000	J	`jnl`	A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes. IEEE Trans. Inf. Theory Sze-Lok Chan, Mordecai J. Golin
2000	J	`jnl`	An algorithm for finding a k-median in a directed tree. Inf. Process. Lett. Antoine Vigneron, Lixin Gao, Mordecai J. Golin, Giuseppe F. Italiano, Bo Li
2000	—	`conf`	On the Average Complexity of 3D-Voronoi Diagrams of Random Points on Convex Polytopes. CCCG Mordecai J. Golin, Hyeon-Suk Na
2000	J	`jnl`	The number of spanning trees in circulant graphs. Discret. Math. Yuanping Zhang, Xuerong Yong, Mordecai J. Golin
1999	A*	`conf`	On the Optimal Placement of Web Proxies in the Internet. INFOCOM Bo Li, Mordecai J. Golin, Giuseppe F. Italiano, Xin Deng, Kazem Sohraby
1999	J	`jnl`	Optimal Point-to-point Broadcast Algorithms Via Lopsided Trees. Discret. Appl. Math. Mordecai J. Golin, Assaf Schuster
1998	J	`jnl`	A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs. IEEE Trans. Inf. Theory Mordecai J. Golin, Günter Rote
1998	J	`jnl`	Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems. Int. J. Comput. Geom. Appl. Olivier Devillers, Mordecai J. Golin
1998	J	`jnl`	Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. Theor. Comput. Sci. Mordecai J. Golin, Shmuel Zaks
1998	—	`conf`	On the Optimal Placement of Web Proxies in the Internet: The Linear Topology. HPN Bo Li, Xin Deng, Mordecai J. Golin, Kazem Sohraby
1998	A	`conf`	Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. ESA Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter
1998	J	`jnl`	Randomized Data Structures for the Dynamic Closest-Pair Problem. SIAM J. Comput. Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
1997	—	`conf`	Optimal point-to-point broadcast algorithms via lopsided trees. ISTCS Mordecai J. Golin, Assaf Schuster
1996	A*	`conf`	Limit Theorems for Minimum-Weight Triangulations, Other Euclidean Functionals, and Probabilistic Recurrence Relations (Extended Abstract). SODA Mordecai J. Golin
1996	A*	`conf`	Lopsided Trees: Analyses, Algorithms, and Applications. ICALP Vicky Siu-Ngan Choi, Mordecai J. Golin
1996	J	`jnl`	Prefix Codes: Equiprobable Words, Unequal Letter Costs. SIAM J. Comput. Mordecai J. Golin, Neal E. Young
1996	J	`jnl`	Queries on Voronoi Diagrams of Moving Points. Comput. Geom. Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra
1995	A*	`conf`	A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs. ICALP Mordecai J. Golin, Günter Rote
1995	J	`jnl`	Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. Inf. Process. Lett. Olivier Devillers, Mordecai J. Golin
1995	J	`jnl`	Simple Randomized Algorithms for Closest Pair Problems. Nord. J. Comput. Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
1995	Misc	`conf`	The Multi-Weighted Spanning Tree Problem (Extended Abstract). COCOON Joseph L. Ganley, Mordecai J. Golin, Jeffrey S. Salowe
1994	J	`jnl`	A Provably Fast Linear-Expected-Time Maxima-Finding Algorithm. Algorithmica Mordecai J. Golin
1994	—	`conf`	Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. CCCG Olivier Devillers, Mordecai J. Golin
1994	B	`conf`	Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. WG Mordecai J. Golin, Shmuel Zaks
1994	J	`jnl`	Mellin Transforms and Asymptotics: The Mergesort Recurrence. Acta Informatica Philippe Flajolet, Mordecai J. Golin
1994	J	`jnl`	Newton's Method for Quadratics, and Nested Intervals. Complex Syst. Mordecai J. Golin, Kenneth J. Supowit
1994	A*	`conf`	Prefix Codes: Equiprobable Words, Unequal Letter Costs. ICALP Mordecai J. Golin, Neal E. Young
1994	—	`conf`	Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points. CCCG Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra
1993	A	`conf`	Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems. ESA Olivier Devillers, Mordecai J. Golin
1993	A*	`conf`	Exact Asymptotics of Divide-and-Conquer Recurrences. ICALP Philippe Flajolet, Mordecai J. Golin
1993	A*	`conf`	Maxima in Convex Regions. SODA Mordecai J. Golin
1993	J	`jnl`	Queue-Mergesort. Inf. Process. Lett. Mordecai J. Golin, Robert Sedgewick
1993	A*	`conf`	Randomized Data Structures for the Dynamic Closest-Pair Problem. SODA Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
1993	—	`conf`	Simple Randomized Algorithms for Closest Pair Problems. CCCG Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
1992	—	`conf`	Dynamic Closest Pairs - A Probabilistic Approach. SWAT Mordecai J. Golin
1992	J	`jnl`	How Many Maxima Can There Be? Comput. Geom. Mordecai J. Golin
1988	—	`conf`	Analysis of a Simple Yet Efficient Convex Hull Algorithm. SCG Mordecai J. Golin, Robert Sedgewick