Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMordecai J. Golin
Person information
- affiliation: Hong Kong University of Science and Technology, Department of Computer Science and Engineering, Hong Kong
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c59]Jinxiang Gan, Mordecai J. Golin:
Fully Dynamic k-Center in Low Dimensions via Approximate Furthest Neighbors. SOSA 2024: 269-278- [i28]Mordecai J. Golin, Albert John Lalim Patupat:
The Markov-Chain Polytope with Applications. CoRR abs/2401.11622 (2024) - 2023
- [j54]Di Chen, Mordecai J. Golin
:
Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows. Algorithmica 85(7): 1948-2000 (2023) - [j53]Wei Yu, Mordecai J. Golin, Guochuan Zhang:
Scheduling on a graph with release times. J. Sched. 26(6): 571-580 (2023) - [j52]Mordecai J. Golin, Elfarouk Harb:
A Polynomial Time Algorithm for Constructing Optimal Binary AIFV-2 Codes. IEEE Trans. Inf. Theory 69(10): 6269-6278 (2023) - [i27]Jinxiang Gan, Mordecai J. Golin:
Fully Dynamic k-Center in Low Dimensions via Approximate Furthest Neighbors. CoRR abs/2302.09737 (2023) - [i26]Jinxiang Gan, Mordecai J. Golin, Zonghan Yang, Yuhao Zhang:
Fair k-Center: a Coreset Approach in Low Dimensions. CoRR abs/2302.09911 (2023) - 2022
- [j51]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
On Huang and Wong's algorithm for generalized binary split trees. Acta Informatica 59(6): 687-708 (2022) - [j50]Mordecai J. Golin, Sai Sandeep:
Minmax regret for sink location on dynamic flow paths with general capacities. Discret. Appl. Math. 315: 1-26 (2022) - [j49]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons. ACM Trans. Algorithms 18(1): 2:1-2:11 (2022) - [c58]Mordecai J. Golin, Albert John L. Patupat:
Speeding Up AIFV-m Dynamic Programs by m-1 Orders of Magnitude. ISIT 2022: 246-251 - 2021
- [j48]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
On the cost of unsuccessful searches in search trees with two-way comparisons. Inf. Comput. 281: 104707 (2021) - [j47]Marek Chrobak, Mordecai J. Golin, Tak Wah Lam, Dorian Nogneng:
Scheduling with gaps: new models and algorithms. J. Sched. 24(4): 381-403 (2021) - [j46]Mordecai J. Golin, Elfarouk Harb:
Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries. Theor. Comput. Sci. 865: 99-118 (2021) - [i25]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
On the Cost of Unsuccessful Searches in Search Trees with Two-way Comparisons. CoRR abs/2103.01052 (2021) - [i24]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
A Simple Algorithm for Optimal Search Trees with Two-Way Comparisons. CoRR abs/2103.01084 (2021) - 2020
- [i23]Mordecai J. Golin, Elfarouk Harb:
Polynomial Time Algorithms for Constructing Optimal Binary AIFV-2 Codes. CoRR abs/2001.11170 (2020) - [i22]Mordecai J. Golin, Elfarouk Harb:
Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries. CoRR abs/2002.09885 (2020)
2010 – 2019
- 2019
- [j45]Guru Prakash Arumugam, John Augustine, Mordecai J. Golin, Prashanth Srikanthan:
Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform Capacities. Algorithmica 81(9): 3534-3585 (2019) - [j44]Zhibing Chen, Mordecai J. Golin, Xuerong Yong:
The transfer matrices and the capacity of the 2-dimensional (1, ∞)-runlength limited constraint. Discret. Math. 342(4): 975-987 (2019) - [c57]Josep Díaz, Mordecai J. Golin:
The Expected Number of Maximal Points of the Convolution of Two 2-D Distributions. APPROX-RANDOM 2019: 35:1-35:14 - [c56]Mordecai J. Golin, Elfarouk Harb:
Polynomial Time Algorithms for Constructing Optimal AIFV Codes. DCC 2019: 231-240 - [i21]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
On Huang and Wong's Algorithm for Generalized Binary Split Trees. CoRR abs/1901.03783 (2019) - [i20]Mordecai J. Golin, Sai Sandeep:
Minmax Regret for sink location on paths with general capacities. CoRR abs/1912.12447 (2019) - 2018
- [c55]Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich:
Dynamic Trees with Almost-Optimal Access Cost. ESA 2018: 38:1-38:14 - [i19]Di Chen, Mordecai J. Golin:
Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows. CoRR abs/1803.09289 (2018) - [i18]Mordecai J. Golin, Sai Sandeep:
Minmax-Regret k-Sink Location on a Dynamic Tree Network with Uniform Capacities. CoRR abs/1806.03814 (2018) - [i17]Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich:
Dynamic Trees with Almost-Optimal Access Cost. CoRR abs/1806.10498 (2018) - [i16]Josep Díaz, Mordecai J. Golin:
Smoothed Analysis of the Expected Number of Maximal Points in Two Dimensions. CoRR abs/1807.06845 (2018) - 2017
- [c54]Mordecai J. Golin, Hadi Khodabande, Bo Qin:
Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems. ISAAC 2017: 41:1-41:13 - [c53]Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks. WADS 2017: 133-144 - [i15]Mordecai J. Golin, Hadi Khodabande, Bo Qin:
Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems. CoRR abs/1709.10307 (2017) - 2016
- [j43]Chuan-Long Wang, Xuerong Yong, Mordecai J. Golin:
The channel capacity of read/write isolated memory. Discret. Appl. Math. 198: 264-273 (2016) - [j42]Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, Srinivasa Rao Satti, Sunil M. Shende:
Encoding 2D range maximum queries. Theor. Comput. Sci. 609: 316-327 (2016) - [c52]Di Chen, Mordecai J. Golin:
Sink Evacuation on Trees with Dynamic Confluent Flows. ISAAC 2016: 25:1-25:13 - [i14]Guru Prakash Arumugam, John Augustine, Mordecai J. Golin, Yuya Higashikawa, Naoki Katoh, Prashanth Srikanthan:
Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities. CoRR abs/1606.07208 (2016) - [i13]Di Chen, Mordecai J. Golin:
Minmax Tree Facility Location and Sink Evacuation with Dynamic Confluent Flows. CoRR abs/1607.08041 (2016) - [i12]Binay K. Bhattacharya, Mordecai J. Golin, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Improved Algorithms for Computing k-Sink on Dynamic Path Networks. CoRR abs/1609.01373 (2016) - 2015
- [j41]Yuya Higashikawa, John Augustine, Siu-Wing Cheng, Mordecai J. Golin, Naoki Katoh, Guanqun Ni, Bing Su, Yin-Feng Xu:
Minimax regret 1-sink location problem in dynamic path networks. Theor. Comput. Sci. 588: 24-36 (2015) - [j40]Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh:
Multiple sink location problems in dynamic path networks. Theor. Comput. Sci. 607: 2-15 (2015) - [c51]Marek Chrobak, Mordecai J. Golin, Tak Wah Lam, Dorian Nogneng:
Scheduling with Gaps: New Models and Algorithms. CIAC 2015: 114-126 - [c50]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
Optimal Search Trees with 2-Way Comparisons. ISAAC 2015: 71-82 - [i11]Marek Chrobak, Mordecai J. Golin, J. Ian Munro, Neal E. Young:
Optimal search trees with equality tests. CoRR abs/1505.00357 (2015) - 2014
- [j39]Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh:
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity. J. Graph Algorithms Appl. 18(4): 539-555 (2014) - [c49]Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh:
Multiple Sink Location Problems in Dynamic Path Networks. AAIM 2014: 149-161 - [c48]Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh:
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity. WALCOM 2014: 125-137 - [i10]Guru Prakash Arumugam, John Augustine, Mordecai J. Golin, Prashanth Srikanthan:
A Polynomial Time Algorithm for Minimax-Regret Evacuation on a Dynamic Path. CoRR abs/1404.5448 (2014) - [i9]Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh:
Improved Algorithms for Multiple Sink Location Problems in Dynamic Path Networks. CoRR abs/1405.5613 (2014) - [i8]Marek Chrobak, Mordecai J. Golin, Tak Wah Lam, Dorian Nogneng:
Scheduling with Gaps: New Models and Algorithms. CoRR abs/1410.7092 (2014) - 2013
- [j38]Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng, Mordecai J. Golin:
Paging mobile users in cellular networks: Optimality versus complexity and simplicity. Theor. Comput. Sci. 470: 23-35 (2013) - 2012
- [j37]Mordecai J. Golin, Claire Mathieu, Neal E. Young:
Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme. SIAM J. Comput. 41(3): 684-713 (2012) - [c47]Wei Yu, Mordecai J. Golin, Guochuan Zhang:
Vehicle Scheduling on a Graph Revisited. ISAAC 2012: 362-371 - 2011
- [c46]Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao:
Encoding 2D Range Maximum Queries. ISAAC 2011: 180-189 - [i7]Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao:
Encoding 2-D Range Maximum Queries. CoRR abs/1109.2885 (2011) - 2010
- [j36]Mordecai J. Golin, Xuerong Yong, Yuanping Zhang:
The asymptotic number of spanning trees in circulant graphs. Discret. Math. 310(4): 792-803 (2010) - [j35]Mordecai J. Golin, Yan Zhang:
A dynamic programming approach to length-limited Huffman coding: space reduction with the Monge property. IEEE Trans. Inf. Theory 56(8): 3918-3929 (2010) - [e1]Mordecai J. Golin, Robert Sedgewick:
Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2010, Austin, Texas, USA, January 16, 2010. SIAM 2010, ISBN 978-0-89871-933-8 [contents] - [i6]Yun Kuen Cheung, Philippe Flajolet, Mordecai J. Golin, C. Y. James Lee:
Multidimensional Divide-and-Conquer and Weighted Digital Sums. CoRR abs/1003.0150 (2010)
2000 – 2009
- 2009
- [j34]Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang:
Online Dynamic Programming Speedups. Theory Comput. Syst. 45(3): 429-445 (2009) - [j33]Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang:
The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity. ACM Trans. Algorithms 6(1): 17:1-17:22 (2009) - [c45]Yun Kuen Cheung, Philippe Flajolet, Mordecai J. Golin, C. Y. James Lee:
Multidimensional Divide-and-Conquer and Weighted Digital Sums. ANALCO 2009: 58-74 - [c44]Mordecai J. Golin, Xiaoming Xu, Jiajin Yu:
A generic top-down dynamic-programming approach to prefix-free coding. SODA 2009: 758-767 - 2008
- [j32]Xuerong Yong, Yuanping Zhang, Mordecai J. Golin:
The number of spanning trees in a class of double fixed-step loop networks. Networks 52(2): 69-77 (2008) - [j31]Mordecai J. Golin, Jian Li:
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. IEEE Trans. Inf. Theory 54(8): 3412-3424 (2008) - [i5]Mordecai J. Golin, Yan Zhang:
A Dynamic Programming Approach To Length-Limited Huffman Coding. CoRR abs/0806.4899 (2008) - [i4]Mordecai J. Golin, Xiaoming Xu, Jiajin Yu:
A Generic Top-Down Dynamic-Programming Approach to Prefix-Free Coding. CoRR abs/0809.4577 (2008) - 2007
- [j30]Mordecai J. Golin, Yan Zhang:
The two-median problem on Manhattan meshes. Networks 49(3): 226-233 (2007) - [c43]Mordecai J. Golin, Xuerong Yong, Yuanping Zhang:
The Asymptotic Number of Spanning Trees in Circulant Graphs. ANALCO 2007: 242-249 - [c42]Amotz Bar-Noy, Yi Feng, Mordecai J. Golin:
Paging Mobile Users Efficiently and Optimally. INFOCOM 2007: 1910-1918 - [c41]Mordecai J. Golin, Jian Li:
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. ISAAC 2007: 329-340 - [i3]Mordecai J. Golin, Jian Li:
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. CoRR abs/0705.0253 (2007) - 2006
- [j29]Rudolf Fleischer, Mordecai J. Golin, Yan Zhang:
Online Maintenance of k-Medians and k-Covers on a Line. Algorithmica 45(4): 549-567 (2006) - [c40]Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang:
Permanents of Circulants: A Transfer Matrix Approach. ANALCO 2006: 263-272 - [c39]Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang:
The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity. SODA 2006: 31-40 - [c38]Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang:
Online Dynamic Programming Speedups. WAOA 2006: 43-54 - 2005
- [j28]Siu-Wing Cheng, Stefan Funke, Mordecai J. Golin, Piyush Kumar, Sheung-Hung Poon, Edgar A. Ramos:
Curve reconstruction from noisy samples. Comput. Geom. 31(1-2): 63-100 (2005) - [j27]Yuanping Zhang, Xuerong Yong, Mordecai J. Golin:
Chebyshev polynomials and spanning tree formulas for circulant and related graphs. Discret. Math. 298(1-3): 334-364 (2005) - [c37]Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang, Xuerong Yong:
Counting Structures in Grid Graphs, Cylinders and Tori Using Transfer Matrices: Survey and New Results. ALENEX/ANALCO 2005: 250-258 - [c36]Mordecai J. Golin, Hyeon-Suk Na:
Generalizing the Kraft-McMillan Inequality to Restricted Languages. DCC 2005: 163-172 - [c35]Mordecai J. Golin, Zhenming Liu:
The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case. WADS 2005: 372-384 - 2004
- [j26]Mordecai J. Golin, Xuerong Yong, Yuanping Zhang, Li Sheng:
New upper and lower bounds on the channel capacity of read/write isolated memory. Discret. Appl. Math. 140(1-3): 35-48 (2004) - [j25]Therese C. Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro:
Fun-Sort--or the chaos of unordered binary search. Discret. Appl. Math. 144(3): 231-236 (2004) - [j24]Rudolf Fleischer, Mordecai J. Golin, Chin-Tau A. Lea, Steven Wong:
Finding optimal paths in MREP routing. Inf. Process. Lett. 89(2): 57-63 (2004) - [j23]Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum:
Competitive facility location: the Voronoi game. Theor. Comput. Sci. 310(1-3): 457-467 (2004) - [c34]Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang:
Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs. ISAAC 2004: 508-521 - [c33]Mordecai J. Golin, Kin Keung Ma:
Algorithms for infinite huffman-codes. SODA 2004: 758-767 - [c32]Rudolf Fleischer, Mordecai J. Golin, Yan Zhang:
Online Maintenance of k-Medians and k-Covers on a Line. SWAT 2004: 102-113 - [c31]Mordecai J. Golin, Yiu-Cho Leung:
Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters. WG 2004: 296-307 - 2003
- [j22]Mordecai J. Golin, Hyeon-Suk Na:
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes. Comput. Geom. 25(3): 197-231 (2003) - [j21]Cunsheng Ding, Mordecai J. Golin, Torleiv Kløve:
Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets. Des. Codes Cryptogr. 30(1): 73-84 (2003) - [c30]Siu-Wing Cheng, Stefan Funke, Mordecai J. Golin, Piyush Kumar, Sheung-Hung Poon, Edgar A. Ramos:
Curve reconstruction from noisy samples. SCG 2003: 302-311 - [c29]Mordecai J. Golin, Yiu-Cho Leung:
Recurrence Relations on Transfer Matrices Yield Good Lower and Upper Bounds on the Channel Capacity of Some 2-Dimensional Constrained Systems (Extended Abstract). DCC 2003: 430 - [c28]Qiling Xie, Chin-Tau A. Lea, Mordecai J. Golin, Rudolf Fleischer:
Maximum residual energy routing with reverse energy cost. GLOBECOM 2003: 564-569 - 2002
- [j20]Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter:
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. J. Algorithms 42(2): 277-303 (2002) - [c27]Mordecai J. Golin, Hyeon-Suk Na:
The probabilistic complexity of the Voronoi diagram of points on a polyhedron. SCG 2002: 209-216 - [c26]Xuerong Yong, Mordecai J. Golin:
New Techniques for Bounding the Channel Capacity of Read/Write Isolated Memor. DCC 2002: 482 - [c25]Mordecai J. Golin, Stefan Langerman, William L. Steiger:
The Convex Hull for Random Lines in the Plane. JCDCG 2002: 172-175 - [c24]Mordecai J. Golin, Claire Kenyon, Neal E. Young:
Huffman coding with unequal letter costs. STOC 2002: 785-791 - [i2]Mordecai J. Golin, Claire Kenyon, Neal E. Young:
Huffman Coding with Unequal Letter Costs. CoRR cs.DS/0205048 (2002) - [i1]Mordecai J. Golin, Neal E. Young:
Prefix Codes: Equiprobable Words, Unequal Letter Costs. CoRR cs.DS/0205049 (2002) - 2001
- [j19]Vicky Siu-Ngan Choi, Mordecai J. Golin:
Lopsided Trees, I: Analyses. Algorithmica 31(3): 240-290 (2001) - [j18]Mordecai J. Golin:
A combinatorial approach to Golomb forests. Theor. Comput. Sci. 263(1-2): 283-304 (2001) - [c23]Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum:
Competitive Facility Location along a Highway. COCOON 2001: 237-246 - [c22]Mordecai J. Golin, Hyeon-Suk Na:
Optimal Prefix-Free Codes That End in a Specified Pattern and Similar Problems: The Uniform Probability Case. Data Compression Conference 2001: 143-152 - [c21]Wai W. Fung, Mordecai J. Golin, James W. Gray III:
Protection of Keys against Modification Attack. S&P 2001: 26-36 - 2000
- [j17]Yuanping Zhang, Xuerong Yong, Mordecai J. Golin:
The number of spanning trees in circulant graphs. Discret. Math. 223(1-3): 337-350 (2000) - [j16]Antoine Vigneron, Lixin Gao, Mordecai J. Golin, Giuseppe F. Italiano, Bo Li:
An algorithm for finding a k-median in a directed tree. Inf. Process. Lett. 74(1-2): 81-88 (2000) - [j15]Sze-Lok Chan, Mordecai J. Golin:
A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes. IEEE Trans. Inf. Theory 46(4): 1637-1644 (2000) - [c20]Mordecai J. Golin, Hyeon-Suk Na:
On the Average Complexity of 3D-Voronoi Diagrams of Random Points on Convex Polytopes. CCCG 2000
1990 – 1999
- 1999
- [j14]Mordecai J. Golin, Assaf Schuster:
Optimal Point-to-point Broadcast Algorithms Via Lopsided Trees. Discret. Appl. Math. 93(2-3): 233-263 (1999) - [c19]Bo Li, Mordecai J. Golin, Giuseppe F. Italiano, Xin Deng, Kazem Sohraby:
On the Optimal Placement of Web Proxies in the Internet. INFOCOM 1999: 1282-1290 - 1998
- [j13]Olivier Devillers, Mordecai J. Golin:
Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems. Int. J. Comput. Geom. Appl. 8(3): 321-342 (1998) - [j12]Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Randomized Data Structures for the Dynamic Closest-Pair Problem. SIAM J. Comput. 27(4): 1036-1072 (1998) - [j11]Mordecai J. Golin, Shmuel Zaks:
Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. Theor. Comput. Sci. 205(1-2): 99-114 (1998) - [j10]Mordecai J. Golin, Günter Rote:
A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs. IEEE Trans. Inf. Theory 44(5): 1770-1781 (1998) - [c18]Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter:
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. ESA 1998: 43-54 - [c17]Bo Li, Xin Deng, Mordecai J. Golin, Kazem Sohraby:
On the Optimal Placement of Web Proxies in the Internet: The Linear Topology. HPN 1998: 485-495 - 1997
- [c16]Mordecai J. Golin, Assaf Schuster:
Optimal point-to-point broadcast algorithms via lopsided trees. ISTCS 1997: 63-73 - 1996
- [j9]Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra:
Queries on Voronoi Diagrams of Moving Points. Comput. Geom. 6: 315-327 (1996) - [j8]Mordecai J. Golin, Neal E. Young:
Prefix Codes: Equiprobable Words, Unequal Letter Costs. SIAM J. Comput. 25(6): 1281-1292 (1996) - [c15]Vicky Siu-Ngan Choi, Mordecai J. Golin:
Lopsided Trees: Analyses, Algorithms, and Applications. ICALP 1996: 538-549 - [c14]Mordecai J. Golin:
Limit Theorems for Minimum-Weight Triangulations, Other Euclidean Functionals, and Probabilistic Recurrence Relations (Extended Abstract). SODA 1996: 252-260 - 1995
- [j7]Olivier Devillers, Mordecai J. Golin:
Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. Inf. Process. Lett. 56(3): 157-164 (1995) - [j6]Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Simple Randomized Algorithms for Closest Pair Problems. Nord. J. Comput. 2(1): 3-27 (1995) - [c13]Joseph L. Ganley, Mordecai J. Golin, Jeffrey S. Salowe:
The Multi-Weighted Spanning Tree Problem (Extended Abstract). COCOON 1995: 141-150 - [c12]Mordecai J. Golin, Günter Rote:
A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs. ICALP 1995: 256-267 - 1994
- [j5]Philippe Flajolet, Mordecai J. Golin:
Mellin Transforms and Asymptotics: The Mergesort Recurrence. Acta Informatica 31(7): 673-696 (1994) - [j4]Mordecai J. Golin:
A Provably Fast Linear-Expected-Time Maxima-Finding Algorithm. Algorithmica 11(6): 501-524 (1994) - [j3]Mordecai J. Golin, Kenneth J. Supowit:
Newton's Method for Quadratics, and Nested Intervals. Complex Syst. 8(3) (1994) - [c11]Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra:
Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points. CCCG 1994: 122-127 - [c10]Olivier Devillers, Mordecai J. Golin:
Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. CCCG 1994: 153-158 - [c9]Mordecai J. Golin, Neal E. Young:
Prefix Codes: Equiprobable Words, Unequal Letter Costs. ICALP 1994: 605-617 - [c8]Mordecai J. Golin, Shmuel Zaks:
Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. WG 1994: 282-291 - 1993
- [j2]Mordecai J. Golin, Robert Sedgewick:
Queue-Mergesort. Inf. Process. Lett. 48(5): 253-259 (1993) - [c7]Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Simple Randomized Algorithms for Closest Pair Problems. CCCG 1993: 246-251 - [c6]Olivier Devillers, Mordecai J. Golin:
Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems. ESA 1993: 133-144 - [c5]Philippe Flajolet, Mordecai J. Golin:
Exact Asymptotics of Divide-and-Conquer Recurrences. ICALP 1993: 137-149 - [c4]Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Randomized Data Structures for the Dynamic Closest-Pair Problem. SODA 1993: 301-310 - [c3]Mordecai J. Golin:
Maxima in Convex Regions. SODA 1993: 352-360 - 1992
- [j1]Mordecai J. Golin:
How Many Maxima Can There Be? Comput. Geom. 2: 335-353 (1992) - [c2]Mordecai J. Golin:
Dynamic Closest Pairs - A Probabilistic Approach. SWAT 1992: 340-351
1980 – 1989
- 1988
- [c1]Mordecai J. Golin, Robert Sedgewick:
Analysis of a Simple Yet Efficient Convex Hull Algorithm. SCG 1988: 153-163
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-11 20:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
