


default search action
Journal of Computer and System Sciences, Volume 119
Volume 119, August 2021
- Thomas Erlebach, Michael Hoffmann, Frank Kammer:

On temporal graph exploration. 1-18
- Sven Schewe

, Lijun Zhang:
Editorial - Special issue on Concurrency Theory (CONCUR 2018). 19-20
- Gianluca De Marco, Tomasz Jurdzinski, Dariusz R. Kowalski:

Optimal channel utilization with limited feedback. 21-33 - Jesús Domínguez

, Maribel Fernández:
Nominal syntax with atom substitutions. 34-59
- Jessica A. Enright, Kitty Meeks, George B. Mertzios

, Viktor Zamaraev
:
Deleting edges to restrict the size of an epidemic in temporal networks. 60-77 - Laure Daviaud

, Marcin Jurdzinski, Ranko Lazic
, Filip Mazowiecki, Guillermo A. Pérez
, James Worrell:
When are emptiness and containment decidable for probabilistic automata? 78-96 - Pablo Barceló, Alexander Baumgartner

, Victor Dalmau, Benny Kimelfeld:
Regularizing conjunctive features for classification. 97-124 - Eduard Eiben, Daniel Lokshtanov, Amer E. Mouawad

:
Bisection of bounded treewidth graphs by convolutions. 125-132
- Guy Avni, Thomas A. Henzinger, Dorde Zikelic:

Bidding mechanisms in graph games. 133-144
- Flavio Ferrarotti

, Senén González, José Maria Turull Torres, Jan Van den Bussche
, Jonni Virtema
:
Descriptive complexity of deterministic polylogarithmic time and space. 145-163 - Huib Donkers, Bart M. P. Jansen

:
A Turing kernelization dichotomy for structural parameterizations of F-Minor-Free Deletion. 164-182
- Sebastian Junges

, Joost-Pieter Katoen, Guillermo A. Pérez
, Tobias Winkler:
The complexity of reachability in parametric Markov decision processes. 183-210 - Thomas Brihaye, Véronique Bruyère, Aline Goeminne

, Nathan Thomasset:
On relevant equilibria in reachability games. 211-230

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














