1
Izdano 2007
Kazalo: ... Retrieval -- Session 7: Data Compression II -- Compressed Text Indexes with Fast Locate -- Processing...
Polni tekst
Elektronski eKnjiga
2
Izdano 2005
Kazalo: ... Common Rigid Subsequence Problem -- Text Indexing with Errors -- A New Compressed Suffix Tree Supporting...
Polni tekst
Elektronski eKnjiga
3
Izdano 2011
Teme: ...Algorithm Analysis and Problem Complexity. https://scigraph.springernature.com/ontologies/product...
Polni tekst
Elektronski eKnjiga
4
Izdano 2013
Kazalo: ..., point sets, and arrays.-  Non-trivial combinatorial properties of such structures.- Problems...
Polni tekst
Elektronski eKnjiga
5
Izdano 2014
Kazalo: ...Trees -- Regular expressions -- Graphs -- Point sets -- Arrays....
Polni tekst
Elektronski eKnjiga
6
Izdano 2015
Kazalo: ... -- Parameterized Complexity of Superstring Problems -- On the Fixed Parameter Tractability and Approximability...
Polni tekst
Elektronski eKnjiga
7
Izdano 2012
Teme: ...Algorithm Analysis and Problem Complexity. https://scigraph.springernature.com/ontologies/product...
Polni tekst
Elektronski eKnjiga
8
Izdano 2006
Kazalo: ... and Related Results -- The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems...
Polni tekst
Elektronski eKnjiga