Algorithm Patentability

Algorithm Patentability is a patent law doctrine that distinguishes abstract algorithms from statutory subject matter by determining whether an algorithm is implemented in a practical application or technological environment sufficient to render it eligible for patent protection under applicable intellectual property statutes.

5

Publications

151

Citations

3

Authors

2

Institutions

Publications per year

2017–2026

0

Authors

3

  1. PS
    Pamela Samuelson

    University of California, Berkeley, United States

    3 publications · 94 citations

    3

    h-index

  2. MR
    Michael Risch

    Villanova University, United States

    1 publications · 26 citations

    1

    h-index

  3. DS
    Donald S. Chisum

    1 publications · 31 citations

    1

    h-index

1–3 of 3

Institutions

2

  1. Villanova University

    Radnor, United States

    1 h-index

    1 publications

    26 citations

  2. University of Pittsburgh

    Pittsburgh, United States

    1 h-index

    1 publications

    35 citations

1–2 of 2

Venues

  1. Communications of the ACM

    1 publications · 35 citations

    1

    h-index

  2. SSRN Electronic Journal

    Repository · 1 publications · 26 citations

    1

    h-index

  3. 1

    h-index

1–3