Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

107

Voted

FOCS
2010
IEEE

122views Theoretical Computer Science» more FOCS 2010»

Estimating the Longest Increasing Sequence in Polylogarithmic Time

15 years 23 days ago

Estimating the Longest Increasing Sequence in Polylogarithmic Time

Download www.cs.princeton.edu

Michael Saks, C. Seshadhri

Real-time Traffic

FOCS 2010 | Theoretical Computer Science |

claim paper

Related Content

» Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input...

» On distance to monotonicity and longest increasing subsequence of a data stream

» Using the longest significance run to estimate regionspecific pvalues in genetic associati...

» A genetic algorithm for the longest common subsequence problem

» A Pattern Matching Algorithm for Codon Optimization and CpG MotifEngineering in DNA Expres...

» An Efficient Algorithm for RealTime Frequent Pattern Mining for RealTime Business Intellig...

» An Efficient Technique for Frequent Pattern Mining in RealTime Business Applications

» Probe set filtering increases correlation between Affymetrix GeneChip and qRTPCR expressio...

» Optical flow estimation using high frame rate sequences

Post Info
More Details (n/a)

Added	11 Feb 2011
Updated	11 Feb 2011
Type	Journal
Year	2010
Where	FOCS
Authors	Michael Saks, C. Seshadhri

Comments (0)