◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

N. Singhal

2 papers hereh-index 334 citations14 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • last author2

Across the 2 of 2 papers where every author was matched, so the position is known.

fields
  • cs.DC2

identity via Semantic Scholar / OpenAlex

collaborators
Showing cs.DCShow all

2 papers · 1 filter

cs.DC2018

A Simple and Practical Concurrent Non-blocking Unbounded Graph with Reachability Queries

Bapi Chatterjee, Sathya Peri, Muktikanta Sa +1

Graph algorithms applied in many applications, including social networks, communication networks, VLSI design, graphics, and several others, require dynamic modifications -- additi…

cs.DC2017

Building Efficient Concurrent Graph Object through Composition of List-based Set

Sathya Peri, Muktikanta Sa, Nandini Singhal

In this paper, we propose a generic concurrent directed graph (for shared memory architecture) that is concurrently being updated by threads adding/deleting vertices and edges. The…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.