Lenore Blum - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 19 from 19

2021

A Theoretical Computer Science Perspective on ConsciousnessManuel Blum 0001, Lenore Blum. jaic, 8(1):1-42, 2021. [doi]

2014

Alan Turing and the other theory of computation (expanded)Lenore Blum. In Rod Downey, editor, Turing's Legacy: Developments from Turing's Ideas in Logic. Volume 42 of Lecture Notes in Logic, pages 48-69, Cambridge University Press, 2014. [doi]

2012

Alan turing and the other theory of computationLenore Blum. iticse 2012: 2 [doi]

2008

The expansion of CS4HS: an outreach program for high school teachersLenore Blum, Thomas J. Cortina, Edward D. Lazowska, Joe Wise. sigcse 2008: 377-378 [doi]

A model for high school computer science education: the four key elements that make it!Orit Hazzan, Judith Gal-Ezer, Lenore Blum. sigcse 2008: 281-285 [doi]

2007

CS4HS: an outreach program for high school CS teachersLenore Blum, Thomas J. Cortina. sigcse 2007: 19-23 [doi]

2006

Culture and environment as determinants of women s participation in computing: revealing the women-CS fit Carol Frieze, Orit Hazzan, Lenore Blum, M. Bernardine Dias. sigcse 2006: 22-26 [doi]

2005

ForewordLenore Blum, Felipe Cucker, Tomaso Poggio, James Renegar, Michael Shub. focm, 5(4):349, 2005. [doi]

2002

Building an effective computer science student organization: the Carnegie Mellon ::::women@SCS:::: action planCarol Frieze, Lenore Blum. SIGCSE, 34(2):74-78, 2002. [doi]

1998

Complexity and real computationLenore Blum. Springer, 1998. [doi]

1988

On a Theory of Computation over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines (Extended Abstract)Lenore Blum, Mike Shub, Steve Smale. focs 1988: 387-397

A new simple homotopy algorithm for linear programming ILenore Blum. jc, 4(2):124-136, 1988. [doi]

1986

A Simple Unpredictable Pseudo-Random Number GeneratorLenore Blum, Manuel Blum, Mike Shub. SICOMP, 15(2):364-383, 1986.

Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on AverageLenore Blum, Mike Shub. SICOMP, 15(2):384-398, 1986.

Towards an Asymptotic Analysis of Karmarkar s AlgorithmLenore Blum. ipl, 23(4):189-194, 1986.

1984

Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average (Extended Abstract)Lenore Blum, Mike Shub. focs 1984: 261-267

1982

Comparison of Two Pseudo-Random Number GeneratorsLenore Blum, Manuel Blum, Mike Shub. crypto 1982: 61-78

1975

Toward a Mathematical Theory of Inductive InferenceLenore Blum, Manuel Blum. iandc, 28(2):125-155, June 1975.

1973

Inductive Inference: A Recursion Theoretic ApproachLenore Blum, Manuel Blum. focs 1973: 200-208

Sign in or sign up to see more results.

runs on WebDSL