◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. Chaudhuri

7 papers hereh-index 11476 citations40 works total

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

author position
  • middle author5
  • last author2

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

fields
  • cs.DC4
  • cs.RO3
same name
  • S. Chaudhuri — 30 papers, h 25
  • S. Chaudhuri — 27 papers, h 47
  • S. Chaudhuri — 19 papers, h 16
  • S. Chaudhuri — 10 papers, h 81
  • S. Chaudhuri — 8 papers, h 19
  • S. Chaudhuri — 7 papers, h 9

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20152020
most citedCrash tolerant gathering on grid by asynchronous oblivious robots

5 citations · 9 across the 5 of their papers we have counts for

collaborators
Showing cs.DCShow all

4 papers · 1 filter

cs.DC2017

Uniform Circle Formation by Transparent Fat Robots

Moumita Mondal, Sruti Gan Chaudhuri

This paper addresses the problem of Uniform Circle Formation by n > 1 transparent disc robots (fat robots). The robots execute repetitive cycles of the states look-compute-move in…

cs.DC2017

Line Formation by Fat Robots under Limited Visibility

Arijit Sil, Sruti Gan Chaudhuri

This paper proposes a distributed algorithm for a set of tiny unit disc shaped robot to form a straight line. The robots are homoge- neous, autonomous, anonymous. They observe thei…

cs.DC2017★ 5 cited

Crash tolerant gathering on grid by asynchronous oblivious robots

Kaustav Bose, Ranendu Adhikary, Sruti Gan Chaudhuri +1

Consider a system of autonomous mobile robots initially randomly deployed on the nodes of an anonymous finite grid. A gathering algorithm is a sequence of moves to be executed inde…

cs.DC2015★ 3 cited

Mutual Visibility by Luminous Robots Without Collisions

G. A. Di Luna, P. Flocchini, S. Gan Chaudhuri +3

Consider a finite set of identical computational entities that can move freely in the Euclidean plane operating in Look-Compute-Move cycles. Let p(t) denote the location of entity…

◍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.