Detlef Sieling
About
In The Last Decade
Detlef Sieling
17 papers receiving 260 citations
Peers
Comparison fields: 5 of 32
- Computational Theory and Mathematics 226
- Artificial Intelligence 139
- Software 75
- Hardware and Architecture 69
- Electrical and Electronic Engineering 58
Countries citing papers authored by Detlef Sieling
This map shows the geographic impact of Detlef Sieling'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 Detlef Sieling with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Detlef Sieling more than expected).
Fields of papers citing papers by Detlef Sieling
This network shows the impact of papers produced by Detlef Sieling. 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 Detlef Sieling. The network helps show where Detlef Sieling may publish in the future.
Co-authorship network of co-authors of Detlef Sieling
This figure shows the co-authorship network connecting the top 25 collaborators of Detlef Sieling. A scholar is included among the top collaborators of Detlef Sieling 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 Detlef Sieling. Detlef Sieling is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 21 | |
| 2 | 1 | |
| 3 | 1 | |
| 4 | 17 | |
| 5 | 1 | |
| 6 | 73 | |
| 7 | 2 | |
| 8 | Lower Bounds for Linear Transformed OBDDs and FBDDs | 1 |
| 9 | Lower Bounds for Linear Transformed OBDDs and FBDDs (Extende Abstract) | 0 |
| 10 | On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization | 0 |
| 11 | 13 | |
| 12 | 2 | |
| 13 | On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization (Extended Abstract) | 6 |
| 14 | 3 | |
| 15 | 1 | |
| 16 | 63 | |
| 17 | 4 | |
| 18 | On the Power of Different Types of Restricted Branching Programs | 5 |
| 19 | 44 | |
| 20 | 35 |
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.