Hong Kong University of Science & Technology, Department of Computer Science & Engineering
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j37 |      | Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng, Mordecai J. Golin: Paging mobile users in cellular networks: Optimality versus complexity and simplicity. Theor. Comput. Sci. 470: 23-35 (2013) |
| 2012 | ||
| j36 | | Mordecai J. Golin, Claire Mathieu, Neal E. Young: Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme. SIAM J. Comput. 41(3): 684-713 (2012) |
| c47 | | Wei Yu, Mordecai J. Golin, Guochuan Zhang: Vehicle Scheduling on a Graph Revisited. ISAAC 2012: 362-371 |
| 2011 | ||
| c46 | | Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao: Encoding 2D Range Maximum Queries. ISAAC 2011: 180-189 |
| i7 | | Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao: Encoding 2-D Range Maximum Queries. CoRR abs/1109.2885 (2011) |
| 2010 | ||
| j35 | | Mordecai J. Golin, Xuerong Yong, Yuanping Zhang: The asymptotic number of spanning trees in circulant graphs. Discrete Mathematics 310(4): 792-803 (2010) |
| j34 | | Mordecai J. Golin, Yan Zhang: A dynamic programming approach to length-limited Huffman coding: space reduction with the Monge property. IEEE Transactions on Information Theory 56(8): 3918-3929 (2010) |
| e1 |  | Mordecai J. Golin, Robert Sedgewick (Eds.): Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2010, Austin, Texas, USA, January 16, 2010. SIAM 2010 |
| i6 | | Y. K. Cheung, Philippe Flajolet, Mordecai J. Golin, C. Y. James Lee: Multidimensional Divide-and-Conquer and Weighted Digital Sums. CoRR abs/1003.0150 (2010) |
| 2009 | ||
| j33 | | Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang: Online Dynamic Programming Speedups. Theory Comput. Syst. 45(3): 429-445 (2009) |
| j32 | | Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang: The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity. ACM Transactions on Algorithms 6(1) (2009) |
| c45 | | Y. K. Cheung, Philippe Flajolet, Mordecai J. Golin, C. Y. James Lee: Multidimensional Divide-and-Conquer and Weighted Digital Sums. ANALCO 2009: 58-74 |
| c44 | | Mordecai J. Golin, Xiaoming Xu, Jiajin Yu: A generic top-down dynamic-programming approach to prefix-free coding. SODA 2009: 758-767 |
| 2008 | ||
| j31 | | Xuerong Yong, Yuanping Zhang, Mordecai J. Golin: The number of spanning trees in a class of double fixed-step loop networks. Networks 52(2): 69-77 (2008) |
| j30 | | Mordecai J. Golin, Jian Li: More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. IEEE Transactions on Information Theory 54(8): 3412-3424 (2008) |
| i5 | | Mordecai J. Golin, Yan Zhang: A Dynamic Programming Approach To Length-Limited Huffman Coding. CoRR abs/0806.4899 (2008) |
| i4 | | Mordecai J. Golin, Xiaoming Xu, Jiajin Yu: A Generic Top-Down Dynamic-Programming Approach to Prefix-Free Coding. CoRR abs/0809.4577 (2008) |
| 2007 | ||
| j29 | | Mordecai J. Golin, Yan Zhang: The two-median problem on Manhattan meshes. Networks 49(3): 226-233 (2007) |
| c43 | | Mordecai J. Golin, Xuerong Yong, Yuanping Zhang: The Asymptotic Number of Spanning Trees in Circulant Graphs. ANALCO 2007: 242-249 |
| c42 | | Amotz Bar-Noy, Yi Feng, Mordecai J. Golin: Paging Mobile Users Efficiently and Optimally. INFOCOM 2007: 1910-1918 |
| c41 | | Mordecai J. Golin, Jian Li: More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. ISAAC 2007: 329-340 |
| i3 | | Mordecai J. Golin, Jian Li: More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. CoRR abs/0705.0253 (2007) |
| 2006 | ||
| j28 | | Rudolf Fleischer, Mordecai J. Golin, Yan Zhang: Online Maintenance of k-Medians and k-Covers on a Line. Algorithmica 45(4): 549-567 (2006) |
| c40 | | Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang: Permanents of Circulants: A Transfer Matrix Approach. ANALCO 2006: 263-272 |
| c39 | | Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang: The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity. SODA 2006: 31-40 |
| c38 | | |
| 2005 | ||
| j27 | | Siu-Wing Cheng, Stefan Funke, Mordecai J. Golin, Piyush Kumar, Sheung-Hung Poon, Edgar A. Ramos: Curve reconstruction from noisy samples. Comput. Geom. 31(1-2): 63-100 (2005) |
| j26 | | Yuanping Zhang, Xuerong Yong, Mordecai J. Golin: Chebyshev polynomials and spanning tree formulas for circulant and related graphs. Discrete Mathematics 298(1-3): 334-364 (2005) |
| c37 | | Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang, Xuerong Yong: Counting Structures in Grid Graphs, Cylinders and Tori Using Transfer Matrices: Survey and New Results. ALENEX/ANALCO 2005: 250-258 |
| c36 | | Mordecai J. Golin, Hyeon-Suk Na: Generalizing the Kraft-McMillan Inequality to Restricted Languages. DCC 2005: 163-172 |
| c35 | | Mordecai J. Golin, Zhenming Liu: The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case. WADS 2005: 372-384 |
| 2004 | ||
| j25 | | Mordecai J. Golin, Xuerong Yong, Yuanping Zhang, Li Sheng: New upper and lower bounds on the channel capacity of read/write isolated memory. Discrete Applied Mathematics 140(1-3): 35-48 (2004) |
| j24 | | Therese C. Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro: Fun-Sort--or the chaos of unordered binary search. Discrete Applied Mathematics 144(3): 231-236 (2004) |
| j23 | | Rudolf Fleischer, Mordecai J. Golin, Chin-Tau A. Lea, Steven Wong: Finding optimal paths in MREP routing. Inf. Process. Lett. 89(2): 57-63 (2004) |
| j22 | | Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum: Competitive facility location: the Voronoi game. Theor. Comput. Sci. 310(1-3): 457-467 (2004) |
| c34 | | Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang: Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs. ISAAC 2004: 508-521 |
| c33 | | |
| c32 | | Rudolf Fleischer, Mordecai J. Golin, Yan Zhang: Online Maintenance of k-Medians and k-Covers on a Line. SWAT 2004: 102-113 |
| c31 | | Mordecai J. Golin, Yiu-Cho Leung: Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters. WG 2004: 296-307 |
| 2003 | ||
| j21 | | Mordecai J. Golin, Hyeon-Suk Na: On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes. Comput. Geom. 25(3): 197-231 (2003) |
| j20 | | Cunsheng Ding, Mordecai J. Golin, Torleiv Kløve: Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets. Des. Codes Cryptography 30(1): 73-84 (2003) |
| c30 | | Siu-Wing Cheng, Stefan Funke, Mordecai J. Golin, Piyush Kumar, Sheung-Hung Poon, Edgar A. Ramos: Curve reconstruction from noisy samples. Symposium on Computational Geometry 2003: 302-311 |
| c29 | | Mordecai J. Golin, Yiu-Cho Leung: Recurrence Relations on Transfer Matrices Yield Good Lower and Upper Bounds on the Channel Capacity of Some 2-Dimensional Constrained Systems (Extended Abstract). DCC 2003: 430 |
| c28 | | Qiling Xie, Chin-Tau A. Lea, Mordecai J. Golin, Rudolf Fleischer: Maximum residual energy routing with reverse energy cost. GLOBECOM 2003: 564-569 |
| 2002 | ||
| j19 | | Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter: Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. J. Algorithms 42(2): 277-303 (2002) |
| c27 | | Mordecai J. Golin, Hyeon-Suk Na: The probabilistic complexity of the Voronoi diagram of points on a polyhedron. Symposium on Computational Geometry 2002: 209-216 |
| c26 | | Xuerong Yong, Mordecai J. Golin: New Techniques for Bounding the Channel Capacity of Read/Write Isolated Memor. DCC 2002: 482 |
| c25 | | Mordecai J. Golin, Stefan Langerman, William L. Steiger: The Convex Hull for Random Lines in the Plane. JCDCG 2002: 172-175 |
| c24 | | Mordecai J. Golin, Claire Kenyon, Neal E. Young: Huffman coding with unequal letter costs. STOC 2002: 785-791 |
| i2 | | Mordecai J. Golin, Claire Kenyon, Neal E. Young: Huffman Coding with Unequal Letter Costs. CoRR cs.DS/0205048 (2002) |
| i1 | | Mordecai J. Golin, Neal E. Young: Prefix Codes: Equiprobable Words, Unequal Letter Costs. CoRR cs.DS/0205049 (2002) |
| 2001 | ||
| j18 | | Vicky Siu-Ngan Choi, Mordecai J. Golin: Lopsided Trees, I: Analyses. Algorithmica 31(3): 240-290 (2001) |
| j17 | | Mordecai J. Golin: A combinatorial approach to Golomb forests. Theor. Comput. Sci. 263(1-2): 283-304 (2001) |
| c23 | | Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum: Competitive Facility Location along a Highway. COCOON 2001: 237-246 |
| c22 | | Mordecai J. Golin, Hyeon-Suk Na: Optimal Prefix-Free Codes That End in a Specified Pattern and Similar Problems: The Uniform Probability Case. Data Compression Conference 2001: 143-152 |
| c21 | | Wai W. Fung, Mordecai J. Golin, James W. Gray III: Protection of Keys against Modification Attack. IEEE Symposium on Security and Privacy 2001: 26-36 |
| 2000 | ||
| j16 | | Yuanping Zhang, Xuerong Yong, Mordecai J. Golin: The number of spanning trees in circulant graphs. Discrete Mathematics 223(1-3): 337-350 (2000) |
| j15 | | Antoine Vigneron, Lixin Gao, Mordecai J. Golin, Giuseppe F. Italiano, Bo Li: An algorithm for finding a k-median in a directed tree. Inf. Process. Lett. 74(1-2): 81-88 (2000) |
| j14 | | Sze-Lok Chan, Mordecai J. Golin: A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes. IEEE Transactions on Information Theory 46(4): 1637-1644 (2000) |
| c20 | | Mordecai J. Golin, Hyeon-Suk Na: On the Average Complexity of 3D-Voronoi Diagrams of Random Points on Convex Polytopes. CCCG 2000 |
| 1999 | ||
| j13 | | Mordecai J. Golin, Assaf Schuster: Optimal Point-to-point Broadcast Algorithms Via Lopsided Trees. Discrete Applied Mathematics 93(2-3): 233-263 (1999) |
| c19 | | Bo Li, Mordecai J. Golin, Giuseppe F. Italiano, Xin Deng, Kazem Sohraby: On the Optimal Placement of Web Proxies in the Internet. INFOCOM 1999: 1282-1290 |
| 1998 | ||
| j12 | | Olivier Devillers, Mordecai J. Golin: Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems. Int. J. Comput. Geometry Appl. 8(3): 321-342 (1998) |
| j11 | | Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid: Randomized Data Structures for the Dynamic Closest-Pair Problem. SIAM J. Comput. 27(4): 1036-1072 (1998) |
| j10 | | Mordecai J. Golin, Shmuel Zaks: Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. Theor. Comput. Sci. 205(1-2): 99-114 (1998) |
| j9 | | Mordecai J. Golin, Günter Rote: A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs. IEEE Transactions on Information Theory 44(5): 1770-1781 (1998) |
| c18 | | Phillip G. Bradford, Mordecai J. Golin, Lawrence L. Larmore, Wojciech Rytter: Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property. ESA 1998: 43-54 |
| c17 | | Bo Li, Xin Deng, Mordecai J. Golin, Kazem Sohraby: On the Optimal Placement of Web Proxies in the Internet: The Linear Topology. HPN 1998: 485-495 |
| 1997 | ||
| c16 | | Mordecai J. Golin, Assaf Schuster: Optimal point-to-point broadcast algorithms via lopsided trees. ISTCS 1997: 63-73 |
| 1996 | ||
| j8 | | Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra: Queries on Voronoi Diagrams of Moving Points. Comput. Geom. 6: 315-327 (1996) |
| j7 | | Mordecai J. Golin, Neal E. Young: Prefix Codes: Equiprobable Words, Unequal Letter Costs. SIAM J. Comput. 25(6): 1281-1292 (1996) |
| c15 | | Vicky Siu-Ngan Choi, Mordecai J. Golin: Lopsided Trees: Analyses, Algorithms, and Applications. ICALP 1996: 538-549 |
| c14 | | Mordecai J. Golin: Limit Theorems for Minimum-Weight Triangulations, Other Euclidean Functionals, and Probabilistic Recurrence Relations (Extended Abstract). SODA 1996: 252-260 |
| 1995 | ||
| j6 | | Olivier Devillers, Mordecai J. Golin: Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. Inf. Process. Lett. 56(3): 157-164 (1995) |
| j5 | | Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid: Simple Randomized Algorithms for Closest Pair Problems. Nord. J. Comput. 2(1): 3-27 (1995) |
| c13 | | Joseph L. Ganley, Mordecai J. Golin, Jeffrey S. Salowe: The Multi-Weighted Spanning Tree Problem (Extended Abstract). COCOON 1995: 141-150 |
| c12 | | Mordecai J. Golin, Günter Rote: A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs. ICALP 1995: 256-267 |
| 1994 | ||
| j4 | | Philippe Flajolet, Mordecai J. Golin: Mellin Transforms and Asymptotics: The Mergesort Recurrence. Acta Inf. 31(7): 673-696 (1994) |
| j3 | | Mordecai J. Golin: A Provably Fast Linear-Expected-Time Maxima-Finding Algorithm. Algorithmica 11(6): 501-524 (1994) |
| c11 | | Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra: Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points. CCCG 1994: 122-127 |
| c10 | | Olivier Devillers, Mordecai J. Golin: Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. CCCG 1994: 153-158 |
| c9 | | Mordecai J. Golin, Neal E. Young: Prefix Codes: Equiprobable Words, Unequal Letter Costs. ICALP 1994: 605-617 |
| c8 | | Mordecai J. Golin, Shmuel Zaks: Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. WG 1994: 282-291 |
| 1993 | ||
| j2 | | |
| c7 | | Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid: Simple Randomized Algorithms for Closest Pair Problems. CCCG 1993: 246-251 |
| c6 | | Olivier Devillers, Mordecai J. Golin: Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems. ESA 1993: 133-144 |
| c5 | | Philippe Flajolet, Mordecai J. Golin: Exact Asymptotics of Divide-and-Conquer Recurrences. ICALP 1993: 137-149 |
| c4 | | Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid: Randomized Data Structures for the Dynamic Closest-Pair Problem. SODA 1993: 301-310 |
| c3 | | |
| 1992 | ||
| j1 | | |
| c2 | | |
| 1988 | ||
| c1 | | Mordecai J. Golin, Robert Sedgewick: Analysis of a Simple Yet Efficient Convex Hull Algorithm. Symposium on Computational Geometry 1988: 153-163 |
Colors in the list of coauthors
Last update Tue May 21 18:49:48 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page