Register | Log in | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

tmarscha's library [14 articles]

Recent papers added to tmarscha's library.
  • Faster Approximate String Matching
    Algorithmica, Vol. 23, No. 2. (1999), pp. 127-158.
    by Ricardo, Gonzalo Navarro
    posted to no-tag by tmarscha on 2007-10-06 12:22:35 as **
  • Markov Chains
    (18 January 2001)
    by Pierre Bremaud
    posted to no-tag by tmarscha on 2007-08-30 09:43:18 as **
  • Introduction to Algorithms, Second Edition
    (01 September 2001)
    by Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, Clifford Stein
    posted to no-tag by tmarscha on 2007-08-22 12:23:13 as ** along with 11 people sven_luzar eporreca pawelt jcheng dragonrez marciolima gurkanbebek dodger042 napvasconcelos chandlerc csacca
  • A Unified Approach to Word Occurrence
    by Probabilities M Egnier
    posted to no-tag by tmarscha on 2007-07-27 11:57:53 as **
  • Probabilistic and Statistical Properties of Words: An Overview
    Journal of computationnal Biology, Vol. 7, No. 1-2. (2000), pp. 1-46.
    by Reinert Gesine, Schbath Sophie, Waterman S Michael
    posted to no-tag by tmarscha on 2007-07-27 08:00:07 as **
  • Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
    (25 July 2005)
    by M Lothaire
    posted to no-tag by tmarscha on 2007-07-24 10:10:01 as **
  • Introduction to the Theory of Computation, Second Edition
    (15 February 2005)
    by Michael Sipser
    posted to no-tag by tmarscha on 2007-07-20 18:01:39 as ** along with 2 people jasmithoffice mmeteo
  • Simple linear work suffix array construction
    (2003)
    by J Kärkkäinen, P Sanders
    posted to no-tag by tmarscha on 2007-05-08 13:49:45 as ** along with 2 people whym ariels
  • On-Line Construction of Suffix Trees
    Algorithmica, Vol. 14, No. 3. (1995), pp. 249-260.
    by Esko Ukkonen
    posted to no-tag by tmarscha on 2007-04-10 10:58:47 as ** along with 4 people creswick sudhanshu_goswami ichii386 yoanjacquemin
  • Compressed Suffix Trees with Full Functionality
    by Kunihiko Sadakane
    posted to no-tag by tmarscha on 2007-04-10 09:19:28 as **
  • Succinct Representation of Balanced Parentheses and Static Trees
    SIAM Journal on Computing, Vol. 31, No. 3. (2001), pp. 762-776.
    by Ian J Munro, Venkatesh Raman
    posted to abstract balanced binary data graphs ordered parenthesis planar representation rooted succinct trees type bibtex-import by tmarscha on 2007-04-10 08:36:02 as **
  • Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs
    (1997), pp. 118-126.
    by Ian J Munro, Venkatesh Raman
    posted to no-tag by tmarscha on 2007-04-10 08:32:18 as ***
  • Handbook of Emotion Regulation
    (21 December 2006)
    posted to emoreg by tmarscha on 2007-04-04 10:13:21 as ** along with 1 person Julia265
  • Suffix Cactus: A Cross between Suffix Tree and Suffix Array
    (1995)
    by Juha Kärkkäinen
    posted to no-tag by tmarscha on 2007-04-04 10:07:49 as ***
    • Note: You may cite this page as: http://www.citeulike.org/user/tmarscha

    RIS BibTeX RSS
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.