Kalpesh Kapoor

According to our database, Kalpesh Kapoor authored at least 32 papers between 2003 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

The square density of words having a sequence of FS-double squares.

Maithilee Patawar, Kalpesh Kapoor

Discret. Appl. Math., December, 2023

Density of distinct squares in non-primitive words.

Maithilee Patawar, Kalpesh Kapoor

Inf. Process. Lett., August, 2023

Analysis of Optimal Number of Shards Using ShardEval, A Simulator for Sharded Blockchains.

Vishisht Priyadarshi, Sourav Goel, Kalpesh Kapoor

Proceedings of the Information Systems Security - 19th International Conference, 2023

Distributed Routing Algorithms for Concurrent Execution of Transactions in PCNs.

Neeraj Sharma, Kalpesh Kapoor

Proceedings of the 7th IEEE International Conference on Fog and Edge Computing, 2023

2021

Design and Validation of BlockEval, A Blockchain Simulator.

Deepak Kumar Gouda, Shashwat Jolly, Kalpesh Kapoor

Proceedings of the 13th International Conference on COMmunication Systems & NETworkS, 2021

Characterization of Dense Patterns Having Distinct Squares.

Maithilee Patawar, Kalpesh Kapoor

Proceedings of the Algorithms and Discrete Applied Mathematics, 2021

2018

<i>Kapees3</i>: A High-Quality VLSI Placement Tool Using Nesterov's Method for Density Penalty.

Sameer Pawanekar, Kalpesh Kapoor, Gaurav Trivedi

J. Circuits Syst. Comput., 2018

2017

Ins-Robust Primitive Words.

Amit Kumar Srivastava, Kalpesh Kapoor

CoRR, 2017

Weighted approximate parameterized string matching.

Shibsankar Das, Kalpesh Kapoor

AKCE Int. J. Graphs Comb., 2017

2016

On del-robust primitive words.

Amit Kumar Srivastava, Ananda Chandra Nayak, Kalpesh Kapoor

Discret. Appl. Math., 2016

A Tight Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs.

Shibsankar Das, Kalpesh Kapoor

CoRR, 2016

On Exchange-Robust and Subst-Robust Primitive Partial Words.

Ananda Chandra Nayak, Amit Kumar Srivastava, Kalpesh Kapoor

Proceedings of the 17th Italian Conference on Theoretical Computer Science, 2016

2015

On reachability in graphs with obstacles.

Udit Agarwal, Kalpesh Kapoor

Discret. Math. Algorithms Appl., 2015

A Nonlinear Analytical Optimization Method for Standard Cell Placement of VLSI Circuits.

Sameer Pawanekar, Gaurav Trivedi, Kalpesh Kapoor

Proceedings of the 28th International Conference on VLSI Design, 2015

On the Language of Primitive Partial Words.

Ananda Chandra Nayak, Kalpesh Kapoor

Proceedings of the Language and Automata Theory and Applications, 2015

2014

Motion planning in Cartesian product graphs.

Biswajit Deb, Kalpesh Kapoor

Discuss. Math. Graph Theory, 2014

Fine-Tuning Decomposition Theorem for Maximum Weight Bipartite Matching.

Shibsankar Das, Kalpesh Kapoor

Proceedings of the Theory and Applications of Models of Computation, 2014

2013

On multiset of factors of a word.

Kalpesh Kapoor, Himadri Nayak

Inf. Process. Lett., 2013

Kapees: A New Tool for Standard Cell Placement.

Sameer Pawanekar, Kalpesh Kapoor, Gaurav Trivedi

Proceedings of the VLSI Design and Test, 17th International Symposium, 2013

2012

On <i>Mrj</i> Reachability in Trees.

Biswajit Deb, Kalpesh Kapoor, Sukanta Pati

Discret. Math. Algorithms Appl., 2012

2011

Fine-grained Concurrency with Separation Logic.

Kalpesh Kapoor, Kamal Lodaya, Uday S. Reddy

J. Philos. Log., 2011

Mutant Hierarchies Support Selective Mutation.

Kalpesh Kapoor

Informatica (Slovenia), 2011

2009

Using formal specifications to support testing.

Robert M. Hierons, Kirill Bogdanov, Jonathan P. Bowen, Rance Cleaveland, John Derrick, Jeremy Dick, Marian Gheorghe, Mark Harman, Kalpesh Kapoor, Paul J. Krause, Gerald Lüttgen, Anthony J. H. Simons, Sergiy A. Vilkomir, Martin R. Woodward, Hussein Zedan

ACM Comput. Surv., 2009

QDMAC: An Energy Efficient Low Latency MAC Protocol for Query Based Wireless Sensor Networks.

Abhishek Anand, Shikhar Sachan, Kalpesh Kapoor, Sukumar Nandi

Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

2007

Test conditions for fault classes in Boolean specifications.

Kalpesh Kapoor, Jonathan P. Bowen

ACM Trans. Softw. Eng. Methodol., 2007

2006

Formal Analysis of Coupling Hypothesis for Logical Faults.

Kalpesh Kapoor

Innov. Syst. Softw. Eng., 2006

2005

A formal analysis of MCDC and RCDC test criteria.

Kalpesh Kapoor, Jonathan P. Bowen

Softw. Test. Verification Reliab., 2005

2004

Stability of test criteria and fault hierarchies in software testing.

Kalpesh Kapoor

PhD thesis, 2004

Experimental evaluation of the tolerance for control-flow test criteria.

Kalpesh Kapoor, Jonathan P. Bowen

Softw. Test. Verification Reliab., 2004

Ordering Mutants to Minimise Test Effort in Mutation Testing.

Kalpesh Kapoor, Jonathan P. Bowen

Proceedings of the Formal Approaches to Software Testing, 4th International Workshop, 2004

2003

Experimental Evaluation of the Variation in Effectiveness for DC, FPC and MC/DC Test Criteria.

Kalpesh Kapoor, Jonathan P. Bowen

Proceedings of the 2003 International Symposium on Empirical Software Engineering (ISESE 2003), 30 September, 2003

Tolerance of Control-Flow Testing Criteria.

Sergiy A. Vilkomir, Kalpesh Kapoor, Jonathan P. Bowen

Proceedings of the 27th International Computer Software and Applications Conference (COMPSAC 2003): Design and Assessment of Trustworthy Software-Based Systems, 2003