scientific article; zbMATH DE number 7651142
From MaRDI portal
Publication:5874464
DOI10.4230/LIPIcs.ESA.2020.3MaRDI QIDQ5874464
Ramtin Afshar, Martha Carolina Osegueda, Pedro Matias, Michael T. Goodrich
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2006.15259
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
hierarchical clusteringparallel algorithmsdata structuresprivacyphylogenetic treestree reconstruction
Related Items (2)
Uses Software
Cites Work
- On the longest path algorithm for reconstructing trees from distance matrices
- Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A?
- Optimal query complexity bounds for finding graphs
- A fast algorithm for constructing trees from distance matrices
- An optimal algorithm to reconstruct trees from additive distance data
- Circuit and decision tree complexity of some number theoretic problems
- The Query Complexity of Finding a Hidden Permutation
- Learning a Bounded-Degree Tree Using Separator Queries
- Universality considerations in VLSI circuits
- Parallelism in Comparison Problems
- Constructing Computer Virus Phylogenies
- Graph Reconstruction and Verification
- Determining the Evolutionary Tree Using Experiments
- From query complexity to computational complexity
- Probability and Computing
- Decision tree complexity and Betti numbers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
