M. Shub

4.1k citations
35 papers · 2.1k · 2 hit papers · h-index 18

Impact in

Papers in

M. Shub

35 papers receiving 1.8k citations

M. Shub's Hit Papers

On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines 1989 · 546 citations
5460+13+26Years since publication100200300400500

Peers

M. Shub
Comparison fields: 5 of 92
  • Computational Theory and Mathematics 974
  • Mathematical Physics 524
  • Geometry and Topology 361
  • Computational Mathematics 22
  • Numerical Analysis 200
Replace Uwe Helmke with:
Uwe Helmke Germany
Roy L. Adler United States
Assaf Naor United States
L. Mirsky United Kingdom
E. G. Straus United States
T. Andô Japan
George E. Collins United States
Gideon Schechtman Israel
Rajendra Bhatia India
Albrecht Böttcher Germany
M. Shub relative to Uwe Helmke Germany Uwe Helmke's profile →
Citations per field
00.5×3.5×
Uwe Helmke · 1×
Citations per year

Countries citing papers authored by M. Shub

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authors

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.

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

All Works

20 of 20 papers shown

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

#Work
1
On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
Hit paper breakdown →
1989546
2
A Simple Unpredictable Pseudo-Random Number Generator
Hit paper breakdown →
1986508
3 1970110
4 197096
5 199480
6 197475
7 197473
8 197563
9 198662
10
The mathematics of numerical analysis
199660
11 199952
12 197549
13 198548
14 199627
15 198825
16 197523
17 199423
18 199918
19 199117
20 201217

About M. Shub

M. Shub is a scholar working on Mathematical Physics, Computational Theory and Mathematics, Numerical Analysis, Statistical and Nonlinear Physics and Geometry and Topology, having authored 35 papers that have together received 2.1k indexed citations. Recurring topics across this work include Mathematical Dynamics and Fractals (13 papers), Computability, Logic, AI Algorithms (6 papers), Advanced Optimization Algorithms Research (6 papers), Polynomial and algebraic computation (5 papers), Iterative Methods for Nonlinear Equations (5 papers), Quantum chaos and dynamical systems (4 papers), Matrix Theory and Algorithms (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, Jacob Palis and Morris W. Hirsch. 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.

Explore authors with similar magnitude of impact