default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 656
Volume 656, Part A, December 2016
- Dario Carotenuto, Aniello Murano
, Adriano Peron:
Ordered multi-stack visibly pushdown automata. 1-26 - Xiang Fu:
On detecting environment sensitivity using slicing. 27-45 - Razvan Diaconescu:
Functorial semantics of first-order views. 46-59 - Samik Basu, Tevfik Bultan:
On deciding synchronizability for asynchronously communicating systems. 60-75 - Björn Lellmann:
Hypersequent rules with restricted contexts for propositional modal logics. 76-105
Volume 656, Part B, December 2016
- Costas S. Iliopoulos, Simon J. Puglisi:
Foreword. 107 - Alice Héliou, Martine Léonard, Laurent Mouchard, Mikaël Salson:
Efficient dynamic range minimum query. 108-117 - Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Élise Prieur-Gaston:
Binary block order Rouen Transform. 118-134 - Joshimar Cordova, Gonzalo Navarro:
Simple and efficient fully-functional succinct trees. 135-145 - Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg:
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings. 146-159 - Carl Barton, Chang Liu, Solon P. Pissis:
Linear-time computation of prefix table for weighted strings & applications. 160-172 - Youngho Kim, Joong Chae Na, Heejin Park, Jeong Seop Sim:
A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm. 173-179 - Wojciech Rytter:
Two fast constructions of compact representations of binary words with given set of periods. 180-187 - Fatema Tuz Zohora, M. Sohel Rahman:
An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications. 188-214 - Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster Lyndon factorization algorithms for SLP and LZ78 compressed text. 215-224 - Yoshiaki Matsuoka, Takahiro Aoki, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Generalized pattern matching and periodicity under substring consistent equivalence relations. 225-233 - Maxime Crochemore, Robert Mercas:
On the density of Lyndon roots in factors. 234-240 - Golnaz Badkobeh, Maxime Crochemore, Manal Mohamed, Chalita Toopsuwan:
Efficient computation of maximal anti-exponent in palindrome-free strings. 241-248 - Jamie Simpson:
An abelian periodicity lemma. 249-255 - Gabriele Fici, Tomasz Kociumaka, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Fast computation of abelian runs. 256-264 - Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski:
Tighter bounds for the sum of irreducible LCP values. 265-278
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-11 23:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
