Σύνδεσμοι / Πηγές
Δημοσιεύσεις
- A. Singh, N. Metaxakis, P. Fatourou "Sharded Elimination and Combining for Highly-Efficient Concurrent Stacks"
- E. Wrench, A. Singh, Y. Roh, P. Fatourou, S. Jayanti, E. Ruppert, Y. Wei "Concurrent Balanced Augmented Trees"
- H. Attiya, P. Fatourou, E. Kosmas, Y. Wei "Recoverable Lock-Free Locks" (Best Paper Award))
- P. Fatourou, E. Ruppert, I. Xiradakis "Brief Announcement: Concurrent Double-Ended Priority Queues"
- O. Grimes, A. Hassan, P. Fatourou, R. Palmieri, "PIPQ: A Strict Insert-Optimized Concurrent Priority Queue"
- S. Koutoupis, M. A. Zervou, M. De Vos, P. Tsakalides, G. Tsagkatakis, "The More, the Merrier: Contrastive Fusion for Higher-Order Multimodal Alignment"
- A. Katsarakis, E. Giortamis, V. Gavrielatos, P. Bhatotia, A. Dragojevic, B. Grot, V. Nagarajan, P. Fatourou, "The LAW theorem: Local Reads and Linearizable Asynchronous Replication"
- P. Fatourou, E. Ruppert. "Lock-Free Augmented Trees (Abstract)"
- J. Wei, Z. Liao, R. Han, Q. Xu, C. Yang, T. Palpanas, "TaCo: Data-adaptive and Query-aware Subspace Collision for High-dimensional Approximate Nearest Neighbor Search"
- Y. Qi, X. Chen, H. Jiang, Q. Wang, B. Peng, T. Palpanas, "ParisKV: Fast and Drift-Robust KV-Cache Retrieval for Long-Context LLMs"
- J. Wei, X. Lee, B. Peng, Q. Xu, C. Yang, T. Palpanas, "PDET-LSH: Scalable In-Memory Indexing for High-Dimensional Approximate Nearest Neighbor Search with Quality Guarantees"
- J. E. d'Hondt, T. H. Kortekaas, O. Papapetrou, T. Palpanas, "MS-Index: Fast Top-k Subsequence Search for Multivariate Time Series under Euclidean Distance"
- M. Chatzakis, Y. Papakonstantinou, T. Palpanas. "DARTH: Declarative Recall Through Early Termination for Approximate Nearest Neighbor Search"
- M. Ceccarello, A. Levchenko, I. Ileana, T. Palpanas "Evaluating and Generating Query Workloads for High Dimensional Vector Similarity Search"
Αφίσες
- SPTDC'26 - ATROPOS: Benchmarking Concurrent Persistent Algorithms under Failures
- SPTDC'26 - Concurrent Double Ended-Priority Queues
- SPTDC'26 - PFRESH: A persistent Lock Free Data Series Index
- SPTDC'26 - The More, the Merrier: Contrastive Fusion for Higher-Order Multimodal Alignment
- VLDB'25 - The LAW Theorem: Local Reads and Linearizable Asynchronous Replication
- Computer Science Graduates Reunion (Classes of '85, '95, '05'), University of Crete
- GEC'25 - Concurrent Double-Ended Priority Queues
- GEC'25 - Concurrent Binary Search Trees Supporting Split and Join
- 40 Years Computer Science Department, University of Crete
Παρουσιάσεις
- Concurrent Double Ended Proirity Queues
- Πλοήγηση στον κόσμο της Πληροφορίας
- Shared Elimination and Combining for Highly Efficient Concurrent Stacks
- Efficient Hardware Primitives for Immediate Memory Reclamation in Optimistic Data Structures
- Parallel Data Series Indexing and Similarity Search on Modern Hardware
- Presentation at Researcher's Night
- Presentation at Researcher's Night ChatLab
- The LAW Theorem
- Course at DC Mexico Summer School
Αναζήτηση Ομοιότητας σε Μεγάλες Συλλογές Σειρών Δεδομένων συνυπολογίζοντας το Yλικό
HARSH: Hardware-Aware extReme-scale Similarity search
- Κωδικός Έργου: ΥΠ3ΤΑ-0560901
- Ημερομηνία Έναρξης Έργου: 15 Απριλίου 2025
- Ημερομηνία Λήξης Έργου: 30 Ιουνίου 2026
- Διαχειριστική Αρχή: Επιτελική Δομή ΕΣΠΑ Τομέα Παιδείας του Υπουργείου Παιδείας και Θρησκευμάτων, ΕΛΛΑΔΑ 2.0, ΕΘΝΙΚΟ ΣΧΕΔΙΟ ΑΝΑΚΑΜΨΗΣ και ΑΝΘΕΚΤΙΚΟΤΗΤΑΣ
- Συντονιστής Σύμπραξης: Πανεπιστήμιο Κρήτης (ΠΚ), Τμήμα Επιστήμης Υπολογιστών
