Chandra Sekharan
Chandra Sekharan
Professor of Computer Science, Loyola University of Chicago
Verified email at luc.edu
Title
Cited by
Cited by
Year
DST-a routing protocol for ad hoc networks using distributed spanning trees
S Radhakrishnan, G Racherla, CN Sekharan, NSV Rao, SG Batsell
WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No …, 1999
1161999
Multicast routing with delay and delay variation constraints for collaborative applications on overlay networks
SM Banik, S Radhakrishnan, CN Sekharan
IEEE Transactions on Parallel and Distributed Systems 18 (3), 421-431, 2007
512007
Solving the all‐pair shortest path query problem on interval and circular‐arc graphs
DZ Chen, DT Lee, R Sridhar, CN Sekharan
Networks: An International Journal 31 (4), 249-258, 1998
511998
NC algorithms for recognizing chordal graphs and k trees
N Chandrasekharan, SS Iyengar
IEEE Transactions on Computers 37 (10), 1178-1183, 1988
261988
Protocol for dynamic ad-hoc networks using distributed spanning trees
S Radhakrishnan, G Racherla, CN Sekharan, NSV Rao, SG Batsell
Wireless Networks 9 (6), 673-686, 2003
242003
Fast parallel algorithms for tree decomposing and parsing partial k-trees
N Chandrasekharan, ST Hedetniemi
Proc. 26th Annual Allerton Conference on Communication, Control, and …, 1988
211988
On compressing massive streaming graphs with Quadtrees
M Nelson, S Radhakrishnan, A Chatterjee, CN Sekharan
2015 IEEE International Conference on Big Data (Big Data), 2409-2417, 2015
202015
Comparative study and evaluation of online ad-blockers
EL Post, CN Sekharan
2015 2nd International Conference on Information Science and Security (ICISS …, 2015
192015
Queryable compression on streaming social networks
M Nelson, S Radhakrishnan, A Chatterjee, CN Sekharan
2017 IEEE International Conference on Big Data (Big Data), 988-993, 2017
172017
Distributed floor control protocols for computer collaborative applications on overlay networks
SM Banik, S Radhakrishnan, T Zheng, CN Sekharan
2005 International Conference on Collaborative Computing: Networking …, 2005
162005
Unified all-pairs shortest path algorithms in the chordal hierarchy
K Han, CN Sekharan, R Sridhar
Discrete Applied Mathematics 77 (1), 59-71, 1997
161997
Multicast routing with delay and delay variation constraints for multimedia applications
SM Banik, S Radhakrishnan, CN Sekharan
IEEE International Conference on High Speed Networks and Multimedia …, 2004
152004
Efficient parallel algorithms for finding chordless cycles in graphs
N Chandrasekharan, VS Lakshmanan, M Medidi
Parallel Processing Letters 3 (02), 165-170, 1993
131993
Fast parallel reordering and isomorphism testing of k-trees
D Greco
Algorithmica 32 (1), 61-72, 2008
122008
AHighly dynamic destinationsequenced distance-vector routing (dsdv) for mobile computers
BPP CE, P Bhagwat
Proceedings of the Conference on Communications Architectures, Protocols and …, 1994
121994
On the number of independent sets of nodes in a tree
R Dutton, N Chandrasekharan, R Brigham
Fibonacci Quarterly 31 (2), 98, 1993
111993
Isomorphism testing of k-trees is in NC, for fixed k
N Chandrasekharan
Information Processing Letters 34 (6), 283-287, 1990
111990
A distributed rerouting algorithm for mobile-mobile connections in connection-oriented networks
G Racherla, S Radhakrishnan, CN Sekharan
Proceedings 7th International Conference on Computer Communications and …, 1998
81998
Load balancing methods for ray tracing and binary tree computing using PVM
CN Sekharan, V Goel, R Sridhar
Parallel computing 21 (12), 1963-1978, 1995
81995
Efficient algorithms for shortest distance queries on interval, directed path and circular arc graphs
R Sridhar, D Joshi, N Chandrasekharan
Proceedings of the 5th International Conference on Computing and Information …, 1993
81993
The system can't perform the operation now. Try again later.
Articles 1–20