Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
sublinear time
Description:
An algorithmic running time that grows more slowly than the size of the input, often in data structures and complexity theory.
Primary topic:
Complexity and Algorithms in Graphs (23%)
Related topics:
Complexity and Algorithms in Graphs (23%),
Algorithms and Data Compression (21%)
OpenAlex ID:
keywords/sublinear-time
Practical Dynamic Searchable Encryption with Small Leakage
2014
·
Emil Stefanov
, Charalampos Papamanthou
, et al.
·
Network and Distributed System Security Symposium
·
677
Secure two-party computation in sublinear (amortized) time
2012
·
S. Dov Gordon
, Jonathan Katz
, et al.
·
ACM SIGSAC Conference on Computer and Communications Security (CCS)
·
204
Networks Cannot Compute Their Diameter in Sublinear Time
2012
·
Silvio Frischknecht
, Stephan Holzer
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
164
An $O(n\log ^2 n)$ Algorithm for the k th Longest Path in a Tree with Applications to Location Problems
1981
·
N. Megiddo
, A. Tamir
, et al.
·
SIAM Journal on Computing
·
145
Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks
2016
·
Leonid Barenboim
·
Journal of the ACM
·
80
Caulk: Lookup Arguments in Sublinear Time
2022
·
Arantxa Zapico
, Vitalik Buterin
, et al.
·
ACM SIGSAC Conference on Computer and Communications Security (CCS)
·
79
Efficient pattern matching with scaling
1992
·
Amihood Amir
, Gad M Landau
, et al.
·
Journal of Algorithms
·
74
Distributed exact shortest paths in sublinear time
2017
·
Michael Elkin
·
ACM Symposium on Theory of Computing (STOC)
·
73
A New Conceptual Clustering Framework
2004
·
Nina Mishra
, Dana Ron
, et al.
·
Machine Learning
·
72
PDF
Submodular meets Structured: Finding Diverse Subsets in Exponentially-Large Structured Item Sets
2014
·
Prasad, Adarsh
, Jegelka, Stefanie
, et al.
·
arXiv (Cornell University)
·
60
PDF
A Sublinear-Time Quantum Algorithm for Approximating Partition Functions
2023
·
Arjan Cornelissen
, Yassine Hamoudi
·
Society for Industrial and Applied Mathematics eBooks
·
52
PDF
Dictionary Matching in a Stream
2015
·
Raphaël Clifford
, Allyx Fontaine
, et al.
·
Lecture notes in computer science
·
52
PDF
Fast Multipoint Evaluation of Bivariate Polynomials
2004
·
Michael Nüsken
, Martin Ziegler
·
Lecture notes in computer science
·
51
PDF
All maximal independent sets and dynamic dominance for sparse graphs
2009
·
David Eppstein
·
ACM Transactions on Algorithms
·
47
PDF
Episode matching
1997
·
Gautam Das
, Rudolf Fleischer
, et al.
·
Lecture notes in computer science
·
47
Suffix Trees on Words
1999
·
A. Andersson
, N. J. Larsson
, et al.
·
Algorithmica
·
45
Answering UCQs under Updates and in the Presence of Integrity Constraints
2017
·
Berkholz, Christoph
, Keppeler, Jens
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
43
PDF
A fully dynamic data structure for reachability in planar digraphs
1993
·
Sairam Subramanian
·
Lecture notes in computer science
·
42
Sketching for Kronecker Product Regression and P-splines
2017
·
Diao, Huaian
, Song, Zhao
, et al.
·
arXiv (Cornell University)
·
34
PDF
Combinatorial Correlation Clustering
2024
·
Vincent Cohen-Addad
, David Rasmussen Lolck
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
32
Distributed Exact Shortest Paths in Sublinear Time
2020
·
Michael Elkin
·
Journal of the ACM
·
32
PDF
Distance Oracles for Vertex-Labeled Graphs
2011
·
Danny Hermelin
, Avivit Levy
, et al.
·
Lecture notes in computer science
·
31
Two-dimensional iterative arrays: Characterizations and applications
1988
·
Oscar H. Ibarra
, Michael A. Palis
·
Theoretical Computer Science
·
31
Fully Dynamic Exact Edge Connectivity in Sublinear Time
2023
·
Gramoz Goranci
, Monika Henzinger
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
30
Efficient text searching of regular expressions: Preliminary version
1989
·
Ricardo A. Baeza-Yates
, Gaston H. Gonnet
·
Lecture notes in computer science
·
29
Show more works
View as search
Works count:
122
Citation count:
2,838
Year
Topic
Type