The following pages link to Mordecai J. Golin (Q672260):
Displayed 40 items.
- (Q4428932) (← links)
- A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes (Q4503603) (← links)
- Dog Bites Postman (Q4513211) (← links)
- Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property (Q4538082) (← links)
- (Q4553235) (← links)
- The probabilistic complexity of the Voronoi diagram of points on a polyhedron (Q4557556) (← links)
- Exact asymptotics of divide-and-conquer recurrences (Q4630256) (← links)
- Prefix codes: Equiprobable words, unequal letter costs (Q4632460) (← links)
- A Generic Top-Down Dynamic-Programming Approach to Prefix-Free Coding (Q4633888) (← links)
- Sink Evacuation on Trees with Dynamic Confluent Flows (Q4636507) (← links)
- A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs (Q4645183) (← links)
- A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs (Q4701156) (← links)
- (Q4818864) (← links)
- (Q4834461) (← links)
- (Q4875192) (← links)
- Vehicle Scheduling on a Graph Revisited (Q4909553) (← links)
- Dynamic Trees with Almost-Optimal Access Cost (Q5009598) (← links)
- Dynamic closest pairs — A probabilistic approach (Q5056153) (← links)
- Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems (Q5136261) (← links)
- The Asymptotic Number of Spanning Trees in Circulant Graphs (Extended Abstract) (Q5194617) (← links)
- Multiple Sink Location Problems in Dynamic Path Networks (Q5251641) (← links)
- A Dynamic Programming Approach to Length-Limited Huffman Coding: Space Reduction With the Monge Property (Q5281351) (← links)
- Algorithm Theory - SWAT 2004 (Q5315363) (← links)
- Curve reconstruction from noisy samples (Q5361636) (← links)
- More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding (Q5387768) (← links)
- Algorithms and Data Structures (Q5394266) (← links)
- Online Dynamic Programming Speedups (Q5443508) (← links)
- (Q5501337) (← links)
- Prefix Codes: Equiprobable Words, Unequal Letter Costs (Q5691295) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710811) (← links)
- Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity (Q5746252) (← links)
- (Q5875491) (← links)
- Discrete and Computational Geometry (Q5897099) (← links)
- A combinatorial approach to Golomb forests (Q5941521) (← links)
- Lopsided trees. I: Analyses (Q5953101) (← links)
- A Simple Algorithm for Optimal Search Trees with Two-way Comparisons (Q6058229) (← links)
- The multi-weighted spanning tree problem (Q6085702) (← links)
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows (Q6107888) (← links)
- Labelled trees and pairs of input-output permutations in priority queues (Q6184377) (← links)
- Scheduling on a graph with release times (Q6204662) (← links)