News
School on the Practice and Theory of Distributed Computing 2026
Excited to announce SPTDC 2026! Organized by HAR.S.H., this year’s school brings together experts from academia and industry to explore the future of Distributed Computing.
Presentation of HAR.S.H to High Schools Visits
Presenting our research work to high school students during their visits to the Department of Computer Science, at the Uniersity of Crete.
Paper Presented at PPoPP 2026
"Concurrent Balanced Augmented Trees"
Paper Presented at PPoPP 2026
Sharded Elimination and Combining for Highly-Efficient Concurrent Stacks
Similarity Search Slides Presented at Researcher Night's Events
HAR.S.H. presentations given to attending students in primary and secondary education at Researcher's Night and at Researcher Night's Chatlab
Participation at Researcher Night Chatlab Event
HAR.S.H. team will participate in Researcher Night's Chatlab to talk about our work to young students.
Participation at Researcher's Night
HAR.S.H. team will participate in Researcher's Night to talk about similarity search and retrieval and zero-shot classification.
Poster Presented at CSD Reunion
Computer Science Department - University of Crete, Classes of '85/'95/'05 reunion.
Poster Presented at VLDB 2025
"The LAW theorem: Local Reads and Linearizable Asynchronous Replication"
Paper Presented at VLDB 2025
"The LAW theorem: Local Reads and Linearizable Asynchronous Replication"
Tutorial at ACM Conference on Knowledge Discovery & Data Mining 2025
"Advances in Time-Series Anomaly Detection: Algorithms, Benchmarks, and Evaluation Measures"
Tutorial at International Joint Conference on Artificial Intelligence 2025
"Advances in Time-Series Anomaly Detection: Algorithms, Benchmarks, and Evaluation Measures"
Paper Presented at Highlights of Parallel Computing 2025
"Lock-Free Augmented Trees (Abstract)"
Poster Presented at ACM-W Celebration of Women in Computing: 7th Summit on Gender Equality in Computing
"Concurrent Double-Ended Priority Queues"
Poster Presented at ACM-W Celebration of Women in Computing: 7th Summit on Gender Equality in Computing
"Concurrent Binary Search Trees Supporting Split and Join"
Journal Accepted at Distributed Computing Volume 38
"When is Recoverable Consensus harder than Consensus?"
University of Crete Press Release at the Beginning of HARSH
HARSH Poster – February 2025
HARSH FactSheet
Similarity Search in Large-Scale Time Series Collections with Hardware Awareness
HARSH: Hardware-Aware extReme-scale Similarity search
- Project Code: ΥΠ3ΤΑ-0560901
- Project Start Date: April 15, 2025
- Project End Date: June 30, 2026
- Funding Body: Ministry of Education, Religious Affairs and Sports, Greece 2.0, National Recovery and Resilience Plan
- Host Institution: University of Crete (UoC), Department of Computer Science
