Mordecai J. Golin
According to our database^{1},
Mordecai J. Golin
authored at least 100 papers
between 1988 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at scopus.com

at orcid.org
On csauthors.net:
Bibliography
2020
Speeding up the AIFV2 dynamic programs by two orders of magnitude using Range Minimum Queries.
CoRR, 2020
CoRR, 2020
2019
The transfer matrices and the capacity of the 2dimensional (1, ∞)runlength limited constraint.
Discret. Math., 2019
CoRR, 2019
CoRR, 2019
Algorithmica, 2019
Proceedings of the Data Compression Conference, 2019
The Expected Number of Maximal Points of the Convolution of Two 2D Distributions.
Proceedings of the Approximation, 2019
2018
CoRR, 2018
CoRR, 2018
Minmax Centered kPartitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows.
CoRR, 2018
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
2017
Proceedings of the Algorithms and Data Structures  15th International Symposium, 2017
Nonapproximability and Polylogarithmic Approximations of the SingleSink Unsplittable and Confluent Dynamic Flow Problems.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017
2016
Theor. Comput. Sci., 2016
Discret. Appl. Math., 2016
CoRR, 2016
CoRR, 2016
CoRR, 2016
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016
2015
Theor. Comput. Sci., 2015
Theor. Comput. Sci., 2015
CoRR, 2015
Proceedings of the Algorithms and Computation  26th International Symposium, 2015
Proceedings of the Algorithms and Complexity  9th International Conference, 2015
2014
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity.
J. Graph Algorithms Appl., 2014
CoRR, 2014
CoRR, 2014
2013
Paging mobile users in cellular networks: Optimality versus complexity and simplicity.
Theor. Comput. Sci., 2013
2012
SIAM J. Comput., 2012
Proceedings of the Algorithms and Computation  23rd International Symposium, 2012
2011
CoRR, 2011
Proceedings of the Algorithms and Computation  22nd International Symposium, 2011
2010
A dynamic programming approach to lengthlimited Huffman coding: space reduction with the Monge property.
IEEE Trans. Inf. Theory, 2010
Discret. Math., 2010
2009
The KnuthYao quadrangleinequality speedup is a consequence of total monotonicity.
ACM Trans. Algorithms, 2009
Theory Comput. Syst., 2009
Proceedings of the Twentieth Annual ACMSIAM Symposium on Discrete Algorithms, 2009
Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, 2009
2008
More Efficient Algorithms and Analyses for Unequal Letter Cost PrefixFree Coding.
IEEE Trans. Inf. Theory, 2008
Networks, 2008
CoRR, 2008
2007
Networks, 2007
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007
2006
Algorithmica, 2006
Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006
2005
Chebyshev polynomials and spanning tree formulas for circulant and related graphs.
Discret. Math., 2005
Comput. Geom., 2005
The Structure of Optimal PrefixFree Codes in Restricted Languages: The Uniform Probability Case.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005
Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005
Counting Structures in Grid Graphs, Cylinders and Tori Using Transfer Matrices: Survey and New Results.
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005
2004
Theor. Comput. Sci., 2004
Inf. Process. Lett., 2004
Discret. Appl. Math., 2004
Discret. Appl. Math., 2004
Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters.
Proceedings of the GraphTheoretic Concepts in Computer Science, 2004
Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2004
Counting Spanning Trees and Other Structures in Nonconstantjump Circulant Graphs.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004
2003
Des. Codes Cryptogr., 2003
On the average complexity of 3DVoronoi diagrams of random points on convex polytopes.
Comput. Geom., 2003
Proceedings of the Global Telecommunications Conference, 2003
Recurrence Relations on Transfer Matrices Yield Good Lower and Upper Bounds on the Channel Capacity of Some 2Dimensional Constrained Systems (Extended Abstract).
Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003
2002
Optimal PrefixFree Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property.
J. Algorithms, 2002
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002
Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002
2001
Theor. Comput. Sci., 2001
Algorithmica, 2001
Proceedings of the 2001 IEEE Symposium on Security and Privacy, 2001
Optimal PrefixFree Codes That End in a Specified Pattern and Similar Problems: The Uniform Probability Case.
Proceedings of the Data Compression Conference, 2001
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001
2000
A dynamic programming algorithm for constructing optimal "1"ended binary prefixfree codes.
IEEE Trans. Inf. Theory, 2000
Inf. Process. Lett., 2000
Discret. Math., 2000
1999
Discret. Appl. Math., 1999
Proceedings of the Proceedings IEEE INFOCOM '99, 1999
1998
A Dynamic Programming Algorithm for Constructing Optimal PrefixFree Codes with Unequal Letter Costs.
IEEE Trans. Inf. Theory, 1998
Theor. Comput. Sci., 1998
SIAM J. Comput., 1998
Dog Bites Postman: Point Location in the Moving Voronoi Diagram and Related Problems.
Int. J. Comput. Geom. Appl., 1998
On the Optimal Placement of Web Proxies in the Internet: The Linear Topology.
Proceedings of the High Performance Networking, 1998
1996
SIAM J. Comput., 1996
Comput. Geom., 1996
Limit Theorems for MinimumWeight Triangulations, Other Euclidean Functionals, and Probabilistic Recurrence Relations (Extended Abstract).
Proceedings of the Seventh Annual ACMSIAM Symposium on Discrete Algorithms, 1996
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996
1995
Simple Randomized Algorithms for Closest Pair Problems.
Nord. J. Comput., 1995
Incremental Algorithms for Finding the Convex Hulls of Circles and the Lower Envelopes of Parabolas.
Inf. Process. Lett., 1995
A Dynamic Programming Algorithm for Constructing Optimal RefixFree Codes for Unequal Letter Costs.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995
1994
Complex Syst., 1994
Algorithmica, 1994
Acta Informatica, 1994
Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994
1993
Inf. Process. Lett., 1993
Proceedings of the Fourth Annual ACM/SIGACTSIAM Symposium on Discrete Algorithms, 1993
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993
1992
Comput. Geom., 1992
Proceedings of the Algorithm Theory, 1992
1988
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988