![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Theoretical Computer Science, Volume 899
Volume 899, January 2022
- Alessio Conte
, Etsuji Tomita:
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms. 1-24 - Petra Wolf:
From decidability to undecidability by considering regular sets of instances. 25-38 - William Kuszmaul:
Train tracks with gaps: Applying the probabilistic method to trains. 39-47 - Angelo Montanari, Pietro Sala:
Reactive synthesis from interval temporal logic specifications. 48-79 - Sayan Bandyapadhyay, Tanmay Inamdar
, Shreyas Pai
, Sriram V. Pemmaraju:
Near-optimal clustering in the k-machine model. 80-97
![](https://dblp1.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.