default search action
18th FCT 2011: Oslo, Norway
- Olaf Owe
, Martin Steffen, Jan Arne Telle:
Fundamentals of Computation Theory - 18th International Symposium, FCT 2011, Oslo, Norway, August 22-25, 2011. Proceedings. Lecture Notes in Computer Science 6914, Springer 2011, ISBN 978-3-642-22952-7 - José Meseguer, Grigore Rosu:
The Rewriting Logic Semantics Project: A Progress Report. 1-37 - Yuri Gurevich:
Impugning Randomness, Convincingly. 38 - Daniel Lokshtanov:
Kernelization: An Overview. 39-40 - Klaus Meer:
Almost Transparent Short Proofs for NPℝ. 41-52 - Robert Bredereck
The Effect of Homogeneity on the Complexity of k-Anonymity. 53-64 - Marius Zimand:
On the Optimal Compression of Sets in PSPACE. 65-77 - Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai:
Computational Randomness from Generalized Hardcore Sets. 78-89 - Bart M. P. Jansen, Stefan Kratsch:
Data Reduction for Graph Coloring Problems. 90-101 - Mila Dalla Preda, Cinzia Di Giusto:
Hunting Distributed Malware with the κ-Calculus. 102-113 - Martin Ebbesen, Paul Fischer, Carsten Witt
Edge-Matching Problems with Rotations. 114-125 - Jacques M. Bahi, Jean-François Couchot, Christophe Guyeux
On the Link between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems. 126-137 - Gregory Z. Gutin, Mark Jones, Anders Yeo:
A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application. 138-147 - Krishnendu Chatterjee, Laurent Doyen, Rohit Singh:
On Memoryless Quantitative Objectives. 148-159 - Elliot Fairweather, Maribel Fernández, Murdoch James Gabbay
Principal Types for Nominal Theories. 160-172 - A. N. Trahtman:
Modifying the Upper Bound on the Length of Minimal Synchronizing Word. 173-180 - Giorgio Ausiello, Nicolas Boria, Aristotelis Giannakos, Giorgio Lucarelli, Vangelis Th. Paschos:
Online Maximum k-Coverage. 181-192 - Petr A. Golovach
Coloring Graphs without Short Cycles and Long Induced Paths. 193-204 - Guillaume Malod:
Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes. 205-216 - Paul Hunter
LIFO-Search on Digraphs: A Searching Game for Cycle-Rank. 217-228 - Stéphane Bessy, Anthony Perez:
Polynomial Kernels for Proper Interval Completion and Related Problems. 229-239 - Pinar Heggernes
Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. 240-251 - Ludwig Staiger:
Constructive Dimension and Hausdorff Dimension: The Case of Exact Dimension. 252-263 - Annabell Berger, Matthias Müller-Hannemann
Dag Realizations of Directed Degree Sequences. 264-275 - Sergey Goncharov
A Coinductive Calculus for Asynchronous Side-Effecting Processes. 276-287 - Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro:
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs. 288-297 - Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary
Enumeration of Minimal Dominating Sets and Variants. 298-309 - Nathaniel Charlton, Bernhard Reus
Specification Patterns and Proofs for Recursion through the Store. 310-321 - Fabien Givors, Grégory Lafitte:
Sub-computabilities. 322-335 - Stephen A. Fenner:
Functions That Preserve p-Randomness. 336-347 - Jos C. M. Baeten, Bas Luttik, Paul van Tilburg:
Reactive Turing Machines. 348-359 - Florian Corzilius, Erika Ábrahám
Virtual Substitution for SMT-Solving. 360-371
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-12-29 20:22 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: