| |
| 2004 | ||
|---|---|---|
| 9 | EE | Saju Jude Dominic, G. Sajith: The Random Buffer Tree : A Randomized Technique for I/O-efficient Algorithms CoRR cs.DS/0404028: (2004) |
| 8 | EE | Saju Jude Dominic, G. Sajith: The Persistent Buffer Tree : An I/O-efficient Index for Temporal Data CoRR cs.GL/0404033: (2004) |
| 2003 | ||
| 7 | EE | G. Sajith, Sanjeev Saxena: Local Nature of Brooks' Colouring for Degree 3 Graphs. Graphs and Combinatorics 19(4): 551-565 (2003) |
| 6 | EE | G. Sajith, Sanjeev Saxena: Fast parallel edge colouring of graphs. J. Parallel Distrib. Comput. 63(9): 775-785 (2003) |
| 2000 | ||
| 5 | EE | G. Sajith, Sanjeev Saxena: Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests. Algorithmica 27(2): 187-197 (2000) |
| 1999 | ||
| 4 | G. Sajith, Sanjeev Saxena: Parallel Vertex Colouring of Interval Graphs. Int. J. Found. Comput. Sci. 10(1): 19-32 (1999) | |
| 1996 | ||
| 3 | EE | G. Sajith, Sanjeev Saxena: Optimal Parallel Algorithm for Brooks' Colouring Bounded Degree Graphs in Logarithmic Time on EREW PRAM. Discrete Applied Mathematics 64(3): 249-265 (1996) |
| 1995 | ||
| 2 | EE | G. Sajith, Sanjeev Saxena: Corrigendum: Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees. Inf. Process. Lett. 54(5): 305 (1995) |
| 1994 | ||
| 1 | G. Sajith, Sanjeev Saxena: Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees. Inf. Process. Lett. 49(6): 303-308 (1994) | |
| 1 | Saju Jude Dominic | [8] [9] |
| 2 | Sanjeev Saxena | [1] [2] [3] [4] [5] [6] [7] |