Chris Freiling

19 papers receiving 240 citations

Peers

Chris Freiling
Comparison fields: 5 of 38
  • Theoretical Computer Science 8
  • Computer Networks and Communications 162
  • Geometry and Topology 42
  • Discrete Mathematics and Combinatorics 15
  • Computational Theory and Mathematics 68
Replace Frank R. Bernhart with:
Frank R. Bernhart United States
Madhu Raka India
Th. Skolem Norway
Bahman Saffari France
David Hobby United States
Patrick J. Morandi United States
Ariel Gabizon Israel
David Kohel Australia
Hervé Daudé France
Omid Amini France
Chris Freiling relative to Frank R. Bernhart United States Frank R. Bernhart's profile →
Citations per field
00.5×3.8×
Frank R. Bernhart · 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 12 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 21 papers — load more, or switch the sort, to bring in the rest.

#Work
1 2007145
2 198641
3 200831
4 199312
5
Achievable Rate Regions for Network Coding
20128
6 19986
7 20126
8 20084
9 20123
10 19903
11 19822
12 19882
13 19842
14 20002
15 20022
16 19901
17 20001
18 19951
19 19841
20 19880

About Chris Freiling

Chris Freiling is a scholar working on Computational Theory and Mathematics, Geometry and Topology, Computer Networks and Communications, Mathematical Physics and Applied Mathematics, having authored 21 papers that have together received 273 indexed citations. Recurring topics across this work include Advanced Topology and Set Theory (6 papers), Cooperative Communication and Network Coding (5 papers), Mathematical and Theoretical Analysis (4 papers), Cellular Automata and Applications (4 papers), Functional Equations Stability Results (3 papers), Wireless Communication Security Techniques (3 papers), Computability, Logic, AI Algorithms (3 papers) and Artificial Intelligence in Games (2 papers). The work is most often cited by research in Theoretical Computer Science (8 citations), Computer Networks and Communications (162 citations), Geometry and Topology (42 citations), Discrete Mathematics and Combinatorics (15 citations) and Computational Theory and Mathematics (68 citations). Chris Freiling has collaborated with scholars based in United States, Germany and Italy. Frequent co-authors include K. Zeger, Randall Dougherty, J. Marshall Ash, Richard J. O’Malley, Udayan B. Darji, Michael J. Evans, Krzysztof Ciesielski, Robert P. Hunter, Jason Teutsch and Russell L. Wheeler. Their work appears in journals such as Journal of Symbolic Logic, Transactions of the American Mathematical Society, IEEE Transactions on Information Theory, Journal of Number 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