Nirman Kumar
Nirman Kumar
Assistant Professor in Computer Science at the University of Memphis
Verified email at memphis.edu - Homepage
Title
Cited by
Cited by
Year
A rewriting based model for probabilistic distributed object systems
N Kumar, K Sen, J Meseguer, G Agha
International Conference on Formal Methods for Open Object-Based Distributed …, 2003
542003
Fast compaction algorithms for NoSQL databases
M Ghosh, I Gupta, S Gupta, N Kumar
2015 IEEE 35th International Conference on Distributed Computing Systems …, 2015
302015
Efficient Algorithms for k-Regret Minimizing Sets
PK Agarwal, N Kumar, S Sintos, S Suri
arXiv preprint arXiv:1702.01446, 2017
292017
Range-max queries on uncertain data
PK Agarwal, N Kumar, S Sintos, S Suri
Journal of Computer and System Sciences 94, 118-134, 2018
282018
Hyperplane separability and convexity of probabilistic point sets
M Fink, J Hershberger, N Kumar, S Suri
Journal of Computational Geometry 8 (2), 32-57, 2017
252017
Probabilistic rewrite theories: Unifying models, logics and tools
N Kumar, K Sen, J Meseguer, G Agha
Technical report UIUCDCS, 2003
252003
Faster Approximation Algorithm for the k-Regret Minimizing Set and Related Problems
N Kumar, S Sintos
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and …, 2018
152018
Down the rabbit hole: Robust proximity search and density estimation in sublinear space
S Har-Peled, N Kumar
SIAM Journal on Computing 43 (4), 1486-1511, 2014
132014
Approximating minimization diagrams and generalized proximity search
S Har-Peled, N Kumar
SIAM Journal on Computing 44 (4), 944-974, 2015
112015
Approximate nearest neighbor search for low-dimensional queries
S Har-Peled, N Kumar
SIAM Journal on Computing 42 (1), 138-159, 2013
102013
On the complexity of error explanation
N Kumar, V Kumar, M Viswanathan
International Workshop on Verification, Model Checking, and Abstract …, 2005
82005
Fault tolerant clustering revisited
N Kumar, B Raichel
arXiv preprint arXiv:1307.2520, 2013
62013
Probabilistic rewrite theories
S Koushik, N Kumar, J Meseguer, G Agha
Technical Report 2343, University of Illinois at Urbana Champaign, 2003
52003
Joint sensing duty cycle scheduling for heterogeneous coverage guarantee
KS Liu, T Mayer, HT Yang, E Arkin, J Gao, M Goswami, MP Johnson, ...
IEEE INFOCOM 2017-IEEE Conference on Computer Communications, 1-9, 2017
42017
Space exploration via proximity search
S Har-Peled, N Kumar, DM Mount, B Raichel
Discrete & Computational Geometry 56 (2), 357-376, 2016
42016
Containment and evasion in stochastic point data
N Kumar, S Suri
LATIN 2016: Theoretical Informatics, 576-589, 2016
32016
Robust proximity search for balls using sublinear space
S Har-Peled, N Kumar
Algorithmica 80 (1), 279-299, 2018
12018
Robust proximity search for balls using sublinear space
S Har-Peled, N Kumar
Algorithmica 80 (1), 279-299, 2018
12018
Probabilistic rewrite theories
N Kumar, K Sen, J Meseguer, G Agha
Technical Report UIUCDCS, 2003
12003
On the minimum edge size for 2-colorability and realizability of hypergraphs by axis-parallel rectangles.
N Kumar
CCCG, 226-231, 2017
2017
The system can't perform the operation now. Try again later.
Articles 1–20