Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
time complexity analysis
Description:
Time complexity analysis is the study of how an algorithm’s running time grows with the size of its input.
Related topics:
Complexity and Algorithms in Graphs (10%),
Algorithms and Data Compression (10%)
OpenAlex ID:
keywords/time-complexity-analysis
Modern Computer Algebra
2013
·
Joachim von zur Gathen
, Jürgen Gerhard
·
Cambridge University Press eBooks
·
685
Generalized arc consistency for global cardinality constraint
1996
·
Jean-Charles Régin
·
National Conference on Artificial Intelligence
·
307
Thread Scheduling for Multiprogrammed Multiprocessors
2001
·
N. S. Arora
, R. D. Blumofe
, et al.
·
Theory of Computing Systems
·
266
DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation
2015
·
Junhao Gan
, Yufei Tao
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
234
Heuristic algorithms for multiconstrained quality-of-service routing
2002
·
Xin Yuan
·
IEEE/ACM Transactions on Networking
·
229
Weighted Automata Algorithms
2009
·
Mehryar Mohri
·
Monographs in theoretical computer science
·
218
Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT
2002
·
Frank Hutter
, Dave A. D. Tompkins
, et al.
·
Lecture notes in computer science
·
211
Nucleic acid sequence design via efficient ensemble defect optimization
2010
·
Joseph N. Zadeh
, Brian R. Wolfe
, et al.
·
Journal of Computational Chemistry
·
196
An iterative algorithm for delay-constrained minimum-cost multicasting
1998
·
M. Parsa
, Qing Zhu
, et al.
·
IEEE/ACM Transactions on Networking
·
194
Analysis and evaluation of heuristic methods for static task scheduling
1990
·
Behrooz Shirazi
, Mingfang Wang
, et al.
·
Journal of Parallel and Distributed Computing
·
189
Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms.
1997
·
Georges R. Harik
·
Deep Blue (University of Michigan)
·
184
Weakly-convex–concave min–max optimization: provable algorithms and applications in machine learning
2021
·
Hassan Rafique
, Mingrui Liu
, et al.
·
Optimization methods & software
·
179
PDF
Multiple Kernel Clustering
2009
·
Bin Zhao
, James T. Kwok
, et al.
·
SIAM International Conference on Data Mining
·
166
ikd-Tree: An Incremental K-D Tree for Robotic Applications
2021
·
Cai, Yixi
, Xu, Wei
, et al.
·
arXiv (Cornell University)
·
156
PDF
Joint Multiuser DNN Partitioning and Computational Resource Allocation for Collaborative Edge Intelligence
2020
·
Xin Tang
, Xu Chen
, et al.
·
IEEE Internet of Things Journal
·
148
PDF
A Knowledge-Based Cuckoo Search Algorithm to Schedule a Flexible Job Shop With Sequencing Flexibility
2019
·
ZhengCai Cao
, ChengRan Lin
, et al.
·
IEEE Transactions on Automation Science and Engineering
·
142
A hierarchical gravitational search algorithm with an effective gravitational constant
2019
·
Yirui Wang
, Yang Yu
, et al.
·
Swarm and Evolutionary Computation
·
138
From Communicating Machines to Graphical Choreographies
2014
·
Julien Lange
, Emilio Tuosto
, et al.
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
138
An initialization method for the K -Means algorithm using neighborhood model
2009
·
Fuyuan Cao
, Jiye Liang
, et al.
·
Computers & Mathematics with Applications
·
133
An aggregative learning gravitational search algorithm with self-adaptive gravitational constants
2020
·
Zhenyu Lei
, Shangce Gao
, et al.
·
Expert Systems with Applications
·
132
Efficient algorithms for divisive hierarchical clustering with the diameter criterion
1991
·
A. Guénoche
, P. Hansen
, et al.
·
Journal of Classification
·
129
Revisiting the paxos algorithm
2000
·
Roberto De Prisco
, Butler Lampson
, et al.
·
Theoretical Computer Science
·
128
PDF
Multivariate time series clustering based on common principal component analysis
2019
·
Hailin Li
·
Neurocomputing
·
127
Lightweight semiformal time complexity analysis for purely functional data structures
2008
·
Nils Anders Danielsson
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
112
Heuristic algorithms for multi-constrained quality of service routing
2002
·
Xin Yuan
, Xingming Liu
·
IEEE Conference on Computer Communications (INFOCOM)
·
107
Show more works
View as search
Works count:
1,164
Citation count:
13,640
Year
Topic
Type