Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
Longest increasing subsequence
OpenAlex ID:
C170006305
The String-to-String Correction Problem
1974
·
Robert A. Wagner
, Michael J. Fischer
·
Journal of the ACM
·
3,515
PDF
On the distribution of the length of the longest increasing subsequence of random permutations
1999
·
Jinho Baik
, Percy Deift
, et al.
·
Journal of the American Mathematical Society
·
1,315
PDF
A linear space algorithm for computing maximal common subsequences
1975
·
D. S. Hirschberg
·
Communications of the ACM
·
1,261
PDF
Matrix Profile I: All Pairs Similarity Joins for Time Series: A Unifying View That Includes Motifs, Discords and Shapelets
2016
·
Chin-Chia Michael Yeh
, Yan Zhu
, et al.
·
Proceedings
·
971
Longest Increasing and Decreasing Subsequences
1961
·
C. Schensted
·
Canadian Journal of Mathematics
·
888
PDF
Algorithms for the Longest Common Subsequence Problem
1977
·
Daniel S. Hirschberg
·
Journal of the ACM
·
857
PDF
Recurrence of Distributional Limits of Finite Planar Graphs
2001
·
Itai Benjamini
, Oded Schramm
·
Electronic Journal of Probability
·
765
PDF
A fast algorithm for computing longest common subsequences
1977
·
James W. Hunt
, Thomas G. Szymanski
·
Communications of the ACM
·
760
PDF
A survey of longest common subsequence algorithms
2002
·
L. Bergroth
, H. Hakonen
, et al.
·
String Processing and Information Retrieval
·
758
Scale Invariance of the PNG Droplet and the Airy Process
2002
·
Michael Prähofer
, Herbert Spohn
·
Journal of Statistical Physics
·
680
PDF
A variational problem for random Young tableaux
1977
·
B.F Logan
, L.A Shepp
·
Advances in Mathematics
·
628
Longest Increasing and Decreasing Subsequences
2009
·
C. Schensted
·
Birkhäuser Boston eBooks
·
587
Preserving order in a forest in less than logarithmic time and linear space
1977
·
P. van Emde Boas
·
Information Processing Letters
·
471
Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
1999
·
David Aldous
, Persi Diaconis
·
Bulletin of the American Mathematical Society
·
459
PDF
Probability Theory and Combinatorial Optimization
1997
·
J. Michael Steele
·
Society for Industrial and Applied Mathematics eBooks
·
452
Generating trees and the Catalan and Schröder numbers
1995
·
Julian West
·
Discrete Mathematics
·
313
PDF
Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping
2015
·
Karl Bringmann
, Marvin Kunnemann
·
Annual Symposium on Foundations of Computer Science
·
298
PDF
The Surprising Mathematics of Longest Increasing Subsequences
2014
·
Dan Romik
·
Cambridge University Press eBooks
·
296
Algebraic aspects of increasing subsequences
2001
·
Eric M. Rains
, Jinho Baik
·
Duke Mathematical Journal
·
283
PDF
Longest common subsequences of two random sequences
1975
·
Vacláv Chvátal
, David Sankoff
·
Journal of Applied Probability
·
276
An extension of Schensted's theorem
1974
·
Curtis Greene
·
Advances in Mathematics
·
274
PDF
Finding the most unusual time series subsequence: algorithms and applications
2006
·
Eamonn Keogh
, Jessica Lin
, et al.
·
Knowledge and Information Systems
·
258
The longest common subsequence problem revisited
1987
·
A. Apostolico
, C. Guerra
·
Algorithmica
·
256
Bounds on the Complexity of the Longest Common Subsequence Problem
1976
·
J. D. Ullman
, A. V. Aho
, et al.
·
Journal of the ACM
·
255
Pattern matching for permutations
1998
·
Prosenjit Bose
, Jonathan F. Buss
, et al.
·
Information Processing Letters
·
244
Show more works
View as search
Works count:
1,724
Citation count:
37,090
Year
Topic
Type