Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
901
search results - page 181 / 181
»
On Anonymization of String Data
Sort
relevance
views
votes
recent
update
View
thumb
title
136
Voted
IANDC
2008
141
views
more
IANDC 2008
»
Graph connectivity, partial words, and a theorem of Fine and Wilf
15 years 2 months ago
Download
www.uncg.edu
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
claim paper
Read More »
« Prev
« First
page 181 / 181
Last »
Next »