default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 256
Volume 256, October 2017
- Martin Dietzfelbinger:
Special issue for the 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014, Budapest, Hungary. 1 - Eric Allender
, Bireswar Das:
Zero knowledge and circuit minimization. 2-8 - Thomas Zeume:
The dynamic descriptive complexity of k-clique. 9-22 - Namit Chaturvedi, Marcus Gelderie:
Classifying recognizable infinitary trace languages using word automata. 23-34 - Suryajith Chillara, Partha Mukhopadhyay:
On the limits of depth reduction at depth 3 over small finite fields. 35-44 - Cewei Cui, Zhe Dang, Thomas R. Fischer, Oscar H. Ibarra:
Information rate of some classes of non-regular languages: An automata-theoretic approach. 45-61 - Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk:
Hitting forbidden subgraphs in graphs of bounded treewidth. 62-82 - Josep Díaz, George B. Mertzios:
Minimum bisection is NP-hard on unit disk graphs. 83-92 - Christian Glaßer, Maximilian Witek:
Autoreducibility and mitoticity of logspace-complete sets for NP and other classes. 93-107 - Tomasz Gogacz, Henryk Michalewski, Matteo Mio, Michal Skrzypczak:
Measure properties of regular sets of trees. 108-130 - Petr A. Golovach:
Editing to a connected graph of given degrees. 131-147
- Rahul Jain, Sanjay Jain, Frank Stephan:
Special issue on the conference Theory and Applications of Models of Computation. 148 - Lance Fortnow, Rahul Santhanam:
Robust simulations and significant separations. 149-159 - Xujin Chen, Xiaodong Hu, Changjun Wang:
Finding connected k-subgraphs with high density. 160-173 - Zhaohui Wei, Shengyu Zhang:
Quantum game players can have advantage without discord. 174-184 - Nadine Losert:
Where join preservation fails in the bounded Turing degrees of c.e. sets. 185-195 - Mingyu Xiao, Huan Tan:
Exact algorithms for Maximum Induced Matching. 196-211 - Nimrod Talmon, Sepp Hartung:
The complexity of degree anonymization by graph contractions. 212-225 - Mitsunori Ogihara, Kei Uchizawa:
Computational complexity studies of synchronous Boolean finite dynamical systems on directed graphs. 226-236 - Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
Deletion operations on deterministic families of automata. 237-252
- Ornela Dardha, Elena Giachino, Davide Sangiorgi:
Session types revisited. 253-286 - Bosheng Song, Mario J. Pérez-Jiménez, Linqiang Pan:
An efficient time-free solution to QSAT problem using P systems with proteins on membranes. 287-299 - Mario Bravetti, Marco Carbone, Gianluigi Zavattaro:
Undecidability of asynchronous session subtyping. 300-320 - Aistis Atminas, Vadim V. Lozin, Mikhail Moshkov:
WQO is decidable for factorial languages. 321-333 - Jesper Jansson, Zhaoxian Li, Wing-Kin Sung:
On finding the Adams consensus tree. 334-347 - Ziyuan Gao, Zeinab Mazadi, Regan Meloche, Hans Ulrich Simon, Sandra Zilles:
Distinguishing pattern languages with membership examples. 348-371 - Martin Anthony, Joel Ratsaby:
Classification based on prototypes with spheres of influence. 372-380
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-10-22 02:19 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:
