Peter Boothe

Mathematics and Computer Science Dept.
Manhattan College

Just the facts

• Office: RLC 200A
• Email: peter.boothe@manhattan.edu
• Jabber/Google chat: peter.boothe@manhattan.edu
• Fall 2009 Classes: CMPT 101 (aka Computer Science 1), CMPT 438 (aka Algorithms), and two sections of Math 103 (aka Calculus I)
• Disposition: friendly and helpful

About Me

Hi! I am Peter Boothe, a professor in the Mathematics and Computer Science department at Manhattan College. I am a computer scientist, which means I care about a whole grab bag of things that, when put under the same umbrella, we end up calling computer science. I care about understanding how computers work and are used and could be used, but I also care about how problems may be solved and whether they can be solved efficiently. Computers and computer science changed the world at least three separate times in the 20th century, but I'm pretty sure that the best is yet to come; With respect to computers, we do not yet know what we have wrought.

My research interests are broad, but end up being centered around graph theory, algorithms, education, and networking. Since you are reading this, you are almost certainly involved with Manhattan College in some fashion, and so you should know that my door is always open, although sometimes not literally, due to nearby noise sources. Come by any time, I love to meet and chat with students.

—Peter
Fri Aug 27 09:30:54 EDT 2010

Scholarly Activity

Peer Reviewed Articles

FUN
SPTrees
AINTEC
Ran

Dissertation

Boothe, Peter. Measuring the Internet AS Graph and its Evolution. University of Oregon, 2009

Posters and Abstracts

2010 Workshop on Information in Networks (NYU)
2010 Sigma Xi Induction (Manhattan College) Presented by undergraduate coauthor Sandro Badame
2008 The Harvard Networks in Political Science Conference
2007 NIPS

Talks

2010

2010 Workshop on Information in Networks (NYU)
FUN with Algorithms (Ischia, Italy)
Forty-First Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic University) Talk given by undergraduate coauthor Sandro Badame
Google tech talk (Google New York)
Manhattan College Math/CS Department Colloquium (Manhattan College)

2009

Dissertation defense (University of Oregon)
Computer Science and Economics Day (New York Academy of Sciences)

Before 2009 (an incomplete list)

Peter Boothe. The Dynamics of Large Sparse Graphs Talk given at the UO CIS Graduate Research Forum.
Peter Boothe and Randy Bush. Anycast Measurements Used to Highlight Routing Instabilities Talk given at NANOG34.
Peter Boothe, James Hiebert, and Randy Bush. How Prevalent is Prefix Hijacking on the Internet? Talk given at NANOG36.
Peter Boothe, Zdeněk Dvořák, Art Farley, and Andrzej Proskurowski. Graph Covering via Shortest Paths Talk given at the 38th Southeastern Conference on Combinatorics, Graph Theory, and Computing. A later version of the same talk was given at a Simon Fraser University colloquium.

Conferences and Workshops Attended

2010

Computer Science and Economics Day (New York Academy of Sciences)
Workshop on Information in Networks (NYU)
“Barriers in Computational Complexity II” workshop (Princeton)
FUN with Algorithms (Ischia, Italy)
Spuyten Duyvil Undergraduate Mathematics Conference
Forty-First Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic University)

2009

Computer Science and Economics Day (New York Academy of Sciences)
Workshop on Information in Networks (NYU)
Faces of Modern Cryptography (City College New York)

Before 2009 (an incomplete list)

2008 The Harvard Networks in Political Science Conference
2007 NIPS
Graph Width Parameters Workshop
i18n of Computer Science Education — CPATH Workshop
NANOG
NANOG
Thirty-Eighth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic University)
SIGCOMM
SIGCSE
Computers, Freedom, and Privacy