default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Mordecai J. Golin
@inproceedings{DBLP:conf/sosa/GanG24,
author = {Jinxiang Gan and
Mordecai J. Golin},
editor = {Merav Parter and
Seth Pettie},
title = {Fully Dynamic \emph{k}-Center in Low Dimensions via Approximate Furthest
Neighbors},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {269--278},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.24},
doi = {10.1137/1.9781611977936.24},
timestamp = {Wed, 10 Apr 2024 20:26:09 +0200},
biburl = {https://dblp.org/rec/conf/sosa/GanG24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-11622,
author = {Mordecai J. Golin and
Albert John Lalim Patupat},
title = {The Markov-Chain Polytope with Applications},
journal = {CoRR},
volume = {abs/2401.11622},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.11622},
doi = {10.48550/ARXIV.2401.11622},
eprinttype = {arXiv},
eprint = {2401.11622},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-11622.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2405-06805,
author = {Reza Hosseini Dolatabadi and
Mordecai J. Golin and
Arian Zamani},
title = {A (Weakly) Polynomial Algorithm for {AIVF} Coding},
journal = {CoRR},
volume = {abs/2405.06805},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2405.06805},
doi = {10.48550/ARXIV.2405.06805},
eprinttype = {arXiv},
eprint = {2405.06805},
timestamp = {Sat, 15 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2405-06805.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2405-06831,
author = {Reza Hosseini Dolatabadi and
Mordecai J. Golin and
Arian Zamani},
title = {Better Algorithms for Constructing Minimum Cost Markov Chains and
{AIFV} Codes},
journal = {CoRR},
volume = {abs/2405.06831},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2405.06831},
doi = {10.48550/ARXIV.2405.06831},
eprinttype = {arXiv},
eprint = {2405.06831},
timestamp = {Sat, 15 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2405-06831.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenG23,
author = {Di Chen and
Mordecai J. Golin},
title = {Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation
with Dynamic Confluent Flows},
journal = {Algorithmica},
volume = {85},
number = {7},
pages = {1948--2000},
year = {2023},
url = {https://doi.org/10.1007/s00453-022-01083-y},
doi = {10.1007/S00453-022-01083-Y},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/YuGZ23,
author = {Wei Yu and
Mordecai J. Golin and
Guochuan Zhang},
title = {Scheduling on a graph with release times},
journal = {J. Sched.},
volume = {26},
number = {6},
pages = {571--580},
year = {2023},
url = {https://doi.org/10.1007/s10951-021-00680-z},
doi = {10.1007/S10951-021-00680-Z},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/YuGZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GolinH23,
author = {Mordecai J. Golin and
Elfarouk Harb},
title = {A Polynomial Time Algorithm for Constructing Optimal Binary {AIFV-2}
Codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {69},
number = {10},
pages = {6269--6278},
year = {2023},
url = {https://doi.org/10.1109/TIT.2023.3287587},
doi = {10.1109/TIT.2023.3287587},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/GolinH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-09737,
author = {Jinxiang Gan and
Mordecai J. Golin},
title = {Fully Dynamic k-Center in Low Dimensions via Approximate Furthest
Neighbors},
journal = {CoRR},
volume = {abs/2302.09737},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.09737},
doi = {10.48550/ARXIV.2302.09737},
eprinttype = {arXiv},
eprint = {2302.09737},
timestamp = {Thu, 23 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-09737.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-09911,
author = {Jinxiang Gan and
Mordecai J. Golin and
Zonghan Yang and
Yuhao Zhang},
title = {Fair k-Center: a Coreset Approach in Low Dimensions},
journal = {CoRR},
volume = {abs/2302.09911},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.09911},
doi = {10.48550/ARXIV.2302.09911},
eprinttype = {arXiv},
eprint = {2302.09911},
timestamp = {Thu, 23 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-09911.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/ChrobakGMY22,
author = {Marek Chrobak and
Mordecai J. Golin and
J. Ian Munro and
Neal E. Young},
title = {On Huang and Wong's algorithm for generalized binary split trees},
journal = {Acta Informatica},
volume = {59},
number = {6},
pages = {687--708},
year = {2022},
url = {https://doi.org/10.1007/s00236-021-00411-z},
doi = {10.1007/S00236-021-00411-Z},
timestamp = {Tue, 06 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/acta/ChrobakGMY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolinS22,
author = {Mordecai J. Golin and
Sai Sandeep},
title = {Minmax regret for sink location on dynamic flow paths with general
capacities},
journal = {Discret. Appl. Math.},
volume = {315},
pages = {1--26},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2022.02.027},
doi = {10.1016/J.DAM.2022.02.027},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/GolinS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChrobakGMY22,
author = {Marek Chrobak and
Mordecai J. Golin and
J. Ian Munro and
Neal E. Young},
title = {A Simple Algorithm for Optimal Search Trees with Two-way Comparisons},
journal = {{ACM} Trans. Algorithms},
volume = {18},
number = {1},
pages = {2:1--2:11},
year = {2022},
url = {https://doi.org/10.1145/3477910},
doi = {10.1145/3477910},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/ChrobakGMY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/GolinP22,
author = {Mordecai J. Golin and
Albert John L. Patupat},
title = {Speeding Up AIFV-m Dynamic Programs by m-1 Orders of Magnitude},
booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2022,
Espoo, Finland, June 26 - July 1, 2022},
pages = {246--251},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/ISIT50566.2022.9834477},
doi = {10.1109/ISIT50566.2022.9834477},
timestamp = {Mon, 08 Aug 2022 16:44:13 +0200},
biburl = {https://dblp.org/rec/conf/isit/GolinP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/ChrobakGMY21,
author = {Marek Chrobak and
Mordecai J. Golin and
J. Ian Munro and
Neal E. Young},
title = {On the cost of unsuccessful searches in search trees with two-way
comparisons},
journal = {Inf. Comput.},
volume = {281},
pages = {104707},
year = {2021},
url = {https://doi.org/10.1016/j.ic.2021.104707},
doi = {10.1016/J.IC.2021.104707},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/ChrobakGMY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/ChrobakGLN21,
author = {Marek Chrobak and
Mordecai J. Golin and
Tak Wah Lam and
Dorian Nogneng},
title = {Scheduling with gaps: new models and algorithms},
journal = {J. Sched.},
volume = {24},
number = {4},
pages = {381--403},
year = {2021},
url = {https://doi.org/10.1007/s10951-021-00691-w},
doi = {10.1007/S10951-021-00691-W},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/scheduling/ChrobakGLN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GolinH21,
author = {Mordecai J. Golin and
Elfarouk Harb},
title = {Speeding up the {AIFV-2} dynamic programs by two orders of magnitude
using Range Minimum Queries},
journal = {Theor. Comput. Sci.},
volume = {865},
pages = {99--118},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.02.040},
doi = {10.1016/J.TCS.2021.02.040},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GolinH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-01052,
author = {Marek Chrobak and
Mordecai J. Golin and
J. Ian Munro and
Neal E. Young},
title = {On the Cost of Unsuccessful Searches in Search Trees with Two-way
Comparisons},
journal = {CoRR},
volume = {abs/2103.01052},
year = {2021},
url = {https://arxiv.org/abs/2103.01052},
eprinttype = {arXiv},
eprint = {2103.01052},
timestamp = {Thu, 04 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-01052.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-01084,
author = {Marek Chrobak and
Mordecai J. Golin and
J. Ian Munro and
Neal E. Young},
title = {A Simple Algorithm for Optimal Search Trees with Two-Way Comparisons},
journal = {CoRR},
volume = {abs/2103.01084},
year = {2021},
url = {https://arxiv.org/abs/2103.01084},
eprinttype = {arXiv},
eprint = {2103.01084},
timestamp = {Thu, 04 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-01084.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-11170,
author = {Mordecai J. Golin and
Elfarouk Harb},
title = {Polynomial Time Algorithms for Constructing Optimal Binary {AIFV-2}
Codes},
journal = {CoRR},
volume = {abs/2001.11170},
year = {2020},
url = {https://arxiv.org/abs/2001.11170},
eprinttype = {arXiv},
eprint = {2001.11170},
timestamp = {Mon, 03 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-11170.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-09885,
author = {Mordecai J. Golin and
Elfarouk Harb},
title = {Speeding up the {AIFV-2} dynamic programs by two orders of magnitude
using Range Minimum Queries},
journal = {CoRR},
volume = {abs/2002.09885},
year = {2020},
url = {https://arxiv.org/abs/2002.09885},
eprinttype = {arXiv},
eprint = {2002.09885},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-09885.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ArumugamAGS19,
author = {Guru Prakash Arumugam and
John Augustine and
Mordecai J. Golin and
Prashanth Srikanthan},
title = {Minmax Regret k-Sink Location on a Dynamic Path Network with Uniform
Capacities},
journal = {Algorithmica},
volume = {81},
number = {9},
pages = {3534--3585},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00589-2},
doi = {10.1007/S00453-019-00589-2},
timestamp = {Thu, 05 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ArumugamAGS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ChenGY19,
author = {Zhibing Chen and
Mordecai J. Golin and
Xuerong Yong},
title = {The transfer matrices and the capacity of the 2-dimensional (1, {\(\infty\)})-runlength
limited constraint},
journal = {Discret. Math.},
volume = {342},
number = {4},
pages = {975--987},
year = {2019},
url = {https://doi.org/10.1016/j.disc.2018.11.014},
doi = {10.1016/J.DISC.2018.11.014},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/ChenGY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DiazG19,
author = {Josep D{\'{\i}}az and
Mordecai J. Golin},
editor = {Dimitris Achlioptas and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {The Expected Number of Maximal Points of the Convolution of Two 2-D
Distributions},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2019, September 20-22, 2019, Massachusetts
Institute of Technology, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {145},
pages = {35:1--35:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.35},
doi = {10.4230/LIPICS.APPROX-RANDOM.2019.35},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/DiazG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/GolinH19,
author = {Mordecai J. Golin and
Elfarouk Harb},
editor = {Ali Bilgin and
Michael W. Marcellin and
Joan Serra{-}Sagrist{\`{a}} and
James A. Storer},
title = {Polynomial Time Algorithms for Constructing Optimal {AIFV} Codes},
booktitle = {Data Compression Conference, {DCC} 2019, Snowbird, UT, USA, March
26-29, 2019},
pages = {231--240},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/DCC.2019.00031},
doi = {10.1109/DCC.2019.00031},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dcc/GolinH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-03783,
author = {Marek Chrobak and
Mordecai J. Golin and
J. Ian Munro and
Neal E. Young},
title = {On Huang and Wong's Algorithm for Generalized Binary Split Trees},
journal = {CoRR},
volume = {abs/1901.03783},
year = {2019},
url = {http://arxiv.org/abs/1901.03783},
eprinttype = {arXiv},
eprint = {1901.03783},
timestamp = {Fri, 01 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-03783.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-12447,
author = {Mordecai J. Golin and
Sai Sandeep},
title = {Minmax Regret for sink location on paths with general capacities},
journal = {CoRR},
volume = {abs/1912.12447},
year = {2019},
url = {http://arxiv.org/abs/1912.12447},
eprinttype = {arXiv},
eprint = {1912.12447},
timestamp = {Fri, 03 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1912-12447.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GolinILMN18,
author = {Mordecai J. Golin and
John Iacono and
Stefan Langerman and
J. Ian Munro and
Yakov Nekrich},
editor = {Yossi Azar and
Hannah Bast and
Grzegorz Herman},
title = {Dynamic Trees with Almost-Optimal Access Cost},
booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22,
2018, Helsinki, Finland},
series = {LIPIcs},
volume = {112},
pages = {38:1--38:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ESA.2018.38},
doi = {10.4230/LIPICS.ESA.2018.38},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/GolinILMN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-09289,
author = {Di Chen and
Mordecai J. Golin},
title = {Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation
with Dynamic Confluent Flows},
journal = {CoRR},
volume = {abs/1803.09289},
year = {2018},
url = {http://arxiv.org/abs/1803.09289},
eprinttype = {arXiv},
eprint = {1803.09289},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-09289.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-03814,
author = {Mordecai J. Golin and
Sai Sandeep},
title = {Minmax-Regret k-Sink Location on a Dynamic Tree Network with Uniform
Capacities},
journal = {CoRR},
volume = {abs/1806.03814},
year = {2018},
url = {http://arxiv.org/abs/1806.03814},
eprinttype = {arXiv},
eprint = {1806.03814},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-03814.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-10498,
author = {Mordecai J. Golin and
John Iacono and
Stefan Langerman and
J. Ian Munro and
Yakov Nekrich},
title = {Dynamic Trees with Almost-Optimal Access Cost},
journal = {CoRR},
volume = {abs/1806.10498},
year = {2018},
url = {http://arxiv.org/abs/1806.10498},
eprinttype = {arXiv},
eprint = {1806.10498},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-10498.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-06845,
author = {Josep D{\'{\i}}az and
Mordecai J. Golin},
title = {Smoothed Analysis of the Expected Number of Maximal Points in Two
Dimensions},
journal = {CoRR},
volume = {abs/1807.06845},
year = {2018},
url = {http://arxiv.org/abs/1807.06845},
eprinttype = {arXiv},
eprint = {1807.06845},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-06845.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GolinKQ17,
author = {Mordecai J. Golin and
Hadi Khodabande and
Bo Qin},
editor = {Yoshio Okamoto and
Takeshi Tokuyama},
title = {Non-approximability and Polylogarithmic Approximations of the Single-Sink
Unsplittable and Confluent Dynamic Flow Problems},
booktitle = {28th International Symposium on Algorithms and Computation, {ISAAC}
2017, December 9-12, 2017, Phuket, Thailand},
series = {LIPIcs},
volume = {92},
pages = {41:1--41:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2017.41},
doi = {10.4230/LIPICS.ISAAC.2017.41},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GolinKQ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BhattacharyaGHK17,
author = {Binay Bhattacharya and
Mordecai J. Golin and
Yuya Higashikawa and
Tsunehiko Kameda and
Naoki Katoh},
editor = {Faith Ellen and
Antonina Kolokolova and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Improved Algorithms for Computing k-Sink on Dynamic Flow Path Networks},
booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS}
2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10389},
pages = {133--144},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-62127-2\_12},
doi = {10.1007/978-3-319-62127-2\_12},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BhattacharyaGHK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-10307,
author = {Mordecai J. Golin and
Hadi Khodabande and
Bo Qin},
title = {Non-approximability and Polylogarithmic Approximations of the Single-Sink
Unsplittable and Confluent Dynamic Flow Problems},
journal = {CoRR},
volume = {abs/1709.10307},
year = {2017},
url = {http://arxiv.org/abs/1709.10307},
eprinttype = {arXiv},
eprint = {1709.10307},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-10307.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/WangYG16,
author = {Chuan{-}Long Wang and
Xuerong Yong and
Mordecai J. Golin},
title = {The channel capacity of read/write isolated memory},
journal = {Discret. Appl. Math.},
volume = {198},
pages = {264--273},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.05.027},
doi = {10.1016/J.DAM.2015.05.027},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/WangYG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GolinIKRSS16,
author = {Mordecai J. Golin and
John Iacono and
Danny Krizanc and
Rajeev Raman and
Srinivasa Rao Satti and
Sunil M. Shende},
title = {Encoding 2D range maximum queries},
journal = {Theor. Comput. Sci.},
volume = {609},
pages = {316--327},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2015.10.012},
doi = {10.1016/J.TCS.2015.10.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GolinIKRSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChenG16,
author = {Di Chen and
Mordecai J. Golin},
editor = {Seok{-}Hee Hong},
title = {Sink Evacuation on Trees with Dynamic Confluent Flows},
booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC}
2016, December 12-14, 2016, Sydney, Australia},
series = {LIPIcs},
volume = {64},
pages = {25:1--25:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.25},
doi = {10.4230/LIPICS.ISAAC.2016.25},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ChenG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ArumugamAGHKS16,
author = {Guru Prakash Arumugam and
John Augustine and
Mordecai J. Golin and
Yuya Higashikawa and
Naoki Katoh and
Prashanth Srikanthan},
title = {Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities},
journal = {CoRR},
volume = {abs/1606.07208},
year = {2016},
url = {http://arxiv.org/abs/1606.07208},
eprinttype = {arXiv},
eprint = {1606.07208},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ArumugamAGHKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChenG16f,
author = {Di Chen and
Mordecai J. Golin},
title = {Minmax Tree Facility Location and Sink Evacuation with Dynamic Confluent
Flows},
journal = {CoRR},
volume = {abs/1607.08041},
year = {2016},
url = {http://arxiv.org/abs/1607.08041},
eprinttype = {arXiv},
eprint = {1607.08041},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChenG16f.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BhattacharyaGHK16,
author = {Binay K. Bhattacharya and
Mordecai J. Golin and
Yuya Higashikawa and
Tsunehiko Kameda and
Naoki Katoh},
title = {Improved Algorithms for Computing k-Sink on Dynamic Path Networks},
journal = {CoRR},
volume = {abs/1609.01373},
year = {2016},
url = {http://arxiv.org/abs/1609.01373},
eprinttype = {arXiv},
eprint = {1609.01373},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BhattacharyaGHK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HigashikawaACGK15,
author = {Yuya Higashikawa and
John Augustine and
Siu{-}Wing Cheng and
Mordecai J. Golin and
Naoki Katoh and
Guanqun Ni and
Bing Su and
Yin{-}Feng Xu},
title = {Minimax regret 1-sink location problem in dynamic path networks},
journal = {Theor. Comput. Sci.},
volume = {588},
pages = {24--36},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2014.02.010},
doi = {10.1016/J.TCS.2014.02.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HigashikawaACGK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HigashikawaGK15,
author = {Yuya Higashikawa and
Mordecai J. Golin and
Naoki Katoh},
title = {Multiple sink location problems in dynamic path networks},
journal = {Theor. Comput. Sci.},
volume = {607},
pages = {2--15},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.05.053},
doi = {10.1016/J.TCS.2015.05.053},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HigashikawaGK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChrobakGLN15,
author = {Marek Chrobak and
Mordecai J. Golin and
Tak Wah Lam and
Dorian Nogneng},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {Scheduling with Gaps: New Models and Algorithms},
booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015,
Paris, France, May 20-22, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9079},
pages = {114--126},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_8},
doi = {10.1007/978-3-319-18173-8\_8},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ChrobakGLN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ChrobakGMY15,
author = {Marek Chrobak and
Mordecai J. Golin and
J. Ian Munro and
Neal E. Young},
editor = {Khaled M. Elbassioni and
Kazuhisa Makino},
title = {Optimal Search Trees with 2-Way Comparisons},
booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC}
2015, Nagoya, Japan, December 9-11, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9472},
pages = {71--82},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48971-0\_7},
doi = {10.1007/978-3-662-48971-0\_7},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ChrobakGMY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChrobakGMY15,
author = {Marek Chrobak and
Mordecai J. Golin and
J. Ian Munro and
Neal E. Young},
title = {Optimal search trees with equality tests},
journal = {CoRR},
volume = {abs/1505.00357},
year = {2015},
url = {http://arxiv.org/abs/1505.00357},
eprinttype = {arXiv},
eprint = {1505.00357},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChrobakGMY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/HigashikawaGK14,
author = {Yuya Higashikawa and
Mordecai J. Golin and
Naoki Katoh},
title = {Minimax Regret Sink Location Problem in Dynamic Tree Networks with
Uniform Capacity},
journal = {J. Graph Algorithms Appl.},
volume = {18},
number = {4},
pages = {539--555},
year = {2014},
url = {https://doi.org/10.7155/jgaa.00336},
doi = {10.7155/JGAA.00336},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/HigashikawaGK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/HigashikawaGK14,
author = {Yuya Higashikawa and
Mordecai J. Golin and
Naoki Katoh},
editor = {Qianping Gu and
Pavol Hell and
Boting Yang},
title = {Multiple Sink Location Problems in Dynamic Path Networks},
booktitle = {Algorithmic Aspects in Information and Management - 10th International
Conference, {AAIM} 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8546},
pages = {149--161},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-07956-1\_14},
doi = {10.1007/978-3-319-07956-1\_14},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/aaim/HigashikawaGK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/HigashikawaGK14,
author = {Yuya Higashikawa and
Mordecai J. Golin and
Naoki Katoh},
editor = {Sudebkumar Prasant Pal and
Kunihiko Sadakane},
title = {Minimax Regret Sink Location Problem in Dynamic Tree Networks with
Uniform Capacity},
booktitle = {Algorithms and Computation - 8th International Workshop, {WALCOM}
2014, Chennai, India, February 13-15, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8344},
pages = {125--137},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-04657-0\_14},
doi = {10.1007/978-3-319-04657-0\_14},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/walcom/HigashikawaGK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ArumugamAGS14,
author = {Guru Prakash Arumugam and
John Augustine and
Mordecai J. Golin and
Prashanth Srikanthan},
title = {A Polynomial Time Algorithm for Minimax-Regret Evacuation on a Dynamic
Path},
journal = {CoRR},
volume = {abs/1404.5448},
year = {2014},
url = {http://arxiv.org/abs/1404.5448},
eprinttype = {arXiv},
eprint = {1404.5448},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ArumugamAGS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HigashikawaGK14,
author = {Yuya Higashikawa and
Mordecai J. Golin and
Naoki Katoh},
title = {Improved Algorithms for Multiple Sink Location Problems in Dynamic
Path Networks},
journal = {CoRR},
volume = {abs/1405.5613},
year = {2014},
url = {http://arxiv.org/abs/1405.5613},
eprinttype = {arXiv},
eprint = {1405.5613},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HigashikawaGK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChrobakGLN14,
author = {Marek Chrobak and
Mordecai J. Golin and
Tak Wah Lam and
Dorian Nogneng},
title = {Scheduling with Gaps: New Models and Algorithms},
journal = {CoRR},
volume = {abs/1410.7092},
year = {2014},
url = {http://arxiv.org/abs/1410.7092},
eprinttype = {arXiv},
eprint = {1410.7092},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChrobakGLN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bar-NoyC0G13,
author = {Amotz Bar{-}Noy and
Panagiotis Cheilaris and
Yi Feng and
Mordecai J. Golin},
title = {Paging mobile users in cellular networks: Optimality versus complexity
and simplicity},
journal = {Theor. Comput. Sci.},
volume = {470},
pages = {23--35},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.11.029},
doi = {10.1016/J.TCS.2012.11.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bar-NoyC0G13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GolinMY12,
author = {Mordecai J. Golin and
Claire Mathieu and
Neal E. Young},
title = {Huffman Coding with Letter Costs: {A} Linear-Time Approximation Scheme},
journal = {{SIAM} J. Comput.},
volume = {41},
number = {3},
pages = {684--713},
year = {2012},
url = {https://doi.org/10.1137/100794092},
doi = {10.1137/100794092},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GolinMY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/YuGZ12,
author = {Wei Yu and
Mordecai J. Golin and
Guochuan Zhang},
editor = {Kun{-}Mao Chao and
Tsan{-}sheng Hsu and
Der{-}Tsai Lee},
title = {Vehicle Scheduling on a Graph Revisited},
booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC}
2012, Taipei, Taiwan, December 19-21, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7676},
pages = {362--371},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35261-4\_39},
doi = {10.1007/978-3-642-35261-4\_39},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/YuGZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GolinIKRR11,
author = {Mordecai J. Golin and
John Iacono and
Danny Krizanc and
Rajeev Raman and
S. Srinivasa Rao},
editor = {Takao Asano and
Shin{-}Ichi Nakano and
Yoshio Okamoto and
Osamu Watanabe},
title = {Encoding 2D Range Maximum Queries},
booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC}
2011, Yokohama, Japan, December 5-8, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7074},
pages = {180--189},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25591-5\_20},
doi = {10.1007/978-3-642-25591-5\_20},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GolinIKRR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-2885,
author = {Mordecai J. Golin and
John Iacono and
Danny Krizanc and
Rajeev Raman and
S. Srinivasa Rao},
title = {Encoding 2-D Range Maximum Queries},
journal = {CoRR},
volume = {abs/1109.2885},
year = {2011},
url = {http://arxiv.org/abs/1109.2885},
eprinttype = {arXiv},
eprint = {1109.2885},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1109-2885.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GolinYZ10,
author = {Mordecai J. Golin and
Xuerong Yong and
Yuanping Zhang},
title = {The asymptotic number of spanning trees in circulant graphs},
journal = {Discret. Math.},
volume = {310},
number = {4},
pages = {792--803},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2009.09.008},
doi = {10.1016/J.DISC.2009.09.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GolinYZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GolinZ10,
author = {Mordecai J. Golin and
Yan Zhang},
title = {A dynamic programming approach to length-limited Huffman coding: space
reduction with the Monge property},
journal = {{IEEE} Trans. Inf. Theory},
volume = {56},
number = {8},
pages = {3918--3929},
year = {2010},
url = {https://doi.org/10.1109/TIT.2010.2050947},
doi = {10.1109/TIT.2010.2050947},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GolinZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/analco/2010,
editor = {Mordecai J. Golin and
Robert Sedgewick},
title = {Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2010, Austin, Texas, USA, January 16, 2010},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973006},
doi = {10.1137/1.9781611973006},
isbn = {978-0-89871-933-8},
timestamp = {Thu, 01 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/2010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1003-0150,
author = {Yun Kuen Cheung and
Philippe Flajolet and
Mordecai J. Golin and
C. Y. James Lee},
title = {Multidimensional Divide-and-Conquer and Weighted Digital Sums},
journal = {CoRR},
volume = {abs/1003.0150},
year = {2010},
url = {http://arxiv.org/abs/1003.0150},
eprinttype = {arXiv},
eprint = {1003.0150},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1003-0150.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Bar-NoyGZ09,
author = {Amotz Bar{-}Noy and
Mordecai J. Golin and
Yan Zhang},
title = {Online Dynamic Programming Speedups},
journal = {Theory Comput. Syst.},
volume = {45},
number = {3},
pages = {429--445},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9166-x},
doi = {10.1007/S00224-009-9166-X},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Bar-NoyGZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BeinGLZ09,
author = {Wolfgang W. Bein and
Mordecai J. Golin and
Lawrence L. Larmore and
Yan Zhang},
title = {The Knuth-Yao quadrangle-inequality speedup is a consequence of total
monotonicity},
journal = {{ACM} Trans. Algorithms},
volume = {6},
number = {1},
pages = {17:1--17:22},
year = {2009},
url = {https://doi.org/10.1145/1644015.1644032},
doi = {10.1145/1644015.1644032},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BeinGLZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/CheungFGL09,
author = {Yun Kuen Cheung and
Philippe Flajolet and
Mordecai J. Golin and
C. Y. James Lee},
editor = {Conrado Mart{\'{\i}}nez and
Robert Sedgewick},
title = {Multidimensional Divide-and-Conquer and Weighted Digital Sums},
booktitle = {Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2009, New York, New York, USA, January 03, 2009},
pages = {58--74},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611972993.9},
doi = {10.1137/1.9781611972993.9},
timestamp = {Thu, 01 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/CheungFGL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GolinXY09,
author = {Mordecai J. Golin and
Xiaoming Xu and
Jiajin Yu},
editor = {Claire Mathieu},
title = {A generic top-down dynamic-programming approach to prefix-free coding},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {758--767},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.83},
doi = {10.1137/1.9781611973068.83},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GolinXY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/YongZG08,
author = {Xuerong Yong and
Yuanping Zhang and
Mordecai J. Golin},
title = {The number of spanning trees in a class of double fixed-step loop
networks},
journal = {Networks},
volume = {52},
number = {2},
pages = {69--77},
year = {2008},
url = {https://doi.org/10.1002/net.20223},
doi = {10.1002/NET.20223},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/YongZG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GolinL08,
author = {Mordecai J. Golin and
Jian Li},
title = {More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free
Coding},
journal = {{IEEE} Trans. Inf. Theory},
volume = {54},
number = {8},
pages = {3412--3424},
year = {2008},
url = {https://doi.org/10.1109/TIT.2008.926326},
doi = {10.1109/TIT.2008.926326},
timestamp = {Tue, 12 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/GolinL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0806-4899,
author = {Mordecai J. Golin and
Yan Zhang},
title = {A Dynamic Programming Approach To Length-Limited Huffman Coding},
journal = {CoRR},
volume = {abs/0806.4899},
year = {2008},
url = {http://arxiv.org/abs/0806.4899},
eprinttype = {arXiv},
eprint = {0806.4899},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0806-4899.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0809-4577,
author = {Mordecai J. Golin and
Xiaoming Xu and
Jiajin Yu},
title = {A Generic Top-Down Dynamic-Programming Approach to Prefix-Free Coding},
journal = {CoRR},
volume = {abs/0809.4577},
year = {2008},
url = {http://arxiv.org/abs/0809.4577},
eprinttype = {arXiv},
eprint = {0809.4577},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0809-4577.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/GolinZ07,
author = {Mordecai J. Golin and
Yan Zhang},
title = {The two-median problem on Manhattan meshes},
journal = {Networks},
volume = {49},
number = {3},
pages = {226--233},
year = {2007},
url = {https://doi.org/10.1002/net.20156},
doi = {10.1002/NET.20156},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/GolinZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/GolinYZ07,
author = {Mordecai J. Golin and
Xuerong Yong and
Yuanping Zhang},
editor = {Daniel Panario and
Robert Sedgewick},
title = {The Asymptotic Number of Spanning Trees in Circulant Graphs},
booktitle = {Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2007, New Orleans, Louisiana, USA, January 06, 2007},
pages = {242--249},
publisher = {{SIAM}},
year = {2007},
url = {https://doi.org/10.1137/1.9781611972979.11},
doi = {10.1137/1.9781611972979.11},
timestamp = {Thu, 01 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/GolinYZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/Bar-NoyFG07,
author = {Amotz Bar{-}Noy and
Yi Feng and
Mordecai J. Golin},
title = {Paging Mobile Users Efficiently and Optimally},
booktitle = {{INFOCOM} 2007. 26th {IEEE} International Conference on Computer Communications,
Joint Conference of the {IEEE} Computer and Communications Societies,
6-12 May 2007, Anchorage, Alaska, {USA}},
pages = {1910--1918},
publisher = {{IEEE}},
year = {2007},
url = {https://doi.org/10.1109/INFCOM.2007.222},
doi = {10.1109/INFCOM.2007.222},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/infocom/Bar-NoyFG07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GolinL07,
author = {Mordecai J. Golin and
Jian Li},
editor = {Takeshi Tokuyama},
title = {More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free
Coding},
booktitle = {Algorithms and Computation, 18th International Symposium, {ISAAC}
2007, Sendai, Japan, December 17-19, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4835},
pages = {329--340},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77120-3\_30},
doi = {10.1007/978-3-540-77120-3\_30},
timestamp = {Tue, 12 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GolinL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0705-0253,
author = {Mordecai J. Golin and
Jian Li},
title = {More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free
Coding},
journal = {CoRR},
volume = {abs/0705.0253},
year = {2007},
url = {http://arxiv.org/abs/0705.0253},
eprinttype = {arXiv},
eprint = {0705.0253},
timestamp = {Tue, 12 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0705-0253.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FleischerGZ06,
author = {Rudolf Fleischer and
Mordecai J. Golin and
Yan Zhang},
title = {Online Maintenance of k-Medians and k-Covers on a Line},
journal = {Algorithmica},
volume = {45},
number = {4},
pages = {549--567},
year = {2006},
url = {https://doi.org/10.1007/s00453-005-1195-5},
doi = {10.1007/S00453-005-1195-5},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FleischerGZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/GolinLW06,
author = {Mordecai J. Golin and
Yiu{-}Cho Leung and
Yajun Wang},
editor = {Daniel Panario and
Robert Sedgewick},
title = {Permanents of Circulants: {A} Transfer Matrix Approach},
booktitle = {Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2006, Miami, Florida, USA, January 21, 2006},
pages = {263--272},
publisher = {{SIAM}},
year = {2006},
url = {https://doi.org/10.1137/1.9781611972962.11},
doi = {10.1137/1.9781611972962.11},
timestamp = {Thu, 01 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/GolinLW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BeinGLZ06,
author = {Wolfgang W. Bein and
Mordecai J. Golin and
Lawrence L. Larmore and
Yan Zhang},
title = {The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity},
booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
pages = {31--40},
publisher = {{ACM} Press},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109562},
timestamp = {Wed, 11 May 2016 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BeinGLZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/Bar-NoyGZ06,
author = {Amotz Bar{-}Noy and
Mordecai J. Golin and
Yan Zhang},
editor = {Thomas Erlebach and
Christos Kaklamanis},
title = {Online Dynamic Programming Speedups},
booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4368},
pages = {43--54},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11970125\_4},
doi = {10.1007/11970125\_4},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/waoa/Bar-NoyGZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/ChengFGKPR05,
author = {Siu{-}Wing Cheng and
Stefan Funke and
Mordecai J. Golin and
Piyush Kumar and
Sheung{-}Hung Poon and
Edgar A. Ramos},
title = {Curve reconstruction from noisy samples},
journal = {Comput. Geom.},
volume = {31},
number = {1-2},
pages = {63--100},
year = {2005},
url = {https://doi.org/10.1016/j.comgeo.2004.07.004},
doi = {10.1016/J.COMGEO.2004.07.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/ChengFGKPR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ZhangYG05,
author = {Yuanping Zhang and
Xuerong Yong and
Mordecai J. Golin},
title = {Chebyshev polynomials and spanning tree formulas for circulant and
related graphs},
journal = {Discret. Math.},
volume = {298},
number = {1-3},
pages = {334--364},
year = {2005},
url = {https://doi.org/10.1016/j.disc.2004.10.025},
doi = {10.1016/J.DISC.2004.10.025},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ZhangYG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/GolinLWY05,
author = {Mordecai J. Golin and
Yiu{-}Cho Leung and
Yajun Wang and
Xuerong Yong},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Counting Structures in Grid Graphs, Cylinders and Tori Using Transfer
Matrices: Survey and New Results},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {250--258},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/analco05/papers/08MGolin.pdf},
timestamp = {Tue, 30 Jan 2007 13:47:28 +0100},
biburl = {https://dblp.org/rec/conf/alenex/GolinLWY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/GolinN05,
author = {Mordecai J. Golin and
Hyeon{-}Suk Na},
title = {Generalizing the Kraft-McMillan Inequality to Restricted Languages},
booktitle = {2005 Data Compression Conference {(DCC} 2005), 29-31 March 2005, Snowbird,
UT, {USA}},
pages = {163--172},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/DCC.2005.42},
doi = {10.1109/DCC.2005.42},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/GolinN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/GolinL05,
author = {Mordecai J. Golin and
Zhenming Liu},
editor = {Frank K. H. A. Dehne and
Alejandro L{\'{o}}pez{-}Ortiz and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {The Structure of Optimal Prefix-Free Codes in Restricted Languages:
The Uniform Probability Case},
booktitle = {Algorithms and Data Structures, 9th International Workshop, {WADS}
2005, Waterloo, Canada, August 15-17, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3608},
pages = {372--384},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11534273\_33},
doi = {10.1007/11534273\_33},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/GolinL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolinYZS04,
author = {Mordecai J. Golin and
Xuerong Yong and
Yuanping Zhang and
Li Sheng},
title = {New upper and lower bounds on the channel capacity of read/write isolated
memory},
journal = {Discret. Appl. Math.},
volume = {140},
number = {1-3},
pages = {35--48},
year = {2004},
url = {https://doi.org/10.1016/j.dam.2003.02.001},
doi = {10.1016/J.DAM.2003.02.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GolinYZS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BiedlCDFGKM04,
author = {Therese Biedl and
Timothy M. Chan and
Erik D. Demaine and
Rudolf Fleischer and
Mordecai J. Golin and
James A. King and
J. Ian Munro},
title = {Fun-Sort--or the chaos of unordered binary search},
journal = {Discret. Appl. Math.},
volume = {144},
number = {3},
pages = {231--236},
year = {2004},
url = {https://doi.org/10.1016/j.dam.2004.01.003},
doi = {10.1016/J.DAM.2004.01.003},
timestamp = {Tue, 02 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BiedlCDFGKM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FleischerGLW04,
author = {Rudolf Fleischer and
Mordecai J. Golin and
Chin{-}Tau A. Lea and
Steven Wong},
title = {Finding optimal paths in {MREP} routing},
journal = {Inf. Process. Lett.},
volume = {89},
number = {2},
pages = {57--63},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.10.005},
doi = {10.1016/J.IPL.2003.10.005},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FleischerGLW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AhnCCGO04,
author = {Hee{-}Kap Ahn and
Siu{-}Wing Cheng and
Otfried Cheong and
Mordecai J. Golin and
Ren{\'{e}} van Oostrum},
title = {Competitive facility location: the Voronoi game},
journal = {Theor. Comput. Sci.},
volume = {310},
number = {1-3},
pages = {457--467},
year = {2004},
url = {https://doi.org/10.1016/j.tcs.2003.09.004},
doi = {10.1016/J.TCS.2003.09.004},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/AhnCCGO04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GolinLW04,
author = {Mordecai J. Golin and
Yiu{-}Cho Leung and
Yajun Wang},
editor = {Rudolf Fleischer and
Gerhard Trippen},
title = {Counting Spanning Trees and Other Structures in Non-constant-jump
Circulant Graphs},
booktitle = {Algorithms and Computation, 15th International Symposium, {ISAAC}
2004, Hong Kong, China, December 20-22, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3341},
pages = {508--521},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30551-4\_45},
doi = {10.1007/978-3-540-30551-4\_45},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GolinLW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GolinM04,
author = {Mordecai J. Golin and
Kin Keung Ma},
editor = {J. Ian Munro},
title = {Algorithms for infinite huffman-codes},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {758--767},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982908},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/GolinM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/FleischerGZ04,
author = {Rudolf Fleischer and
Mordecai J. Golin and
Yan Zhang},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Online Maintenance of k-Medians and k-Covers on a Line},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {102--113},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_10},
doi = {10.1007/978-3-540-27810-8\_10},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/FleischerGZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GolinL04,
author = {Mordecai J. Golin and
Yiu{-}Cho Leung},
editor = {Juraj Hromkovic and
Manfred Nagl and
Bernhard Westfechtel},
title = {Unhooking Circulant Graphs: {A} Combinatorial Method for Counting
Spanning Trees and Other Parameters},
booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG
2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {3353},
pages = {296--307},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30559-0\_25},
doi = {10.1007/978-3-540-30559-0\_25},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/GolinL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/GolinN03,
author = {Mordecai J. Golin and
Hyeon{-}Suk Na},
title = {On the average complexity of 3D-Voronoi diagrams of random points
on convex polytopes},
journal = {Comput. Geom.},
volume = {25},
number = {3},
pages = {197--231},
year = {2003},
url = {https://doi.org/10.1016/S0925-7721(02)00123-2},
doi = {10.1016/S0925-7721(02)00123-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/GolinN03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcc/DingGK03,
author = {Cunsheng Ding and
Mordecai J. Golin and
Torleiv Kl{\o}ve},
title = {Meeting the Welch and Karystinos-Pados Bounds on {DS-CDMA} Binary
Signature Sets},
journal = {Des. Codes Cryptogr.},
volume = {30},
number = {1},
pages = {73--84},
year = {2003},
url = {https://doi.org/10.1023/A:1024759310058},
doi = {10.1023/A:1024759310058},
timestamp = {Mon, 17 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcc/DingGK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/ChengFGKPR03,
author = {Siu{-}Wing Cheng and
Stefan Funke and
Mordecai J. Golin and
Piyush Kumar and
Sheung{-}Hung Poon and
Edgar A. Ramos},
editor = {Steven Fortune},
title = {Curve reconstruction from noisy samples},
booktitle = {Proceedings of the 19th {ACM} Symposium on Computational Geometry,
San Diego, CA, USA, June 8-10, 2003},
pages = {302--311},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/777792.777838},
doi = {10.1145/777792.777838},
timestamp = {Mon, 14 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/ChengFGKPR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/GolinL03,
author = {Mordecai J. Golin and
Yiu{-}Cho Leung},
title = {Recurrence Relations on Transfer Matrices Yield Good Lower and Upper
Bounds on the Channel Capacity of Some 2-Dimensional Constrained Systems
(Extended Abstract)},
booktitle = {2003 Data Compression Conference {(DCC} 2003), 25-27 March 2003, Snowbird,
UT, {USA}},
pages = {430},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/DCC.2003.1194049},
doi = {10.1109/DCC.2003.1194049},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/GolinL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/globecom/XieLGF03,
author = {Qiling Xie and
Chin{-}Tau A. Lea and
Mordecai J. Golin and
Rudolf Fleischer},
title = {Maximum residual energy routing with reverse energy cost},
booktitle = {Proceedings of the Global Telecommunications Conference, 2003. {GLOBECOM}
'03, San Francisco, CA, USA, 1-5 December 2003},
pages = {564--569},
publisher = {{IEEE}},
year = {2003},
url = {https://doi.org/10.1109/GLOCOM.2003.1258300},
doi = {10.1109/GLOCOM.2003.1258300},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/globecom/XieLGF03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BradfordGLR02,
author = {Phillip G. Bradford and
Mordecai J. Golin and
Lawrence L. Larmore and
Wojciech Rytter},
title = {Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming
with the Monge Property},
journal = {J. Algorithms},
volume = {42},
number = {2},
pages = {277--303},
year = {2002},
url = {https://doi.org/10.1006/jagm.2002.1213},
doi = {10.1006/JAGM.2002.1213},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BradfordGLR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/GolinN02,
author = {Mordecai J. Golin and
Hyeon{-}Suk Na},
editor = {Ferran Hurtado and
Vera Sacrist{\'{a}}n and
Chandrajit Bajaj and
Subhash Suri},
title = {The probabilistic complexity of the Voronoi diagram of points on a
polyhedron},
booktitle = {Proceedings of the 18th Annual Symposium on Computational Geometry,
Barcelona, Spain, June 5-7, 2002},
pages = {209--216},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/513400.513426},
doi = {10.1145/513400.513426},
timestamp = {Mon, 14 Jun 2021 16:25:21 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/GolinN02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/YongG02,
author = {Xuerong Yong and
Mordecai J. Golin},
title = {New Techniques for Bounding the Channel Capacity of Read/Write Isolated
Memor},
booktitle = {2002 Data Compression Conference {(DCC} 2002), 2-4 April, 2002, Snowbird,
UT, {USA}},
pages = {482},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/DCC.2002.1000025},
doi = {10.1109/DCC.2002.1000025},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/YongG02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jcdcg/GolinLS02,
author = {Mordecai J. Golin and
Stefan Langerman and
William L. Steiger},
editor = {Jin Akiyama and
Mikio Kano},
title = {The Convex Hull for Random Lines in the Plane},
booktitle = {Discrete and Computational Geometry, Japanese Conference, {JCDCG}
2002, Tokyo, Japan, December 6-9, 2002, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2866},
pages = {172--175},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/978-3-540-44400-8\_17},
doi = {10.1007/978-3-540-44400-8\_17},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/jcdcg/GolinLS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GolinKY02,
author = {Mordecai J. Golin and
Claire Kenyon and
Neal E. Young},
editor = {John H. Reif},
title = {Huffman coding with unequal letter costs},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {785--791},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.510020},
doi = {10.1145/509907.510020},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GolinKY02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0205048,
author = {Mordecai J. Golin and
Claire Kenyon and
Neal E. Young},
title = {Huffman Coding with Unequal Letter Costs},
journal = {CoRR},
volume = {cs.DS/0205048},
year = {2002},
url = {http://arxiv.org/abs/cs.DS/0205048},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0205048.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0205049,
author = {Mordecai J. Golin and
Neal E. Young},
title = {Prefix Codes: Equiprobable Words, Unequal Letter Costs},
journal = {CoRR},
volume = {cs.DS/0205049},
year = {2002},
url = {https://arxiv.org/abs/cs/0205049},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0205049.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChoiG01,
author = {Vicky Siu{-}Ngan Choi and
Mordecai J. Golin},
title = {Lopsided Trees, {I:} Analyses},
journal = {Algorithmica},
volume = {31},
number = {3},
pages = {240--290},
year = {2001},
url = {https://doi.org/10.1007/s00453-001-0063-1},
doi = {10.1007/S00453-001-0063-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChoiG01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Golin01,
author = {Mordecai J. Golin},
title = {A combinatorial approach to Golomb forests},
journal = {Theor. Comput. Sci.},
volume = {263},
number = {1-2},
pages = {283--304},
year = {2001},
url = {https://doi.org/10.1016/S0304-3975(00)00250-4},
doi = {10.1016/S0304-3975(00)00250-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Golin01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/AhnCCGO01,
author = {Hee{-}Kap Ahn and
Siu{-}Wing Cheng and
Otfried Cheong and
Mordecai J. Golin and
Ren{\'{e}} van Oostrum},
editor = {Jie Wang},
title = {Competitive Facility Location along a Highway},
booktitle = {Computing and Combinatorics, 7th Annual International Conference,
{COCOON} 2001, Guilin, China, August 20-23, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2108},
pages = {237--246},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44679-6\_26},
doi = {10.1007/3-540-44679-6\_26},
timestamp = {Mon, 03 Aug 2020 14:08:01 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/AhnCCGO01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/GolinN01,
author = {Mordecai J. Golin and
Hyeon{-}Suk Na},
title = {Optimal Prefix-Free Codes That End in a Specified Pattern and Similar
Problems: The Uniform Probability Case},
booktitle = {Data Compression Conference, {DCC} 2001, Snowbird, Utah, USA, March
27-29, 2001},
pages = {143--152},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/DCC.2001.917145},
doi = {10.1109/DCC.2001.917145},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/GolinN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sp/FungGG01,
author = {Wai W. Fung and
Mordecai J. Golin and
James W. Gray III},
title = {Protection of Keys against Modification Attack},
booktitle = {2001 {IEEE} Symposium on Security and Privacy, Oakland, California,
{USA} May 14-16, 2001},
pages = {26--36},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/SECPRI.2001.924285},
doi = {10.1109/SECPRI.2001.924285},
timestamp = {Thu, 21 Sep 2023 15:57:30 +0200},
biburl = {https://dblp.org/rec/conf/sp/FungGG01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ZhangYG00,
author = {Yuanping Zhang and
Xuerong Yong and
Mordecai J. Golin},
title = {The number of spanning trees in circulant graphs},
journal = {Discret. Math.},
volume = {223},
number = {1-3},
pages = {337--350},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00414-8},
doi = {10.1016/S0012-365X(99)00414-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ZhangYG00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/VigneronGGIL00,
author = {Antoine Vigneron and
Lixin Gao and
Mordecai J. Golin and
Giuseppe F. Italiano and
Bo Li},
title = {An algorithm for finding a k-median in a directed tree},
journal = {Inf. Process. Lett.},
volume = {74},
number = {1-2},
pages = {81--88},
year = {2000},
url = {https://doi.org/10.1016/S0020-0190(00)00026-0},
doi = {10.1016/S0020-0190(00)00026-0},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/VigneronGGIL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/ChanG00,
author = {Sze{-}Lok Chan and
Mordecai J. Golin},
title = {A dynamic programming algorithm for constructing optimal "1"-ended
binary prefix-free codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {46},
number = {4},
pages = {1637--1644},
year = {2000},
url = {https://doi.org/10.1109/18.850708},
doi = {10.1109/18.850708},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/ChanG00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/GolinN00,
author = {Mordecai J. Golin and
Hyeon{-}Suk Na},
title = {On the Average Complexity of 3D-Voronoi Diagrams of Random Points
on Convex Polytopes},
booktitle = {Proceedings of the 12th Canadian Conference on Computational Geometry,
Fredericton, New Brunswick, Canada, August 16-19, 2000},
year = {2000},
url = {http://www.cccg.ca/proceedings/2000/44.ps.gz},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/GolinN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolinS99,
author = {Mordecai J. Golin and
Assaf Schuster},
title = {Optimal Point-to-point Broadcast Algorithms Via Lopsided Trees},
journal = {Discret. Appl. Math.},
volume = {93},
number = {2-3},
pages = {233--263},
year = {1999},
url = {https://doi.org/10.1016/S0166-218X(99)00107-9},
doi = {10.1016/S0166-218X(99)00107-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GolinS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/LiGIDS99,
author = {Bo Li and
Mordecai J. Golin and
Giuseppe F. Italiano and
Xin Deng and
Kazem Sohraby},
title = {On the Optimal Placement of Web Proxies in the Internet},
booktitle = {Proceedings {IEEE} {INFOCOM} '99, The Conference on Computer Communications,
Eighteenth Annual Joint Conference of the {IEEE} Computer and Communications
Societies, The Future Is Now, New York, NY, USA, March 21-25, 1999},
pages = {1282--1290},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/INFCOM.1999.752146},
doi = {10.1109/INFCOM.1999.752146},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/infocom/LiGIDS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/DevillersG98,
author = {Olivier Devillers and
Mordecai J. Golin},
title = {Dog Bites Postman: Point Location in the Moving Voronoi Diagram and
Related Problems},
journal = {Int. J. Comput. Geom. Appl.},
volume = {8},
number = {3},
pages = {321--342},
year = {1998},
url = {https://doi.org/10.1142/S0218195998000163},
doi = {10.1142/S0218195998000163},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/DevillersG98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GolinRSS98,
author = {Mordecai J. Golin and
Rajeev Raman and
Christian Schwarz and
Michiel H. M. Smid},
title = {Randomized Data Structures for the Dynamic Closest-Pair Problem},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {4},
pages = {1036--1072},
year = {1998},
url = {https://doi.org/10.1137/S0097539794277718},
doi = {10.1137/S0097539794277718},
timestamp = {Sat, 20 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GolinRSS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GolinZ98,
author = {Mordecai J. Golin and
Shmuel Zaks},
title = {Labelled Trees and Pairs of Input-Output Permutations in Priority
Queues},
journal = {Theor. Comput. Sci.},
volume = {205},
number = {1-2},
pages = {99--114},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00037-6},
doi = {10.1016/S0304-3975(97)00037-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GolinZ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GolinR98,
author = {Mordecai J. Golin and
G{\"{u}}nter Rote},
title = {A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free
Codes with Unequal Letter Costs},
journal = {{IEEE} Trans. Inf. Theory},
volume = {44},
number = {5},
pages = {1770--1781},
year = {1998},
url = {https://doi.org/10.1109/18.705558},
doi = {10.1109/18.705558},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GolinR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BradfordGLR98,
author = {Phillip G. Bradford and
Mordecai J. Golin and
Lawrence L. Larmore and
Wojciech Rytter},
editor = {Gianfranco Bilardi and
Giuseppe F. Italiano and
Andrea Pietracaprina and
Geppino Pucci},
title = {Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming
with the Monge Property},
booktitle = {Algorithms - {ESA} '98, 6th Annual European Symposium, Venice, Italy,
August 24-26, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1461},
pages = {43--54},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-68530-8\_4},
doi = {10.1007/3-540-68530-8\_4},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/BradfordGLR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hpn/LiDGS98,
author = {Bo Li and
Xin Deng and
Mordecai J. Golin and
Kazem Sohraby},
editor = {Harmen R. van As},
title = {On the Optimal Placement of Web Proxies in the Internet: The Linear
Topology},
booktitle = {High Performance Networking, {IFIP} {TC-6} Eigth International Conference
on High Performance Networking (HPN'98), Vienna, Austria, September
21-25, 1998},
series = {{IFIP} Conference Proceedings},
volume = {134},
pages = {485--495},
publisher = {Kluwer},
year = {1998},
timestamp = {Tue, 29 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/hpn/LiDGS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/istcs/GolinS97,
author = {Mordecai J. Golin and
Assaf Schuster},
title = {Optimal point-to-point broadcast algorithms via lopsided trees},
booktitle = {Fifth Israel Symposium on Theory of Computing and Systems, {ISTCS}
1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings},
pages = {63--73},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/ISTCS.1997.595158},
doi = {10.1109/ISTCS.1997.595158},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/istcs/GolinS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/DevillersGKS96,
author = {Olivier Devillers and
Mordecai J. Golin and
Klara Kedem and
Stefan Schirra},
title = {Queries on Voronoi Diagrams of Moving Points},
journal = {Comput. Geom.},
volume = {6},
pages = {315--327},
year = {1996},
url = {https://doi.org/10.1016/0925-7721(95)00053-4},
doi = {10.1016/0925-7721(95)00053-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/DevillersGKS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GolinY96,
author = {Mordecai J. Golin and
Neal E. Young},
title = {Prefix Codes: Equiprobable Words, Unequal Letter Costs},
journal = {{SIAM} J. Comput.},
volume = {25},
number = {6},
pages = {1281--1292},
year = {1996},
url = {https://doi.org/10.1137/S0097539794268388},
doi = {10.1137/S0097539794268388},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GolinY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ChoiG96,
author = {Vicky Siu{-}Ngan Choi and
Mordecai J. Golin},
editor = {Friedhelm Meyer auf der Heide and
Burkhard Monien},
title = {Lopsided Trees: Analyses, Algorithms, and Applications},
booktitle = {Automata, Languages and Programming, 23rd International Colloquium,
ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1099},
pages = {538--549},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61440-0\_157},
doi = {10.1007/3-540-61440-0\_157},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ChoiG96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Golin96,
author = {Mordecai J. Golin},
editor = {{\'{E}}va Tardos},
title = {Limit Theorems for Minimum-Weight Triangulations, Other Euclidean
Functionals, and Probabilistic Recurrence Relations (Extended Abstract)},
booktitle = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 28-30 January 1996, Atlanta, Georgia, {USA}},
pages = {252--260},
publisher = {{ACM/SIAM}},
year = {1996},
url = {http://dl.acm.org/citation.cfm?id=313852.314071},
timestamp = {Thu, 05 Jul 2018 07:29:31 +0200},
biburl = {https://dblp.org/rec/conf/soda/Golin96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DevillersG95,
author = {Olivier Devillers and
Mordecai J. Golin},
title = {Incremental Algorithms for Finding the Convex Hulls of Circles and
the Lower Envelopes of Parabolas},
journal = {Inf. Process. Lett.},
volume = {56},
number = {3},
pages = {157--164},
year = {1995},
url = {https://doi.org/10.1016/0020-0190(95)00132-V},
doi = {10.1016/0020-0190(95)00132-V},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/DevillersG95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/GolinRSS95,
author = {Mordecai J. Golin and
Rajeev Raman and
Christian Schwarz and
Michiel H. M. Smid},
title = {Simple Randomized Algorithms for Closest Pair Problems},
journal = {Nord. J. Comput.},
volume = {2},
number = {1},
pages = {3--27},
year = {1995},
timestamp = {Sat, 20 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/GolinRSS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/GanleyGS95,
author = {Joseph L. Ganley and
Mordecai J. Golin and
Jeffrey S. Salowe},
editor = {Ding{-}Zhu Du and
Ming Li},
title = {The Multi-Weighted Spanning Tree Problem (Extended Abstract)},
booktitle = {Computing and Combinatorics, First Annual International Conference,
{COCOON} '95, Xi'an, China, August 24-26, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {959},
pages = {141--150},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/BFb0030828},
doi = {10.1007/BFB0030828},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/GanleyGS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GolinR95,
author = {Mordecai J. Golin and
G{\"{u}}nter Rote},
editor = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
Ferenc G{\'{e}}cseg},
title = {A Dynamic Programming Algorithm for Constructing Optimal Refix-Free
Codes for Unequal Letter Costs},
booktitle = {Automata, Languages and Programming, 22nd International Colloquium,
ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {944},
pages = {256--267},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60084-1\_79},
doi = {10.1007/3-540-60084-1\_79},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GolinR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/FlajoletG94,
author = {Philippe Flajolet and
Mordecai J. Golin},
title = {Mellin Transforms and Asymptotics: The Mergesort Recurrence},
journal = {Acta Informatica},
volume = {31},
number = {7},
pages = {673--696},
year = {1994},
url = {https://doi.org/10.1007/BF01177551},
doi = {10.1007/BF01177551},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/FlajoletG94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Golin94,
author = {Mordecai J. Golin},
title = {A Provably Fast Linear-Expected-Time Maxima-Finding Algorithm},
journal = {Algorithmica},
volume = {11},
number = {6},
pages = {501--524},
year = {1994},
url = {https://doi.org/10.1007/BF01189991},
doi = {10.1007/BF01189991},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Golin94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/compsys/GolinS94,
author = {Mordecai J. Golin and
Kenneth J. Supowit},
title = {Newton's Method for Quadratics, and Nested Intervals},
journal = {Complex Syst.},
volume = {8},
number = {3},
year = {1994},
url = {http://www.complex-systems.com/abstracts/v08\_i03\_a02.html},
timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/compsys/GolinS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/DevillersGKS94,
author = {Olivier Devillers and
Mordecai J. Golin and
Klara Kedem and
Stefan Schirra},
title = {Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points},
booktitle = {Proceedings of the 6th Canadian Conference on Computational Geometry,
Saskatoon, SK, Canada, August 1994},
pages = {122--127},
publisher = {University of Saskatchewan},
year = {1994},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/DevillersGKS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/DevillersG94,
author = {Olivier Devillers and
Mordecai J. Golin},
title = {Incremental Algorithms for Finding the Convex Hulls of Circles and
the Lower Envelopes of Parabolas},
booktitle = {Proceedings of the 6th Canadian Conference on Computational Geometry,
Saskatoon, SK, Canada, August 1994},
pages = {153--158},
publisher = {University of Saskatchewan},
year = {1994},
timestamp = {Wed, 26 Sep 2012 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cccg/DevillersG94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GolinY94,
author = {Mordecai J. Golin and
Neal E. Young},
editor = {Serge Abiteboul and
Eli Shamir},
title = {Prefix Codes: Equiprobable Words, Unequal Letter Costs},
booktitle = {Automata, Languages and Programming, 21st International Colloquium,
ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {820},
pages = {605--617},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58201-0\_102},
doi = {10.1007/3-540-58201-0\_102},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GolinY94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GolinZ94,
author = {Mordecai J. Golin and
Shmuel Zaks},
editor = {Ernst W. Mayr and
Gunther Schmidt and
Gottfried Tinhofer},
title = {Labelled Trees and Pairs of Input-Output Permutations in Priority
Queues},
booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop,
{WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {903},
pages = {282--291},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-59071-4\_55},
doi = {10.1007/3-540-59071-4\_55},
timestamp = {Sun, 02 Oct 2022 16:17:33 +0200},
biburl = {https://dblp.org/rec/conf/wg/GolinZ94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GolinD93,
author = {Mordecai J. Golin and
Robert Sedgewick},
title = {Queue-Mergesort},
journal = {Inf. Process. Lett.},
volume = {48},
number = {5},
pages = {253--259},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90088-Q},
doi = {10.1016/0020-0190(93)90088-Q},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GolinD93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/GolinRSS93,
author = {Mordecai J. Golin and
Rajeev Raman and
Christian Schwarz and
Michiel H. M. Smid},
title = {Simple Randomized Algorithms for Closest Pair Problems},
booktitle = {Proceedings of the 5th Canadian Conference on Computational Geometry,
Waterloo, Ontario, Canada, August 1993},
pages = {246--251},
publisher = {University of Waterloo},
year = {1993},
timestamp = {Wed, 19 May 2021 16:29:07 +0200},
biburl = {https://dblp.org/rec/conf/cccg/GolinRSS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DevillersG93,
author = {Olivier Devillers and
Mordecai J. Golin},
editor = {Thomas Lengauer},
title = {Dog Bites Postman: Point Location in the Moving Voronoi Diagram and
Related Problems},
booktitle = {Algorithms - {ESA} '93, First Annual European Symposium, Bad Honnef,
Germany, September 30 - October 2, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {726},
pages = {133--144},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57273-2\_50},
doi = {10.1007/3-540-57273-2\_50},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/DevillersG93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FlajoletG93,
author = {Philippe Flajolet and
Mordecai J. Golin},
editor = {Andrzej Lingas and
Rolf G. Karlsson and
Svante Carlsson},
title = {Exact Asymptotics of Divide-and-Conquer Recurrences},
booktitle = {Automata, Languages and Programming, 20nd International Colloquium,
ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {700},
pages = {137--149},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-56939-1\_68},
doi = {10.1007/3-540-56939-1\_68},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/FlajoletG93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GolinRSS93,
author = {Mordecai J. Golin and
Rajeev Raman and
Christian Schwarz and
Michiel H. M. Smid},
editor = {Vijaya Ramachandran},
title = {Randomized Data Structures for the Dynamic Closest-Pair Problem},
booktitle = {Proceedings of the Fourth Annual {ACM/SIGACT-SIAM} Symposium on Discrete
Algorithms, 25-27 January 1993, Austin, Texas, {USA}},
pages = {301--310},
publisher = {{ACM/SIAM}},
year = {1993},
url = {http://dl.acm.org/citation.cfm?id=313559.313784},
timestamp = {Thu, 05 Jul 2018 07:29:11 +0200},
biburl = {https://dblp.org/rec/conf/soda/GolinRSS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Golin93,
author = {Mordecai J. Golin},
editor = {Vijaya Ramachandran},
title = {Maxima in Convex Regions},
booktitle = {Proceedings of the Fourth Annual {ACM/SIGACT-SIAM} Symposium on Discrete
Algorithms, 25-27 January 1993, Austin, Texas, {USA}},
pages = {352--360},
publisher = {{ACM/SIAM}},
year = {1993},
url = {http://dl.acm.org/citation.cfm?id=313559.313804},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/Golin93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/Golin92,
author = {Mordecai J. Golin},
title = {How Many Maxima Can There Be?},
journal = {Comput. Geom.},
volume = {2},
pages = {335--353},
year = {1992},
url = {https://doi.org/10.1016/0925-7721(93)90014-W},
doi = {10.1016/0925-7721(93)90014-W},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/Golin92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Golin92,
author = {Mordecai J. Golin},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Dynamic Closest Pairs - {A} Probabilistic Approach},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {340--351},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_31},
doi = {10.1007/3-540-55706-7\_31},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/Golin92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/GolinS89,
author = {Mordecai J. Golin and
Robert Sedgewick},
editor = {Herbert Edelsbrunner},
title = {Analysis of a Simple Yet Efficient Convex Hull Algorithm},
booktitle = {Proceedings of the Fourth Annual Symposium on Computational Geometry,
Urbana-Champaign, IL, USA, June 6-8, 1988},
pages = {153--163},
publisher = {{ACM}},
year = {1988},
url = {https://doi.org/10.1145/73393.73409},
doi = {10.1145/73393.73409},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/GolinS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-07-03 21:32 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:
