Mordecai J. Golin
According to our database1, Mordecai J. Golin authored at least 100 papers between 1988 and 2020.
Legend:Book In proceedings Article PhD thesis Other
Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries.
The transfer matrices and the capacity of the 2-dimensional (1, ∞)-runlength limited constraint.
Discret. Math., 2019
Proceedings of the Data Compression Conference, 2019
Proceedings of the Approximation, 2019
Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017
Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016
Theor. Comput. Sci., 2015
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015
J. Graph Algorithms Appl., 2014
Paging mobile users in cellular networks: Optimality versus complexity and simplicity.
Theor. Comput. Sci., 2013
SIAM J. Comput., 2012
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011
A dynamic programming approach to length-limited Huffman coding: space reduction with the Monge property.
IEEE Trans. Inf. Theory, 2010
ACM Trans. Algorithms, 2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, 2009
IEEE Trans. Inf. Theory, 2008
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007
Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics, 2006
Discret. Math., 2005
The Structure of Optimal Prefix-Free 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
Discret. Appl. Math., 2004
Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004
Des. Codes Cryptogr., 2003
On the average complexity of 3D-Voronoi 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 2-Dimensional Constrained Systems (Extended Abstract).
Proceedings of the 2003 Data Compression Conference (DCC 2003), 2003
Optimal Prefix-Free 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
Proceedings of the 2001 IEEE Symposium on Security and Privacy, 2001
Optimal Prefix-Free 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
A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes.
IEEE Trans. Inf. Theory, 2000
Discret. Appl. Math., 1999
Proceedings of the Proceedings IEEE INFOCOM '99, 1999
A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free 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
Limit Theorems for Minimum-Weight Triangulations, Other Euclidean Functionals, and Probabilistic Recurrence Relations (Extended Abstract).
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996
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 Refix-Free 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
Revenge of the Dog: Queries on Voronoi Diagrams of Moving Points.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994
Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993
Proceedings of the Algorithm Theory, 1992
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988