![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 726
Volume 726, May 2018
- Guilhem Gamard, Pascal Ochem
, Gwénaël Richomme, Patrice Séébold:
Avoidability of circular formulas. 1-4 - Yangjun Chen, Yujia Wu:
On the string matching with k mismatches. 5-29 - Kyle Fox, Sungjin Im, Benjamin Moseley:
Energy efficient scheduling of parallelizable jobs. 30-40 - Martin Biely, Peter Robinson, Ulrich Schmid, Manfred Schwarz, Kyrill Winkler
:
Gracefully degrading consensus and k-set agreement in directed dynamic networks. 41-77 - Palash Dey, Neeldhara Misra, Y. Narahari:
Complexity of manipulation with partial information in voting. 78-99
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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.