சுருங்குறித் தொடர் (Tamil Wikipedia)

Analysis of information sources in references of the Wikipedia article "சுருங்குறித் தொடர்" in Tamil language version.

refsWebsite

Global rank Tamil rank

low place

2,245^th place

3,959^th place

low place

low place

low place

1web.archive.org

1^st place

1^st place

2^nd place

4^th place

1uni-giessen.de

low place

low place

low place

low place

low place

low place

catb.org (Global: 3,959^th place; Tamil: low place)

Raymond, Eric S. citing Dennis Ritchie (2003). "Jargon File 4.4.7: grep".

dagstuhl.de (Global: low place; Tamil: low place)

drops.dagstuhl.de

(Gelade & Neven 2008) Gelade, Wouter; Neven, Frank (2008), "Succinctness of the Complement and Intersection of Regular Expressions", Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008), pp. 325–336

doi.org (Global: 2^nd place; Tamil: 4^th place)

(Gruber & Holzer 2008) Gruber, Hermann; Holzer, Markus (2008), "Finite Automata, Digraph Connectivity, and Regular Expression Size", Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP 2008) (PDF), pp. 39–50, doi:10.1007/978-3-540-70583-3_4, archived from the original (PDF) on 2009-09-01, retrieved 2010-01-11

laurikari.net (Global: low place; Tamil: low place)

(Laurikari 2009) Laurikari, Ville (2009). "TRE library 0.7.6".

perl.org (Global: low place; Tamil: 2,245^th place)

perldoc.perl.org

Wall, Larry and the Perl 5 development team (2006). "perlre: Perl regular expressions".{{cite web}}: CS1 maint: numeric names: authors list (link)

dev.perl.org

(Wall 2002) Wall, Larry (2002-06-04). "Apocalypse 5: Pattern Matching".{{cite web}}: CS1 maint: date and year (link)

swtch.com (Global: low place; Tamil: low place)

(Cox 2007) Cox, Russ (2007), Regular Expression Matching Can Be Simple and Fast

uni-giessen.de (Global: low place; Tamil: low place)

informatik.uni-giessen.de

(Gruber & Holzer 2008) Gruber, Hermann; Holzer, Markus (2008), "Finite Automata, Digraph Connectivity, and Regular Expression Size", Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP 2008) (PDF), pp. 39–50, doi:10.1007/978-3-540-70583-3_4, archived from the original (PDF) on 2009-09-01, retrieved 2010-01-11

web.archive.org (Global: 1^st place; Tamil: 1^st place)

(Gruber & Holzer 2008) Gruber, Hermann; Holzer, Markus (2008), "Finite Automata, Digraph Connectivity, and Regular Expression Size", Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP 2008) (PDF), pp. 39–50, doi:10.1007/978-3-540-70583-3_4, archived from the original (PDF) on 2009-09-01, retrieved 2010-01-11