DASH

What is DASH?

A central, open-access repository of research by members of the Harvard community.

Deposit Your Work

DASH enlarges the audience and impact of your work. Authors who deposit in DASH have access to on-demand metrics and receive monthly reports about their readership. Deposited works receive persistent URLs, are comprehensively indexed by search engines, including Google and Google Scholar, reach academic and non-academic readers who may not have access to the original publications, and are preserved by the Harvard Library.

Making your work open access in DASH is as simple as completing our quick submit form. We also welcome bulk deposits and offer CV scraping services. Simply contact OSC if you are interested. OSC will do the legal legwork for all submissions.

The OSC is pleased to offer a robust suite of services to support you and your scholarship. Visit our For Authors page to learn more.

 

  • The Distinction between Theology and Ethics: A Critical History 

    Lau, Sean (Wiley, 2024-01-16)
    <jats:title>ABSTRACT</jats:title><jats:p>This article sketches an intellectual history of the distinction between Christian theology and Christian ethics. The twists and turns of that history have been obscured by a recent ...
  • Critical Friendship After the Pandemic 

    Abi Rached, Joelle (Copenhagen Business School, 2023-12-29)
    Are critique and the “art of governing” antithetical? The aim of this article is to examine this tension that was laid bare by the Covid-19 pandemic by introducing “critical friendship” as a conceptual framework for a ...
  • A Composition Theorem for Randomized Query Complexity 

    Anshu, Anurag; Gavinsky, Dmitry; Jain, Rahul; Kundu, Srijita; Lee, Troy; Mukhopadhyay, Priyanka; Santha, Miklos; Sanyal, Swagato (2017-06-14)
    Let the randomized query complexity of a relation for error probability ϵ be denoted by Rϵ(⋅). We prove that for any relation f⊆{0,1}n× and Boolean function g:{0,1}m→{0,1}, R1/3(f∘gn)=Ω(R4/9(f)⋅R1/2−1/n4(g)), where f∘gn ...

View more