


default search action
Journal of Computer and System Sciences, Volume 107
Volume 107, February 2020
- Heng Guo, Tyson Williams:

The complexity of planar Boolean #CSP with complex weights. 1-27 - Fabrizio Frati

, Maurizio Patrignani, Vincenzo Roselli
:
LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs. 28-53 - Ernesto Jiménez

, José Luis López-Presa
, Javier Martín-Rueda
:
Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures. 54-71 - Philipp Zschoche, Till Fluschnik, Hendrik Molter

, Rolf Niedermeier:
The complexity of finding small separators in temporal graphs. 72-92 - David Gajser:

Verifying whether one-tape Turing machines run in linear time. 93-107 - Eleni C. Akrida

, George B. Mertzios
, Paul G. Spirakis, Viktor Zamaraev
:
Temporal vertex cover with a sliding time window. 108-123 - Reino Niskanen

, Igor Potapov
, Julien Reichert
:
On decidability and complexity of low-dimensional robot games. 124-141 - Juraj Hromkovic, Peter Rossmanith

:
What one has to know when attacking P vs. NP. 142-155 - Anurag Anshu, Peter Høyer

, Mehdi Mhalla
, Simon Perdrix:
Contextuality in multipartite pseudo-telepathy graph games. 156-165

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














