![](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
Discrete Mathematics & Theoretical Computer Science, Volume 2
Volume 2, Number 1, 1998
- Christopher Lynch, Polina Strogova:
SOUR graphs for efficient completion. 1-25 - Philippe Duchon:
Right-cancellability of a family of operations on binary trees. 27-33 - Giovanni Manzini
:
Lower bounds for sparse matrix vector multiplication on hypercubic networks. 35-47 - I. Dutour, Jean-Marc Fedou:
Object grammars and random generation. 47-61
![](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.