8 citations · 35 across the 17 of their papers we have counts for
4 papers · 1 filter
Sorting Networks On Restricted Topologies
Indranil Banerjee, Dana Richards, Igor Shinkar
The sorting number of a graph with vertices is the minimum depth of a sorting network with inputs and outputs that uses only the edges of the graph to perform comparisons.…
On Coloring Random Subgraphs of a Fixed Graph
Igor Shinkar
Given an arbitrary graph we study the chromatic number of a random subgraph obtained from by removing each edge independently with probability . Studying $χ(…
A Graph-Theoretic Approach to Multitasking
Noga Alon, Jonathan D. Cohen, Biswadip Dey +6
A key feature of neural network architectures is their ability to support the simultaneous interaction among large numbers of units in the learning and processing of representation…
An Queries Adaptive Tester for Unateness
Subhash Khot, Igor Shinkar
We present an adaptive tester for the unateness property of Boolean functions. Given a function the tester makes adaptive queries to the…