dblp.uni-trier.dewww.uni-trier.de

Mordecai J. Golin

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2008
75EEMordecai J. Golin, Yan Zhang: A Dynamic Programming Approach To Length-Limited Huffman Coding CoRR abs/0806.4899: (2008)
74EEMordecai 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)
73EEXuerong 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)
2007
72EEAmotz Bar-Noy, Yi Feng, Mordecai J. Golin: Paging Mobile Users Efficiently and Optimally. INFOCOM 2007: 1910-1918
71EEMordecai J. Golin, Jian Li: More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. ISAAC 2007: 329-340
70EEMordecai J. Golin, Jian Li: More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding CoRR abs/0705.0253: (2007)
69EEMordecai J. Golin, Yan Zhang: The two-median problem on Manhattan meshes. Networks 49(3): 226-233 (2007)
2006
68EEWolfgang 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
67EEAmotz Bar-Noy, Mordecai J. Golin, Yan Zhang: Online Dynamic Programming Speedups. WAOA 2006: 43-54
66EERudolf Fleischer, Mordecai J. Golin, Yan Zhang: Online Maintenance of k-Medians and k-Covers on a Line. Algorithmica 45(4): 549-567 (2006)
2005
65EEMordecai 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
64EEMordecai J. Golin, Hyeon-Suk Na: Generalizing the Kraft-McMillan Inequality to Restricted Languages. DCC 2005: 163-172
63EEMordecai J. Golin, Zhenming Liu: The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case. WADS 2005: 372-384
62EESiu-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)
61EEYuanping 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)
2004
60EEMordecai J. Golin, Yiu-Cho Leung, Yajun Wang: Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs. ISAAC 2004: 508-521
59EEMordecai J. Golin, Kin Keung Ma: Algorithms for infinite huffman-codes. SODA 2004: 758-767
58EERudolf Fleischer, Mordecai J. Golin, Yan Zhang: Online Maintenance of k-Medians and k-Covers on a Line. SWAT 2004: 102-113
57EEMordecai J. Golin, Yiu-Cho Leung: Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters. WG 2004: 296-307
56EEMordecai 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)
55EETherese 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)
54EERudolf Fleischer, Mordecai J. Golin, Chin-Tau A. Lea, Steven Wong: Finding optimal paths in MREP routing. Inf. Process. Lett. 89(2): 57-63 (2004)
53EEHee-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)
2003
52EEMordecai 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
51EESiu-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
50EEMordecai 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)
49EECunsheng 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)
2002
48EEXuerong Yong, Mordecai J. Golin: New Techniques for Bounding the Channel Capacity of Read/Write Isolated Memor. DCC 2002: 482
47EEMordecai J. Golin, Stefan Langerman, William L. Steiger: The Convex Hull for Random Lines in the Plane. JCDCG 2002: 172-175
46EEMordecai J. Golin, Claire Kenyon, Neal E. Young: Huffman coding with unequal letter costs. STOC 2002: 785-791
45EEMordecai J. Golin, Hyeon-Suk Na: The probabilistic complexity of the Voronoi diagram of points on a polyhedron. Symposium on Computational Geometry 2002: 209-216
44EEMordecai J. Golin, Claire Kenyon, Neal E. Young: Huffman Coding with Unequal Letter Costs CoRR cs.DS/0205048: (2002)
43EEMordecai J. Golin, Neal E. Young: Prefix Codes: Equiprobable Words, Unequal Letter Costs CoRR cs.DS/0205049: (2002)
42EEPhillip 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)
2001
41EEHee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum: Competitive Facility Location along a Highway. COCOON 2001: 237-246
40EEMordecai 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
39EEWai W. Fung, Mordecai J. Golin, James W. Gray III: Protection of Keys against Modification Attack. IEEE Symposium on Security and Privacy 2001: 26-
38EEVicky Siu-Ngan Choi, Mordecai J. Golin: Lopsided Trees, I: Analyses. Algorithmica 31(3): 240-290 (2001)
37EEMordecai J. Golin: A combinatorial approach to Golomb forests. Theor. Comput. Sci. 263(1-2): 283-304 (2001)
2000
36EEMordecai J. Golin, Hyeon-Suk Na: On the Average Complexity of 3D-Voronoi Diagrams of Random Points on Convex Polytopes. CCCG 2000
35EEYuanping Zhang, Xuerong Yong, Mordecai J. Golin: The number of spanning trees in circulant graphs. Discrete Mathematics 223(1-3): 337-350 (2000)
34 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)
33EEAntoine 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)
1999
32 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
31EEMordecai J. Golin, Assaf Schuster: Optimal Point-to-point Broadcast Algorithms Via Lopsided Trees. Discrete Applied Mathematics 93(2-3): 233-263 (1999)
1998
30EEPhillip 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
29 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
28 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)
27 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)
26EEMordecai 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)
25EEMordecai J. Golin, Shmuel Zaks: Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. Theor. Comput. Sci. 205(1-2): 99-114 (1998)
1997
24EEMordecai J. Golin, Assaf Schuster: Optimal point-to-point broadcast algorithms via lopsided trees. ISTCS 1997: 63-73
1996
23 Vicky Siu-Ngan Choi, Mordecai J. Golin: Lopsided Trees: Analyses, Algorithms, and Applications. ICALP 1996: 538-549
22 Mordecai J. Golin: Limit Theorems for Minimum-Weight Triangulations, Other Euclidean Functionals, and Probabilistic Recurrence Relations (Extended Abstract). SODA 1996: 252-260
21 Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra: Queries on Voronoi Diagrams of Moving Points. Comput. Geom. 6: 315-327 (1996)
20 Mordecai J. Golin, Neal E. Young: Prefix Codes: Equiprobable Words, Unequal Letter Costs. SIAM J. Comput. 25(6): 1281-1292 (1996)
1995
19 Joseph L. Ganley, Mordecai J. Golin, Jeffrey S. Salowe: The Multi-Weighted Spanning Tree Problem (Extended Abstract). COCOON 1995: 141-150
18 Mordecai J. Golin, Günter Rote: A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs. ICALP 1995: 256-267
17EEOlivier 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)
16 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)
1994
15 Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra: Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points. CCCG 1994: 122-127
14 Olivier Devillers, Mordecai J. Golin: Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. CCCG 1994: 153-158
13 Mordecai J. Golin, Neal E. Young: Prefix Codes: Equiprobable Words, Unequal Letter Costs. ICALP 1994: 605-617
12 Mordecai J. Golin, Shmuel Zaks: Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. WG 1994: 282-291
11 Philippe Flajolet, Mordecai J. Golin: Mellin Transforms and Asymptotics: The Mergesort Recurrence. Acta Inf. 31(7): 673-696 (1994)
10 Mordecai J. Golin: A Provably Fast Linear-Expected-Time Maxima-Finding Algorithm. Algorithmica 11(6): 501-524 (1994)
1993
9 Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid: Simple Randomized Algorithms for Closest Pair Problems. CCCG 1993: 246-251
8 Olivier Devillers, Mordecai J. Golin: Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems. ESA 1993: 133-144
7 Philippe Flajolet, Mordecai J. Golin: Exact Asymptotics of Divide-and-Conquer Recurrences. ICALP 1993: 137-149
6 Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid: Randomized Data Structures for the Dynamic Closest-Pair Problem. SODA 1993: 301-310
5 Mordecai J. Golin: Maxima in Convex Regions. SODA 1993: 352-360
4 Mordecai J. Golin, Robert Sedgewick: Queue-Mergesort. Inf. Process. Lett. 48(5): 253-259 (1993)
1992
3 Mordecai J. Golin: Dynamic Closest Pairs - A Probabilistic Approach. SWAT 1992: 340-351
2 Mordecai J. Golin: How Many Maxima Can There Be? Comput. Geom. 2: 335-353 (1992)
1988
1EEMordecai J. Golin, Robert Sedgewick: Analysis of a Simple Yet Efficient Convex Hull Algorithm. Symposium on Computational Geometry 1988: 153-163

Coauthor Index

1Hee-Kap Ahn [41] [53]
2Amotz Bar-Noy [67] [72]
3Wolfgang W. Bein [68]
4Therese C. Biedl [55]
5Phillip G. Bradford [30] [42]
6Sze-Lok Chan [34]
7Timothy M. Chan [55]
8Siu-Wing Cheng [41] [51] [53] [62]
9Otfried Cheong (Otfried Schwarzkopf) [41] [53]
10Vicky Siu-Ngan Choi [23] [38]
11Erik D. Demaine [55]
12Xin Deng [29] [32]
13Olivier Devillers [8] [14] [15] [17] [21] [27]
14Cunsheng Ding [49]
15Yi Feng [72]
16Philippe Flajolet [7] [11]
17Rudolf Fleischer [54] [55] [58] [66]
18Wai W. Fung [39]
19Stefan Funke [51] [62]
20Joseph L. Ganley [19]
21Lixin Gao [33]
22James W. Gray III [39]
23Giuseppe F. Italiano [32] [33]
24Klara Kedem [15] [21]
25James A. King [55]
26Torleiv Kløve [49]
27Piyush Kumar [51] [62]
28Stefan Langerman [47]
29Lawrence L. Larmore [30] [42] [68]
30Chin-Tau A. Lea [54]
31Yiu-Cho Leung [52] [57] [60] [65]
32Bo Li [29] [32] [33]
33Jian Li [70] [71] [74]
34Zhenming Liu [63]
35Kin Keung Ma [59]
36Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu) [44] [46]
37J. Ian Munro [55]
38Hyeon-Suk Na [36] [40] [45] [50] [64]
39René van Oostrum [41] [53]
40Sheung-Hung Poon [51] [62]
41Rajeev Raman [6] [9] [16] [26]
42Edgar A. Ramos [51] [62]
43Günter Rote [18] [28]
44Wojciech Rytter [30] [42]
45Jeffrey S. Salowe [19]
46Stefan Schirra [15] [21]
47Assaf Schuster [24] [31]
48Christian Schwarz [6] [9] [16] [26]
49Robert Sedgewick [1] [4]
50Li Sheng [56]
51Michiel H. M. Smid [6] [9] [16] [26]
52Kazem Sohraby [29] [32]
53William L. Steiger [47]
54Antoine Vigneron [33]
55Yajun Wang [60] [65]
56Steven Wong [54]
57Xuerong Yong [35] [48] [56] [61] [65] [73]
58Neal E. Young [13] [20] [43] [44] [46]
59Shmuel Zaks [12] [25]
60Yan Zhang [58] [66] [67] [68] [69] [75]
61Yuanping Zhang [35] [56] [61] [73]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)