The analysis of algorithms
Data structures and network algorithms
Data structures and network algorithms
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Algorithmics: theory & practice
Algorithmics: theory & practice
Separating Nondeterministic Time Complexity Classes
Journal of the ACM (JACM)
Big omega versus the wild functions
ACM SIGACT News
Computer Algorithms: Introduction to Design and Analysis
Computer Algorithms: Introduction to Design and Analysis
Data Structures and Algorithms
Data Structures and Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Big Omicron and big Omega and big Theta
ACM SIGACT News
ACM SIGACT News
Cost-error relationships in A* tree-searching
Journal of the ACM (JACM)
| Hi-index | 0.00 |
In a well-known SIGACT/NEWS paper, Knuth sets forth the asymptotic notation by which we all now live [K76]. He closes his discussion with: "I propose that members of SIGACT (...) adopt the O, Ω and Θ notations as defined above, unless a better alternative can be found reasonably soon". Although one can hardly consider nearly a full decade later as being "reasonably soon", I would like to share with you my thoughts on the subject.