Maximize Performance with this One Weird Trick or: Cache-Oblivious Data Structures Computer Science |
- Maximize Performance with this One Weird Trick or: Cache-Oblivious Data Structures
- How to fuzz custom functions using libFuzz?
- Computational complexity of developing a program
Maximize Performance with this One Weird Trick or: Cache-Oblivious Data Structures Posted: 05 Feb 2018 05:59 PM PST |
How to fuzz custom functions using libFuzz? Posted: 05 Feb 2018 10:10 PM PST I am researching the topic of fuzzing, specifically I am working with All the examples I see online use the But, what if I want to fuzz my own functions, say: How and why would I make use of the Another question that bothers me is that fact that I don't understand what is being passed in the Thank you. BTW, if you want to learn more about fuzzing, here's a great tutorial: https://github.com/Dor1s/libfuzzer-workshop [link] [comments] |
Computational complexity of developing a program Posted: 05 Feb 2018 08:49 AM PST After reading about complexity classes (P, NP, PSPACE, etc), I got curious, how complex is programming itself? Specifically, creating a program out of a set of definitions or an algorithm with defined inputs and outputs. And what if efficiency should also be considered and always be the best (e.g. n*log(n) sorting instead of n2 )? [link] [comments] |
You are subscribed to email updates from Computer Science: Theory and Application. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States |
No comments:
Post a Comment