4 citations · 4 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2011
Sorting Algorithms with Restrictions
Hakob Aslanyan
Sorting is one of the most used and well investigated algorithmic problem [1]. Traditional postulation supposes the sorting data archived, and the elementary operation as compariso…
cs.DS2011
Interference minimization in physical model of wireless networks
Hakob Aslanyan
Interference minimization problem in wireless sensor and ad-hoc networks is considered. That is to assign a transmission power to each node of a network such that the network is co…