M. Shub
- Computational Theory and Mathematics top 0.5%
- Computability, Logic, AI Algorithms 6
- Polynomial and algebraic computation 5
- semigroups and automata theory 3
- Complexity and Algorithms in Graphs 3
- Mathematical Physics top 2%
- Mathematical Dynamics and Fractals 13
- Geometry and Topology top 2%
- Computational Mathematics top 5%
- Numerical Analysis top 5%
- Advanced Optimization Algorithms Research 6
- Iterative Methods for Nonlinear Equations 5
-
- Quantum chaos and dynamical systems 4
M. Shub
35 papers receiving 1.8k citations
Hit Papers
Peers
Comparison fields: 5 of 92
- Computational Theory and Mathematics 974
- Mathematical Physics 524
- Geometry and Topology 361
- Computational Mathematics 22
- Numerical Analysis 200
Countries citing papers authored by M. Shub
This map shows the geographic impact of M. Shub'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 M. Shub with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites M. Shub more than expected).
Fields of papers citing papers by M. Shub
This network shows the impact of papers produced by M. Shub. 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 M. Shub. The network helps show where M. Shub may publish in the future.
Co-authorship network
The 23 scholars most cited alongside M. Shub, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | Convexity properties of the condition number | 2013 | 4 |
| 2 | 2005 | 7 | |
| 3 | 1999 | 18 | |
| 4 | 1999 | 52 | |
| 5 | The mathematics of numerical analysis | 1996 | 60 |
| 6 | 1994 | 23 | |
| 7 | 1994 | 80 | |
| 8 | On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesbreakdown → | 1989 | 546 |
| 9 | On a Theory of Computation over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines (Extended Abstract) | 1988 | 4 |
| 10 | 1986 | 7 | |
| 11 | A Simple Unpredictable Pseudo-Random Number Generatorbreakdown → | 1986 | 508 |
| 12 | 1985 | 1 | |
| 13 | 1984 | 4 | |
| 14 | 1982 | 7 | |
| 15 | 1978 | 5 | |
| 16 | 1975 | 23 | |
| 17 | 1975 | 49 | |
| 18 | 1974 | 73 | |
| 19 | 1972 | 16 | |
| 20 | 1970 | 110 |
About M. Shub
M. Shub is a scholar working on Mathematical Physics, Numerical Analysis, Computational Theory and Mathematics, Geometry and Topology and Statistical and Nonlinear Physics, having authored 35 papers that have together received 2.1k indexed citations. Recurring topics across this work include Mathematical Dynamics and Fractals (13 papers), Advanced Optimization Algorithms Research (6 papers), Computability, Logic, AI Algorithms (6 papers), Polynomial and algebraic computation (5 papers), Iterative Methods for Nonlinear Equations (5 papers), Quantum chaos and dynamical systems (4 papers), semigroups and automata theory (3 papers) and Complexity and Algorithms in Graphs (3 papers). The work is most often cited by research in Computational Theory and Mathematics (974 citations), Mathematical Physics (524 citations), Geometry and Topology (361 citations), Computational Mathematics (22 citations) and Numerical Analysis (200 citations). M. Shub has collaborated with scholars based in United States, France and Brazil. Frequent co-authors include Lenore Blum, Steve Smale, Manuel Blum, S. Smale, Charles Pugh, Dennis Sullivan, Jean‐Pierre Dedieu, Zbigniew Nitecki, Morris W. Hirsch and Jacob Palis. Their work appears in journals such as Topology, Mathematics of Computation, International Journal of Bifurcation and Chaos, Theoretical Computer Science and SIAM Journal on Computing.
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.