42 citations
- Altai State UniversityRU3 papers
- Federal State Budgetary Institution of Science Federal Scientific Center "Vladikavkaz Scientific Center of the Russian Academy of Sciences"RU2 papers
- Instituto de PescaBR1 paper
- Tver State UniversityRU1 paper
- Universidade Estadual Paulista (Unesp)BR1 paper
- University of LisbonPT1 paper
- University of Massachusetts AmherstUS1 paper
Showing cs.DSShow all
2 papers · 1 filter
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…