Skip to main content
Computer Science
Vladislav Bezhentsev's user avatar
Vladislav Bezhentsev's user avatar
Vladislav Bezhentsev's user avatar
Vladislav Bezhentsev
  • Member for 4 years, 5 months
  • Last seen more than a month ago
Profile Activity
Stats
489
reputation
5k
reached
18
answers
4
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
2
silver badges
8
bronze badges
Top tags
View all tags
15
Score
14
Posts
64
Posts %
8
Score
3
Posts
14
Posts %
4
Score
4
Posts
18
Posts %
4
Score
2
Posts
9
Posts %
3
Score
2
Posts
9
Posts %
3
Score
2
Posts
9
Posts %
Top posts
View all questions and answers
answer
3
How to extend Bellman-Ford to solve the $k$ shortest path routing?
Apr 16, 2020
answer
3
Is there a better-than-brute-force algorithm to generate a graph whose relation is string edit distance=1?
Apr 19, 2020
answer
3
Algorithm for cyclic $n$-string Hamming distance with constant sized language $\Sigma$
Nov 6, 2020
answer
3
Number of vertices and edges lies on the boundary of bounded cells in line arrangement
Nov 12, 2020
question
2
Automated algorithm design
Oct 25, 2020
question
2
Data structure for querying maximum of a rolling total
May 7, 2023
question
2
Is it NP-hard to decide the existence of n subsets picked from n lists of subsets the union of which contains at most s elements?
May 11, 2023
answer
2
Findind The n/lgn intermidiate values in an unsorted array with asymptotic run time of $\Theta(n)$ SELECT algorithm
Apr 16, 2020
answer
2
Understanding depth-limited BFS time complexity
Apr 19, 2020
answer
2
If there is no Hamiltonian path in a DAG then there are at least two different Topological sorts
Nov 8, 2020