![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![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
BibTeX record conf/spire/Nikolaev21
@inproceedings{DBLP:conf/spire/Nikolaev21, author = {Maksim S. Nikolaev}, editor = {Thierry Lecroq and H{\'{e}}l{\`{e}}ne Touzet}, title = {All Instantiations of the Greedy Algorithm for the Shortest Common Superstring Problem are Equivalent}, booktitle = {String Processing and Information Retrieval - 28th International Symposium, {SPIRE} 2021, Lille, France, October 4-6, 2021, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {12944}, pages = {61--67}, publisher = {Springer}, year = {2021}, url = {https://doi.org/10.1007/978-3-030-86692-1\_6}, doi = {10.1007/978-3-030-86692-1\_6}, timestamp = {Tue, 05 Oct 2021 10:03:17 +0200}, biburl = {https://dblp.org/rec/conf/spire/Nikolaev21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](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.