Chandra N. Sekharan

Author Info

Name	Affiliation	Papers
CHANDRA N. SEKHARAN	Loyola Univ, Dept Comp Sci, Chicago, IL 60611 USA	26
Collaborators	Citations	PageRank
37	105	12.77
Referers	Referees	References
231	460	252

Search Limit

100460

Publications (26 rows)

Collaborators (37 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Queryable Compression on Time-evolving Web and Social Networks with Streaming	0	0.34	2022
Billion-Scale Matrix Compression and Multiplication with Implications in Data Mining	0	0.34	2019
Algorithms on Compressed Time-Evolving Graphs	0	0.34	2019
Merkle-Tree Based Approach For Ensuring Integrity Of Electronic Medical Records	0	0.34	2018
Queryable Compression on Time-Evolving Social Networks with Streaming	0	0.34	2018
Queryable Compression On Streaming Social Networks	0	0.34	2017
A probabilistic graphical model for learning as search	0	0.34	2017
On Compressing Massive Streaming Graphs With Quadtrees	6	0.49	2015
Connecting the dots: Triangle completion and related problems on large data sets using GPUs	2	0.37	2014
On the heterogeneous postal delivery model for multicasting.	0	0.34	2011
Delay Constrained Subtree Homeomorphism Problem with Applications	0	0.34	2011
GroupSpeak: High-level Language Extension for Workflow Capability	0	0.34	2009
Implementation of Distributed Floor Control Protocols on Overlay Networks	2	0.46	2008
Multicast Routing with Delay and Delay Variation Constraints for Collaborative Applications on Overlay Networks	22	1.06	2007
Distributed floor control protocols for computer collaborative applications on overlay networks	6	0.52	2005
Interaction of Wireless TCP Schemes and Rerouting: Analytical Models and Simulation	0	0.34	2003
Protocol for dynamic ad-hoc networks using distributed spanning trees	9	0.63	2003
Performance evaluation of wireless TCP with rerouting in mobile networks	1	0.35	2003
Fast Parallel Reordering and Isomorphism Testing of k-Trees	6	0.46	2002
Scalability and Performance of Multi-threaded Algorithms for International Fare Construction on High-Performance Machines	0	0.34	2002
DST-A routing protocol for ad hoc networks using distributed spanning trees.	16	1.70	1999
Solving the all-pair shortest path query problem on interval and circular-arc graphs	26	1.01	1998
Unified all-pairs shortest path algorithms in the chordal hierarchy	6	0.52	1997
MasPaWS — a Massively Parallel War Simulator	1	0.37	1996
Space-Time Trade-Offs In The Relative Unranking Of Binary Trees	0	0.34	1996
Load balancing methods for ray tracing and binary tree computing using PVM	2	0.43	1995