Abstract is missing.
- Querying the Web Graph - (Invited Talk)Marc Najork. 1-12 [doi]
- Incremental Algorithms for Effective and Efficient Query RecommendationDaniele Broccolo, Ophir Frieder, Franco Maria Nardini, Raffaele Perego, Fabrizio Silvestri. 13-24 [doi]
- Fingerprinting Ratings for Collaborative Filtering - Theoretical and Empirical AnalysisYoram Bachrach, Ralf Herbrich. 25-36 [doi]
- On Tag Spell CheckingFranco Maria Nardini, Fabrizio Silvestri, Hossein Vahabi, Pedram Vahabi, Ophir Frieder. 37-42 [doi]
- Compressed Self-indices Supporting Conjunctive Queries on Document CollectionsDiego Arroyuelo, Senén González, Mauricio Oyarzún. 43-54 [doi]
- String Retrieval for Multi-pattern QueriesWing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter. 55-66 [doi]
- Colored Range Queries and Document RetrievalTravis Gagie, Gonzalo Navarro, Simon J. Puglisi. 67-81 [doi]
- Range Queries over Untangled ChainsFrancisco Claude, J. Ian Munro, Patrick K. Nicholson. 82-93 [doi]
- Multiplication Algorithms for Monge MatricesLuís M. S. Russo. 94-105 [doi]
- Why Large Closest String Instances Are Easy to Solve in PracticeChristina Boucher, Kathleen Wilkie. 106-117 [doi]
- A PTAS for the Square Tiling ProblemAmihood Amir, Alberto Apostolico, Gad M. Landau, Oren Sar Shalom. 118-126 [doi]
- On the Hardness of Counting and Sampling Center StringsChristina Boucher, Mohamed Omar. 127-134 [doi]
- Counting and Verifying Maximal PalindromesTomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 135-146 [doi]
- Identifying SNPs without a Reference Genome by Comparing Raw ReadsPierre Peterlongo, Nicolas Schnel, Nadia Pisanti, Marie-France Sagot, Vincent Lacroix. 147-158 [doi]
- Dynamic Z-Fast TriesDjamal Belazzougui, Paolo Boldi, Sebastiano Vigna. 159-172 [doi]
- Improved Fast Similarity Search in DictionariesDaniel Karch, Dennis Luxen, Peter Sanders. 173-178 [doi]
- Training Parse Trees for Efficient VF CodingTakashi Uemura, Satoshi Yoshida, Takuya Kida, Tatsuya Asai, Seishi Okamoto. 179-184 [doi]
- Algorithms for Finding a Minimum Repetition Representation of a StringAtsuyoshi Nakamura, Tomoya Saito, Ichigaku Takigawa, Hiroshi Mamitsuka, Mineichi Kudo. 185-190 [doi]
- Faster Compressed Dictionary MatchingWing-Kai Hon, Tsung-Han Ku, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter. 191-200 [doi]
- Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and RetrievalShanika Kuruppu, Simon J. Puglisi, Justin Zobel. 201-206 [doi]
- Standard Deviation as a Query Hardness EstimatorJoaquín Pérez-Iglesias, Lourdes Araujo. 207-212 [doi]
- Using Related Queries to Improve Web Search Results RankingGeorges Dupret, Ricardo Zilleruelo-Ramos, Sumio Fujita. 213-224 [doi]
- Evaluation of Query Performance Prediction Methods by RangeJoaquín Pérez-Iglesias, Lourdes Araujo. 225-236 [doi]
- Mining Large Query Induced Graphs towards a Hierarchical Query FolksonomyAlexandre P. Francisco, Ricardo A. Baeza-Yates, Arlindo L. Oliveira. 237-242 [doi]
- Finite Automata Based Algorithms for the Generalized Constrained Longest Common Subsequence ProblemsEffat Farhana, Jannatul Ferdous, Tanaeem M. Moosa, M. Sohel Rahman. 243-249 [doi]
- Restricted LCSZvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe Lewenstein. 250-257 [doi]
- Extracting Powers and Periods in a String from Its Runs StructureMaxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. 258-269 [doi]
- On Shortest Common Superstring and Swap PermutationsZvi Gotthilf, Moshe Lewenstein, Alexandru Popa. 270-278 [doi]
- A Self-Supervised Approach for Extraction of Attribute-Value Pairs from Wikipedia ArticlesWladmir C. Brandão, Edleno Silva de Moura, Altigran S. Silva, Nivio Ziviani. 279-289 [doi]
- Temporal Analysis of Document Collections: Framework and ApplicationsOmar Alonso, Michael Gertz, Ricardo A. Baeza-Yates. 290-296 [doi]
- Text Comparison Using Soft CardinalitySergio Jimenez, Fabio Gonzalez, Alexander F. Gelbukh. 297-302 [doi]
- Hypergeometric Language Model and Zipf-Like Scoring Function for Web Document Similarity RetrievalFelipe Bravo-Marquez, Gaston L Huillier, Sebastián A. Ríos, Juan D. Velásquez. 303-308 [doi]
- Dual-Sorted Inverted ListsGonzalo Navarro, Simon J. Puglisi. 309-321 [doi]
- CST++Enno Ohlebusch, Johannes Fischer, Simon Gog. 322-333 [doi]
- Succinct Representations of Dynamic StringsMeng He, J. Ian Munro. 334-346 [doi]
- Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text IndexesEnno Ohlebusch, Simon Gog, Adrian Kügel. 347-358 [doi]
- The Gapped Suffix Array: A New Index Structure for Fast Approximate MatchingMaxime Crochemore, German Tischler. 359-364 [doi]
- Parameterized Searching with Mismatches for Run-Length Encoded Strings - (Extended Abstract)Alberto Apostolico, Péter L. Erdös, Alpár Jüttner. 365-371 [doi]
- Fast Bit-Parallel Matching for Network and Regular ExpressionsYusaku Kaneta, Shin-ichi Minato, Hiroki Arimura. 372-384 [doi]
- String Matching with Variable Length GapsPhilip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, David Kofoed Wind. 385-394 [doi]
- Approximate String Matching with Stuck Address BitsAmihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat. 395-405 [doi]