Tight Conditional Lower Bounds for Longest Common Increasing Subsequence

Lech Duraj, Marvin Künnemann, Adam Polak. Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. Algorithmica, 81(10):3968-3992, 2019. [doi]

Authors

Lech Duraj

This author has not been identified. Look up 'Lech Duraj' in Google

Marvin Künnemann

This author has not been identified. Look up 'Marvin Künnemann' in Google

Adam Polak

This author has not been identified. Look up 'Adam Polak' in Google