Resource-bounded Computation

Resource-Bounded Computation is a computational process constrained by specified limits on time, space, or other computational resources, distinguishing it from unbounded or idealized models of computation by explicitly accounting for the feasibility of computation under practical resource restrictions.

127

Publications

7.8K

Citations

287

Authors

149

Institutions

Publications per year

2017–2026

31

Authors

287

  1. NA
    Natasha Alechina

    University of Nottingham, United Kingdom

    5 publications · 113 citations

    5

    h-index

  2. BL
    Brian Logan

    University of Nottingham, United Kingdom

    4 publications · 103 citations

    4

    h-index

  3. EH
    Eric Horvitz

    Microsoft (United States), United States

    4 publications · 232 citations

    4

    h-index

  4. SJ
    Steffen Jost

    Ludwig-Maximilians-Universität München, Germany

    4 publications · 184 citations

    4

    h-index

  5. JH
    Jan Hoffmann

    Carnegie Mellon University, United States

    4 publications · 184 citations

    4

    h-index

1–5 of 287

Venues

  1. SIAM Journal on Computing

    4 publications · 440 citations

    4

    h-index

  2. ACM SIGPLAN Notices

    3 publications · 49 citations

    3

    h-index

  3. Mathematical Structures in Computer Science

    MSCS · 3 publications · 94 citations

    3

    h-index

  4. arXiv (Cornell University)

    Repository · 3 publications · 131 citations

    3

    h-index

  5. Theoretical Computer Science

    3 publications · 63 citations

    3

    h-index

1–5