Lenore Blum

Q: What Schools Are Affiliated With Lenore Blum

Lenore Blum is affiliated with the following schools: University of California, Berkeley, Massachusetts Institute of Technology, City University of Hong Kong, Carnegie Mellon University, Simmons University

Lenore Blum's AcademicInfluence.com Rankings

Lenore Blum

Computer Science

#554

World Rank

#574

Historical Rank

#300

USA Rank

Theoretical Computer Science

#35

World Rank

#35

Historical Rank

#11

USA Rank

computer-science Degrees

Lenore Blum

Mathematics

#1211

World Rank

#2033

Historical Rank

#502

USA Rank

Measure Theory

#2987

World Rank

#3544

Historical Rank

#845

USA Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Lenore Blum's Degrees

Bachelors Mathematics University of California, Berkeley

Similar Degrees You Can Earn

Best Online Bachelor's in Math Ranked

Why Is Lenore Blum Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Lenore Carol Blum is an American computer scientist and mathematician who has made contributions to the theories of real number computation, cryptography, and pseudorandom number generation. She was a distinguished career professor of computer science at Carnegie Mellon University until 2019 and is currently a professor in residence at the University of California, Berkeley. She is also known for her efforts to increase diversity in mathematics and computer science.

(See a Problem?)

Lenore Blum's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Papers

Complexity and Real Computation (1997) (1548)
On a theory of computation and complexity over the real numbers: $NP$- completeness, recursive functions and universal machines (1989) (1144)
A Simple Unpredictable Pseudo-Random Number Generator (1986) (1016)
Toward a Mathematical Theory of Inductive Inference (1975) (635)
On a theory of computation and complexity over the real numbers; np-completeness (1989) (185)
Comparison of Two Pseudo-Random Number Generators (1982) (108)
CS4HS: an outreach program for high school CS teachers (2007) (93)
A Theory of Computation and Complexity over the real numbers (1991) (79)
On a theory of computation over the real numbers; NP completeness, recursive functions and universal machines (1988) (73)
A model for high school computer science education: the four key elements that make it! (2008) (68)
COMPLEXITY AND REAL COMPUTATION: A MANIFESTO (1996) (56)
Building an effective computer science student organization: the Carnegie Mellon women@SCS action plan (2002) (54)
Culture and environment as determinants of women's participation in computing: revealing the "women-CS fit" (2006) (51)
Computing over the Reals: Where Turing Meets Newton (2004) (49)
Entrepreneurship Education Comes of Age on Campus: The Challenges and Rewards of Bringing Entrepreneurship to Higher Education (2013) (47)
A Cultural Perspective on Gender Diversity in Computing (2007) (44)
The Evolving Culture of Computing: Similarity Is the Difference (2005) (43)
Algebraic Settings for the Problem “P ≠ NP?” (1998) (42)
Differentially closed fields: a model-theoretic tour (1977) (36)
Women in Computer Science: The Carnegie Mellon Experience (2001) (35)
A simple secure pseudo-random number generator (1982) (27)
Transforming the Culture of Computing at Carnegie Mellon (2001) (25)
The Gödel Incompleteness Theorem and Decidability over a Ring (1993) (25)
Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average (1984) (22)
Midlife development: A personality and social systems perspective. (1980) (20)
The expansion of CS4HS: an outreach program for high school teachers (2008) (17)
A theory of consciousness from a theoretical computer science perspective: Insights from the Conscious Turing Machine (2021) (15)
A Theoretical Computer Science Perspective on Consciousness (2020) (12)
Inductive Inference: A Recursion Theoretic Approach (1973) (11)
Towards an Asymptotic Analysis of Karmarkar's Algorithm (1986) (9)
Structuring Efficient Asset‐Backed Transactions (2008) (9)
Generalized algebraic theories : a model theorectic approach, (1968) (8)
Alan turing and the other theory of computation (2012) (6)
Alan Turing and the other theory of computation (expanded) (2014) (4)
Women in mathematics: An international perspective, eight years later (1987) (4)
A new simple homotopy algorithm for linear programming I (1988) (4)
Increasing the Participation of Women in Fields that Use Mathematics. (1980) (2)
The Condition Number in ℙ(H(d)) (1998) (2)
The Condition Number for Nonlinear Problems (1998) (2)
The critical role of culture and environment as determinants of women's participation in computer science (2007) (2)
Julia, A Life in Mathematics. By Constance Reid (1998) (2)
Newton’s Method (1998) (1)
The WORK OF STEVE SMALE ON THE THEORY OF COMPUTATION: 1990–1999 (2002) (1)
Multiscale Scheduling: Integrating Competitive and Cooperative Scheduling in Theory and in Practice (2007) (1)
Mathematical Foundations for Understanding and Designing Conceptualizing Strategizing Control ( CONSCS ) Systems (2004) (1)
A Theoretical Computer Science Perspective on Free Will (2022) (1)
Computation over a Ring (1998) (0)
Condition Numbers and the Loss of Precision of Linear Equations (1998) (0)
Isadore M. Singer (1924–2021) In Memoriam Part 2: Personal Recollections (2022) (0)
Viewpoint: A Theoretical Computer Science Perspective on Consciousness and Artificial General Intelligence (2023) (0)
Chapter 2 Algorithms : Tiny Yet Powerful (2020) (0)
Computing over the Reals (or an Arbitrary Ring) (1990) (0)
Some Separations of Complexity Classes (1998) (0)
Definitions and First Properties of Computation (1998) (0)
Algebraic Settings for the Problem P 6 = Np?" 1. Statement of Main Theorems (1996) (0)
Clermont-Ferrand, France, July 21–30, 1994 (1995) (0)
Complexity and the Condition Number (1998) (0)
The Class NP and NP-Complete Problems (1998) (0)
Deterministic Lower Bounds (1998) (0)
Decision Problems and Complexity over a Ring (1998) (0)
Fundamental Theorem of Algebra: Complexity Aspects (1998) (0)
Transitive Transfer of Conndence: a Per- Fect Zero-knowledge Interactive Proto- Col for Sat and Beyond. 5.1 Additional Security for the User (1997) (0)
Nonuniform Complexity Classes (1998) (0)

This paper list is powered by the following services:

Other Resources About Lenore Blum

What Schools Are Affiliated With Lenore Blum?

Lenore Blum is affiliated with the following schools:

What Are Lenore Blum's Academic Contributions?

Lenore Blum is most known for their academic work in the field of computer science. They are also known for their academic work in the fields of and mathematics.

Lenore Blum has made the following academic contributions:

Complexity and Real Computation

Lenore Blum's Academic­Influence.com Rankings

Lenore Blum's Degrees

Similar Degrees You Can Earn

Why Is Lenore Blum Influential?

Lenore Blum's Published Works

Published Papers

Other Resources About Lenore Blum

What Schools Are Affiliated With Lenore Blum?

What Are Lenore Blum's Academic Contributions?

Image Attributions

Lenore Blum's AcademicInfluence.com Rankings