Sciweavers

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

34

ENDM
2010

favoriteEmaildiscussreport

101views more ENDM 2010»

Finding Gale Strings

13 years 11 months ago

Finding Gale Strings

Download www.maths.lse.ac.uk

Electronic Notes in Discrete Mathematics 36 (2010) 1065

Marta M. Casetti, Julian Merschen, Bernhard von St

Real-time Traffic

Bimatrix Games | Cyclic Polytopes | ENDM 2010 | LemkeHowson Algorithm |

claim paper

Related Content

» Linear time approximation schemes for the GaleBerlekamp game and related minimization prob...

» Conservative String Covering of Indeterminate Strings

» String Pattern Discovery

» Finding approximate palindromes in strings

» Finding Approximate Palindromes in Strings Quickly and Simply

» Finding Patterns in Strings using Suffixarrays

» Finding Maximal Quasiperiodicities in Strings

» Finding submasses in weighted strings with Fast Fourier Transform

» Weighted SetBased String Similarity

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2010
Where	ENDM
Authors	Marta M. Casetti, Julian Merschen, Bernhard von Stengel

Comments (0)