Sciweavers

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

11

CORR
2010
Springer

favoriteEmaildiscussreport

49views Education» more CORR 2010»

Counting dependent and independent strings

13 years 11 months ago

Counting dependent and independent strings

Download triton.towson.edu

Marius Zimand

Real-time Traffic

CORR 2010 | Education |

claim paper

Related Content

» Infinite Families of Finite String Rewriting Systems and Their Confluence

» DNA Motif Representation with Nucleotide Dependency

» Extracting Randomness Using Few Independent Sources

» A Simple and Effective Measure for Complex LowLevel Dependencies

» Simulating independence new constructions of condensers ramsey graphs dispersers and extra...

» A Fast BitVector Algorithm for Approximate String Matching Based on Dynamic Programming

» Online Approximate String Matching in Natural Language

» A plethora of paths

» Counting Subgraphs via Homomorphisms

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Marius Zimand

Comments (0)