Computer Science

Necromancer

 Necromancer
Answer a question more than 60 days later with score of 5 or more. This badge can be awarded multiple times.
Awarded 517 times.
Dynamic Programming vs Memoization
Awarded Nov 27 at 16:21
Why is quicksort better than other sorting algorithms in practice?
Awarded Nov 12 at 14:20
Why are Red-Black trees so popular?
Awarded Nov 2 at 20:27
What are the advantages of x86 CPUs over ARM?
Awarded Oct 30 at 18:27
Sorting functions by asymptotic growth
Awarded Oct 19 at 11:09
The equivalence relations cover problem (in graph theory)
Awarded Sep 26 at 4:41
Smallest set of features that would make relational algebra Turing complete
Awarded Sep 25 at 16:11
A faster, leaner JavaScript for scientific computing: what features should I keep?
Awarded Sep 14 at 5:27
Quadratic probing maximum load factor with $c_1 = c_2 = 0.5$ to guarantee successful insertion
Awarded Sep 11 at 5:26
What does the complexity class $\mathsf{XP}$ stand for?
Awarded Jul 26 at 10:05
Understanding pipeline stalls (bubbles) based on stage
Awarded Jul 11 at 10:35
Time complexity for count-change procedure in SICP
Awarded Jul 3 at 9:05
What is a cache write miss?
Awarded Jun 23 at 21:55
Show that P is closed against the Kleene star
Awarded Apr 23 at 15:55
Can a total programming language be Turing-complete?
Awarded Apr 18 at 18:16
Minimum number of clues to fully specify any sudoku?
Awarded Apr 7 at 15:10
Why is the commit phase in PBFT necessary?
Awarded Apr 6 at 0:20
Formal program verification in practice
Awarded Mar 3 at 20:57
Why is it best to use a prime number as a mod in a hashing function?
Awarded Feb 24 at 1:32
motivation and idea of defining non-deterministic Turing machine
Awarded Jan 12 at 9:42
Equivalence of data-flow analysis, abstract interpretation and type inference?
Awarded Jan 10 at 4:42
Equivalence of data-flow analysis, abstract interpretation and type inference?
Awarded Jan 10 at 4:42
Simple graph canonization algorithm
Awarded Jan 3 at 0:08
End-Of-The-Line Augmented Problem of PPAD
Awarded Jan 2 at 18:09
SAT algorithm for determining if a graph is disjoint
Awarded Dec 4, 2022 at 12:04
Are all Turing machines Turing complete?
Awarded Nov 7, 2022 at 9:42
How to prove that a grammar is unambiguous?
Awarded Oct 17, 2022 at 20:56
Why is the A* search heuristic optimal even if it underestimates costs?
Awarded Oct 11, 2022 at 3:26
A* optimality of the expanded node
Awarded Oct 8, 2022 at 23:11
What is a "trap" in the context of system virtualization?
Awarded Sep 9, 2022 at 14:03
Algorithm Request: "Shortest non-existing substring over given alphabet"
Awarded Sep 8, 2022 at 21:22
If the two generals problem is unsolvable how can we human beings agree on things?
Awarded Aug 31, 2022 at 16:15
How to prove: If $\textsf{EXP} \subseteq \textsf{P/poly} $ then $\textsf{EXP} = \Sigma^p_2$
Awarded Aug 22, 2022 at 13:04
Is the language of words containing equal number of 001 and 100 regular?
Awarded Aug 22, 2022 at 11:11
What exactly is Symbolic Model Checking?
Awarded Jul 25, 2022 at 13:33
Why Do Computers Use the Binary Number System (0,1)?
Awarded Jul 24, 2022 at 16:08
Numerical stability of linear interpolation
Awarded Jul 19, 2022 at 14:05
Guided Backpropagation in Deep Neural Networks
Awarded Jul 18, 2022 at 6:32
Are there any optimization problems in P whose decision version is hard?
Awarded Jul 5, 2022 at 8:35
Are there improvements on Dana Angluin's algorithm for learning regular sets
Awarded Jun 24, 2022 at 22:11
Do functions with slower growth than inverse Ackermann appear in runtime bounds?
Awarded Jun 17, 2022 at 0:21
Do all recursive problems have optimal substructure?
Awarded Jun 13, 2022 at 17:04
Balance factor changes after local rotations in AVL tree
Awarded Jun 3, 2022 at 14:57
Is it decidable if a language described by number of occurences is regular?
Awarded May 31, 2022 at 11:11
What is the difference between R precision and precision at K?
Awarded May 30, 2022 at 9:48
What is the difference between the fundamental matrix and the essential matrix?
Awarded May 10, 2022 at 16:48
What is required for universal analogue computation?
Awarded Apr 15, 2022 at 18:34
How can I solve this constrained assignment problem?
Awarded Mar 18, 2022 at 17:15
Infinite Language vs. finite language
Awarded Mar 16, 2022 at 19:40
Difference between Lamport timestamps and Vector clocks
Awarded Mar 12, 2022 at 2:31
Difference between Lamport timestamps and Vector clocks
Awarded Mar 12, 2022 at 2:31
What edges are not in any MST?
Awarded Mar 4, 2022 at 23:21
Huffman Coding vs LZW Algorithm
Awarded Mar 3, 2022 at 11:32
How to measure "sortedness"
Awarded Mar 1, 2022 at 22:40
What's the difference between Adaptive Control and a Kalman Filter?
Awarded Feb 15, 2022 at 6:04
Find median of unsorted array in $O(n)$ time
Awarded Feb 11, 2022 at 17:30
How to simulate backreferences, lookaheads, and lookbehinds in finite state automata?
Awarded Feb 8, 2022 at 8:31
Regular expression for strings that begin with 0 and contain an equal number of 01 and 10 substrings
Awarded Jan 25, 2022 at 20:12
Context-free grammar for language with unequal numbers of a and b
Awarded Jan 12, 2022 at 17:10
Is subtype polymorphism a kind of ad hoc polymorphism?
Awarded Jan 10, 2022 at 0:18
1
2 3 4 5
…
9

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.