Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing Systems, Volume 60
Volume 60, Number 1, January 2017
- Alan L. Selman, Arnold L. Rosenberg:
50 Years of TOCS. 1-2 - Bernard Mans
, Luke Mathieson:
Incremental Problems in the Parameterized Complexity Setting. 3-19 - Suguru Tamaki, Osamu Watanabe:
Local Restrictions from the Furst-Saxe-Sipser Paper. 20-32 - Fabrizio Luccio:
Arithmetic for Rooted Trees. 33-52 - Michelle Porter, Adam Day, Rodney G. Downey:
Notes on Computable Analysis. 53-111 - Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis:
On the Chromatic Number of Non-Sparse Random Intersection Graphs. 112-127
Volume 60, Number 2, February 2017
- Joost Engelfriet, Zoltán Fülöp, Andreas Maletti:
Composition Closure of Linear Extended Top-down Tree Transducers. 129-171 - Marcus Schaefer, Daniel Stefankovic:
Fixed Points, Nash Equilibria, and the Existential Theory of the Reals. 172-193 - Niloofar Fazlollahi, David Starobinski:
Distance Vector-based Advance Reservation with Delay Performance Guarantees. 194-221 - Anja Rey, Jörg Rothe, Adrian Marple:
Path-Disruption Games: Bribery and a Probabilistic Model. 222-252 - Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Finding Effectors. 253-279 - Luis Filipe Coelho Antunes, Bruno Bauwens, André Souto, Andreia Teixeira:
Sophistication vs Logical Depth. 280-298 - Siddharth Bhaskar:
A Difference in Complexity Between Recursion and Tail Recursion. 299-313 - Bruno Bauwens:
Conditional Measure and the Violation of Van Lambalgen's Theorem for Martin-Löf Randomness. 314-323 - Louay Bazzi, Nagi Nahas:
Small-Bias is Not Enough to Hit Read-Once CNF. 324-345 - Frank Gurski:
The Behavior of Clique-Width under Graph Operations and Graph Transformations. 346-376
Volume 60, Number 3, April 2017
- Editor's Note. 377
- Dmitry Gavinsky, Pavel Pudlák:
Partition Expanders. 378-395 - Mathieu Hoyrup:
Genericity of Weakly Computable Objects. 396-420 - Benoit Monin:
Higher Randomness and Forcing with Closed Sets. 421-437 - Georg Zetzsche, Dietrich Kuske, Markus Lohrey:
On Boolean Closed Full Trios and Rational Kripke Frames. 438-472 - Francine Blanchet-Sadri, Michelle Bodnar, Benjamin De Winkle:
New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings. 473-497 - Timo Kötzing:
A Solution to Wiehagen's Thesis. 498-520 - Matthew Anderson, Anuj Dawar:
On Symmetric Circuits and Fixed-Point Logics. 521-551 - Adeline Pierrot, Dominique Rossin:
2-Stack Sorting is Polynomial. 552-579
Volume 60, Number 4, May 2017
- Christoph Berkholz, Paul S. Bonsma, Martin Grohe:
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. 581-614 - Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Erik Jan van Leeuwen, Marcin Wrochna:
Polynomial Kernelization for Removing Induced Claws and Diamonds. 615-636 - Spyros Angelopoulos, Diogo Arsénio, Christoph Dürr, Alejandro López-Ortiz:
Multi-processor Search and Scheduling Problems with Setup Cost. 637-670 - Alexander N. Rybalov:
On the Generic Undecidability of the Halting Problem for Normalized Turing Machines. 671-676 - Achour Mostéfaoui, Matoula Petrolia, Michel Raynal, Claude Jard:
Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems. 677-694 - Benedikt Bollig, Dietrich Kuske, Roy Mennicke:
The Complexity of Model Checking Multi-Stack Systems. 695-736 - Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer:
Paradigms for Parameterized Enumeration. 737-758 - Takuya Yoshino, Kouichi Hirata:
Tai Mapping Hierarchy for Rooted Labeled Trees Through Common Subforest. 759-783
a service of 
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 2024-05-10 19:48 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:
