![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Kalpesh Kapoor
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2004
- [b1]Kalpesh Kapoor:
Stability of test criteria and fault hierarchies in software testing. London South Bank University, UK, 2004
Journal Articles
- 2023
- [j16]Maithilee Patawar
, Kalpesh Kapoor:
The square density of words having a sequence of FS-double squares. Discret. Appl. Math. 341: 349-358 (2023) - [j15]Maithilee Patawar
, Kalpesh Kapoor:
Density of distinct squares in non-primitive words. Inf. Process. Lett. 182: 106367 (2023) - 2018
- [j14]Sameer Pawanekar
, Kalpesh Kapoor, Gaurav Trivedi:
Kapees3: A High-Quality VLSI Placement Tool Using Nesterov's Method for Density Penalty. J. Circuits Syst. Comput. 27(8): 1850122:1-1850122:29 (2018) - 2017
- [j13]Shibsankar Das
, Kalpesh Kapoor:
Weighted approximate parameterized string matching. AKCE Int. J. Graphs Comb. 14(1): 1-12 (2017) - 2016
- [j12]Amit Kumar Srivastava, Ananda Chandra Nayak, Kalpesh Kapoor:
On del-robust primitive words. Discret. Appl. Math. 206: 115-121 (2016) - 2015
- [j11]Udit Agarwal, Kalpesh Kapoor:
On reachability in graphs with obstacles. Discret. Math. Algorithms Appl. 7(4): 1550059:1-1550059:22 (2015) - 2014
- [j10]Biswajit Deb
, Kalpesh Kapoor:
Motion planning in Cartesian product graphs. Discuss. Math. Graph Theory 34(2): 207-221 (2014) - 2013
- [j9]Kalpesh Kapoor, Himadri Nayak
:
On multiset of factors of a word. Inf. Process. Lett. 113(3): 78-80 (2013) - 2012
- [j8]Biswajit Deb
, Kalpesh Kapoor, Sukanta Pati
:
On Mrj Reachability in Trees. Discret. Math. Algorithms Appl. 4(4) (2012) - 2011
- [j7]Kalpesh Kapoor:
Mutant Hierarchies Support Selective Mutation. Informatica (Slovenia) 35(3): 331-342 (2011) - [j6]Kalpesh Kapoor, Kamal Lodaya, Uday S. Reddy:
Fine-grained Concurrency with Separation Logic. J. Philos. Log. 40(5): 583-632 (2011) - 2009
- [j5]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:
Using formal specifications to support testing. ACM Comput. Surv. 41(2): 9:1-9:76 (2009) - 2007
- [j4]Kalpesh Kapoor, Jonathan P. Bowen
:
Test conditions for fault classes in Boolean specifications. ACM Trans. Softw. Eng. Methodol. 16(3): 10 (2007) - 2006
- [j3]Kalpesh Kapoor:
Formal Analysis of Coupling Hypothesis for Logical Faults. Innov. Syst. Softw. Eng. 2(2): 80-87 (2006) - 2005
- [j2]Kalpesh Kapoor, Jonathan P. Bowen
:
A formal analysis of MCDC and RCDC test criteria. Softw. Test. Verification Reliab. 15(1): 21-40 (2005) - 2004
- [j1]Kalpesh Kapoor, Jonathan P. Bowen
:
Experimental evaluation of the tolerance for control-flow test criteria. Softw. Test. Verification Reliab. 14(3): 167-187 (2004)
Conference and Workshop Papers
- 2023
- [c13]Neeraj Sharma
, Kalpesh Kapoor:
Distributed Routing Algorithms for Concurrent Execution of Transactions in PCNs. ICFEC 2023: 49-57 - [c12]Vishisht Priyadarshi, Sourav Goel, Kalpesh Kapoor:
Analysis of Optimal Number of Shards Using ShardEval, A Simulator for Sharded Blockchains. ICISS 2023: 339-359 - 2021
- [c11]Maithilee Patawar, Kalpesh Kapoor:
Characterization of Dense Patterns Having Distinct Squares. CALDAM 2021: 397-409 - [c10]Deepak Kumar Gouda, Shashwat Jolly, Kalpesh Kapoor:
Design and Validation of BlockEval, A Blockchain Simulator. COMSNETS 2021: 281-289 - 2016
- [c9]Ananda Chandra Nayak, Amit Kumar Srivastava, Kalpesh Kapoor:
On Exchange-Robust and Subst-Robust Primitive Partial Words. ICTCS 2016: 190-202 - 2015
- [c8]Ananda Chandra Nayak, Kalpesh Kapoor:
On the Language of Primitive Partial Words. LATA 2015: 436-445 - [c7]Sameer Pawanekar, Gaurav Trivedi, Kalpesh Kapoor:
A Nonlinear Analytical Optimization Method for Standard Cell Placement of VLSI Circuits. VLSID 2015: 423-428 - 2014
- [c6]Shibsankar Das
, Kalpesh Kapoor:
Fine-Tuning Decomposition Theorem for Maximum Weight Bipartite Matching. TAMC 2014: 312-322 - 2013
- [c5]Sameer Pawanekar, Kalpesh Kapoor, Gaurav Trivedi:
Kapees: A New Tool for Standard Cell Placement. VDAT 2013: 66-73 - 2009
- [c4]Abhishek Anand, Shikhar Sachan, Kalpesh Kapoor, Sukumar Nandi
:
QDMAC: An Energy Efficient Low Latency MAC Protocol for Query Based Wireless Sensor Networks. ICDCN 2009: 306-317 - 2004
- [c3]Kalpesh Kapoor, Jonathan P. Bowen
:
Ordering Mutants to Minimise Test Effort in Mutation Testing. FATES 2004: 195-209 - 2003
- [c2]Sergiy A. Vilkomir, Kalpesh Kapoor, Jonathan P. Bowen
:
Tolerance of Control-Flow Testing Criteria. COMPSAC 2003: 182-187 - [c1]Kalpesh Kapoor, Jonathan P. Bowen
:
Experimental Evaluation of the Variation in Effectiveness for DC, FPC and MC/DC Test Criteria. ISESE 2003: 185-194
Informal and Other Publications
- 2017
- [i2]Amit Kumar Srivastava, Kalpesh Kapoor:
Ins-Robust Primitive Words. CoRR abs/1707.01010 (2017) - 2016
- [i1]Shibsankar Das, Kalpesh Kapoor:
A Tight Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs. CoRR abs/1605.00406 (2016)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint