Ramtin Afshar

According to our database, Ramtin Afshar authored at least 8 papers between 2020 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Noisy Sorting Without Searching: Data Oblivious Sorting with Comparison Errors.

Ramtin Afshar, Michael B. Dillencourt, Michael T. Goodrich, Evrim Ozel

Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

2022

Efficient Exact Learning Algorithms for Road Networks and Other Graphs with Bounded Clustering Degrees.

Ramtin Afshar, Michael T. Goodrich, Evrim Ozel

Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

Mapping Networks via Parallel kth-Hop Traceroute Queries.

Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Exact Learning of Multitrees and Almost-Trees Using Path Queries.

Ramtin Afshar, Michael T. Goodrich

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021

Parallel Network Mapping Algorithms.

Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

2020

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, Pedro Matias

Proceedings of the String Processing and Information Retrieval, 2020

Reconstructing Binary Trees in Parallel.

Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Reconstructing Biological and Digital Phylogenetic Trees in Parallel.

Ramtin Afshar, Michael T. Goodrich, Pedro Matias, Martha C. Osegueda

Proceedings of the 28th Annual European Symposium on Algorithms, 2020