Chris Freiling

19 papers receiving 270 citations

Peers

Chris Freiling
Comparison fields: 5 of 39
  • Theoretical Computer Science 11
  • Computer Networks and Communications 173
  • Discrete Mathematics and Combinatorics 17
  • Geometry and Topology 43
  • Computational Theory and Mathematics 77
Replace Madhu Raka with:
Madhu Raka India
Charles Vanden Eynden United States
Stanley S. Wainer United Kingdom
Andreas Weiermann Belgium
Duane W. DeTemple United States
Patrick J. Morandi United States
Th. Skolem Norway
Mark Ramras United States
David Hobby United States
Frazer Jarvis United Kingdom
Chris Freiling relative to Madhu Raka India Madhu Raka's profile →
Citations per field
00.5×2×2.9×
Madhu Raka · 1×
Citations per year

Countries citing papers authored by Chris Freiling

Since Specialization
Citations

This map shows the geographic impact of Chris Freiling'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 Chris Freiling with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Chris Freiling more than expected).

Fields of papers citing papers by Chris Freiling

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Chris Freiling. 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 Chris Freiling. The network helps show where Chris Freiling may publish in the future.

Co-authors

The 13 scholars most cited alongside Chris Freiling, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Chris Freiling Line = papers co-authored together Chris Freiling links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 22 papers — load more, or switch the sort, to bring in the rest.

#Work
1 2007155
2 198647
3 200834
4 199315
5
Achievable Rate Regions for Network Coding
20128
6 20127
7 19986
8 20084
9 20123
10 19843
11 19922
12 19822
13 19882
14 19902
15 19842
16 20002
17 20021
18 19901
19 19951
20 20001

About Chris Freiling

Chris Freiling is a scholar working on Geometry and Topology, Computational Theory and Mathematics, Mathematical Physics, Applied Mathematics and Computer Networks and Communications, having authored 22 papers that have together received 298 indexed citations. Recurring topics across this work include Advanced Topology and Set Theory (6 papers), Cooperative Communication and Network Coding (5 papers), Cellular Automata and Applications (4 papers), Mathematical and Theoretical Analysis (4 papers), Wireless Communication Security Techniques (3 papers), Computability, Logic, AI Algorithms (3 papers), Functional Equations Stability Results (3 papers) and Coding theory and cryptography (2 papers). The work is most often cited by research in Theoretical Computer Science (11 citations), Computer Networks and Communications (173 citations), Discrete Mathematics and Combinatorics (17 citations), Geometry and Topology (43 citations) and Computational Theory and Mathematics (77 citations). Chris Freiling has collaborated with scholars based in United States and Germany. Frequent co-authors include Randall L. Dougherty, K. Zeger, J. Marshall Ash, Michael J. Evans, Richard J. O’Malley, Udayan B. Darji, Russell L. Wheeler, Thomas H. Payne, Robert P. Hunter and Jason Teutsch. Their work appears in journals such as Journal of Symbolic Logic, Transactions of the American Mathematical Society, Journal of Number Theory, IEEE Transactions on Information Theory and Bulletin of Symbolic Logic.

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