- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence ; day:23 ; month:7 ; year:2018 ; pages:1-25
Algorithmica ; (23.7.2018), 1-25
- Creator
-
Duraj, Lech
- Contributor
-
Künnemann, Marvin
Polak, Adam
SpringerLink (Online service)
- DOI
-
10.1007/s00453-018-0485-7
- URN
-
urn:nbn:de:101:1-2018092522060877963267
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:38 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Duraj, Lech
- Künnemann, Marvin
- Polak, Adam
- SpringerLink (Online service)
Other Objects (12)
The scaling limit of the longest increasing subsequence
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
The longest journey
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Tight Bounds for Double Coverage Against Weak Adversaries
A Tight Lower Bound for Planar Steiner Orientation
A Stirling-Type Formula for the Distribution of the Length of Longest Increasing Subsequences
Women: the longest revolution
Fast and Longest Rollercoasters
The longest Laminate Flooring
The scaling limit of the longest increasing subsequence
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
The longest journey
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Tight Bounds for Double Coverage Against Weak Adversaries
A Tight Lower Bound for Planar Steiner Orientation
A Stirling-Type Formula for the Distribution of the Length of Longest Increasing Subsequences
Women: the longest revolution
Fast and Longest Rollercoasters
The longest Laminate Flooring
The scaling limit of the longest increasing subsequence
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
The longest journey
An asymptotically tight bound for the Davenport constant
Tight bounds for blind search on the integers
Tight Bounds for Double Coverage Against Weak Adversaries
A Tight Lower Bound for Planar Steiner Orientation
A Stirling-Type Formula for the Distribution of the Length of Longest Increasing Subsequences
Women: the longest revolution
Fast and Longest Rollercoasters