Naresh Ganesh Nayak
International Conference on Real-Time and Network Systems · 2016
A researcher in the Science corpus: 1 paper; trusts 1 researcher and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Naresh Ganesh Nayak trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Naresh Ganesh Nayak's perspective
Ordered by how strongly the researchers Naresh Ganesh Nayak trusts endorse each paper. Same corpus, a different order for every researcher.
- Random graphs
- Emergence of Scaling in Random Networks
- Reducibility Among Combinatorial Problems
- Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web
- Spectral partitioning of random graphs (Proceedings IEEE International Conference on Cluster Computing)
- The complexity of massive data set computations
- AND T
- Balanced Allocations
- Property testing and its connection to learning and approximation
- Directed graphs, Hamiltonicity and doubly stochastic matrices
Their papers
- No-wait Packet Scheduling for IEEE Time-sensitive Networks (TSN) (2016) — 344 citations