Mordecai J. Golin

From MaRDI portal
Person:672260

Available identifiers

zbMath Open golin.mordecai-jWikidataQ58137972 ScholiaQ58137972MaRDI QIDQ672260

List of research outcomes

PublicationDate of PublicationType
Scheduling on a graph with release times2024-04-02Paper
Labelled trees and pairs of input-output permutations in priority queues2024-01-05Paper
The multi-weighted spanning tree problem2023-12-12Paper
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons2023-10-31Paper
Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows2023-06-28Paper
https://portal.mardi4nfdi.de/entity/Q58754912023-02-03Paper
Dynamic closest pairs — A probabilistic approach2022-12-09Paper
On Huang and Wong's algorithm for generalized binary split trees2022-10-24Paper
Minmax regret for sink location on dynamic flow paths with general capacities2022-04-29Paper
Scheduling with gaps: new models and algorithms2021-12-13Paper
On the cost of unsuccessful searches in search trees with two-way comparisons2021-11-25Paper
Dynamic Trees with Almost-Optimal Access Cost2021-08-04Paper
Speeding up the AIFV-2 dynamic programs by two orders of magnitude using range minimum queries2021-04-08Paper
Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems2020-11-25Paper
The Asymptotic Number of Spanning Trees in Circulant Graphs (Extended Abstract)2019-09-16Paper
Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities2019-08-20Paper
A Generic Top-Down Dynamic-Programming Approach to Prefix-Free Coding2019-05-06Paper
Prefix codes: Equiprobable words, unequal letter costs2019-04-29Paper
Exact asymptotics of divide-and-conquer recurrences2019-03-29Paper
The transfer matrices and the capacity of the 2-dimensional \((1, \infty)\)-runlength limited constraint2019-02-20Paper
A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs2019-01-10Paper
The probabilistic complexity of the Voronoi diagram of points on a polyhedron2018-11-23Paper
Sink Evacuation on Trees with Dynamic Confluent Flows2018-04-19Paper
Curve reconstruction from noisy samples2017-09-29Paper
Improved algorithms for computing \(k\)-sink on dynamic flow path networks2017-09-22Paper
A Dynamic Programming Approach to Length-Limited Huffman Coding: Space Reduction With the Monge Property2017-07-27Paper
Optimal Search Trees with 2-Way Comparisons2016-01-11Paper
Encoding 2D range maximum queries2015-12-08Paper
Multiple sink location problems in dynamic path networks2015-12-08Paper
The channel capacity of read/write isolated memory2015-12-07Paper
Scheduling with Gaps: New Models and Algorithms2015-09-21Paper
https://portal.mardi4nfdi.de/entity/Q55013372015-08-03Paper
Minimax regret 1-sink location problem in dynamic path networks2015-06-11Paper
Multiple Sink Location Problems in Dynamic Path Networks2015-05-20Paper
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity2015-01-15Paper
The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity2014-11-18Paper
Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity2014-02-18Paper
Vehicle Scheduling on a Graph Revisited2013-03-21Paper
Paging mobile users in cellular networks: optimality versus complexity and simplicity2013-02-19Paper
Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme2012-09-12Paper
Encoding 2D range maximum queries2011-12-16Paper
The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity2010-08-16Paper
Huffman coding with unequal letter costs2010-08-05Paper
The asymptotic number of spanning trees in circulant graphs2010-04-27Paper
Discrete and Computational Geometry2010-02-05Paper
Online dynamic programming speedups2009-09-02Paper
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding2009-02-24Paper
The number of spanning trees in a class of double fixed-step loop networks2008-10-08Paper
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding2008-05-27Paper
Online Dynamic Programming Speedups2008-02-21Paper
The two‐median problem on Manhattan meshes2007-05-23Paper
Algorithms and Data Structures2006-10-25Paper
Online maintenance of \(k\)-medians and \(k\)-covers on a line2006-09-26Paper
Graph-Theoretic Concepts in Computer Science2005-12-08Paper
Chebyshev polynomials and spanning tree formulas for circulant and related graphs2005-09-22Paper
Algorithm Theory - SWAT 20042005-09-07Paper
Curve reconstruction from noisy samples2005-05-04Paper
Fun-Sort -- or the chaos of unordered binary search2005-02-23Paper
Competitive facility location: the Voronoi game2004-10-27Paper
https://portal.mardi4nfdi.de/entity/Q48188642004-09-24Paper
New upper and lower bounds on the channel capacity of read/write isolated memory2004-08-06Paper
Optimal point-to-point broadcast algorithms via lopsided trees2004-02-18Paper
https://portal.mardi4nfdi.de/entity/Q44289322003-09-22Paper
Meeting the Welch and Karystinos-Pados bounds on DS-CDMA binary signature sets2003-09-07Paper
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes2003-05-27Paper
https://portal.mardi4nfdi.de/entity/Q45532352002-11-04Paper
Lopsided trees. I: Analyses2002-08-01Paper
An algorithm for finding a \(k\)-median in a directed tree2002-07-25Paper
Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property2002-07-11Paper
A combinatorial approach to Golomb forests2001-08-20Paper
The number of spanning trees in circulant graphs2000-12-03Paper
Dog Bites Postman2000-11-07Paper
A dynamic programming algorithm for constructing optimal "1"-ended binary prefix-free codes2000-09-07Paper
https://portal.mardi4nfdi.de/entity/Q42520222000-04-06Paper
On the Expected Depth of Random Circuits2000-03-07Paper
A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs1999-11-21Paper
Labelled trees and pairs of input--output permutations in priority queues1999-01-12Paper
Randomized Data Structures for the Dynamic Closest-Pair Problem1998-09-20Paper
Prefix Codes: Equiprobable Words, Unequal Letter Costs1997-11-18Paper
Queries on Voronoi diagrams on moving points1997-03-03Paper
Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas1997-02-28Paper
https://portal.mardi4nfdi.de/entity/Q48344611996-11-10Paper
https://portal.mardi4nfdi.de/entity/Q48751921996-06-18Paper
A provably fast linear-expected-time maxima-finding algorithm1995-10-29Paper
Mellin transforms and asymptotics. The mergesort recurrence1994-12-18Paper
https://portal.mardi4nfdi.de/entity/Q31404331994-11-29Paper
Queue-mergesort1994-02-24Paper
https://portal.mardi4nfdi.de/entity/Q31404391993-12-15Paper
How many maxima can there be?1993-06-29Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Mordecai J. Golin