| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao |
Encoding 2-D Range Maximum Queries  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Mordecai J. Golin, John Iacono, Danny Krizanc, Rajeev Raman, S. Srinivasa Rao |
Encoding 2D Range Maximum Queries. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Xuerong Yong, Yuanping Zhang |
The asymptotic number of spanning trees in circulant graphs. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Y. K. Cheung, Philippe Flajolet, Mordecai J. Golin, C. Y. James Lee |
Multidimensional Divide-and-Conquer and Weighted Digital Sums |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang |
Online Dynamic Programming Speedups. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Dynamic programming, Monge property |
| 1 | Xuerong Yong, Yuanping Zhang, Mordecai J. Golin |
The number of spanning trees in a class of double fixed-step loop networks. |
Networks |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Yan Zhang |
A Dynamic Programming Approach To Length-Limited Huffman Coding |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Mordecai J. Golin, Jian Li |
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. |
IEEE Transactions on Information Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Yan Zhang |
The two-median problem on Manhattan meshes. |
Networks |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Jian Li |
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Yi Feng 0002, Mordecai J. Golin |
Paging Mobile Users Efficiently and Optimally. |
INFOCOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Jian Li |
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Fleischer, Mordecai J. Golin, Yan Zhang |
Online Maintenance of k-Medians and k-Covers on a Line. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang |
Online Dynamic Programming Speedups. |
WAOA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuanping Zhang, Xuerong Yong, Mordecai J. Golin |
Chebyshev polynomials and spanning tree formulas for circulant and related graphs. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Siu-Wing Cheng, Stefan Funke, Mordecai J. Golin, Piyush Kumar, Sheung-Hung Poon, Edgar A. Ramos |
Curve reconstruction from noisy samples. |
Comput. Geom. |
2005 |
DBLP DOI BibTeX RDF |
|
| 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. |
ALENEX/ANALCO |
2005 |
DBLP BibTeX RDF |
|
| 1 | Mordecai J. Golin, Zhenming Liu |
The Structure of Optimal Prefix-Free Codes in Restricted Languages: The Uniform Probability Case. |
WADS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Hyeon-Suk Na |
Generalizing the Kraft-McMillan Inequality to Restricted Languages. |
DCC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Fleischer, Mordecai J. Golin, Chin-Tau A. Lea, Steven Wong |
Finding optimal paths in MREP routing. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum |
Competitive facility location: the Voronoi game. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Yiu-Cho Leung |
Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Kin Keung Ma |
Algorithms for infinite huffman-codes. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Fleischer, Mordecai J. Golin, Yan Zhang |
Online Maintenance of k-Medians and k-Covers on a Line. |
SWAT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang |
Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Hyeon-Suk Na |
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes. |
Comput. Geom. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Cunsheng Ding, Mordecai J. Golin, Torleiv Kløve |
Meeting the Welch and Karystinos-Pados Bounds on DS-CDMA Binary Signature Sets. |
Des. Codes Cryptography |
2003 |
DBLP DOI BibTeX RDF |
Welch bound, Karystinos-Pados bound, code division multiple access, codes, binary sequences |
| 1 | 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 |
DBLP DOI BibTeX RDF |
sampling, probabilistic analysis, curve reconstruction |
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Neal E. Young |
Prefix Codes: Equiprobable Words, Unequal Letter Costs |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Mordecai J. Golin, Claire Kenyon, Neal E. Young |
Huffman Coding with Unequal Letter Costs |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Mordecai J. Golin, Hyeon-Suk Na |
The probabilistic complexity of the Voronoi diagram of points on a polyhedron. |
Symposium on Computational Geometry |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuerong Yong, Mordecai J. Golin |
New Techniques for Bounding the Channel Capacity of Read/Write Isolated Memor. |
DCC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Stefan Langerman, William L. Steiger |
The Convex Hull for Random Lines in the Plane. |
JCDCG |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Claire Kenyon, Neal E. Young |
Huffman coding with unequal letter costs. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin |
A combinatorial approach to Golomb forests. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Vicky Siu-Ngan Choi, Mordecai J. Golin |
Lopsided Trees, I: Analyses. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Wai W. Fung, Mordecai J. Golin, James W. Gray III |
Protection of Keys against Modification Attack. (PDF / PS) |
IEEE Symposium on Security and Privacy |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong, Mordecai J. Golin, René van Oostrum |
Competitive Facility Location along a Highway. |
COCOON |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuanping Zhang, Xuerong Yong, Mordecai J. Golin |
The number of spanning trees in circulant graphs. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Sze-Lok Chan, Mordecai J. Golin |
A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes. |
IEEE Transactions on Information Theory |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Hyeon-Suk Na |
On the Average Complexity of 3D-Voronoi Diagrams of Random Points on Convex Polytopes. |
CCCG |
2000 |
DBLP BibTeX RDF |
|
| 1 | Mordecai J. Golin, Assaf Schuster |
Optimal Point-to-point Broadcast Algorithms Via Lopsided Trees. |
Discrete Applied Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Bo Li, Mordecai J. Golin, Giuseppe F. Italiano, Xin Deng, Kazem Sohraby |
On the Optimal Placement of Web Proxies in the Internet. |
INFOCOM |
1999 |
DBLP BibTeX RDF |
|
| 1 | Mordecai J. Golin, Shmuel Zaks |
Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid |
Randomized Data Structures for the Dynamic Closest-Pair Problem. |
SIAM J. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Devillers, Mordecai J. Golin |
Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems. |
Int. J. Comput. Geometry Appl. |
1998 |
DBLP BibTeX RDF |
|
| 1 | 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 |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Bo Li, Xin Deng, Mordecai J. Golin, Kazem Sohraby |
On the Optimal Placement of Web Proxies in the Internet: The Linear Topology. |
HPN |
1998 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Assaf Schuster |
Optimal point-to-point broadcast algorithms via lopsided trees. (PDF / PS) |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
optimal point-to-point broadcast algorithms, lopsided trees, point-to-point packet-switched processor networks, optimal broadcast algorithms, optimal broadcast algorithm, optical ring, multiport multimedia model, message passing, POSTAL model |
| 1 | Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra |
Queries on Voronoi Diagrams of Moving Points. |
Comput. Geom. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Neal E. Young |
Prefix Codes: Equiprobable Words, Unequal Letter Costs. |
SIAM J. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin |
Limit Theorems for Minimum-Weight Triangulations, Other Euclidean Functionals, and Probabilistic Recurrence Relations (Extended Abstract). |
SODA |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Vicky Siu-Ngan Choi, Mordecai J. Golin |
Lopsided Trees: Analyses, Algorithms, and Applications. |
ICALP |
1996 |
DBLP DOI BibTeX RDF |
Varn Codes, Fibonacci Recurrences, Postal Model, Mellin Transforms |
| 1 | Olivier Devillers, Mordecai J. Golin |
Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid |
Simple Randomized Algorithms for Closest Pair Problems. |
Nord. J. Comput. |
1995 |
DBLP BibTeX RDF |
|
| 1 | Mordecai J. Golin, Günter Rote |
A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs. |
ICALP |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph L. Ganley, Mordecai J. Golin, Jeffrey S. Salowe |
The Multi-Weighted Spanning Tree Problem (Extended Abstract). |
COCOON |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Flajolet, Mordecai J. Golin |
Mellin Transforms and Asymptotics: The Mergesort Recurrence. |
Acta Inf. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin |
A Provably Fast Linear-Expected-Time Maxima-Finding Algorithm. |
Algorithmica |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Shmuel Zaks |
Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. |
WG |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Neal E. Young |
Prefix Codes: Equiprobable Words, Unequal Letter Costs. |
ICALP |
1994 |
DBLP DOI BibTeX RDF |
Algorithms, Trees, Huffman Codes, Prefix Codes |
| 1 | Olivier Devillers, Mordecai J. Golin, Klara Kedem, Stefan Schirra |
Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points. |
CCCG |
1994 |
DBLP BibTeX RDF |
|
| 1 | Olivier Devillers, Mordecai J. Golin |
Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas. |
CCCG |
1994 |
DBLP BibTeX RDF |
|
| 1 | Mordecai J. Golin, Robert Sedgewick |
Queue-Mergesort. |
Inf. Process. Lett. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Devillers, Mordecai J. Golin |
Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems. |
ESA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid |
Randomized Data Structures for the Dynamic Closest-Pair Problem. |
SODA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin |
Maxima in Convex Regions. |
SODA |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Flajolet, Mordecai J. Golin |
Exact Asymptotics of Divide-and-Conquer Recurrences. |
ICALP |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid |
Simple Randomized Algorithms for Closest Pair Problems. |
CCCG |
1993 |
DBLP BibTeX RDF |
|
| 1 | Mordecai J. Golin |
How Many Maxima Can There Be? |
Comput. Geom. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin |
Dynamic Closest Pairs - A Probabilistic Approach. |
SWAT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Mordecai J. Golin, Robert Sedgewick |
Analysis of a Simple Yet Efficient Convex Hull Algorithm. |
Symposium on Computational Geometry |
1988 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")