zweidimensionales bewegtes Bild
First-order tree-to-tree functions: Q/A Session C - Paper C5.E
- Location
-
Hannover TIB
- Extent
-
26MB, 00:18:57:26 (unknown)
- Language
-
Englisch
- Notes
-
Audiovisuelles Material
- Bibliographic citation
-
Thirty-Fifth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2020 ; (Jan. 2020)
- Event
-
Veröffentlichung
- (who)
-
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
- (when)
-
2020-01-01
- Contributor
-
Doumane, Amina
Bojańczyk, Mikołaj
- DOI
-
10.5446/49292
- Last update
-
04.12.2024, 8:09 AM CET
Data provider
This object is provided by:
Technische Informationsbibliothek (TIB). If you have any questions about the object, please contact the data provider.
Technische Informationsbibliothek (TIB). If you have any questions about the object, please contact the data provider.
Object type
- zweidimensionales bewegtes Bild
Associated
- Doumane, Amina
- Bojańczyk, Mikołaj
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Time of origin
- 2020-01-01
Other Objects (12)
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
On Packing Low-Diameter Spanning Trees: Q/A Session C - Paper C1.B
Tree Polymatrix Games are PPAD-hard: Q/A Session D - Paper D1.A
Robust Algorithms for TSP and Steiner Tree: Q/A Session B - Paper B2.C
Asynchronous Majority Dynamics in Preferential Attachment Trees: Q/A Session E - Paper E1.A
Near-optimal Algorithm for Constructing Greedy Consensus Tree: Q/A Session C - Paper C3.D
First-Order Definability of Trees and Sparse Random Graphs
Computing measures of weak-MSO definable sets of trees: Q/A Session F - Paper F3.C
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata: Q/A Session F - Paper F3.A
Learning from forest trees: improving urban tree biomass functions
Expressivity and decidability of first-order languages over feature trees
Expressivity and decidability of first-order languages over feature trees
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
On Packing Low-Diameter Spanning Trees: Q/A Session C - Paper C1.B
Tree Polymatrix Games are PPAD-hard: Q/A Session D - Paper D1.A
Robust Algorithms for TSP and Steiner Tree: Q/A Session B - Paper B2.C
Asynchronous Majority Dynamics in Preferential Attachment Trees: Q/A Session E - Paper E1.A
Near-optimal Algorithm for Constructing Greedy Consensus Tree: Q/A Session C - Paper C3.D
First-Order Definability of Trees and Sparse Random Graphs
Computing measures of weak-MSO definable sets of trees: Q/A Session F - Paper F3.C
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata: Q/A Session F - Paper F3.A
Learning from forest trees: improving urban tree biomass functions
Expressivity and decidability of first-order languages over feature trees
Expressivity and decidability of first-order languages over feature trees
Counting Bounded Tree Depth Homomorphisms: Q/A Session D - Paper D5.A
On Packing Low-Diameter Spanning Trees: Q/A Session C - Paper C1.B
Tree Polymatrix Games are PPAD-hard: Q/A Session D - Paper D1.A
Robust Algorithms for TSP and Steiner Tree: Q/A Session B - Paper B2.C
Asynchronous Majority Dynamics in Preferential Attachment Trees: Q/A Session E - Paper E1.A
Near-optimal Algorithm for Constructing Greedy Consensus Tree: Q/A Session C - Paper C3.D
First-Order Definability of Trees and Sparse Random Graphs
Computing measures of weak-MSO definable sets of trees: Q/A Session F - Paper F3.C
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata: Q/A Session F - Paper F3.A
Learning from forest trees: improving urban tree biomass functions
Expressivity and decidability of first-order languages over feature trees