Portfolio item number 1
Short description of portfolio item number 1
Short description of portfolio item number 1
Short description of portfolio item number 2
Published in HAL-Inria, 2022
This report presents the design and implementation of a caching, indexing and object checkpoint library for AntidoteDB.
Recommended citation: Ayush Pandey, Annette Bieniusa, Marc Shapiro. Persisting the AntidoteDB Cache: Design and Implementation of a Cache for a CRDT Datastore. [Research Report] RR-9470, TU Kaiserslautern; LIP6, Sorbonne Université. 2022.
Download Paper
Published in ComPas, 2023
Recommended citation: Ayush Pandey, Swan Dubois, Marc Shapiro, Julien Sopena, "CALock : Multi-Granularity Locking in Directed Graphs." ComPas, 2023.
Download Paper
Published in EuroSys 2024 Doctoral Workshop, 2024
Recommended citation: Ayush Pandey, Julien Sopena, Swan Dubois, Marc Shapiro, "Diversifying locks for effective synchronization in dynamic graphs." EuroSys 2024 Doctoral Workshop, 2024.
Download Paper
Published in 12th Workshop on Principles and Practice of Consistency for Distributed Data (PaPoC), 2025
Recommended citation: Ayush Pandey, Stefania Dumbrava, Marc Shapiro, Carla Ferreira, M{\'a}rio Pereira, Nuno Pregui{\c c}a, "Towards Local-First Distributed Property Graphs." 12th Workshop on Principles and Practice of Consistency for Distributed Data (PaPoC), 2025.
Download Paper
Published in IPDPS 2025 - 39th IEEE International Parallel and Distributed Processing Symposium, 2025
Recommended citation: Ayush Pandey, Julien Sopena, Marc Shapiro, Swan Dubois, "CALock: Multi-granularity locking in dynamic hierarchies." IPDPS 2025 - 39th IEEE International Parallel and Distributed Processing Symposium, 2025.
Download Paper
Published:
This talk was given as a part of the workshop for RainbowFS.
Published:
This talk was given as a presentation in ComPAS.
Published:
This talk was given as a part of a seminar (https://www.inf.telecom-sudparis.eu/pds/seminars_cpt/983/).
Undergraduate course, Sorbonne University, Computer Science, 2023
Synthetically present commonly used data structures used in computing in order to know the keys allowing one to choose optimally the most suitable structures to solve a given problem.
Undergraduate course, Sorbonne University, Computer Science, 2024
Synthetically present commonly used data structures used in computing in order to know the keys allowing one to choose optimally the most suitable structures to solve a given problem.