Thomas Byers

510 total citations
6 papers, 290 citations indexed

About

Thomas Byers is a scholar working on Computer Networks and Communications, Artificial Intelligence and Accounting. According to data from OpenAlex, Thomas Byers has authored 6 papers receiving a total of 290 indexed citations (citations by other indexed papers that have themselves been cited), including 2 papers in Computer Networks and Communications, 2 papers in Artificial Intelligence and 2 papers in Accounting. Recurrent topics in Thomas Byers's work include Optimization and Search Problems (2 papers), Algorithms and Data Compression (2 papers) and Private Equity and Venture Capital (2 papers). Thomas Byers is often cited by papers focused on Optimization and Search Problems (2 papers), Algorithms and Data Compression (2 papers) and Private Equity and Venture Capital (2 papers). Thomas Byers collaborates with scholars based in United States and Finland. Thomas Byers's co-authors include Richard C. Dorf, Michael S. Waterman, Anthony Leone, Robert H. Keeley and Erkko Autio and has published in prestigious journals such as Operations Research, Mathematical Biosciences and The Journal of Private Equity.

In The Last Decade

Thomas Byers

6 papers receiving 257 citations

Peers

Thomas Byers

MTI

MB

SM

AI

EE

Anil Menon United States

Antonio Iovanella Italy

Byunghoon Kim South Korea

P. Vivekanandan India

Dongwoo Kang South Korea

Jinhai Li China

Praveen Kumar Donepudi United States

Steven P. Coy United States

Chih-Hung Hsieh Taiwan

Camille Rosenthal‐Sabroux France

Anil Menon United States

Thomas Byers

130 ×1.8

MTI

8 ×0.1

MB

31 ×0.7

SM

51 ×1.8

AI

31 ×1.1

EE

Citations per year, relative to Thomas Byers Thomas Byers (= 1×) peers Anil Menon

Countries citing papers authored by Thomas Byers

Since Specialization

Citations

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

Fields of papers citing papers by Thomas Byers

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Thomas Byers

This figure shows the co-authorship network connecting the top 25 collaborators of Thomas Byers. A scholar is included among the top collaborators of Thomas Byers 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 Thomas Byers. Thomas Byers is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

6 of 6 papers shown

1.

Dorf, Richard C. & Thomas Byers. (2004). MP: Technology Ventures: From Idea to Enterprise w/ Engineering Subscription Card. 3 indexed citations

2.

Dorf, Richard C. & Thomas Byers. (2004). Technology Ventures from Idea to Enterprise. Medical Entomology and Zoology. 148 indexed citations

3.

Byers, Thomas, et al.. (2000). The Impact of a Research University in Silicon Valley. The Journal of Private Equity. 4(1). 7–15. 6 indexed citations

4.

Waterman, Michael S. & Thomas Byers. (1985). A dynamic programming algorithm to find all solutions in a neighborhood of the optimum. Mathematical Biosciences. 77(1-2). 179–188. 48 indexed citations

5.

Byers, Thomas & Michael S. Waterman. (1984). Technical Note—Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming. Operations Research. 32(6). 1381–1384. 49 indexed citations

6.

Byers, Thomas & Michael S. Waterman. (1984). Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming. 36 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