Optimal Decremental Connectivity in Planar Graphs.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 4, p. 1037, doi. 10.1007/s00224-016-9709-x
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2017 AND VI 61 AND IP 4
Results: 20
1
2
On the Information Carried by Programs About the Objects they Compute.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 4, p. 1214, doi. 10.1007/s00224-016-9726-9
- By:
- Publication type:
- Article
3
New Pairwise Spanners.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 4, p. 1011, doi. 10.1007/s00224-016-9736-7
- By:
- Publication type:
- Article
4
Multi- k-ic Depth Three Circuit Lower Bound.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 4, p. 1237, doi. 10.1007/s00224-016-9742-9
- By:
- Publication type:
- Article
5
Characterisation of Limit Measures of Higher-Dimensional Cellular Automata.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 4, p. 1178, doi. 10.1007/s00224-017-9753-1
- By:
- Publication type:
- Article
6
Welfare Maximization with Friends-of-Friends Network Externalities.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 4, p. 948, doi. 10.1007/s00224-017-9759-8
- By:
- Publication type:
- Article
7
Conditional Probabilities and van Lambalgen's Theorem Revisited.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 4, p. 1315, doi. 10.1007/s00224-017-9789-2
- By:
- Publication type:
- Article
8
Dynamic Planar Embeddings of Dynamic Graphs.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 4, p. 1054, doi. 10.1007/s00224-017-9768-7
- By:
- Publication type:
- Article
9
A Generalized Characterization of Algorithmic Probability.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 4, p. 1337, doi. 10.1007/s00224-017-9774-9
- By:
- Publication type:
- Article
10
Towards an Isomorphism Dichotomy for Hereditary Graph Classes.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 4, p. 1084, doi. 10.1007/s00224-017-9775-8
- By:
- Publication type:
- Article
11
Minimum-Cost Flows in Unit-Capacity Networks.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 4, p. 987, doi. 10.1007/s00224-017-9776-7
- By:
- Publication type:
- Article
12
Short lists with short programs from programs of functions and strings.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 4, p. 1440, doi. 10.1007/s00224-017-9773-x
- By:
- Publication type:
- Article
13
Exact Constructive and Computable Dimensions.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 4, p. 1288, doi. 10.1007/s00224-017-9790-9
- By:
- Publication type:
- Article
14
Layerwise Computability and Image Randomness.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 4, p. 1353, doi. 10.1007/s00224-017-9791-8
- By:
- Publication type:
- Article
15
Semiautomatic Structures.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 4, p. 1254, doi. 10.1007/s00224-017-9792-7
- By:
- Publication type:
- Article
16
Editorial: Special Issue on 'Theoretical Aspects of Computer Science' (STACS 2015).
- Published in:
- 2017
- By:
- Publication type:
- Editorial
17
On the Complexity of Automatic Complexity.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 4, p. 1427, doi. 10.1007/s00224-017-9795-4
- By:
- Publication type:
- Article
18
On the Uniform Computational Content of Computability Theory.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 4, p. 1376, doi. 10.1007/s00224-017-9798-1
- By:
- Publication type:
- Article
19
Guest Editorial: Tenth International Conference on Computability, Complexity and Randomness (CCR 2015).
- Published in:
- 2017
- By:
- Publication type:
- Editorial
20
The Advice Complexity of a Class of Hard Online Problems.
- Published in:
- Theory of Computing Systems, 2017, v. 61, n. 4, p. 1128, doi. 10.1007/s00224-016-9688-y
- By:
- Publication type:
- Article