Adaptive Complexity
Adaptive Complexity is a theoretical construct in algorithm analysis that characterizes the efficiency of a sorting algorithm by its ability to exploit existing order in the input sequence, thereby reducing computational effort relative to worst-case complexity when processing partially sorted data.
47
Publications
6.3K
Citations
97
Authors
58
Institutions
Publications per year
2017–2026
13
Parents
47
Hidden Order: How Adaptation Builds Complexity
Roger F. Malina, John H. Holland · Leonardo · 1996 · 2.5K citations
Hidden Order: How Adaptation Builds Complexity
Francis Fukuyama, John H. Holland · Foreign Affairs · 1996 · 1.1K citations
Hidden Order: How Adaptation Builds Complexity.
John R. Koza · Artificial Life · 1995 · 706 citations
Hidden order how adaptation builds complexity
1996 · 405 citations
Environmental complexity, cerebral change, and behavior.
Mark R. Rosenzweig · American Psychologist · 1966 · 279 citations
Medicine, Neuroscience, Psychology +17
1–5 of 47
97
3
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 97
58
Stanford University
Stanford, United States
5 h-index
4 publications
828 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
3 h-index
9 publications
405 citations
University of Pennsylvania
Philadelphia, United States
3 h-index
9 publications
911 citations
University of California, Los Angeles
Los Angeles, United States
2 h-index
3 publications
157 citations
University of Wisconsin–Madison
Madison, United States
2 h-index
2 publications
40 citations
California University of Pennsylvania
California, United States
2 h-index
5 publications
543 citations
New York University
New York, United States
2 h-index
4 publications
165 citations

University of British Columbia
Vancouver, Canada
2 h-index
7 publications
169 citations
1–8 of 58
2 publications · 783 citations
2
h-index
2 publications · 55 citations
2
h-index
JMD · 1 publications · 15 citations
1
h-index
1 publications · 279 citations
1
h-index
1 publications · 30 citations
1
h-index
1–5