Courses

This course looks at the narrative and the historical context for an extraordinary event: the conquest of the Persian empire by Alexander III of Macedonia, conventionally known as “Alexander the Great”. We will explore the different worlds Alexander grew out of, confronted, and affected: the old Greek world, the Persian empire, the ancient near-east (Egypt, Levant, Babylonia, Iran), and the worlds beyond, namely pre-Islamic (and pre-Silk Road) Central Asia, the Afghan borderlands, and the Indus valley. The first part of the course will establish context, before laying out a narrative framework; the second part of the course will explore a series of themes, especially the tension between military conquest, political negotiation, and social interactions. Overall, the course will serve as an exercise in historical methodology (with particular attention to ancient sources and to interpretation), an introduction to the geography and the history of the ancient world (classical and near-eastern), and the exploration of a complex testcase located at the contact point between several worlds, and at a watershed of world history.

 

Introduction to and analysis of major myths in classical literature. Topics include the changing attitudes and applications of myth from Greek epic to tragedy, as well as modern approaches to myth. Readings include Homer, Hesiod, Aeschylus, Sophocles, and Euripides. All readings in English.

Pushing back against this trope of homelessness, this course illuminates the robust, vibrant, and multifacetted
qualities of a home in the Diaspora, lasting for over a millennium, that both Ashkenazi and Sephardi
Jews managed to create for themselves in lands, predominantly populated by Slavs. They did so despite the
many constraints of legal and religious discrimination, threats of physical violence, displacement, and countless
forms of exclusion from dominant society. Moving across centuries, countries, and languages, we will revisit the
contributions of the Jews to their so called “host cultures” by way of diverse media—literary and non-fictional
works, memoirs, artistic works, songs, feature and documentary films, journalistic pieces, and more. By the end
of this journey, we will have gained a deeper understanding of the ways in which the Jews and Slavs have been
intimately imbricated and intertwined since times immemorial.

All course materials are available in English. No reading knowledge of Russian or other Slavic languages
is required. Course participants with the reading knowledge of any region-specific language are encouraged to
consult the respective originals, provided by the instructor upon request. This course will be of interest to those
majoring in Slavic and/or Jewish Studies, as well as anyone interested in Comparative Literature, History, Art
History, and Film and Visual Studies.

An introduction to modern cryptography, focusing on the complexity-theoretic foundations of secure computation and communication in adversarial environments; a rigorous approach, based on precise definitions and provably secure protocols. Topics include private and public key encryption schemes, digital signatures, authentication, pseudorandom generators and functions, one-way functions, trapdoor functions, number theory and computational hardness, identification and zero knowledge protocols.

Prior knowledge of Python is recommended. Provides a broad understanding of the basic techniques for building intelligent computer systems. Topics include state-space problem representations, problem reduction and and-or graphs, game playing and heuristic search, predicate calculus, and resolution theorem proving, AI systems and languages for knowledge representation, machine learning and concept formation and other topics such as natural language processing may be included as time permits.

Prerequisites: (COMS W3134 or COMS W3136COMS W3137) and (COMS W3203) Introduction to the design and analysis of efficient algorithms. Topics include models of computation, efficient sorting and searching, algorithms for algebraic problems, graph algorithms, dynamic programming, probabilistic methods, approximation algorithms, and NP-completeness.

Prerequisites: (COMS W3134 or COMS W3136COMS W3137) and (COMS W3203) Introduction to the design and analysis of efficient algorithms. Topics include models of computation, efficient sorting and searching, algorithms for algebraic problems, graph algorithms, dynamic programming, probabilistic methods, approximation algorithms, and NP-completeness.