Benjamin Johnson's Home Page
Benjamin Johnson's Home Page
Welcome to my home page.
The picture collage is still a work in progress, trying to keep things interesting. I moved my website's url to the school of information, from the math department in spring 2009.
I taught Numerical Analysis (Math 128A) at Cal during summer 2011. A link to the 128A course materials is at the top of the page.
I will be teaching Math 16A (Analytic Geometry and Calculus) during the fall 2011 semester. I have included my course information sheet and tentative course outline below.
I will be using bSpace for this course, but will try to keep the website here up to date as time permits.
 Homework for chapter 0:
0.1 (pg 1214): 1,7,13,23,2733,37;
0.2 (pg 2021): 1,21,23,33,37;
0.3 (pg 2526): 11,17,19,23,29;
0.4 (pg 3233): 1,7,13,19,25,33;
0.5 (pg 3940): 2,7,17,31,35,67,71;
0.6 (pg 4750): 1,3,11,15;
Below are some links to my job application materials, the courses I have taught over the last several years, and an abbreviated list of my publications and talk slides. Feel free to email me and tell me what you think. There are links to some of my other interests in the "About Me" page linked at the top.
Job Application Materials
 CV
Lecture Notes
 Transition to Upper Division Mathematics (Math 74, Spring 2005)
 Math Teaching Workshop (Math 300, Spring 2006)
Selected Course Materials (for courses taught at U.C. Berkeley)
Numerical Analysis (Math 128A, Summer 2009)
Applied Calculus (Math 16A, Summer 2008)
 Linear Algebra (Math 110, Summer 2007)
 Introduction to Analysis (Math 104, Summer 2006)
Math Teaching Workshop (Math 300, Spring 2006)
Introduction to Abstract Algebra (Math 113, Summer 2005)
 Transition to Upper Division Mathematics (Math 74, Summer 2004, Fall 2004, Spring 2005)
 Precalculus (Math 32, Fall 2002, Spring 2003)
 Calculus (Math 1A, Summer 2003)
Selected Publications
 Benjamin Johnson, Jens Grossklags, Nicolas Christin, and John Chuang (2011) Nash Equilibria for Weakest Target Security Games with Heterogeneous Agents, in: Proceedings of the 2nd International ICST Conference on Game Theory for Networks (GamNets 2011), April 1618, 2011, Shanghai, China.
 Benjamin Johnson, Jens Grossklags, Nicolas Christin, and John Chuang (2010) Uncertainty in Interdependent Security Games, in: Proceedings of the 1st Conference on Decision and Game Theory for Security (Gamesec 2010), November 2223, 2010, Berlin, Germany.

Benjamin Johnson, Jens Grossklags, Nicolas Christin, and John Chuang (2010)
Are Security Experts Useful? Bayesian Nash Equilibria for Network Security Games with Limited Information,
in: Proceedings of the 15th European Symposium on Research in Computer Security (ESORICS), September 2022, 2010, Athens, Greece, pp. 588606. (Paper acceptance rate: 20.8%)

Benjamin Johnson (2010)
The Polynomial Degree of Recursive Fourier Sampling,
The 5th Annual Conference on Theory of Quantum Computation, Communication and Cryptography (TQC), April 1315, 2010, Leeds, UK. To appear in LNCS 6519.

Jens Grossklags, Benjamin Johnson and Nicolas Christin (2010)
The Price of Uncertainty in Security Games,
in: T. Moore, D. Pym, and C. Ioannidis (Eds.), "Economics of Information Security and Privacy", Springer Verlag, pp. 183210. ISBN: 9783540778868. Lead article.
An earlier extended version
was presented at the Eighth Workshop on the Economics of Information Security (WEIS 2009), London, UK, June 2425, 2009.

Jens Grossklags, Benjamin Johnson and Nicolas Christin (2010)
When Information Improves Information Security,
in: Proceedings of the Fourteenth International Conference Financial Cryptography and Data Security (FC'10),
January 2528, 2010, Tenerife, Spain. Published in: Radu Sion (Ed.), Lecture Notes in Computer Science (LNCS), No. 6052, Springer Verlag, 2010, pp. 416423
(paper acceptance rate: 26%). Extended version available as CyLab Technical Report, CMU, No. CMUCyLab09004.

Jens Grossklags and Benjamin Johnson (2009)
Uncertainty in the Weakest Link Security Game,
in: Proceedings of the International Conference on Game Theory for Networks (GameNets 2009), May 1315, 2009, Istanbul, Turkey, pp. 673682. Proceedings published by IEEE. ISBN: 9781424441761.

Benjamin Johnson. Upper and Lower Bounds for Recursive Fourier Sampling.
Ph.D. Thesis, University of California, Berkeley, May 2008.

Paul Laskowski, Benjamin Johnson, and John Chuang. UserDirected Routing: From Theory towards Practice,
NetEcon08, August 22, 2008, Seattle, Washington, USA.
Selected Talks

"Nash Equilibria for Weakest Target Security Games with Heterogeneous Agents"
The 2nd International ICST Conference on Game Theory for Networks (GameNets 2011), April 17, 2011, Shanghai, China

"Uncertainty in Interdependent Security Games"
The 1st Conference on Decision and Game Theory for Security(GameSec 2010), November 23, 2010, Berlin, Germany.

"Are Security Experts Useful? Bayesian Nash Equilibria for Network Security Games with Limited Information"
ESORICS 2010, September 22, 2010, Athens, Greece. (also presented at: Information
Sciences and Technology Seminar, November 3, 2010, Penn State University; and at TRUST Autumn
2010 Conference, November 11, 2010, Stanford University.)

"The Polynomial Degree of Recursive Fourier Sampling"
The 5th Annual Conference on Theory of Quantum Computation, Communication, and Cryptography (TQC 2010), April 15, 2010, Leeds, UK

”Uncertainty in the Weakest Link Security Game” International Conference on Game Theory for Networks (GameNets 2009), May 15, 2009, Istanbul, Turkey
”The Price of Uncertainty in Security Games” Cylab student seminar, Carnegie Mellon University, March 27, 2009
”Upper and Lower Bounds for Recursive Fourier Sampling” Ph.D. Thesis Defense, May 9, 2008
”Recursive Fourier Sampling and Quantum Complexity Theory” U. C. Berkeley Student Logic Colloquium, December 7, 2007