3 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.DS2022★ 1 cited
Exact Learning of Multitrees and Almost-Trees Using Path Queries
Ramtin Afshar, Michael T. Goodrich
Given a directed graph, G=(V,E), a path query, path(u,v), returns whether there is a directed path from u to v in G, for u,v vertices in V. Given only V, exactly learning all the e…
cs.DS2020
Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors and Jumbled-Index Queries in String Reconstruction
Ramtin Afshar, Amihood Amir, Michael T. Goodrich +1
We study the query complexity of exactly reconstructing a string from adaptive queries, such as substring, subsequence, and jumbled-index queries. Such problems have applications,…
cs.DS2020★ 3 cited
Reconstructing Biological and Digital Phylogenetic Trees in Parallel
Ramtin Afshar, Michael T. Goodrich, Pedro Matias +1
In this paper, we study the parallel query complexity of reconstructing biological and digital phylogenetic trees from simple queries involving their nodes. This is motivated from…