default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical 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
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.
last updated on 2025-07-19 02:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
