default search action
Nikolaos D. Kallimanis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i8]Panagiota Fatourou, Nikolaos D. Kallimanis, Eleni Kanellou, Odysseas Makridakis, Christi Symeonidou:
Efficient Distributed Data Structures for Future Many-core Architectures. CoRR abs/2404.05515 (2024) - [i7]Marios Tyrovolas, Nikolaos D. Kallimanis, Chrysostomos D. Stylios:
Advancing Explainable AI with Causal Analysis in Large-Scale Fuzzy Cognitive Maps. CoRR abs/2405.09190 (2024) - 2023
- [c18]Nikolaos D. Kallimanis
, Eleni Kanellou, Charidimos Kiosterakis, Vasiliki Liagkou:
Exploring Trade-Offs in Partial Snapshot Implementations. SSS 2023: 90-105 - [i6]Manolis Ploumidis, Fabien Chaix, Nikolaos Chrysos, Marios Asiminakis, Vassilis Flouris, Nikolaos D. Kallimanis, Nikolaos Kossifidis, Michael Nikoloudakis, Polydoros Petrakis, Nikolaos Dimou, Michalis Gianioudis, Georgios Ieronymakis, Aggelos Ioannou, George Kalokerinos, Pantelis Xirouchakis, Georgios Ailamakis, Astrinos Damianakis, Michael Ligerakis, Ioannis Makris, Theocharis Vavouris, Manolis Katevenis, Vassilis Papaefstathiou, Manolis Marazakis, Iakovos Mavroidis:
The ExaNeSt Prototype: Evaluation of Efficient HPC Communication Hardware in an ARM-based Multi-FPGA Rack. CoRR abs/2307.09371 (2023) - 2022
- [c17]Panagiota Fatourou, Nikolaos D. Kallimanis
The performance power of software combining in persistence. PPoPP 2022: 337-352 - [i5]Panagiota Fatourou, Nikolaos D. Kallimanis, Thomas Ropars:
An Efficient Wait-free Resizable Hash Table. CoRR abs/2204.09624 (2022) - 2021
- [j4]Nikolaos D. Kallimanis
Synch: A framework for concurrent data-structures and benchmarks. J. Open Source Softw. 6(64): 3143 (2021) - [c16]Panagiota Fatourou, Nikolaos D. Kallimanis
Brief Announcement: Persistent Software Combining. DISC 2021: 56:1-56:4 - [i4]Nikolaos D. Kallimanis:
Synch: A framework for concurrent data-structures and benchmarks. CoRR abs/2103.16182 (2021) - [i3]Panagiota Fatourou, Nikolaos D. Kallimanis, Eleftherios Kosmas:
Persistent Software Combining. CoRR abs/2107.03492 (2021) - 2020
- [j3]Panagiota Fatourou, Nikolaos D. Kallimanis
The RedBlue family of universal constructions. Distributed Comput. 33(6): 485-513 (2020) - [i2]Panagiota Fatourou, Nikolaos D. Kallimanis, Eleni Kanellou:
An Efficient Universal Construction for Large Objects. CoRR abs/2001.03457 (2020) - [i1]Nikolaos D. Kallimanis, Eleni Kanellou, Charidimos Kiosterakis:
Efficient Partial Snapshot Implementations. CoRR abs/2006.06048 (2020)
2010 – 2019
- 2019
- [c15]Panagiota Fatourou, Nikolaos D. Kallimanis
An Efficient Universal Construction for Large Objects. OPODIS 2019: 18:1-18:15 - [c14]Manolis Ploumidis, Nikolaos D. Kallimanis
Software and Hardware Co-design for Low-Power HPC Platforms. ISC Workshops 2019: 88-100 - 2018
- [c13]Milan Radulovic
Mainstream vs. Emerging HPC: Metrics, Trade-Offs and Lessons Learned. SBAC-PAD 2018: 250-257 - [c12]Panagiota Fatourou, Nikolaos D. Kallimanis
An Efficient Wait-free Resizable Hash Table. SPAA 2018: 111-120 - 2017
- [j2]Panagiota Fatourou, Nikolaos D. Kallimanis
Lower and upper bounds for single-scanner snapshot implementations. Distributed Comput. 30(4): 231-260 (2017) - [c11]Panagiota Fatourou, Nikolaos D. Kallimanis
Lock Oscillation: Boosting the Performance of Concurrent Data Structures. OPODIS 2017: 8:1-8:17 - 2016
- [c10]Manolis Katevenis, Nikolaos Chrysos, Manolis Marazakis, Iakovos Mavroidis, Fabien Chaix, Nikolaos D. Kallimanis
The ExaNeSt Project: Interconnects, Storage, and Packaging for Exascale Systems. DSD 2016: 60-67 - [c9]Panagiota Fatourou, Nikolaos D. Kallimanis
Efficient Distributed Data Structures for Future Many-Core Architectures. ICPADS 2016: 835-842 - 2015
- [c8]Nikolaos D. Kallimanis
Wait-Free Concurrent Graph Objects with Dynamic Traversals. OPODIS 2015: 27:1-27:17 - 2014
- [j1]Panagiota Fatourou, Nikolaos D. Kallimanis
Highly-Efficient Wait-Free Synchronization. Theory Comput. Syst. 55(3): 475-520 (2014) - [c7]Panagiota Fatourou, Nikolaos D. Kallimanis:
The Power of Scheduling-Aware Synchronization. DISC 2014: 533-534 - 2013
- [b1]Nikolaos D. Kallimanis:
Efficient synchronization techniques for shared memory systems. University of Ioannina, Greece, 2013 - 2012
- [c6]Spiros N. Agathos, Nikolaos D. Kallimanis, Vassilios V. Dimakopoulos:
Speeding Up OpenMP Tasking. Euro-Par 2012: 650-661 - [c5]Panagiota Fatourou, Nikolaos D. Kallimanis
Revisiting the combining synchronization technique. PPoPP 2012: 257-266 - 2011
- [c4]Panagiota Fatourou, Nikolaos D. Kallimanis
A highly-efficient wait-free universal construction. SPAA 2011: 325-334
2000 – 2009
- 2009
- [c3]Panagiota Fatourou, Nikolaos D. Kallimanis
The RedBlue Adaptive Universal Constructions. DISC 2009: 127-141 - 2007
- [c2]Panagiota Fatourou, Nikolaos D. Kallimanis
Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS. PODC 2007: 33-42 - 2006
- [c1]Panagiota Fatourou, Nikolaos D. Kallimanis
Single-scanner multi-writer snapshot implementations are fast! PODC 2006: 228-237
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-13 21:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: