Computer Science

Revival

 Revival
Answer more than 30 days after a question was asked as first answer scoring 2 or more. This badge can be awarded multiple times.

earned this badge 7 times.
Looking for memory-efficient way to detect hash collisions
Awarded Aug 5 '20 at 19:48
Time complexity of this solution to N-queens problem
Awarded Mar 21 '20 at 21:35
Are Huffman codes self-synchronizing?
Awarded May 14 '19 at 18:20
Exactly how many clocks does a Computer consists of and how do they synchronize with each other?
Awarded Feb 22 '19 at 5:05
Terminology for reducing runtime of an algorithm by using a property of the problem?
Awarded Jan 22 '19 at 9:15
Difference between ways to compare floating-point numbers
Awarded Nov 28 '16 at 15:26
How to prevent overflow and underflow in the Euclidean distance and Mahalanobis distance
Awarded Aug 29 '16 at 1:46

Others with this badge