The SCEAS System
| |||||||

## Search the dblp DataBase
Sanjeev Saxena:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Sanjeev Saxena, P. C. P. Bhatt, V. C. Prasad
**On Parallel Sorting and Addition with Concurrent Writes.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1988, pp:143-153 [Conf] - S. Das, Sanjeev Saxena
**Parallel algorithms for single row routing in narrow streets.**[Citation Graph (0, 0)][DBLP] VLSI Design, 1995, pp:13-18 [Conf] - Sanjeev Saxena
**Parallel Integer Sorting and Simulation Amongst CRCW Models.**[Citation Graph (0, 0)][DBLP] Acta Inf., 1996, v:33, n:7, pp:607-619 [Journal] - G. Sajith, Sanjeev Saxena
**Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2000, v:27, n:2, pp:187-197 [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:249-265 [Journal] - V. Yugandhar, Sanjeev Saxena
**Parallel algorithms for separable permutations.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:146, n:3, pp:343-364 [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:551-565 [Journal] - P. C. P. Bhatt, Krzysztof Diks, Torben Hagerup, V. C. Prasad, Tomasz Radzik, Sanjeev Saxena
**Improved Deterministic Parallel Integer Sorting**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1991, v:94, n:1, pp:29-47 [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:19-32 [Journal] - K. V. R. C. N. Kishore, Sanjeev Saxena
**An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:75, n:4, pp:145-151 [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:303-308 [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] - Sanjeev Saxena
**Two-Coloring Linked Lists is NC^1-Complete for Logarithmic Space.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1994, v:49, n:2, pp:73-76 [Journal] - Sanjeev Saxena, N. Malahal Rao
**Parallel Algorithms for Connectivity Problems on Interval Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:56, n:1, pp:37-44 [Journal] - Sudarshan Banerjee, Sanjeev Saxena
**Parallel Algorithms for Finding the Most Vital Edge in Weighted Graphs.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 1997, v:46, n:1, pp:101-104 [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:775-785 [Journal] - Sanjeev Saxena, Pramod Chandra P. Bhatt, V. C. Prasad
**On Parallel Prefix Computation.**[Citation Graph (0, 0)][DBLP] Parallel Processing Letters, 1994, v:4, n:, pp:429-436 [Journal] - Sanjeev Saxena, P. C. P. Bhatt, V. C. Prasad
**Efficient VLSI Parallel Algorithm for Delaunay Triangulation on Orthogonal Tree Network in Two and Three Dimensions.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1990, v:39, n:3, pp:400-404 [Journal]
Search in 0.043secs, Finished in 0.045secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |