3 citations · 5 across the 2 of their papers we have counts for
3 papers
cs.NI2009
Network congestion control using NetFlow
Maxim A. Kolosovskiy, Elena N. Kryuchkova
The goal of congestion control is to avoid congestion in network elements. A network element is congested if it is being offered more traffic than it can process. To detect such si…
cs.DS2009★ 2 cited
Simple implementation of deletion from open-address hash table
Maxim Kolosovskiy
Deletion from open-address hash table is not so easy as deletion from chained hash table, because in open-address table we can't simply mark a slot containing deleted key as empty.…
cs.DS2009★ 3 cited
Data structure for representing a graph: combination of linked list and hash table
Maxim A. Kolosovskiy
In this article we discuss a data structure, which combines advantages of two different ways for representing graphs: adjacency matrix and collection of adjacency lists. This data…