Name
Affiliation
Papers
KISHORI M. KONWAR
Department of Computer Science and Engineering, University of Connecticut, Unit 2155, Storrs, CT 06269, United States
38
Collaborators
Citations 
PageRank 
48
107
17.49
Referers 
Referees 
References 
236
709
373
Search Limit
100709
Title
Citations
PageRank
Year
CassandrEAS: Highly Available and Storage-Efficient Distributed Key-Value Store with Erasure Coding00.342020
Fast Lean Erasure-Coded Atomic Memory Object.00.342019
Formalizing and Implementing Distributed Ledger Objects.30.412018
The SNOW Theorem Revisited.00.342018
ARES: Adaptive, Reconfigurable, Erasure coded, atomic Storage.00.342018
A Layered Architecture for Erasure-Coded Consistent Distributed Storage.10.362017
RADON: Repairable Atomic Data Object in Networks.10.352016
Evaluating reliability techniques in the master-worker paradigm00.342016
Storage-Optimized Data-Atomic Algorithms for Handling Erasures and Errors in Distributed Storage Systems20.382016
LCA*: an entropy-based measure for taxonomic assignment within assembled metagenomes.00.342016
Assembly independent functional annotation of short-read data using SOFA: Short-ORF functional annotation10.372015
MetaPathways v2.5: quantitative functional, taxonomic and usability improvements30.422015
FragGeneScan-plus for scalable high-throughput short-read open reading frame prediction00.342015
Robust network supercomputing with unreliable workers.30.452015
Technical Report: Dealing with Undependable Workers in Decentralized Network Supercomputing.00.342014
Dependable Decentralized Cooperation with the Help of Reliability Estimation.00.342014
Technical Report: Estimating Reliability of Workers for Cooperative Distributed Computing.00.342014
MetaPathways v2.0: A master-worker model for environmental Pathway/Genome Database construction on grids and clouds80.532014
Self-stabilizing Resource Discovery Algorithm.20.412013
MetaPathways: a modular pipeline for constructing pathway/genome databases from environmental sequence information.140.772013
An improved stemming approach using HMM for a highly inflectional language40.562013
Brief announcement: self-stabilizing resource discovery algorithm10.372013
Scalable heuristics for clustering biological graphs.10.362013
Expanding the boundaries of local similarity analysis.30.472013
Dealing with undependable workers in decentralized network supercomputing.10.352013
Brief announcement: decentralized network supercomputing in the presence of malicious and crash-prone workers20.402012
Robust network supercomputing without centralized control80.592011
Node discovery in networks40.462009
Spontaneous, Self-Sampling Quorum Systems for Ad Hoc Networks00.342008
Moments of Memory Access Time for Systems With Hierarchical Memories10.412006
Robust network supercomputing with malicious processes180.842006
Resource Discovery in Networks under Bandwidth Limitations00.342006
Performance modeling of hierarchical memories00.342006
Fast Distance Preserving Level Set Evolution for Medical Image Segmentation131.492006
Improved algorithms for multiplex PCR primer set selection with amplification length constraints10.512005
Highly scalable algorithms for robust string barcoding.91.052005
The Join Problem in Dynamic Network Algorithms10.392004
Approximation Algorithms for Minimum PCR Primer Set Selection with Amplification Length and Uniqueness Constraints20.422004