Search for Topics All Reviews
	Browse All Reviews > Theory Of Computation (F)     Theory Of Computation (F) See Reviews     F.0 General (128) F.1 Computation By Abstract Devices   General (72)   Models Of Computation (274)   Modes Of Computation (13)   Complexity Measures And Classes (262)   Miscellaneous (7) F.2 Analysis Of Algorithms And Problem Complexity   General (322)   Numerical Algorithms And Problems (389)   Nonnumerical Algorithms And Problems (667)   Tradeoffs between Complexity Measures (27)   Miscellaneous (23) F.2 Analysis Of Algorithms And Problem Complexity (cont.) F.3 Logics And Meanings Of Programs   General (45)   Specifying And Verifying And Reasoning About Programs (35)   Semantics Of Programming Languages (316)   Studies Of Program Constructs (119)   Miscellaneous (0) F.4 Mathematical Logic And Formal Languages   General (70)   Mathematical Logic (8)   Grammars And Other Rewriting Systems (152)   Formal Languages (197)   Miscellaneous (13) F.m Miscellaneous (26)               Reviews limited to: All General Terms Algorithms Design Documentation Economics Experimentation Human factors Languages Legal Aspects Management Measurement Performance Reliability Security Standardization Theory Verification     Reviews in category "Theory Of Computation (F)":  BlockQuicksort: avoiding branch mispredictions in Quicksort Edelkamp S., Weiß A.  Journal of Experimental Algorithmics 24(1): 1-22, 2019. Type: Article TSLAM: A trust-enabled self-learning agent model for service matching in the cloud market Li W., Cao J., Qian S., Buyya R.  ACM Transactions on Autonomous and Adaptive Systems 13(4): 1-41, 2019. Type: Article Competitive programming in Python: 128 algorithms to develop your coding skills Dürr C., Vie J.,  Cambridge University Press, Cambridge, UK, 2021. 264 pp. Type: Book (978-1-108716-82-6) Near optimal online algorithms and fast approximation algorithms for resource allocation problems Devanur N., Jain K., Sivan B., Wilkens C.  Journal of the ACM 66(1): 1-41, 2019. Type: Article  On the foundations of computing Primiero G.,  Oxford University Press, Oxford, UK, 2020. 320 pp. Type: Book (978-0-198835-65-3) more... Related Topics F.1.1 Models Of Computation   - Mathematical Logic F.2 Analysis Of Algorithms And Problem Complexity   - Logic Design   - Integrated Circuits   - Complexity Measures And Classes F.2.1 Numerical Algorithms And Problems   - Numerical Analysis   - Mathematical Software   - Symbolic and Algebraic Manipulation    more
	Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2022 ThinkLoud, Inc. Terms of Use | Privacy Policy