Affichage des résultats 1 à 12 sur 229 au total
ParSys : 1 à 12 sur 229 au total
-
Communication dans un congrès
Brice Chichereau, Stéphane Vialle, Miwako Tsuji, Patrick Carribault, Mitsuhisa Sato. HPCQCMark: a new modular HPC-QC benchmarking framework. 2025 IEEE International Conference on Quantum Computing and Engineering (QCE), Aug 2025, Albuquerque, United States. pp.8-14, ⟨10.1109/QCE65121.2025.10285⟩. ⟨hal-05426530⟩
-
-
Communication dans un congrès
Pierre Fraigniaud, Minh Hang Nguyen, Ami Paz. A Simple Lower Bound for Set Agreement in Dynamic Networks. 2025 Symposium on Simplicity in Algorithms (SOSA), Jan 2025, New Orleans, United States. pp.253-262, ⟨10.1137/1.9781611978315.20⟩. ⟨hal-05403931⟩
-
Traduction
Pierre Jehel, Stéphane Vialle. Collaborative Platform for Railway Projects - Business Needs Analysis and Their Formalization as Functional Requirements. 2023. ⟨hal-05371720⟩
-
Thèse
Sylvain Joube. Portable Performance for High Throughput Computing. Other [cs.OH]. Université Paris-Saclay, 2025. English. ⟨NNT : 2025UPASG063⟩. ⟨tel-05418502⟩
-
Pré-publication, Document de travail
Uri Meir, Ami Paz. Smoothed Analysis of Dynamic Graph Algorithms. 2025. ⟨hal-05405516⟩
-
Communication dans un congrès
Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum. On the Existence of Extension-Based Proofs of Impossibility for Set-Agreement. SIROCCO 2025 - Structural Information and Communication Complexity, Jun 2025, Delphi, Greece. pp.56-73, ⟨10.1007/978-3-031-91736-3_4⟩. ⟨hal-05403686⟩
-
Communication dans un congrès
Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum. Solvability Characterization for General Three-Process Tasks. PODC '25: ACM Symposium on Principles of Distributed Computing, Jun 2025, Huatulco, Mexico. pp.488-498, ⟨10.1145/3732772.3733548⟩. ⟨hal-05403672⟩
-
Pré-publication, Document de travail
Joffroy Beauquier, Aijia Guan. Pool Games. 2025. ⟨hal-05372921⟩
-
Pré-publication, Document de travail
Avinandan Das, Pierre Fraigniaud, Ami Paz, Adi Rosén. Semi-Streaming Algorithms for Graph Property Certification. 2025. ⟨hal-05381544⟩
-
Algorithmes, apprentissage et calcul
ParSys
-
Algorithmes, apprentissage et calcul
ParSys