Search

Your search keyword '"Owe, Olaf"' showing total 31 results

Search Constraints

Start Over You searched for: Author "Owe, Olaf" Remove constraint Author: "Owe, Olaf" Journal fundamentals of computation theory : 18th international symposium, fct 2011, oslo, norway, august 22-25, 2011. proceedings Remove constraint Journal: fundamentals of computation theory : 18th international symposium, fct 2011, oslo, norway, august 22-25, 2011. proceedings
31 results on '"Owe, Olaf"'

Search Results

1. The Rewriting Logic Semantics Project: A Progress Report

2. Functions That Preserve p-Randomness

3. Hunting Distributed Malware with the κ-Calculus

4. The Effect of Homogeneity on the Complexity of k-Anonymity

5. Computational Randomness from Generalized Hardcore Sets

6. On the Optimal Compression of Sets in PSPACE

7. Data Reduction for Graph Coloring Problems

8. Almost Transparent Short Proofs for NPℝ

9. Virtual Substitution for SMT-Solving

10. A Coinductive Calculus for Asynchronous Side-Effecting Processes

11. Sub-computabilities

12. Specification Patterns and Proofs for Recursion through the Store

13. Reactive Turing Machines

14. Parameterized Complexity of Vertex Deletion into Perfect Graph Classes

15. Dag Realizations of Directed Degree Sequences

16. Enumeration of Minimal Dominating Sets and Variants

17. Constructive Dimension and Hausdorff Dimension: The Case of Exact Dimension

18. Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs

19. Polynomial Kernels for Proper Interval Completion and Related Problems

20. On the Link between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems

21. Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes

22. LIFO-Search on Digraphs: A Searching Game for Cycle-Rank

23. Coloring Graphs without Short Cycles and Long Induced Paths

24. On Memoryless Quantitative Objectives

25. A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application

26. Online Maximum k-Coverage

27. Principal Types for Nominal Theories

28. Modifying the Upper Bound on the Length of Minimal Synchronizing Word

29. Edge-Matching Problems with Rotations

30. Kernelization: An Overview

31. Impugning Randomness, Convincingly

Catalog

Books, media, physical & digital resources