Concepedia

Sublinear-time Algorithms

Sublinear-Time Algorithms is a computational method that belongs to the class of randomized algorithms and is distinguished by its ability to solve problems in time asymptotically less than the input size, typically by exploiting probabilistic strategies to achieve efficient approximations or local inspections.

273

Publications

15.1K

Citations

520

Authors

214

Institutions

Publications per year

2017–2026

68

Parents

Publications

273

Fast pose estimation with parameter-sensitive hashing

Shakhnarovich, Viola, Darrell · 2003 · 765 citations · Full text

, , +16

Beyond sliding windows: Object localization by efficient subwindow search

Christoph H. Lampert, Matthew B. Blaschko, Thomas Hofmann · 2008 · 692 citations

, , +16

Practical Dynamic Searchable Encryption with Small Leakage

Emil Stefanov, Charalampos Papamanthou, Elaine Shi · 2014 · 593 citations

, , +13

Efficient Subwindow Search: A Branch and Bound Framework for Object Localization

Christoph H. Lampert, Matthew B. Blaschko, Thomas Hofmann · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2009 · 348 citations · Full text

, , +16

Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality

Piotr Indyk · 1998 · 319 citations

, , +17

1–5 of 273

Authors

520

  1. RR
    Ronitt Rubinfeld

    Massachusetts Institute of Technology, United States

    15 publications · 1.1K citations

    14

    h-index

  2. DR
    Dana Ron

    Tel Aviv University, Israel

    9 publications · 352 citations

    9

    h-index

  3. PI
    Piotr Indyk

    Massachusetts Institute of Technology, United States

    9 publications · 568 citations

    9

    h-index

  4. TB
    Tuğkan Batu

    IBM Research - Almaden, United States

    7 publications · 653 citations

    7

    h-index

  5. CS
    C. Seshadhri

    Sandia National Laboratories California, United States

    6 publications · 97 citations

    6

    h-index

1–5 of 520

Institutions

214

  1. Tel Aviv University

    Tel Aviv, Israel

    17 h-index

    51 publications

    1.9K citations

  2. Stanford University

    Stanford, United States

    15 h-index

    21 publications

    1.1K citations

  3. Princeton University

    Princeton, United States

    13 h-index

    20 publications

    1.7K citations

  4. Massachusetts Institute of Technology

    Cambridge, United States

    13 h-index

    33 publications

    1.9K citations

  5. University of Pennsylvania

    Philadelphia, United States

    11 h-index

    21 publications

    817 citations

  6. University of California, Berkeley

    Berkeley, United States

    9 h-index

    17 publications

    1.8K citations

  7. Rutgers, The State University of New Jersey

    New Brunswick, United States

    9 h-index

    11 publications

    1.1K citations

  8. Microsoft (United States)

    Redmond, United States

    8 h-index

    10 publications

    1.2K citations

1–8 of 214

Venues

  1. SIAM Journal on Computing

    15 publications · 828 citations

    14

    h-index

  2. arXiv (Cornell University)

    Repository · 19 publications · 662 citations

    12

    h-index

  3. ACM Transactions on Algorithms

    TALG · 10 publications · 255 citations

    10

    h-index

  4. Algorithmica

    9 publications · 418 citations

    9

    h-index

  5. Journal of the ACM

    JACM · 8 publications · 955 citations

    8

    h-index

1–5