Daniel S. Roche
Impact in
-
- Polynomial and algebraic computation
- Complexity and Algorithms in Graphs
- Numerical Methods and Algorithms
Papers in
-
- Coding theory and cryptography 9
- Cryptography and Data Security 8
- Privacy-Preserving Technologies in Data 3
-
- Polynomial and algebraic computation 15
- Numerical Methods and Algorithms 5
- Co-authors
- Mark Giesbrecht (8 shared papers)Seung Geol Choi (4 shared papers)Adam J. Aviv (5 shared papers)Daniel Apon (1 shared paper)Arkady Yerukhimovich (1 shared paper)David Harvey (1 shared paper)Travis Mayberry (1 shared paper)Radu Sion (1 shared paper)
- Journals
- Algorithmica (1 paper)Computational Complexity (1 paper)SIAM Journal on Matrix Analysis and Applications (1 paper)Journal of Symbolic Computation (4 papers)ACM communications in computer algebra (1 paper)
- Partner nations
- United StatesCanadaFrance
In The Last Decade
Daniel S. Roche
25 papers receiving 204 citations
Peers
Comparison fields: 5 of 27
- Computational Mathematics 4
- Computational Theory and Mathematics 106
- Artificial Intelligence 149
- Information Systems 70
- Discrete Mathematics and Combinatorics 7
Countries citing papers authored by Daniel S. Roche
This map shows the geographic impact of Daniel S. Roche'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 Daniel S. Roche with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel S. Roche more than expected).
Fields of papers citing papers by Daniel S. Roche
This network shows the impact of papers produced by Daniel S. Roche. 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 Daniel S. Roche. The network helps show where Daniel S. Roche may publish in the future.
Co-authors
The 18 scholars most cited alongside Daniel S. Roche, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 28 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2016 | 40 | |
| 2 | 2016 | 30 | |
| 3 | 2011 | 16 | |
| 4 | 2019 | 16 | |
| 5 | 2015 | 15 | |
| 6 | 2009 | 12 | |
| 7 | 2010 | 10 | |
| 8 | 2014 | 10 | |
| 9 | 2015 | 10 | |
| 10 | 2014 | 9 | |
| 11 | 2010 | 7 | |
| 12 | 2016 | 5 | |
| 13 | 2008 | 4 | |
| 14 | 2019 | 4 | |
| 15 | 2011 | 3 | |
| 16 | 2019 | 3 | |
| 17 | Faster sparse polynomial interpolation of straight-line programs over finite fields. | 2014 | 2 |
| 18 | 2021 | 2 | |
| 19 | 2010 | 2 | |
| 20 | 2019 | 2 |
About Daniel S. Roche
Daniel S. Roche is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Information Systems, Computational Mathematics and Signal Processing, having authored 28 papers that have together received 207 indexed citations. Recurring topics across this work include Polynomial and algebraic computation (15 papers), Coding theory and cryptography (9 papers), Cryptography and Residue Arithmetic (9 papers), Cryptography and Data Security (8 papers), Numerical Methods and Algorithms (5 papers), Tensor decomposition and applications (4 papers), Privacy-Preserving Technologies in Data (3 papers) and Cloud Data Security Solutions (3 papers). The work is most often cited by research in Computational Mathematics (4 citations), Computational Theory and Mathematics (106 citations), Artificial Intelligence (149 citations), Information Systems (70 citations) and Discrete Mathematics and Combinatorics (7 citations). Daniel S. Roche has collaborated with scholars based in United States, Canada and France. Frequent co-authors include Mark Giesbrecht, Seung Geol Choi, Adam J. Aviv, Daniel Apon, Arkady Yerukhimovich, David Harvey, Travis Mayberry, Radu Sion, Clément Pernet and Pascal Giorgi. Their work appears in journals such as Algorithmica, Computational Complexity, SIAM Journal on Matrix Analysis and Applications, Journal of Symbolic Computation and ACM communications in computer algebra.
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.