Sciweavers

3 search results - page 1 / 1
» The Greatest Common Divisor: A Case Study for Program Extrac...
Sort
View
IANDC
2008
141views more  IANDC 2008»
13 years 5 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
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...
ICSE
2010
IEEE-ACM
13 years 7 months ago
Supporting developers with natural language queries
The feature list of modern IDEs is steadily growing and mastering these tools becomes more and more demanding, especially for novice programmers. Despite their remarkable capabili...
Michael Würsch, Giacomo Ghezzi, Gerald Reif, ...