Sciweavers

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

86

ISAAC
2009
Springer

favoriteEmaildiscussreport

245views Algorithms» more ISAAC 2009»

Pattern Matching for 321-Avoiding Permutations

15 years 4 months ago

Pattern Matching for 321-Avoiding Permutations

Download www.lirmm.fr

Sylvain Guillemot, Stéphane Vialette

Real-time Traffic

Algorithms | ISAAC 2009 |

claim paper

Related Content

» Longest Increasing Subsequences in PatternRestricted Permutations

» Restricted Dumont permutations Dyck paths and noncrossing partitions

» Pattern Avoidance in Permutations Linear and Cyclic Orders

» Permutation Editing and Matching via Embeddings

» AverageCase Analysis of Perfect Sorting by Reversals

» Building a better Boolean matcher and symmetry detector

» Azimuthelevation direction finding using power measurements from single antenna

» Analysis and Synthesis of PseudoPeriodic Job Arrivals in Grids A Matching Pursuit Approach

» Fast Bit Gather Bit Scatter and Bit Permutation Instructions for Commodity Microprocessors

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	ISAAC
Authors	Sylvain Guillemot, Stéphane Vialette

Comments (0)