default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikos Anastopoulos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c11]Dimitra Paranou, Angelos Pentelas, Dimitris Katsiros, Konstantinos Maidatsis, George Giannopoulos, Evangelos Angelou
, Nikos Anastopoulos, George Papastefanatos:
Forecasting Resource Demand for Dynamic Datacenter Sizing in Telco Infrastructures. IEEE Big Data 2023: 3813-3822
2010 – 2019
- 2014
- [c10]Alexandros-Herodotos Haritatos, Georgios I. Goumas, Nikos Anastopoulos, Konstantinos Nikas, Kornilios Kourtis, Nectarios Koziris:
LCA: a memory link and cache-aware co-scheduling approach for CMPs. PACT 2014: 469-470 - [i1]Abdou Abdel-Rehim, Constantia Alexandrou, Nikos Anastopoulos, G. Koutsou, Ioannis Liabotis, N. Papadopoulou:
PLQCD library for Lattice QCD on multi-core machines. CoRR abs/1405.0700 (2014) - 2012
- [c9]Anastasios Katsigiannis, Nikos Anastopoulos, Konstantinos Nikas, Nectarios Koziris:
An Approach to Parallelize Kruskal's Algorithm Using Helper Threads. IPDPS Workshops 2012: 1601-1610
2000 – 2009
- 2009
- [j2]Georgios I. Goumas, Kornilios Kourtis, Nikos Anastopoulos, Vasileios Karakasis, Nectarios Koziris:
Performance evaluation of the sparse matrix-vector multiplication on modern architectures. J. Supercomput. 50(1): 36-77 (2009) - [c8]Georgios I. Goumas, Nikos Anastopoulos, Nectarios Koziris, Nikolas Ioannou:
Overlapping computation and communication in SMT clusters with commodity interconnects. CLUSTER 2009: 1-10 - [c7]Konstantinos Nikas, Nikos Anastopoulos, Georgios I. Goumas, Nectarios Koziris:
Employing Transactional Memory and Helper Threads to Speedup Dijkstra's Algorithm. ICPP 2009: 388-395 - [c6]Nikos Anastopoulos, Konstantinos Nikas, Georgios I. Goumas, Nectarios Koziris:
Early experiences on accelerating Dijkstra's algorithm using transactional memory. IPDPS 2009: 1-8 - 2008
- [j1]Evangelia Athanasaki, Nikos Anastopoulos, Kornilios Kourtis, Nectarios Koziris:
Exploring the performance limits of simultaneous multithreading for memory intensive applications. J. Supercomput. 44(1): 64-97 (2008) - [c5]Nikos Anastopoulos, Nectarios Koziris:
Facilitating efficient synchronization of asymmetric threads on hyper-threaded processors. IPDPS 2008: 1-8 - [c4]Georgios I. Goumas, Kornilios Kourtis, Nikos Anastopoulos, Vasileios Karakasis, Nectarios Koziris:
Understanding the Performance of Sparse Matrix-Vector Multiplication. PDP 2008: 283-292 - 2006
- [c3]Evangelia Athanasaki, Nikos Anastopoulos, Kornilios Kourtis, Nectarios Koziris:
Exploring the Capacity of a Modern SMT Architecture to Deliver High Scientific Application Performance. HPCC 2006: 180-189 - [c2]Evangelia Athanasaki, Nikos Anastopoulos, Kornilios Kourtis, Nectarios Koziris:
Exploring the Performance Limits of Simultaneous Multithreading for Scientific Codes. ICPP 2006: 45-54 - 2005
- [c1]Evangelia Athanasaki, Kornilios Kourtis, Nikos Anastopoulos, Nectarios Koziris:
Tuning Blocked Array Layouts to Exploit Memory Hierarchy in SMT Architectures. Panhellenic Conference on Informatics 2005: 600-610
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-08-05 21:24 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:
