default search action
Theoretical Computer Science, Volume 753
Volume 753, January 2019
- Tomohiro I, Dominik Köppl:
Improved upper bounds on all maximal α-gapped repeats and palindromes. 1-15 - Yoshifumi Sakai:
A substring-substring LCS data structure. 16-34 - Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore:
A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem. 35-63 - Can Umut Ileri, Orhan Dagdeviren:
A self-stabilizing algorithm for b-matching. 64-75 - Andrew Ryzhikov:
On automata recognizing birecurrent sets. 76-79 - Evangelos Bampas, Lélia Blin, Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Maria Potop-Butucaru, Sébastien Tixeuil:
On asynchronous rendezvous in general graphs. 80-90
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.