Description:
Theoretical Computer Science.
|
|
|
10 Reasons Why YOU Should Join Us
|
| |
10 Reasons Why YOU Should Join Us The Most Proven Leisure Internet Business. Business that earns you more money every day. Thanks to the power of the Internet. Ground floor opportunity backed by a highly successful. 1. Free Registration 2. Start Earning As Soon As You Join 3. Weekly Unlimited Income... more »
|
|
|
The simplest way to understand sets.
|
| |
musatov wrote to John Jones, et. al.: ...'May' is the term I strongly prefer. Even in the non-positive case 'may not' is more precise. Usually when a term is defined 'may' is more precise: ...--------------------------- ---------------- please notice illustrations: *example 1* ----------- Equation 1 -----------... more »
|
|
|
Introducing Form1™, a quick and tiny web browser from MeAmI™
|
| |
Only 8.5kb compressed and 36kb single file executable. [link]" Copyright 2009 MeAmI.org "Search for the People!"™ P.S. Attention Developers: I need to figure out how to change the homepage setting with this browser (if it is possible), or does my code too closely rely on MIcrosoft integration?... more »
|
|
|
recent formal proof re: seL4 microkernel
|
| |
I read about this in some computer security forum or magazine: "seL4: Formal verification of an OS kernel" presented at Proceedings of the 22nd ACM Symposium on Operating Systems Principles, Big Sky, MT, USA, October, 2009 Authors: Gerwin Klein, Kevin Elphinstone, Gernot Heiser, June Andronick, David... more »
|
|
|
Math/CompSci Interview Question - Thoughts?
|
| |
I was posed the following question in a technical interview for a Software Engineering position by a major multinational NASDAQ company: [Paraphrasing] "You are given an array of 1,000,000 32-bit integers. One int value x occurs 500,001 times or more in the array. Specify an algorithm to determine x."... more »
|
|
|
Unhashing int64 to string
|
| |
A classic string hashing algorithm can be simply described by the following code (C++ like pseudo code) int64 hash(string s) { int64 hash = 5381; for (i = 0; i < s.length; i++) hash = (hash * 33) XOR s[i]; return hash; ...Is there any known approach to "unhash" a string (consisting no more... more »
|
|
|
|
