Eldar Fischer
About
In The Last Decade
Eldar Fischer
50 papers receiving 954 citations
Peers
Comparison fields: 5 of 38
- Computational Theory and Mathematics 920
- Artificial Intelligence 503
- Discrete Mathematics and Combinatorics 314
- Computer Networks and Communications 309
- Geometry and Topology 100
Countries citing papers authored by Eldar Fischer
This map shows the geographic impact of Eldar Fischer'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 Eldar Fischer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Eldar Fischer more than expected).
Fields of papers citing papers by Eldar Fischer
This network shows the impact of papers produced by Eldar Fischer. 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 Eldar Fischer. The network helps show where Eldar Fischer may publish in the future.
Co-authorship network of co-authors of Eldar Fischer
This figure shows the co-authorship network connecting the top 25 collaborators of Eldar Fischer. A scholar is included among the top collaborators of Eldar Fischer 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 Eldar Fischer. Eldar Fischer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 1 | |
| 3 | 0 | |
| 4 | Some properties are not even partially testable | 2 |
| 5 | 8 | |
| 6 | Testing monotonicity of distributions over general partial orders. | 3 |
| 7 | 103 | |
| 8 | 2 | |
| 9 | 10 | |
| 10 | Property and Equivalence Testing on Strings | 1 |
| 11 | 58 | |
| 12 | Tolerant Versus Intolerant Testing for Boolean Properties | 0 |
| 13 | 3 | |
| 14 | 16 | |
| 15 | 21 | |
| 16 | The art of uninformed decisions | 27 |
| 17 | Refining the Graph Density Condition for the Existence of Almost K-factors. | 7 |
| 18 | 1 | |
| 19 | 25 | |
| 20 | 26 |
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.