The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Mordecai J. Golin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALCO, 2005, pp:250-258 [Conf]
  2. Olivier Devillers, Mordecai J. Golin
    Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:153-158 [Conf]
  3. Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra
    Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:122-127 [Conf]
  4. Mordecai J. Golin, Hyeon-Suk Na
    On the Average Complexity of 3D-Voronoi Diagrams of Random Points on Convex Polytopes. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  5. Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
    Simple Randomized Algorithms for Closest Pair Problems. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:246-251 [Conf]
  6. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum
    Competitive Facility Location along a Highway. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:237-246 [Conf]
  7. Joseph L. Ganley, Mordecai J. Golin, Jeffrey S. Salowe
    The Multi-Weighted Spanning Tree Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:141-150 [Conf]
  8. Siu-Wing Cheng, Stefan Funke, Mordecai J. Golin, Piyush Kumar, Sheung-Hung Poon, Edgar A. Ramos
    Curve reconstruction from noisy samples. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:302-311 [Conf]
  9. Mordecai J. Golin, Hyeon-Suk Na
    The probabilistic complexity of the Voronoi diagram of points on a polyhedron. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:209-216 [Conf]
  10. Mordecai J. Golin, Robert Sedgewick
    Analysis of a Simple Yet Efficient Convex Hull Algorithm. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:153-163 [Conf]
  11. 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). [Citation Graph (0, 0)][DBLP]
    DCC, 2003, pp:430- [Conf]
  12. Mordecai J. Golin, Hyeon-Suk Na
    Optimal Prefix-Free Codes That End in a Specified Pattern and Similar Problems: The Uniform Probability Case. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2001, pp:143-152 [Conf]
  13. Mordecai J. Golin, Hyeon-Suk Na
    Generalizing the Kraft-McMillan Inequality to Restricted Languages. [Citation Graph (0, 0)][DBLP]
    DCC, 2005, pp:163-172 [Conf]
  14. Xuerong Yong, Mordecai J. Golin
    New Techniques for Bounding the Channel Capacity of Read/Write Isolated Memor. [Citation Graph (0, 0)][DBLP]
    DCC, 2002, pp:482- [Conf]
  15. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:43-54 [Conf]
  16. Olivier Devillers, Mordecai J. Golin
    Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:133-144 [Conf]
  17. Bo Li, Xin Deng, Mordecai J. Golin, Kazem Sohraby
    On the Optimal Placement of Web Proxies in the Internet: The Linear Topology. [Citation Graph (0, 0)][DBLP]
    HPN, 1998, pp:485-495 [Conf]
  18. Vicky Siu-Ngan Choi, Mordecai J. Golin
    Lopsided Trees: Analyses, Algorithms, and Applications. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:538-549 [Conf]
  19. Philippe Flajolet, Mordecai J. Golin
    Exact Asymptotics of Divide-and-Conquer Recurrences. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:137-149 [Conf]
  20. Mordecai J. Golin, Günter Rote
    A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:256-267 [Conf]
  21. Mordecai J. Golin, Neal E. Young
    Prefix Codes: Equiprobable Words, Unequal Letter Costs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:605-617 [Conf]
  22. Bo Li, Mordecai J. Golin, Giuseppe F. Italiano, Xin Deng, Kazem Sohraby
    On the Optimal Placement of Web Proxies in the Internet. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1999, pp:1282-1290 [Conf]
  23. Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang
    Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:508-521 [Conf]
  24. Mordecai J. Golin, Assaf Schuster
    Optimal point-to-point broadcast algorithms via lopsided trees. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1997, pp:63-73 [Conf]
  25. Mordecai J. Golin, Stefan Langerman, William L. Steiger
    The Convex Hull for Random Lines in the Plane. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:172-175 [Conf]
  26. Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang
    The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:31-40 [Conf]
  27. Mordecai J. Golin
    Maxima in Convex Regions. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:352-360 [Conf]
  28. Mordecai J. Golin
    Limit Theorems for Minimum-Weight Triangulations, Other Euclidean Functionals, and Probabilistic Recurrence Relations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:252-260 [Conf]
  29. Mordecai J. Golin, Kin Keung Ma
    Algorithms for infinite huffman-codes. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:758-767 [Conf]
  30. Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
    Randomized Data Structures for the Dynamic Closest-Pair Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:301-310 [Conf]
  31. Wai W. Fung, Mordecai J. Golin, James W. Gray III
    Protection of Keys against Modification Attack. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 2001, pp:26-0 [Conf]
  32. Mordecai J. Golin, Claire Kenyon, Neal E. Young
    Huffman coding with unequal letter costs. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:785-791 [Conf]
  33. Rudolf Fleischer, Mordecai J. Golin, Yan Zhang
    Online Maintenance of k-Medians and k-Covers on a Line. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:102-113 [Conf]
  34. Mordecai J. Golin
    Dynamic Closest Pairs - A Probabilistic Approach. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:340-351 [Conf]
  35. Mordecai J. Golin, Zhenming Liu
    The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:372-384 [Conf]
  36. Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang
    Online Dynamic Programming Speedups. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:43-54 [Conf]
  37. Mordecai J. Golin, Yiu-Cho Leung
    Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:296-307 [Conf]
  38. Mordecai J. Golin, Shmuel Zaks
    Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:282-291 [Conf]
  39. Philippe Flajolet, Mordecai J. Golin
    Mellin Transforms and Asymptotics: The Mergesort Recurrence. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1994, v:31, n:7, pp:673-696 [Journal]
  40. Vicky Siu-Ngan Choi, Mordecai J. Golin
    Lopsided Trees, I: Analyses. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:3, pp:240-290 [Journal]
  41. Mordecai J. Golin
    A Provably Fast Linear-Expected-Time Maxima-Finding Algorithm. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:6, pp:501-524 [Journal]
  42. Rudolf Fleischer, Mordecai J. Golin, Yan Zhang
    Online Maintenance of k-Medians and k-Covers on a Line. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:45, n:4, pp:549-567 [Journal]
  43. Siu-Wing Cheng, Stefan Funke, Mordecai J. Golin, Piyush Kumar, Sheung-Hung Poon, Edgar A. Ramos
    Curve reconstruction from noisy samples. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:31, n:1-2, pp:63-100 [Journal]
  44. Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra
    Queries on Voronoi Diagrams of Moving Points. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:315-327 [Journal]
  45. Mordecai J. Golin
    How Many Maxima Can There Be? [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:335-353 [Journal]
  46. Mordecai J. Golin, Hyeon-Suk Na
    On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:3, pp:197-231 [Journal]
  47. Mordecai J. Golin, Claire Kenyon, Neal E. Young
    Huffman Coding with Unequal Letter Costs [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  48. Mordecai J. Golin, Neal E. Young
    Prefix Codes: Equiprobable Words, Unequal Letter Costs [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  49. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:144, n:3, pp:231-236 [Journal]
  50. Mordecai J. Golin, Assaf Schuster
    Optimal Point-to-point Broadcast Algorithms Via Lopsided Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:93, n:2-3, pp:233-263 [Journal]
  51. Mordecai J. Golin, Xuerong Yong, Yuanping Zhang, Li Sheng
    New upper and lower bounds on the channel capacity of read/write isolated memory. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:140, n:1-3, pp:35-48 [Journal]
  52. Cunsheng Ding, Mordecai J. Golin, Torleiv Kløve
    Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:30, n:1, pp:73-84 [Journal]
  53. Yuanping Zhang, Xuerong Yong, Mordecai J. Golin
    The number of spanning trees in circulant graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:223, n:1-3, pp:337-350 [Journal]
  54. Yuanping Zhang, Xuerong Yong, Mordecai J. Golin
    Chebyshev polynomials and spanning tree formulas for circulant and related graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:298, n:1-3, pp:334-364 [Journal]
  55. Olivier Devillers, Mordecai J. Golin
    Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1998, v:8, n:3, pp:321-342 [Journal]
  56. Olivier Devillers, Mordecai J. Golin
    Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:3, pp:157-164 [Journal]
  57. Rudolf Fleischer, Mordecai J. Golin, Chin-Tau A. Lea, Steven Wong
    Finding optimal paths in MREP routing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:2, pp:57-63 [Journal]
  58. Mordecai J. Golin, Robert Sedgewick
    Queue-Mergesort. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:5, pp:253-259 [Journal]
  59. Antoine Vigneron, Lixin Gao, Mordecai J. Golin, Giuseppe F. Italiano, Bo Li
    An algorithm for finding a k-median in a directed tree. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:81-88 [Journal]
  60. 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. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:42, n:2, pp:277-303 [Journal]
  61. Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
    Simple Randomized Algorithms for Closest Pair Problems. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1995, v:2, n:1, pp:3-27 [Journal]
  62. Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid
    Randomized Data Structures for the Dynamic Closest-Pair Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:1036-1072 [Journal]
  63. Mordecai J. Golin, Neal E. Young
    Prefix Codes: Equiprobable Words, Unequal Letter Costs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:6, pp:1281-1292 [Journal]
  64. Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum
    Competitive facility location: the Voronoi game. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:457-467 [Journal]
  65. Mordecai J. Golin
    A combinatorial approach to Golomb forests. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:283-304 [Journal]
  66. Mordecai J. Golin, Shmuel Zaks
    Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:205, n:1-2, pp:99-114 [Journal]
  67. Sze-Lok Chan, Mordecai J. Golin
    A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:4, pp:1637-1644 [Journal]
  68. Mordecai J. Golin, Günter Rote
    A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes with Unequal Letter Costs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:5, pp:1770-1781 [Journal]
  69. Amotz Bar-Noy, Yi Feng, Mordecai J. Golin
    Paging Mobile Users Efficiently and Optimally. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:1910-1918 [Conf]
  70. Mordecai J. Golin, Li Jian
    More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  71. More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. [Citation Graph (, )][DBLP]


  72. A Dynamic Programming Approach To Length-Limited Huffman Coding [Citation Graph (, )][DBLP]


  73. Multidimensional Divide-and-Conquer and Weighted Digital Sums [Citation Graph (, )][DBLP]


  74. The asymptotic number of spanning trees in circulant graphs. [Citation Graph (, )][DBLP]


Search in 0.055secs, Finished in 0.659secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002