
Search the dblp DataBase
G. Sajith:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 G. Sajith, Sanjeev Saxena
Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests. [Citation Graph (0, 0)][DBLP] Algorithmica, 2000, v:27, n:2, pp:187197 [Journal]
 Saju Jude Dominic, G. Sajith
The Random Buffer Tree : A Randomized Technique for I/Oefficient Algorithms [Citation Graph (0, 0)][DBLP] CoRR, 2004, v:0, n:, pp: [Journal]
 Saju Jude Dominic, G. Sajith
The Persistent Buffer Tree : An I/Oefficient Index for Temporal Data [Citation Graph (0, 0)][DBLP] CoRR, 2004, v:0, n:, pp: [Journal]
 G. Sajith, Sanjeev Saxena
Optimal Parallel Algorithm for Brooks' Colouring Bounded Degree Graphs in Logarithmic Time on EREW PRAM. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:64, n:3, pp:249265 [Journal]
 G. Sajith, Sanjeev Saxena
Local Nature of Brooks' Colouring for Degree 3 Graphs. [Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2003, v:19, n:4, pp:551565 [Journal]
 G. Sajith, Sanjeev Saxena
Parallel Vertex Colouring of Interval Graphs. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 1999, v:10, n:1, pp:1932 [Journal]
 G. Sajith, Sanjeev Saxena
Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1994, v:49, n:6, pp:303308 [Journal]
 G. Sajith, Sanjeev Saxena
Corrigendum: Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:54, n:5, pp:305 [Journal]
 G. Sajith, Sanjeev Saxena
Fast parallel edge colouring of graphs. [Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 2003, v:63, n:9, pp:775785 [Journal]
Search in 0.024secs, Finished in 0.025secs
