The following pages link to Mordecai J. Golin (Q672260):
Displayed 50 items.
- (Q198768) (redirect page) (← links)
- (Q1275071) (redirect page) (← links)
- Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas (Q672261) (← links)
- Online dynamic programming speedups (Q839641) (← links)
- The channel capacity of read/write isolated memory (Q897614) (← links)
- Encoding 2D range maximum queries (Q897899) (← links)
- Multiple sink location problems in dynamic path networks (Q897956) (← links)
- The asymptotic number of spanning trees in circulant graphs (Q965958) (← links)
- Labelled trees and pairs of input--output permutations in priority queues (Q1275072) (← links)
- (Q1296578) (redirect page) (← links)
- Optimal point-to-point broadcast algorithms via lopsided trees (Q1296579) (← links)
- Queue-mergesort (Q1313731) (← links)
- A provably fast linear-expected-time maxima-finding algorithm (Q1329142) (← links)
- Mellin transforms and asymptotics. The mergesort recurrence (Q1338908) (← links)
- Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets (Q1406880) (← links)
- The number of spanning trees in circulant graphs (Q1587617) (← links)
- An algorithm for finding a \(k\)-median in a directed tree (Q1607050) (← links)
- The transfer matrices and the capacity of the 2-dimensional \((1, \infty)\)-runlength limited constraint (Q1727769) (← links)
- Fun-Sort -- or the chaos of unordered binary search (Q1765229) (← links)
- Curve reconstruction from noisy samples (Q1775779) (← links)
- New upper and lower bounds on the channel capacity of read/write isolated memory (Q1827834) (← links)
- On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes (Q1873689) (← links)
- Competitive facility location: the Voronoi game (Q1884986) (← links)
- Queries on Voronoi diagrams on moving points (Q1924716) (← links)
- Paging mobile users in cellular networks: optimality versus complexity and simplicity (Q1935810) (← links)
- On the cost of unsuccessful searches in search trees with two-way comparisons (Q2051772) (← links)
- Scheduling with gaps: new models and algorithms (Q2059088) (← links)
- On Huang and Wong's algorithm for generalized binary split trees (Q2089746) (← links)
- Minmax regret for sink location on dynamic flow paths with general capacities (Q2133396) (← links)
- Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities (Q2319636) (← links)
- Minimax regret 1-sink location problem in dynamic path networks (Q2348257) (← links)
- How many maxima can there be? (Q2365811) (← links)
- Improved algorithms for computing \(k\)-sink on dynamic flow path networks (Q2405281) (← links)
- Online maintenance of \(k\)-medians and \(k\)-covers on a line (Q2505498) (← links)
- Chebyshev polynomials and spanning tree formulas for circulant and related graphs (Q2566290) (← links)
- Speeding up the AIFV-2 dynamic programs by two orders of magnitude using range minimum queries (Q2661782) (← links)
- Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme (Q2910857) (← links)
- The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity (Q2930293) (← links)
- Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity (Q2938749) (← links)
- Scheduling with Gaps: New Models and Algorithms (Q2947014) (← links)
- (Q3140433) (← links)
- (Q3140439) (← links)
- The two‐median problem on Manhattan meshes (Q3442865) (← links)
- Optimal Search Trees with 2-Way Comparisons (Q3459851) (← links)
- The number of spanning trees in a class of double fixed-step loop networks (Q3528151) (← links)
- Huffman coding with unequal letter costs (Q3579254) (← links)
- The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity (Q3583432) (← links)
- More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding (Q3604768) (← links)
- Randomized Data Structures for the Dynamic Closest-Pair Problem (Q4210083) (← links)
- (Q4252022) (← links)
- On the Expected Depth of Random Circuits (Q4256686) (← links)