dblp.uni-trier.dewww.uni-trier.de

Sanjeev Saxena Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
19EESanjeev Saxena: Dominance made simple. Inf. Process. Lett. 109(9): 419-421 (2009)
2005
18EEV. Yugandhar, Sanjeev Saxena: Parallel algorithms for separable permutations. Discrete Applied Mathematics 146(3): 343-364 (2005)
2003
17EEG. Sajith, Sanjeev Saxena: Local Nature of Brooks' Colouring for Degree 3 Graphs. Graphs and Combinatorics 19(4): 551-565 (2003)
16EEG. Sajith, Sanjeev Saxena: Fast parallel edge colouring of graphs. J. Parallel Distrib. Comput. 63(9): 775-785 (2003)
2000
15EEG. Sajith, Sanjeev Saxena: Optimal Sublogarithmic Time Parallel Algorithms on Rooted Forests. Algorithmica 27(2): 187-197 (2000)
14EEK. V. R. C. N. Kishore, Sanjeev Saxena: An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs. Inf. Process. Lett. 75(4): 145-151 (2000)
1999
13 G. Sajith, Sanjeev Saxena: Parallel Vertex Colouring of Interval Graphs. Int. J. Found. Comput. Sci. 10(1): 19-32 (1999)
1997
12 Sudarshan Banerjee, Sanjeev Saxena: Parallel Algorithms for Finding the Most Vital Edge in Weighted Graphs. J. Parallel Distrib. Comput. 46(1): 101-104 (1997)
1996
11 Sanjeev Saxena: Parallel Integer Sorting and Simulation Amongst CRCW Models. Acta Inf. 33(7): 607-619 (1996)
10EEG. 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
9EES. Das, Sanjeev Saxena: Parallel algorithms for single row routing in narrow streets. VLSI Design 1995: 13-18
8EEG. 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)
7EESanjeev Saxena, N. Malahal Rao: Parallel Algorithms for Connectivity Problems on Interval Graphs. Inf. Process. Lett. 56(1): 37-44 (1995)
1994
6 Sanjeev Saxena: Two-Coloring Linked Lists is NC^1-Complete for Logarithmic Space. Inf. Process. Lett. 49(2): 73-76 (1994)
5 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)
4 Sanjeev Saxena, Pramod Chandra P. Bhatt, V. C. Prasad: On Parallel Prefix Computation. Parallel Processing Letters 4: 429-436 (1994)
1991
3 P. C. P. Bhatt, Krzysztof Diks, Torben Hagerup, V. C. Prasad, Tomasz Radzik, Sanjeev Saxena: Improved Deterministic Parallel Integer Sorting Inf. Comput. 94(1): 29-47 (1991)
1990
2 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. IEEE Trans. Computers 39(3): 400-404 (1990)
1988
1EESanjeev Saxena, P. C. P. Bhatt, V. C. Prasad: On Parallel Sorting and Addition with Concurrent Writes. FSTTCS 1988: 143-153

Coauthor Index

1Sudarshan Banerjee [12]
2P. C. P. Bhatt [1] [2] [3]
3Pramod Chandra P. Bhatt [4]
4S. Das [9]
5Krzysztof Diks [3]
6Torben Hagerup [3]
7K. V. R. C. N. Kishore [14]
8V. C. Prasad [1] [2] [3] [4]
9Tomasz Radzik [3]
10N. Malahal Rao [7]
11G. Sajith [5] [8] [10] [13] [15] [16] [17]
12V. Yugandhar [18]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)