Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
sublinear time complexity
Description:
A computational complexity bound in which an algorithm's running time grows more slowly than the size of its input.
Related topics:
Complexity and Algorithms in Graphs (12%),
Algorithms and Data Compression (10%)
OpenAlex ID:
keywords/sublinear-time-complexity
Efficient Quantum Algorithms for Simulating Sparse Hamiltonians
2006
·
Dominic W. Berry
, Graeme Ahokas
, et al.
·
Communications in Mathematical Physics
·
1,117
PDF
Matching events in a content-based subscription system
1999
·
Marcos K. Aguilera
, Robert E. Strom
, et al.
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
677
Fast search in Hamming space with multi-index hashing
2012
·
M. Norouzi
, A. Punjani
, et al.
·
IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings
·
289
A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
1998
·
Juan A. Garay
, Shay Kutten
, et al.
·
SIAM Journal on Computing
·
207
SimpleFlow: A Non‐iterative, Sublinear Optical Flow Algorithm
2012
·
Michael Tao
, Jiamin Bai
, et al.
·
Computer Graphics Forum
·
164
A fast branch & bound nearest neighbour classifier in metric spaces
1996
·
Luisa Micó
, Jose Oncina
, et al.
·
Pattern Recognition Letters
·
121
Million Module March: Scalable Locomotion for Large Self-Reconfiguring Robots
2008
·
Robert Fitch
, Zack Butler
·
The International Journal of Robotics Research
·
102
Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system
1998
·
Keqin Li
, Yi Pan
, et al.
·
IEEE Transactions on Parallel and Distributed Systems
·
97
ND-Tree-Based Update: A Fast Algorithm for the Dynamic Nondominance Problem
2018
·
Andrzej Jaszkiewicz
, Thibaut Lust
·
IEEE Transactions on Evolutionary Computation
·
60
PDF
A Fast Algorithm to Compute Maximum k-Plexes in Social Network Analysis
2017
·
Mingyu Xiao
, Weibo Lin
, et al.
·
Proceedings of the AAAI Conference on Artificial Intelligence
·
57
Accelerating Nearest Neighbor Search on Manycore Systems
2012
·
Lawrence Cayton
·
IEEE International Parallel and Distributed Processing Symposium (IPDPS)
·
56
PDF
On wirelength estimations for row-based placement
1998
·
Andrew E. Caldwell
, Andrew B. Kahng
, et al.
·
International Symposium on Physical Design
·
52
Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
2005
·
Seth Pettie
·
Journal of Graph Algorithms and Applications
·
47
A Pyramid-Based Approach to Segmentation Applied to Region Matching
1986
·
William I. Grosky
, Ramesh Jain
·
IEEE Transactions on Pattern Analysis and Machine Intelligence
·
46
Reading many variables in one atomic operation: solutions with linear or sublinear complexity
1994
·
L.M. Kirousis
, P. Spirakis
, et al.
·
IEEE Transactions on Parallel and Distributed Systems
·
45
An efficient algorithm for matching multiple patterns
1993
·
Jang-Jong Fan
, Keh-Yih Su
·
IEEE Transactions on Knowledge and Data Engineering
·
45
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry
2022
·
Thomas Bläsius
, Cedric Freiberger
, et al.
·
ACM Transactions on Algorithms
·
38
PDF
Time complexity analysis of the stochastic diffusion search
1998
·
Slawomir J. Nasuto
, J. M. Bishop
, et al.
·
Natural Computing
·
37
Faster Sample-Based Motion Planning Using Instance-Based Learning
2013
·
Jia Pan
, Sachin Chitta
, et al.
·
Springer tracts in advanced robotics
·
36
Structator: fast index-based search for RNA sequence-structure patterns
2011
·
Fernando Meyer
, Stefan Kurtz
, et al.
·
BMC Bioinformatics
·
36
PDF
Tight Fault Locality
2000
·
Shay Kutten
, David Peleg
·
SIAM Journal on Computing
·
35
Learning Mixtures of Sparse Linear Regressions Using Sparse Graph Codes
2018
·
Dong Yin
, Ramtin Pedarsani
, et al.
·
IEEE Transactions on Information Theory
·
28
PDF
mpscan: Fast Localisation of Multiple Reads in Genomes
2009
·
Eric Rivals
, Leena Salmela
, et al.
·
Lecture notes in computer science
·
28
PDF
Reading many variables in one atomic operation solutions with linear or sublinear complexity
2005
·
Lefteris M. Kirousis
, Paul Spirakis
, et al.
·
Springer eBooks
·
27
A New Design for Wide-Sense Nonblocking Multicast Switching Networks
2005
·
Y. Yang
, J. Wang
·
IEEE Transactions on Communications
·
27
Show more works
View as search
Works count:
92
Citation count:
3,862
Year
Topic
Type