2 papers
cs.DS2024
Improved Lower Bounds on the Expected Length of Longest Common Subsequences
George T. Heineman, Chase Miller, Daniel Reichman +3
It has been proven that, when normalized by , the expected length of a longest common subsequence of random strings of length over an alphabet of size converges to s…
cs.DS2023
Time Lower Bounds for the Metropolis Process and Simulated Annealing
Zongchen Chen, Dan Mikulincer, Daniel Reichman +1
The Metropolis process (MP) and Simulated Annealing (SA) are stochastic local search heuristics that are often used in solving combinatorial optimization problems. Despite signific…