S. Rao Kosaraju
E323101
S. Rao Kosaraju is a computer scientist known for his contributions to algorithm design and graph theory, including early work on strongly connected components algorithms.
All labels observed (1)
| Label | Occurrences |
|---|---|
| S. Rao Kosaraju canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T3043274 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: S. Rao Kosaraju Context triple: [Robert Tarjan, doctoralStudent, S. Rao Kosaraju]
-
A.
Robert Tarjan
Robert Tarjan is an American computer scientist renowned for his pioneering work in algorithms and data structures, including the development of efficient graph algorithms and the union–find data structure.
-
B.
David S. Johnson
David S. Johnson was a prominent American computer scientist known for his influential work in algorithms and computational complexity, particularly in the study of NP-completeness and approximation algorithms.
-
C.
Jeffrey D. Ullman
Jeffrey D. Ullman is a prominent American computer scientist known for his foundational contributions to database theory, algorithms, and formal languages, and for coauthoring several classic textbooks in computer science.
-
D.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
E.
Richard Karp
Richard Karp is a renowned American computer scientist best known for his foundational work in computational complexity theory and combinatorial algorithms, including the theory of NP-completeness.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: S. Rao Kosaraju Target entity description: S. Rao Kosaraju is a computer scientist known for his contributions to algorithm design and graph theory, including early work on strongly connected components algorithms.
-
A.
Robert Tarjan
Robert Tarjan is an American computer scientist renowned for his pioneering work in algorithms and data structures, including the development of efficient graph algorithms and the union–find data structure.
-
B.
David S. Johnson
David S. Johnson was a prominent American computer scientist known for his influential work in algorithms and computational complexity, particularly in the study of NP-completeness and approximation algorithms.
-
C.
Jeffrey D. Ullman
Jeffrey D. Ullman is a prominent American computer scientist known for his foundational contributions to database theory, algorithms, and formal languages, and for coauthoring several classic textbooks in computer science.
-
D.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
E.
Richard Karp
Richard Karp is a renowned American computer scientist best known for his foundational work in computational complexity theory and combinatorial algorithms, including the theory of NP-completeness.
- F. None of above. chosen
Statements (35)
| Predicate | Object |
|---|---|
| instanceOf |
computer scientist
ⓘ
person ⓘ |
| academicDegree | PhD in computer science ⓘ |
| citizenship |
United States of America
ⓘ
surface form:
United States
|
| countryOfCitizenship | India ⓘ |
| developed | linear-time algorithm for strongly connected components ⓘ |
| educatedAt |
Indian Institute of Technology Kharagpur
ⓘ
University of Wisconsin–Madison ⓘ |
| employer | Johns Hopkins University ⓘ |
| ethnicGroup | Telugu people ⓘ |
| fieldOfWork |
algorithms
ⓘ
computer science ⓘ graph theory ⓘ |
| genre | scientific literature ⓘ |
| hasAcademicAdvisor | Daniel J. Rosenkrantz ⓘ |
| hasResearchInterest |
computational complexity
ⓘ
data structures ⓘ graph algorithms ⓘ pattern matching ⓘ string algorithms ⓘ |
| inspiredWork |
Kosaraju's algorithm
ⓘ
surface form:
Sharir's algorithm for strongly connected components
Tarjan's strongly connected components algorithm ⓘ
surface form:
Tarjan's algorithm for strongly connected components
|
| knownFor |
Kosaraju's algorithm
ⓘ
algorithm for finding strongly connected components in a directed graph ⓘ contributions to algorithm design ⓘ contributions to graph theory ⓘ |
| languageOfWorkOrName | English ⓘ |
| memberOf | Department of Computer Science at Johns Hopkins University ⓘ |
| nativeLanguage | Telugu ⓘ |
| notableStudent | Subhash Suri ⓘ |
| notableWork |
papers on graph algorithms
ⓘ
papers on string matching ⓘ |
| occupation | university professor ⓘ |
| positionHeld | professor of computer science at Johns Hopkins University ⓘ |
| workLocation | Baltimore ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: S. Rao Kosaraju Description of subject: S. Rao Kosaraju is a computer scientist known for his contributions to algorithm design and graph theory, including early work on strongly connected components algorithms.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.