- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-0541
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence ; day:23 ; month:7 ; year:2018 ; pages:1-25
Algorithmica ; (23.7.2018), 1-25
- Urheber
-
Duraj, Lech
- Beteiligte Personen und Organisationen
-
Künnemann, Marvin
Polak, Adam
SpringerLink (Online service)
- DOI
-
10.1007/s00453-018-0485-7
- URN
-
urn:nbn:de:101:1-2018092522060877963267
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:38 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Duraj, Lech
- Künnemann, Marvin
- Polak, Adam
- SpringerLink (Online service)
Ähnliche Objekte (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 Double Coverage Against Weak Adversaries
Tight bounds for blind search on the integers
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 Double Coverage Against Weak Adversaries
Tight bounds for blind search on the integers
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 Double Coverage Against Weak Adversaries
Tight bounds for blind search on the integers
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