Daniel Cederman

532 total citations
17 papers, 232 citations indexed

About

Daniel Cederman is a scholar working on Computer Networks and Communications, Hardware and Architecture and Information Systems. According to data from OpenAlex, Daniel Cederman has authored 17 papers receiving a total of 232 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computer Networks and Communications, 13 papers in Hardware and Architecture and 3 papers in Information Systems. Recurrent topics in Daniel Cederman's work include Parallel Computing and Optimization Techniques (13 papers), Distributed systems and fault tolerance (10 papers) and Distributed and Parallel Computing Systems (5 papers). Daniel Cederman is often cited by papers focused on Parallel Computing and Optimization Techniques (13 papers), Distributed systems and fault tolerance (10 papers) and Distributed and Parallel Computing Systems (5 papers). Daniel Cederman collaborates with scholars based in Sweden and Austria. Daniel Cederman's co-authors include Philippas Tsigas, Jesper Larsson Träff, Marina Papatriantafilou, Vincenzo Gulisano, Nhan Nguyen, Yi Zhang, Gedare Bloom, Rafia Inam and Daniel Hellström and has published in prestigious journals such as IEEE Transactions on Computers, Bone Marrow Transplantation and ACM SIGPLAN Notices.

In The Last Decade

Daniel Cederman

16 papers receiving 216 citations

Peers

Daniel Cederman
Sriram Lakshminarasimhan United States
Nodari Sitchinava United States
Minglong Shao United States
Bernd Burgstaller South Korea
Rakesh Krishnaiyer United States
Gaël Thomas France
Cedric Nugteren Netherlands
V. Krishna Nandivada India
Benoit Steiner United States
Akshay Venkatesh United States
Sriram Lakshminarasimhan United States
Daniel Cederman
Citations per year, relative to Daniel Cederman Daniel Cederman (= 1×) peers Sriram Lakshminarasimhan

Countries citing papers authored by Daniel Cederman

Since Specialization
Citations

This map shows the geographic impact of Daniel Cederman's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Daniel Cederman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel Cederman more than expected).

Fields of papers citing papers by Daniel Cederman

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Daniel Cederman. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Daniel Cederman. The network helps show where Daniel Cederman may publish in the future.

Co-authorship network of co-authors of Daniel Cederman

This figure shows the co-authorship network connecting the top 25 collaborators of Daniel Cederman. A scholar is included among the top collaborators of Daniel Cederman based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Daniel Cederman. Daniel Cederman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

17 of 17 papers shown
1.
Cederman, Daniel, et al.. (2015). RTEMS SMP and MTAPI for Efficient Multi-Core Space Applications on LEON3/LEON4 Processors. 732. 24. 1 indexed citations
2.
Träff, Jesper Larsson, et al.. (2014). Data structures for task-based priority scheduling. ACM SIGPLAN Notices. 49(8). 379–380. 6 indexed citations
3.
Träff, Jesper Larsson, et al.. (2014). Data structures for task-based priority scheduling. Chalmers Research (Chalmers University of Technology). 379–380. 16 indexed citations
4.
Cederman, Daniel, et al.. (2014). Concurrent data structures for efficient streaming aggregation. Chalmers Research (Chalmers University of Technology). 76–78. 15 indexed citations
5.
Cederman, Daniel, et al.. (2013). A Study of the Behavior of Synchronization Methods in Commonly Used Languages and Systems. Chalmers Research (Chalmers University of Technology). cs ni 9809099. 1309–1320. 12 indexed citations
6.
Cederman, Daniel, et al.. (2013). Work-stealing with configurable scheduling strategies. ACM SIGPLAN Notices. 48(8). 315–316. 1 indexed citations
7.
Cederman, Daniel, et al.. (2013). Work-stealing with configurable scheduling strategies. Chalmers Research (Chalmers University of Technology). 315–316. 7 indexed citations
8.
Cederman, Daniel & Philippas Tsigas. (2012). Adapting Lock-Free Concurrent Data Objects to Support a Generic Move Operation. Chalmers Publication Library (Chalmers University of Technology). 1 indexed citations
9.
Cederman, Daniel & Philippas Tsigas. (2012). Supporting Lock-Free Composition of Concurrent Data Objects: Moving Data between Containers. IEEE Transactions on Computers. 62(9). 1866–1878. 3 indexed citations
10.
Cederman, Daniel. (2011). Concurrent Algorithms and Data Structures for Many-Core Processors. Chalmers Research (Chalmers University of Technology). 1 indexed citations
11.
Inam, Rafia, Daniel Cederman, & Philippas Tsigas. (2010). A* Algorithm for Graphics Processors. Bone Marrow Transplantation. 58(11). 1197–1202. 1 indexed citations
12.
Cederman, Daniel, et al.. (2010). Towards a Software Transactional Memory for Graphics Processors. Eurographics. 121–129. 26 indexed citations
13.
Cederman, Daniel & Philippas Tsigas. (2010). Supporting lock-free composition of concurrent data objects. Chalmers Research (Chalmers University of Technology). 339–340. 4 indexed citations
14.
Cederman, Daniel & Philippas Tsigas. (2009). GPU-Quicksort. ACM Journal of Experimental Algorithmics. 14. 67 indexed citations
15.
Cederman, Daniel & Philippas Tsigas. (2008). On dynamic load balancing on graphics processors. 2008. 57–64. 53 indexed citations
16.
Cederman, Daniel & Philippas Tsigas. (2008). On sorting and load balancing on GPUs. ACM SIGARCH Computer Architecture News. 36(5). 11–18. 16 indexed citations
17.
Tsigas, Philippas, et al.. (2006). Wait-Free Queue Algorithms for the Real-time Java Specification. 373–383. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Sriram Lakshminarasimhan Breakdown of academic impact, for papers by Nodari Sitchinava Breakdown of academic impact, for papers by Minglong Shao Breakdown of academic impact, for papers by Bernd Burgstaller Breakdown of academic impact, for papers by Rakesh Krishnaiyer Breakdown of academic impact, for papers by Gaël Thomas Breakdown of academic impact, for papers by Cedric Nugteren Breakdown of academic impact, for papers by V. Krishna Nandivada Breakdown of academic impact, for papers by Benoit Steiner Breakdown of academic impact, for papers by Akshay Venkatesh
Rankless by CCL
2026