×
Author ID: golin.mordecai-j Recent zbMATH articles by "Golin, Mordecai J."
Published as: Golin, Mordecai J.; Golin, Mordecai; Golin, M. J.; Golin, M.
External Links: ORCID
all top 5

Co-Authors

6 single-authored
8 Yong, Xuerong
8 Young, Neal E.
8 Zhang, Yan
7 Zhang, Yuanping
6 Chrobak, Marek
6 Higashikawa, Yuya
6 Katoh, Naoki
6 Munro, J. Ian
5 Cheng, Siu-Wing
4 Fleischer, Rudolf
4 Larmore, Lawrence L.
4 Raman, Rajeev
3 Bar-Noy, Amotz
3 Devillers, Olivier
3 Flajolet, Philippe
3 Iacono, John
3 Leung, Yiu Cho
2 Ahn, Hee-Kap
2 Augustine, John E.
2 Bein, Wolfgang W.
2 Bradford, Phil
2 Chen, Di
2 Cheong, Otfried
2 Cheung, Yun Kuen
2 Choi, Vicky Siu-Ngan
2 Funke, Stefan
2 Krizanc, Danny
2 Kumar, Piyush
2 Lam, Tak-Wah
2 Langerman, Stefan
2 Li, Jian
2 Na, Hyeon-Suk
2 Nogneng, Dorian
2 Poon, Sheung-Hung
2 Ramos, Edgar A.
2 Rote, Günter
2 Rytter, Wojciech
2 Schwarz, Christian
2 Sedgewick, Robert
2 Smid, Michiel H. M.
2 van Oostrum, René
2 Zaks, Shmuel
1 Arumugam, Guru Prakash
1 Arya, Sunil
1 Bhattacharya, Binay Kumar
1 Biedl, Therese C.
1 Chan, Sze-Lok
1 Chan, Timothy Moon-Yew
1 Cheilaris, Panagiotis
1 Chen, Zhibing
1 Demaine, Erik D.
1 Díaz, Josep
1 Ding, Cunsheng
1 Feng, Yi
1 Ganley, Joseph L.
1 Gao, Lixin
1 Harb, Elfarouk
1 Italiano, Giuseppe Francesco
1 Kameda, Tsunehiko
1 Kedem, Klara
1 Kenyon, Claire M.
1 Khodabande, Hadi
1 King, James A.
1 Kløve, Torleiv
1 Lee, C. Y. James
1 Li, Bo
1 Liu, Zhenming
1 Ma, Kin Keung
1 Mathieu, Claire
1 Mehlhorn, Kurt
1 Nekrich, Yakov
1 Ni, Guanqun
1 Qin, Bo
1 Rao, Satti Srinivasa
1 Salowe, Jeffrey S.
1 Sandeep, Sai
1 Satti, Srinivasa Rao
1 Schirra, Stefan
1 Schuster, Assaf
1 Shende, Sunil M.
1 Sheng, Li
1 Srikanthan, Prashanth
1 Steiger, William L.
1 Su, Bing
1 Supowit, Kenneth J.
1 Vigneron, Antoine
1 Wang, Chuanlong
1 Wong, Steven
1 Xu, Xiaoming
1 Xu, Yinfeng
1 Yu, Jiajin
1 Yu, Wei
1 Zhang, Guochuan

Publications by Year

Citations contained in zbMATH Open

69 Publications have been cited 379 times in 260 Documents Cited by Year
The number of spanning trees in circulant graphs. Zbl 0969.05036
Zhang, Yuanping; Yong, Xuerong; Golin, Mordecai J.
34
2000
Competitive facility location: the Voronoi game. Zbl 1098.91003
Ahn, Hee-Kap; Cheng, Siu-Wing; Cheong, Otfried; Golin, Mordecai; van Oostrum, René
33
2004
Chebyshev polynomials and spanning tree formulas for circulant and related graphs. Zbl 1070.05029
Zhang, Yuanping; Yong, Xuerong; Golin, Mordecai J.
32
2005
Mellin transforms and asymptotics. The mergesort recurrence. Zbl 0818.68064
Flajolet, Philippe; Golin, Mordecai
21
1994
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes. Zbl 1023.65014
Golin, Mordecai J.; Na, Hyeon-Suk
12
2003
Encoding 2D range maximum queries. Zbl 1330.68051
Golin, Mordecai; Iacono, John; Krizanc, Danny; Raman, Rajeev; Srinivasa Rao, S.
11
2011
The asymptotic number of spanning trees in circulant graphs. Zbl 1205.05108
Golin, Mordecai J.; Yong, Xuerong; Zhang, Yuanping
11
2010
Minimax regret 1-sink location problem in dynamic path networks. Zbl 1326.90044
Higashikawa, Yuya; Augustine, John; Cheng, Siu-Wing; Golin, Mordecai J.; Katoh, Naoki; Ni, Guanqun; Su, Bing; Xu, Yinfeng
11
2015
Minimax regret sink location problem in dynamic tree networks with uniform capacity. Zbl 1302.90103
Higashikawa, Yuya; Golin, Mordecai J.; Katoh, Naoki
11
2014
Multiple sink location problems in dynamic path networks. Zbl 1332.68079
Higashikawa, Yuya; Golin, Mordecai J.; Katoh, Naoki
10
2015
On the expected depth of random circuits. Zbl 0941.68001
Arya, Sunil; Golin, Mordecai J.; Mehlhorn, Kurt
8
1999
Curve reconstruction from noisy samples. Zbl 1070.65013
Cheng, Siu-Wing; Funke, Stefan; Golin, Mordecai; Kumar, Piyush; Poon, Sheung-Hung; Ramos, Edgar
8
2005
Multiple sink location problems in dynamic path networks. Zbl 1445.68109
Higashikawa, Yuya; Golin, Mordecai J.; Katoh, Naoki
8
2014
Improved algorithms for computing \(k\)-sink on dynamic flow path networks. Zbl 1493.68261
Bhattacharya, Binay; Golin, Mordecai J.; Higashikawa, Yuya; Kameda, Tsunehiko; Katoh, Naoki
8
2017
A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs. Zbl 0980.94009
Golin, Mordecai J.; Rote, Günter
7
1998
Sink evacuation on trees with dynamic confluent flows. Zbl 1398.05098
Chen, Di; Golin, Mordecai
7
2016
Queries on Voronoi diagrams on moving points. Zbl 0857.68104
Devillers, O.; Golin, M.; Kedem, K.; Schirra, S.
7
1996
Minimax regret sink location problem in dynamic tree networks with uniform capacity. Zbl 1305.05213
Higashikawa, Yuya; Golin, Mordecai J.; Katoh, Naoki
7
2014
An algorithm for finding a \(k\)-median in a directed tree. Zbl 1003.68196
Vigneron, Antoine; Gao, Lixin; Golin, Mordecai J.; Italiano, Giuseppe F.; Li, Bo
7
2000
Queue-mergesort. Zbl 0787.68030
Golin, Mordecai J.; Sedgewick, Robert
6
1993
Competitive facility location along a highway. Zbl 0998.91009
Ahn, Hee-Kap; Cheng, Siu-Wing; Cheong, Otfried; Golin, Mordecai; van Oostrum, René
6
2001
Encoding 2D range maximum queries. Zbl 1331.68060
Golin, Mordecai; Iacono, John; Krizanc, Danny; Raman, Rajeev; Satti, Srinivasa Rao; Shende, Sunil
6
2016
Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities. Zbl 1431.90031
Arumugam, Guru Prakash; Augustine, John; Golin, Mordecai J.; Srikanthan, Prashanth
6
2019
Dog bites postman: Point location in the moving Voronoi diagram and related problems. Zbl 1035.68528
Devillers, Olivier; Golin, Mordecai J.
5
1998
Fun-Sort – or the chaos of unordered binary search. Zbl 1062.68045
Biedl, Therese; Chan, Timothy; Demaine, Erik D.; Fleischer, Rudolf; Golin, Mordecai; King, James A.; Munro, J. Ian
5
2004
Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas. Zbl 0875.68901
Devillers, Olivier; Golin, Mordecai J.
5
1995
Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property. Zbl 1005.94013
Bradford, Phil; Golin, Mordecai J.; Larmore, Lawrence L.; Rytter, Wojciech
4
2002
Counting spanning trees and other structures in non-constant-jump circulant graphs (Extended abstract). Zbl 1116.05303
Golin, Mordecai J.; Leung, Yiu Cho; Wang, Yajun
4
2004
A provably fast linear-expected-time maxima-finding algorithm. Zbl 0823.68112
Golin, M. J.
4
1994
The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity. Zbl 1298.68073
Bein, Wolfgang; Golin, Mordecai J.; Larmore, Lawrence L.; Zhang, Yan
4
2009
The number of spanning trees in a class of double fixed-step loop networks. Zbl 1155.05032
Yong, Xuerong; Zhang, Yuanping; Golin, Mordecai J.
4
2008
Huffman coding with unequal letter costs. Zbl 1192.68899
Golin, Mordecai J.; Kenyon, Claire; Young, Neal E.
4
2002
Limit theorems for minimum-weight triangulations, other Euclidean functionals, and probabilistic recurrence relations. (Extended abstract). Zbl 0845.60016
Golin, Mordecai J.
3
1996
Labelled trees and pairs of input–output permutations in priority queues. Zbl 0917.68048
Golin, M.; Zaks, S.
3
1998
Unhooking circulant graphs: A combinatorial method for counting spanning trees and other parameters. Zbl 1112.05312
Golin, Mordecai J.; Leung, Yiu Cho
3
2004
Maxima in convex regions. Zbl 0802.60015
Golin, Mordecai J.
3
1993
Scheduling with gaps: new models and algorithms. Zbl 1394.90268
Chrobak, Marek; Golin, Mordecai; Lam, Tak-Wah; Nogneng, Dorian
3
2015
Optimal search trees with 2-way comparisons. Zbl 1472.68044
Chrobak, Marek; Golin, Mordecai; Munro, J. Ian; Young, Neal E.
3
2015
Further applications of Chebyshev polynomials in the derivation of spanning tree formulas for circulant graphs. Zbl 1029.05075
Zhang, Yuanping; Golin, Mordecai J.
3
2002
Exact asymptotics of divide-and-conquer recurrences. Zbl 1418.68252
Flajolet, Philippe; Golin, Mordecai
3
1993
Huffman coding with letter costs: a linear-time approximation scheme. Zbl 1248.94045
Golin, Mordecai J.; Mathieu, Claire; Young, Neal E.
2
2012
The convex hull for random lines in the plane. Zbl 1179.52009
Golin, Mordecai; Langerman, Stefan; Steiger, William
2
2003
Online dynamic programming speedups. Zbl 1170.90512
Bar-Noy, Amotz; Golin, Mordecai J.; Zhang, Yan
2
2009
New upper and lower bounds on the channel capacity of read/write isolated memory. Zbl 1046.94006
Golin, Mordecai J.; Yong, Xuerong; Zhang, Yuanping; Sheng, Li
2
2004
Online maintenance of \(k\)-medians and \(k\)-covers on a line. Zbl 1099.68129
Fleischer, Rudolf; Golin, Mordecai J.; Zhang, Yan
2
2006
More efficient algorithms and analyses for unequal letter cost prefix-free coding. Zbl 1329.94046
Golin, Mordecai J.; Li, Jian
2
2008
How many maxima can there be? Zbl 0774.68059
Golin, Mordecai J.
2
1993
The channel capacity of read/write isolated memory. Zbl 1344.68066
Wang, Chuanlong; Yong, Xuerong; Golin, Mordecai
2
2016
On the cost of unsuccessful searches in search trees with two-way comparisons. Zbl 1518.68072
Chrobak, Marek; Golin, Mordecai; Munro, J. Ian; Young, Neal E.
2
2021
The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity. Zbl 1192.90217
Bein, Wolfgang W.; Golin, Mordecai J.; Larmore, Lawrence L.; Zhang, Yan
2
2006
More efficient algorithms and analyses for unequal letter cost prefix-free coding. Zbl 1193.94053
Golin, Mordecai; Li, Jian
1
2007
A dynamic programming algorithm for constructing optimal “1”-ended binary prefix-free codes. Zbl 1002.94015
Chan, Sze-Lok; Golin, Mordecai J.
1
2000
Online maintenance of \(k\)-medians and \(k\)-covers on a line. Zbl 1095.68754
Fleischer, Rudolf; Golin, Mordecai J.; Zhang, Yan
1
2004
Optimal point-to-point broadcast algorithms via lopsided trees. Zbl 1031.90006
Golin, Mordecai; Schuster, Assaf
1
1999
Lopsided trees. I: Analyses. Zbl 0989.68105
Choi, V.; Golin, M. J.
1
2001
Lopsided trees: Analyses, algorithms, and applications (extended abstract). Zbl 1046.68511
Choi, Vicky Siu-Ngan; Golin, Mordecai
1
1996
Prefix codes: Equiprobable words, unequal letter costs. Zbl 0876.68053
Golin, Mordecai J.; Young, Neal
1
1996
Randomized data structures for the dynamic closest-pair problem. Zbl 0801.68036
Golin, Mordecai; Raman, Rajeev; Schwarz, Christian; Smid, Michiel
1
1993
Curve reconstruction from noisy samples. Zbl 1378.65053
Cheng, Siu-Wing; Funke, Stefan; Golin, Mordecai; Kumar, Piyush; Poon, Sheung-Hung; Ramos, Edgar
1
2003
A dynamic programming approach to length-limited Huffman coding: space reduction with the Monge property. Zbl 1366.94283
Golin, Mordecai; Zhang, Yan
1
2010
Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets. Zbl 1036.94006
Ding, Cunsheng; Golin, Mordecai; Kløve, Torleiv
1
2003
Algorithms for infinite Huffman-codes. Zbl 1318.94056
Golin, Mordecai J.; Ma, Kin Keung
1
2004
Non-approximability and polylogarithmic approximations of the single-sink unsplittable and confluent dynamic flow problems. Zbl 1457.68308
Golin, Mordecai J.; Khodabande, Hadi; Qin, Bo
1
2017
A simple algorithm for optimal search trees with two-way comparisons. Zbl 07758395
Chrobak, Marek; Golin, Mordecai; Munro, J. Ian; Young, Neal E.
1
2022
Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows. Zbl 07704066
Chen, Di; Golin, Mordecai
1
2023
The expected number of maximal points of the convolution of two 2-D distributions. Zbl 07650102
Diaz, Josep; Golin, Mordecai
1
2019
On Huang and Wong’s algorithm for generalized binary split trees. Zbl 07605996
Chrobak, Marek; Golin, Mordecai; Munro, J. Ian; Young, Neal E.
1
2022
Dynamic trees with almost-optimal access cost. Zbl 1524.68109
Golin, Mordecai; Iacono, John; Langerman, Stefan; Munro, J. Ian; Nekrich, Yakov
1
2018
The probabilistic complexity of the Voronoi diagram of points on a polyhedron. Zbl 1414.68121
Golin, Mordecai J.; Na, Hyeon-Suk
1
2002
Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows. Zbl 07704066
Chen, Di; Golin, Mordecai
1
2023
A simple algorithm for optimal search trees with two-way comparisons. Zbl 07758395
Chrobak, Marek; Golin, Mordecai; Munro, J. Ian; Young, Neal E.
1
2022
On Huang and Wong’s algorithm for generalized binary split trees. Zbl 07605996
Chrobak, Marek; Golin, Mordecai; Munro, J. Ian; Young, Neal E.
1
2022
On the cost of unsuccessful searches in search trees with two-way comparisons. Zbl 1518.68072
Chrobak, Marek; Golin, Mordecai; Munro, J. Ian; Young, Neal E.
2
2021
Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities. Zbl 1431.90031
Arumugam, Guru Prakash; Augustine, John; Golin, Mordecai J.; Srikanthan, Prashanth
6
2019
The expected number of maximal points of the convolution of two 2-D distributions. Zbl 07650102
Diaz, Josep; Golin, Mordecai
1
2019
Dynamic trees with almost-optimal access cost. Zbl 1524.68109
Golin, Mordecai; Iacono, John; Langerman, Stefan; Munro, J. Ian; Nekrich, Yakov
1
2018
Improved algorithms for computing \(k\)-sink on dynamic flow path networks. Zbl 1493.68261
Bhattacharya, Binay; Golin, Mordecai J.; Higashikawa, Yuya; Kameda, Tsunehiko; Katoh, Naoki
8
2017
Non-approximability and polylogarithmic approximations of the single-sink unsplittable and confluent dynamic flow problems. Zbl 1457.68308
Golin, Mordecai J.; Khodabande, Hadi; Qin, Bo
1
2017
Sink evacuation on trees with dynamic confluent flows. Zbl 1398.05098
Chen, Di; Golin, Mordecai
7
2016
Encoding 2D range maximum queries. Zbl 1331.68060
Golin, Mordecai; Iacono, John; Krizanc, Danny; Raman, Rajeev; Satti, Srinivasa Rao; Shende, Sunil
6
2016
The channel capacity of read/write isolated memory. Zbl 1344.68066
Wang, Chuanlong; Yong, Xuerong; Golin, Mordecai
2
2016
Minimax regret 1-sink location problem in dynamic path networks. Zbl 1326.90044
Higashikawa, Yuya; Augustine, John; Cheng, Siu-Wing; Golin, Mordecai J.; Katoh, Naoki; Ni, Guanqun; Su, Bing; Xu, Yinfeng
11
2015
Multiple sink location problems in dynamic path networks. Zbl 1332.68079
Higashikawa, Yuya; Golin, Mordecai J.; Katoh, Naoki
10
2015
Scheduling with gaps: new models and algorithms. Zbl 1394.90268
Chrobak, Marek; Golin, Mordecai; Lam, Tak-Wah; Nogneng, Dorian
3
2015
Optimal search trees with 2-way comparisons. Zbl 1472.68044
Chrobak, Marek; Golin, Mordecai; Munro, J. Ian; Young, Neal E.
3
2015
Minimax regret sink location problem in dynamic tree networks with uniform capacity. Zbl 1302.90103
Higashikawa, Yuya; Golin, Mordecai J.; Katoh, Naoki
11
2014
Multiple sink location problems in dynamic path networks. Zbl 1445.68109
Higashikawa, Yuya; Golin, Mordecai J.; Katoh, Naoki
8
2014
Minimax regret sink location problem in dynamic tree networks with uniform capacity. Zbl 1305.05213
Higashikawa, Yuya; Golin, Mordecai J.; Katoh, Naoki
7
2014
Huffman coding with letter costs: a linear-time approximation scheme. Zbl 1248.94045
Golin, Mordecai J.; Mathieu, Claire; Young, Neal E.
2
2012
Encoding 2D range maximum queries. Zbl 1330.68051
Golin, Mordecai; Iacono, John; Krizanc, Danny; Raman, Rajeev; Srinivasa Rao, S.
11
2011
The asymptotic number of spanning trees in circulant graphs. Zbl 1205.05108
Golin, Mordecai J.; Yong, Xuerong; Zhang, Yuanping
11
2010
A dynamic programming approach to length-limited Huffman coding: space reduction with the Monge property. Zbl 1366.94283
Golin, Mordecai; Zhang, Yan
1
2010
The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity. Zbl 1298.68073
Bein, Wolfgang; Golin, Mordecai J.; Larmore, Lawrence L.; Zhang, Yan
4
2009
Online dynamic programming speedups. Zbl 1170.90512
Bar-Noy, Amotz; Golin, Mordecai J.; Zhang, Yan
2
2009
The number of spanning trees in a class of double fixed-step loop networks. Zbl 1155.05032
Yong, Xuerong; Zhang, Yuanping; Golin, Mordecai J.
4
2008
More efficient algorithms and analyses for unequal letter cost prefix-free coding. Zbl 1329.94046
Golin, Mordecai J.; Li, Jian
2
2008
More efficient algorithms and analyses for unequal letter cost prefix-free coding. Zbl 1193.94053
Golin, Mordecai; Li, Jian
1
2007
Online maintenance of \(k\)-medians and \(k\)-covers on a line. Zbl 1099.68129
Fleischer, Rudolf; Golin, Mordecai J.; Zhang, Yan
2
2006
The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity. Zbl 1192.90217
Bein, Wolfgang W.; Golin, Mordecai J.; Larmore, Lawrence L.; Zhang, Yan
2
2006
Chebyshev polynomials and spanning tree formulas for circulant and related graphs. Zbl 1070.05029
Zhang, Yuanping; Yong, Xuerong; Golin, Mordecai J.
32
2005
Curve reconstruction from noisy samples. Zbl 1070.65013
Cheng, Siu-Wing; Funke, Stefan; Golin, Mordecai; Kumar, Piyush; Poon, Sheung-Hung; Ramos, Edgar
8
2005
Competitive facility location: the Voronoi game. Zbl 1098.91003
Ahn, Hee-Kap; Cheng, Siu-Wing; Cheong, Otfried; Golin, Mordecai; van Oostrum, René
33
2004
Fun-Sort – or the chaos of unordered binary search. Zbl 1062.68045
Biedl, Therese; Chan, Timothy; Demaine, Erik D.; Fleischer, Rudolf; Golin, Mordecai; King, James A.; Munro, J. Ian
5
2004
Counting spanning trees and other structures in non-constant-jump circulant graphs (Extended abstract). Zbl 1116.05303
Golin, Mordecai J.; Leung, Yiu Cho; Wang, Yajun
4
2004
Unhooking circulant graphs: A combinatorial method for counting spanning trees and other parameters. Zbl 1112.05312
Golin, Mordecai J.; Leung, Yiu Cho
3
2004
New upper and lower bounds on the channel capacity of read/write isolated memory. Zbl 1046.94006
Golin, Mordecai J.; Yong, Xuerong; Zhang, Yuanping; Sheng, Li
2
2004
Online maintenance of \(k\)-medians and \(k\)-covers on a line. Zbl 1095.68754
Fleischer, Rudolf; Golin, Mordecai J.; Zhang, Yan
1
2004
Algorithms for infinite Huffman-codes. Zbl 1318.94056
Golin, Mordecai J.; Ma, Kin Keung
1
2004
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes. Zbl 1023.65014
Golin, Mordecai J.; Na, Hyeon-Suk
12
2003
The convex hull for random lines in the plane. Zbl 1179.52009
Golin, Mordecai; Langerman, Stefan; Steiger, William
2
2003
Curve reconstruction from noisy samples. Zbl 1378.65053
Cheng, Siu-Wing; Funke, Stefan; Golin, Mordecai; Kumar, Piyush; Poon, Sheung-Hung; Ramos, Edgar
1
2003
Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets. Zbl 1036.94006
Ding, Cunsheng; Golin, Mordecai; Kløve, Torleiv
1
2003
Optimal prefix-free codes for unequal letter costs: Dynamic programming with the Monge property. Zbl 1005.94013
Bradford, Phil; Golin, Mordecai J.; Larmore, Lawrence L.; Rytter, Wojciech
4
2002
Huffman coding with unequal letter costs. Zbl 1192.68899
Golin, Mordecai J.; Kenyon, Claire; Young, Neal E.
4
2002
Further applications of Chebyshev polynomials in the derivation of spanning tree formulas for circulant graphs. Zbl 1029.05075
Zhang, Yuanping; Golin, Mordecai J.
3
2002
The probabilistic complexity of the Voronoi diagram of points on a polyhedron. Zbl 1414.68121
Golin, Mordecai J.; Na, Hyeon-Suk
1
2002
Competitive facility location along a highway. Zbl 0998.91009
Ahn, Hee-Kap; Cheng, Siu-Wing; Cheong, Otfried; Golin, Mordecai; van Oostrum, René
6
2001
Lopsided trees. I: Analyses. Zbl 0989.68105
Choi, V.; Golin, M. J.
1
2001
The number of spanning trees in circulant graphs. Zbl 0969.05036
Zhang, Yuanping; Yong, Xuerong; Golin, Mordecai J.
34
2000
An algorithm for finding a \(k\)-median in a directed tree. Zbl 1003.68196
Vigneron, Antoine; Gao, Lixin; Golin, Mordecai J.; Italiano, Giuseppe F.; Li, Bo
7
2000
A dynamic programming algorithm for constructing optimal “1”-ended binary prefix-free codes. Zbl 1002.94015
Chan, Sze-Lok; Golin, Mordecai J.
1
2000
On the expected depth of random circuits. Zbl 0941.68001
Arya, Sunil; Golin, Mordecai J.; Mehlhorn, Kurt
8
1999
Optimal point-to-point broadcast algorithms via lopsided trees. Zbl 1031.90006
Golin, Mordecai; Schuster, Assaf
1
1999
A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs. Zbl 0980.94009
Golin, Mordecai J.; Rote, Günter
7
1998
Dog bites postman: Point location in the moving Voronoi diagram and related problems. Zbl 1035.68528
Devillers, Olivier; Golin, Mordecai J.
5
1998
Labelled trees and pairs of input–output permutations in priority queues. Zbl 0917.68048
Golin, M.; Zaks, S.
3
1998
Queries on Voronoi diagrams on moving points. Zbl 0857.68104
Devillers, O.; Golin, M.; Kedem, K.; Schirra, S.
7
1996
Limit theorems for minimum-weight triangulations, other Euclidean functionals, and probabilistic recurrence relations. (Extended abstract). Zbl 0845.60016
Golin, Mordecai J.
3
1996
Lopsided trees: Analyses, algorithms, and applications (extended abstract). Zbl 1046.68511
Choi, Vicky Siu-Ngan; Golin, Mordecai
1
1996
Prefix codes: Equiprobable words, unequal letter costs. Zbl 0876.68053
Golin, Mordecai J.; Young, Neal
1
1996
Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas. Zbl 0875.68901
Devillers, Olivier; Golin, Mordecai J.
5
1995
Mellin transforms and asymptotics. The mergesort recurrence. Zbl 0818.68064
Flajolet, Philippe; Golin, Mordecai
21
1994
A provably fast linear-expected-time maxima-finding algorithm. Zbl 0823.68112
Golin, M. J.
4
1994
Queue-mergesort. Zbl 0787.68030
Golin, Mordecai J.; Sedgewick, Robert
6
1993
Maxima in convex regions. Zbl 0802.60015
Golin, Mordecai J.
3
1993
Exact asymptotics of divide-and-conquer recurrences. Zbl 1418.68252
Flajolet, Philippe; Golin, Mordecai
3
1993
How many maxima can there be? Zbl 0774.68059
Golin, Mordecai J.
2
1993
Randomized data structures for the dynamic closest-pair problem. Zbl 0801.68036
Golin, Mordecai; Raman, Rajeev; Schwarz, Christian; Smid, Michiel
1
1993
all top 5

Cited by 434 Authors

23 Golin, Mordecai J.
13 Mednykh, Il’ya Aleksandrovich
10 Yong, Xuerong
9 Hwang, Hsien-Kuei
8 Das, Sandip
8 Katoh, Naoki
8 Mednykh, Aleksandr Dmitrievich
8 Satti, Srinivasa Rao
7 Banik, Aritra
7 Devillers, Olivier
7 Higashikawa, Yuya
6 Flajolet, Philippe
6 Jo, Seungbum
5 Chrobak, Marek
5 Dumas, Philippe
5 Kameda, Tsunehiko
5 Maheshwari, Anil
5 Raman, Rajeev
4 Baïou, Mourad
4 Barahona, Francisco
4 Bhattacharya, Bhaswar B.
4 Boissonnat, Jean-Daniel
4 Cheng, Siu-Wing
4 Kwon, Young Soo
4 Li, Hongmei
4 Munro, J. Ian
4 Nikolopoulos, Stavros D.
4 Papadopoulos, Charis
4 Xu, Yinfeng
4 Young, Neal E.
4 Zhang, Yuanping
3 Agarwal, Pankaj Kumar
3 Atajan, Talip
3 Bhattacharya, Binay Kumar
3 Chan, Timothy Moon-Yew
3 Daoud, Salama Nagy
3 Das, Arun Kumar
3 Durocher, Stephane
3 Fekete, Sándor P.
3 Gagie, Travis
3 Glisse, Marc
3 Hurtado, Ferran
3 Lewenstein, Moshe
3 Louis, Justine
3 Palios, Leonidas
3 Sarvottamananda, Swami
3 Seara, Carlos
3 Tsai, Tsung-Hsi
3 Tsiotras, Panagiotis
2 Abrosimov, Nikolaĭ Vladimirovich
2 Agaev, Rafig P.
2 Attali, Dominique
2 Baĭgonakova, Gal’ya Amanboldynovna
2 Bakolas, Efstathios
2 Benkoczi, Robert R.
2 Bilò, Vittorio
2 Byrne, Thomas H.
2 Cabello, Sergio
2 Chebotarev, Pavel Yu.
2 Chen, Wei-Mei
2 Chen, Xiebin
2 Chen, Yen-Chi
2 Chen, Zhibing
2 Cook, Atlas F. IV
2 Davoodi, Pooya
2 Dutta, Kunal
2 Dziubiński, Marcin
2 Fawzi, Omar
2 Flammini, Michele
2 Gawrychowski, Paweł
2 Genovese, Christopher R.
2 Grunwald, Liliya Aleksandrovna
2 Iacono, John
2 Inaba, Hiroshi
2 Jayapaul, Varunkumar
2 Kalcsics, Jörg
2 Kallrath, Josef
2 Kaplan, Haim
2 Kim, Deok-Soo
2 Kleist, Linda
2 Lam, Tak-Wah
2 Li, Feng
2 Liu, Jia Jie
2 Mahmoud, Hosam M.
2 Manzini, Giovanni
2 Monaco, Gianpiero
2 Moscardelli, Luca
2 Navarro, Gonzalo
2 Nicholson, Patrick K.
2 Nogneng, Dorian
2 Noy, Marc
2 Oudot, Steve Yann
2 Prodinger, Helmut
2 Raman, Venkatesh
2 Ramos, Pedro A.
2 Ryu, Joonghyun
2 Saburi, Shun
2 Sharir, Micha
2 Smid, Michiel H. M.
2 Song, Chanyoung
...and 334 more Authors
all top 5

Cited in 83 Serials

26 Theoretical Computer Science
13 Information Processing Letters
13 Algorithmica
12 Discrete Applied Mathematics
11 Computational Geometry
10 Discrete Mathematics
7 Discrete & Computational Geometry
5 European Journal of Operational Research
5 Mathematical Problems in Engineering
4 Linear Algebra and its Applications
4 Theory of Computing Systems
4 Discrete Optimization
3 Automatica
3 Advances in Applied Mathematics
3 The Annals of Applied Probability
3 Doklady Mathematics
3 Journal of Combinatorial Optimization
3 Ars Mathematica Contemporanea
2 Advances in Applied Probability
2 Journal of Computational and Applied Mathematics
2 Networks
2 European Journal of Combinatorics
2 Operations Research Letters
2 Information and Computation
2 Computers & Operations Research
2 Journal of Parallel and Distributed Computing
2 Annals of Operations Research
2 Random Structures & Algorithms
2 International Journal of Computational Geometry & Applications
2 Automation and Remote Control
2 Combinatorics, Probability and Computing
2 Annals of Combinatorics
2 JMMA. Journal of Mathematical Modelling and Algorithms
2 Journal of Discrete Algorithms
2 Sibirskie Èlektronnye Matematicheskie Izvestiya
2 Science China. Information Sciences
1 Acta Informatica
1 American Mathematical Monthly
1 Bulletin of the Australian Mathematical Society
1 Physica A
1 Russian Mathematical Surveys
1 The Annals of Statistics
1 Applied Mathematics and Computation
1 International Journal of Game Theory
1 Journal of the American Statistical Association
1 Journal of Computer and System Sciences
1 Mathematics of Operations Research
1 Monatshefte für Mathematik
1 Operations Research
1 Tôhoku Mathematical Journal. Second Series
1 Statistics & Probability Letters
1 Computer Aided Geometric Design
1 Graphs and Combinatorics
1 ACM Transactions on Graphics
1 Applied Mathematics Letters
1 Journal of Scientific Computing
1 International Journal of Foundations of Computer Science
1 Journal of Global Optimization
1 Designs, Codes and Cryptography
1 Applied Mathematical Modelling
1 International Journal of Computer Mathematics
1 Annales de l’Institut Henri Poincaré. Probabilités et Statistiques
1 RAIRO. Informatique Théorique et Applications
1 Advances in Engineering Software
1 Journal of Algebraic Combinatorics
1 Test
1 Journal de Théorie des Nombres de Bordeaux
1 Applied and Computational Harmonic Analysis
1 The Electronic Journal of Combinatorics
1 Vietnam Journal of Mathematics
1 Journal of Scheduling
1 CEJOR. Central European Journal of Operations Research
1 Methodology and Computing in Applied Probability
1 International Game Theory Review
1 Forma
1 Journal of Applied Mathematics
1 Bulletin of the Malaysian Mathematical Sciences Society. Second Series
1 Mathematical Biosciences and Engineering
1 Proyecciones
1 Optimization Letters
1 Electronic Journal of Statistics
1 Probability Surveys
1 Symmetry

Citations by Year