default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Computer and System Sciences, Volume 129
Volume 129, November 2022
- Krishnendu Chatterjee, Laurent Doyen
:
Graph planning with expected finite horizon. 1-21 - Saket Saurabh, Uéverton dos Santos Souza, Prafullkumar Tale:
On the parameterized complexity of Grid Contraction. 22-38 - Manuel Vilares Ferro, Víctor Manuel Darriba Bilbao, Jesús Vilares Ferro:
Absolute convergence and error thresholds in non-active adaptive sampling. 39-61 - Cornelius Brand:
Discriminantal subset convolution: Refining exterior-algebraic methods for parameterized algorithms. 62-71 - Mehdi Kadivar, Neda Mohammadi:
A maximum clique based approximation algorithm for wireless link scheduling under SINR model. 72-89 - Stasys Jukna, Andrzej Lingas:
Lower bounds for Boolean circuits of bounded negation width. 90-105
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-03-07 00:53 CET 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:
