Categorical Views on Computations on Trees (Extended Abstract)

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-73420-8_54
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths Extended Abstract

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

On Privacy Homomorphisms (Extended Abstract)

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

On the Expressivity of Inconsistency Measures (Extended Abstract)

2017English

On Minimum Representations of Matched Formulas (Extended Abstract)

2017English

On the Abstract Properties of Markov Graphs for Maps on Trees

Математички билтен/BULLETIN MATHÉMATIQUE DE LA SOCIÉTÉ DES MATHÉMATICIENS DE LA RÉPUBLIQUE MACÉDOINE
2017English

Drawing Graphs by Example Efficiently: Trees and Planar Acyclic Digraphs (Extended Abstract)

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

Expanders Are Universal for the Class of All Spanning Trees (Extended Abstract)

2012English

Games on Graphs and Sequentially Realizable Functionals. Extended Abstract

English

A Key Exchange System Based on Real Quadratic Fields Extended Abstract

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy