類似資料

• Optimal-Cost Construction of Shallow Cuttings for 3-D Dominance Ranges in the I/O-Model
  著者:: Nekrich, Yakov, 等
  出版事項: (2026)
• Exact Sampling of Permutations with a Fixed Longest Increasing Subsequence
  著者:: Clifford, Peter, 等
  出版事項: (2026)
• A Bouquet of Results on Maximum Range Sum: General Techniques and Hardness Reductions
  著者:: Gusain, Rachana, 等
  出版事項: (2025)
• An Algorithm for the Longest Common Subsequence and Substring Problem for Multiple Strings
  著者:: Li, Rao
  出版事項: (2024)
• Improved Lower Bounds on the Expected Length of Longest Common Subsequences
  著者:: Heineman, George T., 等
  出版事項: (2024)