Maleq Khan

According to our database1, Maleq Khan authored at least 42 papers between 2002 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Finding and Counting Tree-Like Subgraphs Using MapReduce.
IEEE Trans. Multi-Scale Computing Systems, 2018

2017
Parallel algorithms for switching edges in heterogeneous graphs.
J. Parallel Distrib. Comput., 2017

Parallel Algorithms for Generating Random Networks with Given Degree Sequences.
International Journal of Parallel Programming, 2017

Efficient algorithms for assortative edge switch in large labeled networks.
Proceedings of the 25th High Performance Computing Symposium, Virginia Beach, VA, USA, April 23, 2017

A parallel algorithm for generating a random graph with a prescribed degree sequence.
Proceedings of the 2017 IEEE International Conference on Big Data, BigData 2017, 2017

2016
Current and Future Challenges in Mining Large Networks: Report on the Second SDM Workshop on Mining Networks and Graphs.
SIGKDD Explorations, 2016

An efficient and scalable algorithmic method for generating large: scale random graphs.
Proceedings of the International Conference for High Performance Computing, 2016

An integrated agent-based approach for modeling disease spread in large populations to support health informatics.
Proceedings of the 2016 IEEE-EMBS International Conference on Biomedical and Health Informatics, 2016

2015
Fast parallel conversion of edge list to adjacency list for large-scale graphs.
Proceedings of the Symposium on High Performance Computing, 2015

A Space-Efficient Parallel Algorithm for Counting Exact Triangles in Massive Networks.
Proceedings of the 17th IEEE International Conference on High Performance Computing and Communications, 2015

A fast parallel algorithm for counting triangles in graphs using dynamic load balancing.
Proceedings of the 2015 IEEE International Conference on Big Data, 2015

2014
Fast Parallel Algorithms for Edge-Switching to Achieve a Target Visit Rate in Heterogeneous Graphs.
Proceedings of the 43rd International Conference on Parallel Processing, 2014


2013
Distributed-memory parallel algorithms for generating massive scale-free networks using preferential attachment model.
Proceedings of the International Conference for High Performance Computing, 2013

PATRIC: a parallel algorithm for counting triangles in massive networks.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2012
Efficient distributed approximation algorithms via probabilistic tree embeddings.
Distributed Computing, 2012

Brief Announcement: A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Poster: Parallel Algorithms for Counting Triangles and Computing Clustering Coefficients.
Proceedings of the 2012 SC Companion: High Performance Computing, 2012

Abstract: Parallel Algorithms for Counting Triangles and Computing Clustering Coefficients.
Proceedings of the 2012 SC Companion: High Performance Computing, 2012

SAHAD: Subgraph Analysis in Massive Networks Using Hadoop.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012


2011
Social Networks.
Proceedings of the Encyclopedia of Parallel Computing, 2011

2010
Beyond Degree Distributions: Local to Global Structure of Social Contact Graphs.
Proceedings of the Advances in Social Computing, 2010

NAP: An Agent-Based Scheme on Reducing Churn-Induced Delays for P2P Live Streaming.
Proceedings of the IEEE Tenth International Conference on Peer-to-Peer Computing, 2010

On Minimizing Average End-to-End Delay in P2P Live Streaming Systems.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Subgraph Enumeration in Large Social Contact Networks Using Parallel Color Coding and Streaming.
Proceedings of the 39th International Conference on Parallel Processing, 2010

2009
Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks.
IEEE Trans. Parallel Distrib. Syst., 2009

Energy-Optimal Distributed Algorithms for Minimum Spanning Trees.
IEEE Journal on Selected Areas in Communications, 2009

Generation and Analysis of Large Synthetic Social Contact Networks.
Proceedings of the 2009 Winter Simulation Conference, 2009

Bi-Criteria Approximation Algorithms for Power-Efficient and Low-Interference Topology Control in Unreliable Ad Hoc Networks.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

A Study of Information Diffusion over a Realistic Social Network Model.
Proceedings of the 12th IEEE International Conference on Computational Science and Engineering, 2009

2008
A fast distributed approximation algorithm for minimum spanning trees.
Distributed Computing, 2008

Energy-optimal distributed algorithms for minimum spanning trees.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Efficient distributed approximation algorithms via probabilistic tree embeddings.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

2007
A simple randomized scheme for constructing low-weight k-connected spanning subgraphs with applications to distributed algorithms.
Theor. Comput. Sci., 2007

An efficient weighted nearest neighbour classifier using vertical data representation.
IJBIDM, 2007

2006
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

2005
Multimedia data transmission and control using active networks.
Computer Communications, 2005

2004
Edge-to-edge measurement-based distributed network monitoring.
Computer Networks, 2004

2003
PINE - Podium Incremental Neighbor Evaluator for Classifying Spatial Data.
Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003

2002
The P-tree algebra.
Proceedings of the 2002 ACM Symposium on Applied Computing (SAC), 2002

k-nearest Neighbor Classification on Spatial Data Streams Using P-trees.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2002


  Loading...