Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase longest increasing subsequences (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1999-2010 (9)
Publication types (Num. hits)
article(5) inproceedings(4)
Venues (Conferences, Journals, ...)
Electr. J. Comb.(2) Theor. Comput. Sci.(2) CPM(1) Inf. Process. Lett.(1) ISAAC(1) PPAM(1) SPAA(1)
Authors
Alexander Tiskin(2) Erdong Chen(2) Hao Yuan(2) Linji Yang(2) Peter Krusche(2) A. J. Hildebrand(1) Alejandro López-Ortiz(1) Alexander Golynski(1) Alexandre Tiskin(1) Alexei Borodin(1) Angèle M. Hamel(1) Emeric Deutsch(1) Herbert S. Wilf(1) Michael H. Albert(1) Michael Segal(1) Mohammad Ali Safari(1) More (+10 of total 18)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1 occurrences of 1 keywords
Results
Found 9 publication records. Showing 9 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
2Erdong Chen, Hao Yuan, Linji Yang Longest Increasing Subsequences in Windows Based on Canonical Antichain Partition. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Peter Krusche, Alexander Tiskin New algorithms for efficient parallel string comparison. Search on Bibsonomy SPAA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF BSP algorithms, longest increasing subsequences, longest common subsequences
1Peter Krusche, Alexander Tiskin Parallel Longest Increasing Subsequences in Scalable Time and Memory. Search on Bibsonomy PPAM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Erdong Chen, Linji Yang, Hao Yuan Longest increasing subsequences in windows based on canonical antichain partition. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Alexandre Tiskin Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs. Search on Bibsonomy CPM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Michael H. Albert, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, S. Srinivasa Rao, Mohammad Ali Safari Longest increasing subsequences in sliding windows. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Emeric Deutsch, A. J. Hildebrand, Herbert S. Wilf Longest Increasing Subsequences in Pattern-Restricted Permutations. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2002 DBLP  BibTeX  RDF
1Sergei Bespamyatnikh, Michael Segal Enumerating longest increasing subsequences and patience sorting. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Alexei Borodin Longest Increasing Subsequences of Random Colored Permutations. Search on Bibsonomy Electr. J. Comb. The full citation details ... 1999 DBLP  BibTeX  RDF
Displaying result #1 - #9 of 9 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.