Skip to main content
RandomPerfectHashFunction's user avatar
RandomPerfectHashFunction's user avatar
RandomPerfectHashFunction's user avatar
RandomPerfectHashFunction
  • Member for 5 years, 11 months
  • Last seen more than 3 years ago
4 votes
Accepted

Efficiently convert an NFA with multiple $\varepsilon$ edges and accepting states into a regular expression

4 votes
Accepted

BST representation of Hash Tables

2 votes

Closest Pair Algorithm

2 votes
Accepted

Polynomial Complexity (Relative to the Size of the Input)

2 votes

Find the language an NFA recognizes

2 votes

How to know if a code is Huffman or not without having the probability of each codeword?

2 votes

Data structure for a tree of points moving in space

2 votes
Accepted

Conversion from octal numerical system to binary numerical system

2 votes

Combinations and Permutations of M sets of distinct items?

1 vote

How do you solve this [1,5,9,4] pair numbers problem?

1 vote

Are there deterministic and/or non-interactive zero-knowledge proofs?

1 vote

Which order is "lexicographic order"?

0 votes

challenge: Closing hash, linear probing, probe length 1

0 votes
Accepted

Check if one condition includes another

0 votes

Prove that the following language is not regular: $\{0^i1^j : i \neq j\}$

0 votes

Converting DFA to Regular Expression Using State Removal

0 votes
Accepted

Byte addressable vs Word addressable

-1 votes

Can this system of polynomial equations be solved in polynomial time?

-1 votes

Can area-partitioning lose included points due to floating point precision?