var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=http://www.bibsonomy.org/bib/author/rakesh%20verma?items=1000&jsonp=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=http://www.bibsonomy.org/bib/author/rakesh%20verma?items=1000&jsonp=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=http://www.bibsonomy.org/bib/author/rakesh%20verma?items=1000&jsonp=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
    2. \n
  2. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
    3. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2024\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Data Quality in NLP: Metrics and a Comprehensive Taxonomy.\n \n \n \n \n\n\n \n Dang, V. M. H.; and Verma, R. M.\n\n\n \n\n\n\n In Miliou, I.; Piatkowski, N.; and Papapetrou, P., editor(s), IDA (1), volume 14641, of Lecture Notes in Computer Science, pages 217-229, 2024. Springer\n \n\n\n\n
\n\n\n\n \n \n \"DataLink\n  \n \n \n \"DataPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/ida/DangV24,\n  added-at = {2024-04-24T00:00:00.000+0200},\n  author = {Dang, Vu Minh Hoang and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2f7380771cfd8b060c3c7fb2fad3b1759/dblp},\n  booktitle = {IDA (1)},\n  crossref = {conf/ida/2024-1},\n  editor = {Miliou, Ioanna and Piatkowski, Nico and Papapetrou, Panagiotis},\n  ee = {https://doi.org/10.1007/978-3-031-58547-0_18},\n  interhash = {0ec1954f2896d7983beec126b7d81ea5},\n  intrahash = {f7380771cfd8b060c3c7fb2fad3b1759},\n  isbn = {978-3-031-58547-0},\n  keywords = {dblp},\n  pages = {217-229},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2024-04-29T07:17:39.000+0200},\n  title = {Data Quality in NLP: Metrics and a Comprehensive Taxonomy.},\n  url = {http://dblp.uni-trier.de/db/conf/ida/ida2024-1.html#DangV24},\n  volume = 14641,\n  year = 2024\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n DetectiveReDASers at HSD-2Lang 2024: A New Pooling Strategy with Cross-lingual Augmentation and Ensembling for Hate Speech Detection in Low-resource Languages.\n \n \n \n \n\n\n \n Qachfar, F. Z.; Tuck, B.; and Verma, R. M.\n\n\n \n\n\n\n In Hürriyetoglu, A.; Tanev, H.; Thapa, S.; and Uludogan, G., editor(s), CASE, pages 199-204, 2024. Association for Computational Linguistics\n \n\n\n\n
\n\n\n\n \n \n \"DetectiveReDASersLink\n  \n \n \n \"DetectiveReDASersPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/case-ws/QachfarTV24,\n  added-at = {2024-03-25T00:00:00.000+0100},\n  author = {Qachfar, Fatima Zahra and Tuck, Bryan and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2b535f496e7d21c4cb6395f4f3b14c253/dblp},\n  booktitle = {CASE},\n  crossref = {conf/case-ws/2024},\n  editor = {Hürriyetoglu, Ali and Tanev, Hristo and Thapa, Surendrabikram and Uludogan, Gökçe},\n  ee = {https://aclanthology.org/2024.case-1.28},\n  interhash = {e18b29a11ea986f0567ab9925c5d9e60},\n  intrahash = {b535f496e7d21c4cb6395f4f3b14c253},\n  isbn = {979-8-89176-070-7},\n  keywords = {dblp},\n  pages = {199-204},\n  publisher = {Association for Computational Linguistics},\n  timestamp = {2024-04-09T15:07:41.000+0200},\n  title = {DetectiveReDASers at HSD-2Lang 2024: A New Pooling Strategy with Cross-lingual Augmentation and Ensembling for Hate Speech Detection in Low-resource Languages.},\n  url = {http://dblp.uni-trier.de/db/conf/case-ws/case2024.html#QachfarTV24},\n  year = 2024\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Homograph Attacks on Maghreb Sentiment Analyzers.\n \n \n \n \n\n\n \n Qachfar, F. Z.; and Verma, R. M.\n\n\n \n\n\n\n CoRR, abs/2402.03171. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"HomographLink\n  \n \n \n \"HomographPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/corr/abs-2402-03171,\n  added-at = {2024-02-12T00:00:00.000+0100},\n  author = {Qachfar, Fatima Zahra and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2693c80e82c80bdd88a53d9ae306fbe29/dblp},\n  ee = {https://doi.org/10.48550/arXiv.2402.03171},\n  interhash = {5704081e3338c06913eb5ebf2d324407},\n  intrahash = {693c80e82c80bdd88a53d9ae306fbe29},\n  journal = {CoRR},\n  keywords = {dblp},\n  timestamp = {2024-04-09T00:14:39.000+0200},\n  title = {Homograph Attacks on Maghreb Sentiment Analyzers.},\n  url = {http://dblp.uni-trier.de/db/journals/corr/corr2402.html#abs-2402-03171},\n  volume = {abs/2402.03171},\n  year = 2024\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Domain-Independent Deception: A New Taxonomy and Linguistic Analysis.\n \n \n \n \n\n\n \n Verma, R. M.; Dershowitz, N.; Zeng, V.; Boumber, D.; and Liu, X.\n\n\n \n\n\n\n CoRR, abs/2402.01019. 2024.\n \n\n\n\n
\n\n\n\n \n \n \"Domain-IndependentLink\n  \n \n \n \"Domain-IndependentPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/corr/abs-2402-01019,\n  added-at = {2024-02-09T00:00:00.000+0100},\n  author = {Verma, Rakesh M. and Dershowitz, Nachum and Zeng, Victor and Boumber, Dainis and Liu, Xuting},\n  biburl = {https://www.bibsonomy.org/bibtex/27bdadc004d10b92857b8594ebbb52568/dblp},\n  ee = {https://doi.org/10.48550/arXiv.2402.01019},\n  interhash = {666f408d70b4d47bd63c80ef83cf7e5c},\n  intrahash = {7bdadc004d10b92857b8594ebbb52568},\n  journal = {CoRR},\n  keywords = {dblp},\n  timestamp = {2024-04-08T22:38:44.000+0200},\n  title = {Domain-Independent Deception: A New Taxonomy and Linguistic Analysis.},\n  url = {http://dblp.uni-trier.de/db/journals/corr/corr2402.html#abs-2402-01019},\n  volume = {abs/2402.01019},\n  year = 2024\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2023\n \n \n (8)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n DetectiveRedasers at ArAIEval Shared Task: Leveraging Transformer Ensembles for Arabic Deception Detection.\n \n \n \n \n\n\n \n Tuck, B.; Qachfar, F. Z.; Boumber, D.; and Verma, R. M.\n\n\n \n\n\n\n In Sawaf, H.; El-Beltagy, S. R.; Zaghouani, W.; Magdy, W.; Abdelali, A.; Tomeh, N.; Farha, I. A.; Habash, N.; Khalifa, S.; Keleg, A.; Haddad, H.; Zitouni, I.; Mrini, K.; and Al-Matham, R. N., editor(s), ArabicNLP, pages 494-501, 2023. Association for Computational Linguistics\n \n\n\n\n
\n\n\n\n \n \n \"DetectiveRedasersLink\n  \n \n \n \"DetectiveRedasersPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/wanlp/TuckQBV23,\n  added-at = {2024-04-12T00:00:00.000+0200},\n  author = {Tuck, Bryan and Qachfar, Fatima Zahra and Boumber, Dainis and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2b4b1f6e93968e5ecad770cbcccb0c304/dblp},\n  booktitle = {ArabicNLP},\n  crossref = {conf/wanlp/2023},\n  editor = {Sawaf, Hassan and El-Beltagy, Samhaa R. and Zaghouani, Wajdi and Magdy, Walid and Abdelali, Ahmed and Tomeh, Nadi and Farha, Ibrahim Abu and Habash, Nizar and Khalifa, Salam and Keleg, Amr and Haddad, Hatem and Zitouni, Imed and Mrini, Khalil and Al-Matham, Rawan N.},\n  ee = {https://aclanthology.org/2023.arabicnlp-1.45},\n  interhash = {2b4a1f65c6e89fb56cc2a7ea7160e30d},\n  intrahash = {b4b1f6e93968e5ecad770cbcccb0c304},\n  isbn = {978-1-959429-27-2},\n  keywords = {dblp},\n  pages = {494-501},\n  publisher = {Association for Computational Linguistics},\n  timestamp = {2024-04-15T07:05:14.000+0200},\n  title = {DetectiveRedasers at ArAIEval Shared Task: Leveraging Transformer Ensembles for Arabic Deception Detection.},\n  url = {http://dblp.uni-trier.de/db/conf/wanlp/arabicnlp2023.html#TuckQBV23},\n  year = 2023\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n ReDASPersuasion at ArAIEval Shared Task: Multilingual and Monolingual Models For Arabic Persuasion Detection.\n \n \n \n \n\n\n \n Qachfar, F. Z.; and Verma, R. M.\n\n\n \n\n\n\n In Sawaf, H.; El-Beltagy, S. R.; Zaghouani, W.; Magdy, W.; Abdelali, A.; Tomeh, N.; Farha, I. A.; Habash, N.; Khalifa, S.; Keleg, A.; Haddad, H.; Zitouni, I.; Mrini, K.; and Al-Matham, R. N., editor(s), ArabicNLP, pages 549-557, 2023. Association for Computational Linguistics\n \n\n\n\n
\n\n\n\n \n \n \"ReDASPersuasionLink\n  \n \n \n \"ReDASPersuasionPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/wanlp/QachfarV23,\n  added-at = {2024-04-12T00:00:00.000+0200},\n  author = {Qachfar, Fatima Zahra and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/25643ce4992b37d14a5e9cc872a855c4b/dblp},\n  booktitle = {ArabicNLP},\n  crossref = {conf/wanlp/2023},\n  editor = {Sawaf, Hassan and El-Beltagy, Samhaa R. and Zaghouani, Wajdi and Magdy, Walid and Abdelali, Ahmed and Tomeh, Nadi and Farha, Ibrahim Abu and Habash, Nizar and Khalifa, Salam and Keleg, Amr and Haddad, Hatem and Zitouni, Imed and Mrini, Khalil and Al-Matham, Rawan N.},\n  ee = {https://aclanthology.org/2023.arabicnlp-1.54},\n  interhash = {31fc1fead1194057d43fdd2009587e7f},\n  intrahash = {5643ce4992b37d14a5e9cc872a855c4b},\n  isbn = {978-1-959429-27-2},\n  keywords = {dblp},\n  pages = {549-557},\n  publisher = {Association for Computational Linguistics},\n  timestamp = {2024-04-15T07:05:14.000+0200},\n  title = {ReDASPersuasion at ArAIEval Shared Task: Multilingual and Monolingual Models For Arabic Persuasion Detection.},\n  url = {http://dblp.uni-trier.de/db/conf/wanlp/arabicnlp2023.html#QachfarV23},\n  year = 2023\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n USDOT Tier-1 University Transportation Center for Advancing Cybersecurity Research and Education.\n \n \n \n \n\n\n \n Zhang, Y. J.; Wang, K.; Song, L.; Lendasse, A.; Song, H. H.; Han, Z.; Verma, R.; Silva, A.; Rubio-Medrano, C. E.; Li, Z. R.; and Zhang, G.\n\n\n \n\n\n\n In MOST, pages 237-241, 2023. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"USDOTLink\n  \n \n \n \"USDOTPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/most/ZhangWSLSHVSRLZ23,\n  added-at = {2024-03-13T00:00:00.000+0100},\n  author = {Zhang, Yunpeng Jack and Wang, Kailai and Song, Lingguang and Lendasse, Amaury and Song, Houbing Herbert and Han, Zhu and Verma, Rakesh and Silva, Arlei and Rubio-Medrano, Carlos E. and Li, Zhixia Richard and Zhang, Guohui},\n  biburl = {https://www.bibsonomy.org/bibtex/23d67c0bf28200fc8c3f61f88b5e51603/dblp},\n  booktitle = {MOST},\n  crossref = {conf/most/2023},\n  ee = {https://doi.org/10.1109/MOST57249.2023.00036},\n  interhash = {03377b2f65a188204e2bac5425adfc91},\n  intrahash = {3d67c0bf28200fc8c3f61f88b5e51603},\n  isbn = {979-8-3503-1995-8},\n  keywords = {dblp},\n  pages = {237-241},\n  publisher = {IEEE},\n  timestamp = {2024-04-09T17:44:15.000+0200},\n  title = {USDOT Tier-1 University Transportation Center for Advancing Cybersecurity Research and Education.},\n  url = {http://dblp.uni-trier.de/db/conf/most/most2023.html#ZhangWSLSHVSRLZ23},\n  year = 2023\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n ReDASPersuasion at SemEval-2023 Task 3: Persuasion Detection using Multilingual Transformers and Language Agnostic Features.\n \n \n \n \n\n\n \n Qachfar, F. Z.; and Verma, R. M.\n\n\n \n\n\n\n In Ojha, A. K.; Dogruöz, A. S.; Martino, G. D. S.; Madabushi, H. T.; Kumar, R.; and Sartori, E., editor(s), SemEval@ACL, pages 2124-2132, 2023. Association for Computational Linguistics\n \n\n\n\n
\n\n\n\n \n \n \"ReDASPersuasionLink\n  \n \n \n \"ReDASPersuasionPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/semeval/QachfarV23,\n  added-at = {2024-02-05T00:00:00.000+0100},\n  author = {Qachfar, Fatima Zahra and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/239e36e2f6a1eebdb9a508e5b254ff3e8/dblp},\n  booktitle = {SemEval@ACL},\n  crossref = {conf/semeval/2023},\n  editor = {Ojha, Atul Kr. and Dogruöz, A. Seza and Martino, Giovanni Da San and Madabushi, Harish Tayyar and Kumar, Ritesh and Sartori, Elisa},\n  ee = {https://aclanthology.org/2023.semeval-1.293},\n  interhash = {e694e9aa7c0acb0dfb5cb99c53ea2bfb},\n  intrahash = {39e36e2f6a1eebdb9a508e5b254ff3e8},\n  keywords = {dblp},\n  pages = {2124-2132},\n  publisher = {Association for Computational Linguistics},\n  timestamp = {2024-04-09T09:53:45.000+0200},\n  title = {ReDASPersuasion at SemEval-2023 Task 3: Persuasion Detection using Multilingual Transformers and Language Agnostic Features.},\n  url = {http://dblp.uni-trier.de/db/conf/semeval/semeval2023.html#QachfarV23},\n  year = 2023\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Rebutting Rebuttals.\n \n \n \n \n\n\n \n Dershowitz, N.; and Verma, R. M.\n\n\n \n\n\n\n Commun. ACM, 66(9): 35-41. 09 2023.\n \n\n\n\n
\n\n\n\n \n \n \"RebuttingLink\n  \n \n \n \"RebuttingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/cacm/DershowitzV23,\n  added-at = {2023-10-20T00:00:00.000+0200},\n  author = {Dershowitz, Nachum and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2ea6bfc23dc10e3016d59e98a3e6bcfe6/dblp},\n  ee = {https://doi.org/10.1145/3584664},\n  interhash = {98261eb1c77911c418f0122b56a722ec},\n  intrahash = {ea6bfc23dc10e3016d59e98a3e6bcfe6},\n  journal = {Commun. ACM},\n  keywords = {dblp},\n  month = {09},\n  number = 9,\n  pages = {35-41},\n  timestamp = {2024-04-09T02:13:20.000+0200},\n  title = {Rebutting Rebuttals.},\n  url = {http://dblp.uni-trier.de/db/journals/cacm/cacm66.html#DershowitzV23},\n  volume = 66,\n  year = 2023\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Adversarial Robustness of Phishing Email Detection Models.\n \n \n \n \n\n\n \n Gholampour, P. M.; and Verma, R. M.\n\n\n \n\n\n\n In Marchette, D. J.; Sung, A. H.; and Verma, R. M., editor(s), IWSPA@CODASPY, pages 67-76, 2023. ACM\n \n\n\n\n
\n\n\n\n \n \n \"AdversarialLink\n  \n \n \n \"AdversarialPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/codaspy/GholampourV23,\n  added-at = {2023-04-29T00:00:00.000+0200},\n  author = {Gholampour, Parisa Mehdi and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2b51ade98871e55072c294522c5c54c5a/dblp},\n  booktitle = {IWSPA@CODASPY},\n  crossref = {conf/codaspy/2023iwspa},\n  editor = {Marchette, David J. and Sung, Andrew H. and Verma, Rakesh M.},\n  ee = {https://doi.org/10.1145/3579987.3586567},\n  interhash = {a3adb33dcd060ae9a54c0e00b5da2013},\n  intrahash = {b51ade98871e55072c294522c5c54c5a},\n  keywords = {dblp},\n  pages = {67-76},\n  publisher = {ACM},\n  timestamp = {2024-04-09T11:17:09.000+0200},\n  title = {Adversarial Robustness of Phishing Email Detection Models.},\n  url = {http://dblp.uni-trier.de/db/conf/codaspy/iwspa2023.html#GholampourV23},\n  year = 2023\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Sixteen Years of Phishing User Studies: What Have We Learned?.\n \n \n \n \n\n\n \n Baki, S.; and Verma, R. M.\n\n\n \n\n\n\n IEEE Trans. Dependable Secur. Comput., 20(2): 1200-1212. 03 2023.\n \n\n\n\n
\n\n\n\n \n \n \"SixteenLink\n  \n \n \n \"SixteenPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/tdsc/BakiV23,\n  added-at = {2023-03-28T00:00:00.000+0200},\n  author = {Baki, Shahryar and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2be5c5779098aa614d7577d01f6c50906/dblp},\n  ee = {https://doi.org/10.1109/TDSC.2022.3151103},\n  interhash = {321899cd7e9a4d2401726999a1f11c47},\n  intrahash = {be5c5779098aa614d7577d01f6c50906},\n  journal = {IEEE Trans. Dependable Secur. Comput.},\n  keywords = {dblp},\n  month = {03},\n  number = 2,\n  pages = {1200-1212},\n  timestamp = {2024-04-09T06:53:55.000+0200},\n  title = {Sixteen Years of Phishing User Studies: What Have We Learned?},\n  url = {http://dblp.uni-trier.de/db/journals/tdsc/tdsc20.html#BakiV23},\n  volume = 20,\n  year = 2023\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Enhancement of Twitter event detection using news streams.\n \n \n \n \n\n\n \n Karimi, S.; Shakery, A.; and Verma, R. M.\n\n\n \n\n\n\n Nat. Lang. Eng., 29(2): 181-200. 03 2023.\n \n\n\n\n
\n\n\n\n \n \n \"EnhancementLink\n  \n \n \n \"EnhancementPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/nle/KarimiSV23,\n  added-at = {2023-03-19T00:00:00.000+0100},\n  author = {Karimi, Samaneh and Shakery, Azadeh and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/25b61d97107a94a47095201dc7b20d5e9/dblp},\n  ee = {https://doi.org/10.1017/S1351324921000462},\n  interhash = {e691155758845150660712cc0f78853d},\n  intrahash = {5b61d97107a94a47095201dc7b20d5e9},\n  journal = {Nat. Lang. Eng.},\n  keywords = {dblp},\n  month = {03},\n  number = 2,\n  pages = {181-200},\n  timestamp = {2024-04-09T02:38:38.000+0200},\n  title = {Enhancement of Twitter event detection using news streams.},\n  url = {http://dblp.uni-trier.de/db/journals/nle/nle29.html#KarimiSV23},\n  volume = 29,\n  year = 2023\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2022\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Software Vulnerability Detection via Multimodal Deep Learning.\n \n \n \n \n\n\n \n Zhou, X.; and Verma, R. M.\n\n\n \n\n\n\n In Lenzini, G.; and Meng, W., editor(s), STM, volume 13867, of Lecture Notes in Computer Science, pages 85-103, 2022. Springer\n \n\n\n\n
\n\n\n\n \n \n \"SoftwareLink\n  \n \n \n \"SoftwarePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/stm/ZhouV22,\n  added-at = {2023-05-02T00:00:00.000+0200},\n  author = {Zhou, Xin and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2c39f0d03611e4da5cf249e223d9f7ea4/dblp},\n  booktitle = {STM},\n  crossref = {conf/stm/2022},\n  editor = {Lenzini, Gabriele and Meng, Weizhi},\n  ee = {https://doi.org/10.1007/978-3-031-29504-1_5},\n  interhash = {3c468fffa4236a5b050d8433a8a6a0a5},\n  intrahash = {c39f0d03611e4da5cf249e223d9f7ea4},\n  isbn = {978-3-031-29504-1},\n  keywords = {dblp},\n  pages = {85-103},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2024-04-09T15:50:33.000+0200},\n  title = {Software Vulnerability Detection via Multimodal Deep Learning.},\n  url = {http://dblp.uni-trier.de/db/conf/stm/stm2022.html#ZhouV22},\n  volume = 13867,\n  year = 2022\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Data Quality and Linguistic Cues for Domain-independent Deception Detection.\n \n \n \n \n\n\n \n Hanks, C.; and Verma, R. M.\n\n\n \n\n\n\n In BDCAT, pages 248-258, 2022. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"DataLink\n  \n \n \n \"DataPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/bdc/HanksV22,\n  added-at = {2023-03-25T00:00:00.000+0100},\n  author = {Hanks, Casey and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/257e7f75beb1ac1f4f335d9804ca80607/dblp},\n  booktitle = {BDCAT},\n  crossref = {conf/bdc/2022},\n  ee = {https://doi.org/10.1109/BDCAT56447.2022.00042},\n  interhash = {144339038003dd7973c4d99f4e71a1f2},\n  intrahash = {57e7f75beb1ac1f4f335d9804ca80607},\n  isbn = {978-1-6654-6090-3},\n  keywords = {dblp},\n  pages = {248-258},\n  publisher = {IEEE},\n  timestamp = {2024-04-09T12:19:44.000+0200},\n  title = {Data Quality and Linguistic Cues for Domain-independent Deception Detection.},\n  url = {http://dblp.uni-trier.de/db/conf/bdc/bdcat2022.html#HanksV22},\n  year = 2022\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Leveraging Synthetic Data and PU Learning For Phishing Email Detection.\n \n \n \n \n\n\n \n Qachfar, F. Z.; Verma, R. M.; and Mukherjee, A.\n\n\n \n\n\n\n In Joshi, A.; Fernández, M.; and Verma, R. M., editor(s), CODASPY, pages 29-40, 2022. ACM\n \n\n\n\n
\n\n\n\n \n \n \"LeveragingLink\n  \n \n \n \"LeveragingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/codaspy/QachfarVM22,\n  added-at = {2022-10-02T00:00:00.000+0200},\n  author = {Qachfar, Fatima Zahra and Verma, Rakesh M. and Mukherjee, Arjun},\n  biburl = {https://www.bibsonomy.org/bibtex/21f2534d1049d2eef50464ae74aca4f32/dblp},\n  booktitle = {CODASPY},\n  crossref = {conf/codaspy/2022},\n  editor = {Joshi, Anupam and Fernández, Maribel and Verma, Rakesh M.},\n  ee = {https://doi.org/10.1145/3508398.3511524},\n  interhash = {81e93e9b1ceb6a2dd7fb8422a9a21c8c},\n  intrahash = {1f2534d1049d2eef50464ae74aca4f32},\n  isbn = {978-1-4503-9220-4},\n  keywords = {dblp},\n  pages = {29-40},\n  publisher = {ACM},\n  timestamp = {2024-04-09T11:17:09.000+0200},\n  title = {Leveraging Synthetic Data and PU Learning For Phishing Email Detection.},\n  url = {http://dblp.uni-trier.de/db/conf/codaspy/codaspy2022.html#QachfarVM22},\n  year = 2022\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Does Deception Leave a Content Independent Stylistic Trace?.\n \n \n \n \n\n\n \n Zeng, V.; Liu, X.; and Verma, R. M.\n\n\n \n\n\n\n In Joshi, A.; Fernández, M.; and Verma, R. M., editor(s), CODASPY, pages 349-351, 2022. ACM\n \n\n\n\n
\n\n\n\n \n \n \"DoesLink\n  \n \n \n \"DoesPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/codaspy/ZengLV22,\n  added-at = {2022-10-02T00:00:00.000+0200},\n  author = {Zeng, Victor and Liu, Xuting and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2404e6a49c65646d648673c9f8fcc9b09/dblp},\n  booktitle = {CODASPY},\n  crossref = {conf/codaspy/2022},\n  editor = {Joshi, Anupam and Fernández, Maribel and Verma, Rakesh M.},\n  ee = {https://doi.org/10.1145/3508398.3519358},\n  interhash = {8fadeb41d88fa09edd549ff8eacd5a8f},\n  intrahash = {404e6a49c65646d648673c9f8fcc9b09},\n  isbn = {978-1-4503-9220-4},\n  keywords = {dblp},\n  pages = {349-351},\n  publisher = {ACM},\n  timestamp = {2024-04-09T11:17:09.000+0200},\n  title = {Does Deception Leave a Content Independent Stylistic Trace?},\n  url = {http://dblp.uni-trier.de/db/conf/codaspy/codaspy2022.html#ZengLV22},\n  year = 2022\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Domain-Independent Deception: Definition, Taxonomy and the Linguistic Cues Debate.\n \n \n \n \n\n\n \n Verma, R. M.; Dershowitz, N.; Zeng, V.; and Liu, X.\n\n\n \n\n\n\n CoRR, abs/2207.01738. 2022.\n \n\n\n\n
\n\n\n\n \n \n \"Domain-IndependentLink\n  \n \n \n \"Domain-IndependentPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/corr/abs-2207-01738,\n  added-at = {2022-07-06T00:00:00.000+0200},\n  author = {Verma, Rakesh M. and Dershowitz, Nachum and Zeng, Victor and Liu, Xuting},\n  biburl = {https://www.bibsonomy.org/bibtex/27a69e4dc9d97dbf60a4121f46777b279/dblp},\n  ee = {https://doi.org/10.48550/arXiv.2207.01738},\n  interhash = {598f5ae886c0b36bf7180d394a329167},\n  intrahash = {7a69e4dc9d97dbf60a4121f46777b279},\n  journal = {CoRR},\n  keywords = {dblp},\n  timestamp = {2024-04-08T22:40:03.000+0200},\n  title = {Domain-Independent Deception: Definition, Taxonomy and the Linguistic Cues Debate.},\n  url = {http://dblp.uni-trier.de/db/journals/corr/corr2207.html#abs-2207-01738},\n  volume = {abs/2207.01738},\n  year = 2022\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Vulnerability Detection via Multimodal Learning: Datasets and Analysis.\n \n \n \n \n\n\n \n Zhou, X.; and Verma, R. M.\n\n\n \n\n\n\n In Suga, Y.; Sakurai, K.; Ding, X.; and Sako, K., editor(s), AsiaCCS, pages 1225-1227, 2022. ACM\n \n\n\n\n
\n\n\n\n \n \n \"VulnerabilityLink\n  \n \n \n \"VulnerabilityPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/asiaccs/ZhouV22,\n  added-at = {2022-05-24T00:00:00.000+0200},\n  author = {Zhou, Xin and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/22d07f279477113c84954ebf597890bba/dblp},\n  booktitle = {AsiaCCS},\n  crossref = {conf/asiaccs/2022},\n  editor = {Suga, Yuji and Sakurai, Kouichi and Ding, Xuhua and Sako, Kazue},\n  ee = {https://doi.org/10.1145/3488932.3527288},\n  interhash = {e808fe3d2db268344277e3bf204988a3},\n  intrahash = {2d07f279477113c84954ebf597890bba},\n  isbn = {978-1-4503-9140-5},\n  keywords = {dblp},\n  pages = {1225-1227},\n  publisher = {ACM},\n  timestamp = {2024-04-09T21:18:28.000+0200},\n  title = {Vulnerability Detection via Multimodal Learning: Datasets and Analysis.},\n  url = {http://dblp.uni-trier.de/db/conf/asiaccs/asiaccs2022.html#ZhouV22},\n  year = 2022\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (7)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On the Feasibility of Using GANs for Claim Verification- Experiments and Analysis.\n \n \n \n \n\n\n \n Hatua, A.; Mukherjee, A.; and Verma, R. M.\n\n\n \n\n\n\n In Saracco, F.; and Viviani, M., editor(s), ROMCIR@ECIR, volume 2838, of CEUR Workshop Proceedings, pages 35-46, 2021. CEUR-WS.org\n \n\n\n\n
\n\n\n\n \n \n \"OnLink\n  \n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/ecir/HatuaMV21,\n  added-at = {2023-03-10T00:00:00.000+0100},\n  author = {Hatua, Amartya and Mukherjee, Arjun and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/257e31576080c97251df58dbd396d5d24/dblp},\n  booktitle = {ROMCIR@ECIR},\n  crossref = {conf/ecir/2021romcir},\n  editor = {Saracco, Fabio and Viviani, Marco},\n  ee = {https://ceur-ws.org/Vol-2838/paper4.pdf},\n  interhash = {443b250f9e0e84f9f58028a39733a707},\n  intrahash = {57e31576080c97251df58dbd396d5d24},\n  keywords = {dblp},\n  pages = {35-46},\n  publisher = {CEUR-WS.org},\n  series = {CEUR Workshop Proceedings},\n  timestamp = {2024-04-09T21:31:23.000+0200},\n  title = {On the Feasibility of Using GANs for Claim Verification- Experiments and Analysis.},\n  url = {http://dblp.uni-trier.de/db/conf/ecir/romcir2021.html#HatuaMV21},\n  volume = 2838,\n  year = 2021\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Claim Verification Using a Multi-GAN Based Model.\n \n \n \n \n\n\n \n Hatua, A.; Mukherjee, A.; and Verma, R. M.\n\n\n \n\n\n\n In Angelova, G.; Kunilovskaya, M.; Mitkov, R.; and Nikolova-Koleva, I., editor(s), RANLP, pages 494-503, 2021. INCOMA Ltd.\n \n\n\n\n
\n\n\n\n \n \n \"ClaimLink\n  \n \n \n \"ClaimPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/ranlp/HatuaMV21,\n  added-at = {2021-11-23T00:00:00.000+0100},\n  author = {Hatua, Amartya and Mukherjee, Arjun and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/28907a2526a50fe483a96ffa7ee60c6fa/dblp},\n  booktitle = {RANLP},\n  crossref = {conf/ranlp/2021},\n  editor = {Angelova, Galia and Kunilovskaya, Maria and Mitkov, Ruslan and Nikolova-Koleva, Ivelina},\n  ee = {https://aclanthology.org/2021.ranlp-1.56},\n  interhash = {56f70226eccd1a92c634c3d359731998},\n  intrahash = {8907a2526a50fe483a96ffa7ee60c6fa},\n  keywords = {dblp},\n  pages = {494-503},\n  publisher = {INCOMA Ltd.},\n  timestamp = {2024-04-09T10:13:25.000+0200},\n  title = {Claim Verification Using a Multi-GAN Based Model.},\n  url = {http://dblp.uni-trier.de/db/conf/ranlp/ranlp2021.html#HatuaMV21},\n  year = 2021\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n What is the Security Mindset? Can it be Developed?.\n \n \n \n \n\n\n \n Verma, R. M.; Parthasarathy, R. R.; and Ghemri, L.\n\n\n \n\n\n\n In Sherriff, M.; Merkle, L. D.; Cutter, P. A.; Monge, A. E.; and Sheard, J., editor(s), SIGCSE, pages 1361, 2021. ACM\n \n\n\n\n
\n\n\n\n \n \n \"WhatLink\n  \n \n \n \"WhatPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/sigcse/VermaPG21,\n  added-at = {2021-10-14T00:00:00.000+0200},\n  author = {Verma, Rakesh M. and Parthasarathy, Rangarajan Ray and Ghemri, Lila},\n  biburl = {https://www.bibsonomy.org/bibtex/292ffd85a1b797ecd8422886083f35f78/dblp},\n  booktitle = {SIGCSE},\n  crossref = {conf/sigcse/2021},\n  editor = {Sherriff, Mark and Merkle, Laurence D. and Cutter, Pamela A. and Monge, Alvaro E. and Sheard, Judithe},\n  ee = {https://doi.org/10.1145/3408877.3439528},\n  interhash = {4ce7e948f892bcd4e3dfad31dd65b7c4},\n  intrahash = {92ffd85a1b797ecd8422886083f35f78},\n  isbn = {978-1-4503-8062-1},\n  keywords = {dblp},\n  pages = 1361,\n  publisher = {ACM},\n  timestamp = {2024-04-09T17:39:57.000+0200},\n  title = {What is the Security Mindset? Can it be Developed?},\n  url = {http://dblp.uni-trier.de/db/conf/sigcse/sigcse2021.html#VermaPG21},\n  year = 2021\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Sixteen Years of Phishing User Studies: What Have We Learned?.\n \n \n \n \n\n\n \n Baki, S.; and Verma, R. M.\n\n\n \n\n\n\n CoRR, abs/2109.04661. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"SixteenLink\n  \n \n \n \"SixteenPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/corr/abs-2109-04661,\n  added-at = {2021-10-08T00:00:00.000+0200},\n  author = {Baki, Shahryar and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/21ef437b23c95eafc4d5ce39f6f619be9/dblp},\n  ee = {https://arxiv.org/abs/2109.04661},\n  interhash = {bdead7ebb1b2190b2240124a52d25278},\n  intrahash = {1ef437b23c95eafc4d5ce39f6f619be9},\n  journal = {CoRR},\n  keywords = {dblp},\n  timestamp = {2024-04-08T23:52:13.000+0200},\n  title = {Sixteen Years of Phishing User Studies: What Have We Learned?},\n  url = {http://dblp.uni-trier.de/db/journals/corr/corr2109.html#abs-2109-04661},\n  volume = {abs/2109.04661},\n  year = 2021\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Online news media website ranking using user-generated content.\n \n \n \n \n\n\n \n Karimi, S.; Shakery, A.; and Verma, R. M.\n\n\n \n\n\n\n J. Inf. Sci., 47(3). 2021.\n \n\n\n\n
\n\n\n\n \n \n \"OnlineLink\n  \n \n \n \"OnlinePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/jis/KarimiSV21,\n  added-at = {2021-09-23T00:00:00.000+0200},\n  author = {Karimi, Samaneh and Shakery, Azadeh and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2e1bcf58914dfd68c09c8ea88a40090f4/dblp},\n  ee = {https://doi.org/10.1177/0165551519894928},\n  interhash = {985c34d6eb26c4cf2c9fe5310de331c1},\n  intrahash = {e1bcf58914dfd68c09c8ea88a40090f4},\n  journal = {J. Inf. Sci.},\n  keywords = {dblp},\n  number = 3,\n  timestamp = {2024-04-09T03:01:08.000+0200},\n  title = {Online news media website ranking using user-generated content.},\n  url = {http://dblp.uni-trier.de/db/journals/jis/jis47.html#KarimiSV21},\n  volume = 47,\n  year = 2021\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Capacity Expansion in Cybersecurity: Challenges and Prospects.\n \n \n \n \n\n\n \n Verma, R. M.\n\n\n \n\n\n\n In Sherriff, M.; Merkle, L. D.; Cutter, P. A.; Monge, A. E.; and Sheard, J., editor(s), SIGCSE, pages 1277, 2021. ACM\n \n\n\n\n
\n\n\n\n \n \n \"CapacityLink\n  \n \n \n \"CapacityPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/sigcse/Verma21,\n  added-at = {2021-09-23T00:00:00.000+0200},\n  author = {Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/23ea7fd72927bf1001a5941dc7062ef3f/dblp},\n  booktitle = {SIGCSE},\n  crossref = {conf/sigcse/2021},\n  editor = {Sherriff, Mark and Merkle, Laurence D. and Cutter, Pamela A. and Monge, Alvaro E. and Sheard, Judithe},\n  ee = {https://doi.org/10.1145/3408877.3439634},\n  interhash = {02d169cc52902364b96bf5ca7b997df7},\n  intrahash = {3ea7fd72927bf1001a5941dc7062ef3f},\n  isbn = {978-1-4503-8062-1},\n  keywords = {dblp},\n  pages = 1277,\n  publisher = {ACM},\n  timestamp = {2024-04-09T17:39:57.000+0200},\n  title = {Capacity Expansion in Cybersecurity: Challenges and Prospects.},\n  url = {http://dblp.uni-trier.de/db/conf/sigcse/sigcse2021.html#Verma21},\n  year = 2021\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Claim Verification using a Multi-GAN based Model.\n \n \n \n \n\n\n \n Hatua, A.; Mukherjee, A.; and Verma, R. M.\n\n\n \n\n\n\n CoRR, abs/2103.08001. 2021.\n \n\n\n\n
\n\n\n\n \n \n \"ClaimLink\n  \n \n \n \"ClaimPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/corr/abs-2103-08001,\n  added-at = {2021-03-23T00:00:00.000+0100},\n  author = {Hatua, Amartya and Mukherjee, Arjun and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/20476e0327656ea4aa627e153d8f55cc8/dblp},\n  ee = {https://arxiv.org/abs/2103.08001},\n  interhash = {56f70226eccd1a92c634c3d359731998},\n  intrahash = {0476e0327656ea4aa627e153d8f55cc8},\n  journal = {CoRR},\n  keywords = {dblp},\n  timestamp = {2024-04-08T23:21:00.000+0200},\n  title = {Claim Verification using a Multi-GAN based Model.},\n  url = {http://dblp.uni-trier.de/db/journals/corr/corr2103.html#abs-2103-08001},\n  volume = {abs/2103.08001},\n  year = 2021\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (12)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Diverse Datasets and a Customizable Benchmarking Framework for Phishing.\n \n \n \n \n\n\n \n Zeng, V.; Baki, S.; Aassal, A. E.; Verma, R. M.; Moraes, L. F. T. D.; and Das, A.\n\n\n \n\n\n\n In Verma, R. M.; Khan, L.; and Mohan, C. K., editor(s), IWSPA@CODASPY, pages 35-41, 2020. ACM\n \n\n\n\n
\n\n\n\n \n \n \"DiverseLink\n  \n \n \n \"DiversePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/codaspy/ZengBAVMD20,\n  added-at = {2022-10-02T00:00:00.000+0200},\n  author = {Zeng, Victor and Baki, Shahryar and Aassal, Ayman El and Verma, Rakesh M. and Moraes, Luis Felipe Teixeira De and Das, Avisha},\n  biburl = {https://www.bibsonomy.org/bibtex/22ca3aca9bae98253142531daaa6d706a/dblp},\n  booktitle = {IWSPA@CODASPY},\n  crossref = {conf/codaspy/2020iwspa},\n  editor = {Verma, Rakesh M. and Khan, Latifur and Mohan, Chilukuri K.},\n  ee = {https://doi.org/10.1145/3375708.3380313},\n  interhash = {096c6b0b0e5f4668851c2f3eec8fc82d},\n  intrahash = {2ca3aca9bae98253142531daaa6d706a},\n  isbn = {978-1-4503-7115-5},\n  keywords = {dblp},\n  pages = {35-41},\n  publisher = {ACM},\n  timestamp = {2024-04-10T11:57:37.000+0200},\n  title = {Diverse Datasets and a Customizable Benchmarking Framework for Phishing.},\n  url = {http://dblp.uni-trier.de/db/conf/codaspy/iwspa2020.html#ZengBAVMD20},\n  year = 2020\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n PhishBench 2.0: A Versatile and Extendable Benchmarking Framework for Phishing.\n \n \n \n \n\n\n \n Zeng, V.; Zhou, X.; Baki, S.; and Verma, R. M.\n\n\n \n\n\n\n In Ligatti, J.; Ou, X.; Katz, J.; and Vigna, G., editor(s), CCS, pages 2077-2079, 2020. ACM\n \n\n\n\n
\n\n\n\n \n \n \"PhishBenchLink\n  \n \n \n \"PhishBenchPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/ccs/ZengZBV20,\n  added-at = {2022-10-02T00:00:00.000+0200},\n  author = {Zeng, Victor and Zhou, Xin and Baki, Shahryar and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/20298a35ff6963fdbaa0bcd33492fb876/dblp},\n  booktitle = {CCS},\n  crossref = {conf/ccs/2020},\n  editor = {Ligatti, Jay and Ou, Xinming and Katz, Jonathan and Vigna, Giovanni},\n  ee = {https://doi.org/10.1145/3372297.3420017},\n  interhash = {f1329c1b0d1af0daba0d7d38b395be15},\n  intrahash = {0298a35ff6963fdbaa0bcd33492fb876},\n  isbn = {978-1-4503-7089-9},\n  keywords = {dblp},\n  pages = {2077-2079},\n  publisher = {ACM},\n  timestamp = {2024-04-10T06:17:27.000+0200},\n  title = {PhishBench 2.0: A Versatile and Extendable Benchmarking Framework for Phishing.},\n  url = {http://dblp.uni-trier.de/db/conf/ccs/ccs2020.html#ZengZBV20},\n  year = 2020\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Phishing Sites Detection from a Web Developer's Perspective Using Machine Learning.\n \n \n \n \n\n\n \n Zhou, X.; and Verma, R. M.\n\n\n \n\n\n\n In HICSS, pages 1-10, 2020. ScholarSpace\n \n\n\n\n
\n\n\n\n \n \n \"PhishingLink\n  \n \n \n \"PhishingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/hicss/ZhouV20,\n  added-at = {2022-05-04T00:00:00.000+0200},\n  author = {Zhou, Xin and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2a8ac4917715e5760d6fef19f60a22109/dblp},\n  booktitle = {HICSS},\n  crossref = {conf/hicss/2020},\n  ee = {https://hdl.handle.net/10125/64536},\n  interhash = {4417c751a766ade53123b897335970c9},\n  intrahash = {a8ac4917715e5760d6fef19f60a22109},\n  keywords = {dblp},\n  pages = {1-10},\n  publisher = {ScholarSpace},\n  timestamp = {2024-04-10T21:23:07.000+0200},\n  title = {Phishing Sites Detection from a Web Developer's Perspective Using Machine Learning.},\n  url = {http://dblp.uni-trier.de/db/conf/hicss/hicss2020.html#ZhouV20},\n  year = 2020\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Experiments in Extractive Summarization: Integer Linear Programming, Term/Sentence Scoring, and Title-driven Models.\n \n \n \n \n\n\n \n Lee, D.; Verma, R. M.; Das, A.; and Mukherjee, A.\n\n\n \n\n\n\n CoRR, abs/2008.00140. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"ExperimentsLink\n  \n \n \n \"ExperimentsPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/corr/abs-2008-00140,\n  added-at = {2021-10-08T00:00:00.000+0200},\n  author = {Lee, Daniel and Verma, Rakesh M. and Das, Avisha and Mukherjee, Arjun},\n  biburl = {https://www.bibsonomy.org/bibtex/2ba21879627bde7c74205df738a3617d5/dblp},\n  ee = {https://arxiv.org/abs/2008.00140},\n  interhash = {26e2cc5a08c9ee7c0d68484c7b254fa7},\n  intrahash = {ba21879627bde7c74205df738a3617d5},\n  journal = {CoRR},\n  keywords = {dblp},\n  timestamp = {2024-04-08T23:04:07.000+0200},\n  title = {Experiments in Extractive Summarization: Integer Linear Programming, Term/Sentence Scoring, and Title-driven Models.},\n  url = {http://dblp.uni-trier.de/db/journals/corr/corr2008.html#abs-2008-00140},\n  volume = {abs/2008.00140},\n  year = 2020\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Scam Augmentation and Customization: Identifying Vulnerable Users and Arming Defenders.\n \n \n \n \n\n\n \n Baki, S.; Verma, R. M.; and Gnawali, O.\n\n\n \n\n\n\n In Sun, H.; Shieh, S.; Gu, G.; and Ateniese, G., editor(s), AsiaCCS, pages 236-247, 2020. ACM\n \n\n\n\n
\n\n\n\n \n \n \"ScamLink\n  \n \n \n \"ScamPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/ccs/BakiVG20,\n  added-at = {2021-09-23T00:00:00.000+0200},\n  author = {Baki, Shahryar and Verma, Rakesh M. and Gnawali, Omprakash},\n  biburl = {https://www.bibsonomy.org/bibtex/2695279f81210fbb62dc9190c48a36749/dblp},\n  booktitle = {AsiaCCS},\n  crossref = {conf/ccs/2020asia},\n  editor = {Sun, Hung-Min and Shieh, Shiuh-Pyng and Gu, Guofei and Ateniese, Giuseppe},\n  ee = {https://doi.org/10.1145/3320269.3384753},\n  interhash = {124917f43847ca4f6933253636cca042},\n  intrahash = {695279f81210fbb62dc9190c48a36749},\n  isbn = {978-1-4503-6750-9},\n  keywords = {dblp},\n  pages = {236-247},\n  publisher = {ACM},\n  timestamp = {2024-04-10T09:01:04.000+0200},\n  title = {Scam Augmentation and Customization: Identifying Vulnerable Users and Arming Defenders.},\n  url = {http://dblp.uni-trier.de/db/conf/ccs/asiaccs2020.html#BakiVG20},\n  year = 2020\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Adversarial Machine Learning for Text.\n \n \n \n \n\n\n \n Lee, D.; and Verma, R. M.\n\n\n \n\n\n\n In Verma, R. M.; Khan, L.; and Mohan, C. K., editor(s), IWSPA@CODASPY, pages 33-34, 2020. ACM\n \n\n\n\n
\n\n\n\n \n \n \"AdversarialLink\n  \n \n \n \"AdversarialPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/codaspy/LeeV20,\n  added-at = {2021-09-23T00:00:00.000+0200},\n  author = {Lee, Daniel and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2526b72b1081bde7c38ff50f707688a05/dblp},\n  booktitle = {IWSPA@CODASPY},\n  crossref = {conf/codaspy/2020iwspa},\n  editor = {Verma, Rakesh M. and Khan, Latifur and Mohan, Chilukuri K.},\n  ee = {https://doi.org/10.1145/3375708.3380551},\n  interhash = {a3b6dd9592c5f786f115e3e887faf7f0},\n  intrahash = {526b72b1081bde7c38ff50f707688a05},\n  isbn = {978-1-4503-7115-5},\n  keywords = {dblp},\n  pages = {33-34},\n  publisher = {ACM},\n  timestamp = {2024-04-10T11:57:37.000+0200},\n  title = {Adversarial Machine Learning for Text.},\n  url = {http://dblp.uni-trier.de/db/conf/codaspy/iwspa2020.html#LeeV20},\n  year = 2020\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Developing A Compelling Vision for Winning the Cybersecurity Arms Race.\n \n \n \n \n\n\n \n Bertino, E.; Singhal, A.; Srinivasagopalan, S.; and Verma, R. M.\n\n\n \n\n\n\n In Roussev, V.; Thuraisingham, B.; Carminati, B.; and Kantarcioglu, M., editor(s), CODASPY, pages 220-222, 2020. ACM\n Due to the escalation of the COVID-19 situation around the world, CODASPY'20 was postponed to early fall 2020.\n\n\n\n
\n\n\n\n \n \n \"DevelopingLink\n  \n \n \n \"DevelopingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/codaspy/BertinoSSV20,\n  added-at = {2021-09-23T00:00:00.000+0200},\n  author = {Bertino, Elisa and Singhal, Anoop and Srinivasagopalan, Srivathsan and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2613b3b2657f57e95bb1e567850bba1c7/dblp},\n  booktitle = {CODASPY},\n  crossref = {conf/codaspy/2020},\n  editor = {Roussev, Vassil and Thuraisingham, Bhavani and Carminati, Barbara and Kantarcioglu, Murat},\n  ee = {https://doi.org/10.1145/3374664.3379538},\n  interhash = {fba2cd576b7f78756dc20a67fccf4450},\n  intrahash = {613b3b2657f57e95bb1e567850bba1c7},\n  isbn = {978-1-4503-7107-0},\n  keywords = {dblp},\n  note = {Due to the escalation of the COVID-19 situation around the world, CODASPY'20 was postponed to early fall 2020.},\n  pages = {220-222},\n  publisher = {ACM},\n  timestamp = {2024-04-09T11:17:01.000+0200},\n  title = {Developing A Compelling Vision for Winning the Cybersecurity Arms Race.},\n  url = {http://dblp.uni-trier.de/db/conf/codaspy/codaspy2020.html#BertinoSSV20},\n  year = 2020\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An In-Depth Benchmarking and Evaluation of Phishing Detection Research for Security Needs.\n \n \n \n \n\n\n \n Aassal, A. E.; Baki, S.; Das, A.; and Verma, R. M.\n\n\n \n\n\n\n IEEE Access, 8: 22170-22192. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"AnLink\n  \n \n \n \"AnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/access/AassalBDV20,\n  added-at = {2021-09-23T00:00:00.000+0200},\n  author = {Aassal, Ayman El and Baki, Shahryar and Das, Avisha and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2356a03922658fecfb84c00fd72cb17f7/dblp},\n  ee = {https://doi.org/10.1109/ACCESS.2020.2969780},\n  interhash = {c87fafa5479585d51d4452cf857eb89e},\n  intrahash = {356a03922658fecfb84c00fd72cb17f7},\n  journal = {IEEE Access},\n  keywords = {dblp},\n  pages = {22170-22192},\n  timestamp = {2024-04-08T13:39:49.000+0200},\n  title = {An In-Depth Benchmarking and Evaluation of Phishing Detection Research for Security Needs.},\n  url = {http://dblp.uni-trier.de/db/journals/access/access8.html#AassalBDV20},\n  volume = 8,\n  year = 2020\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Poster: A Modular and Innovative Security Analytics Course.\n \n \n \n \n\n\n \n Verma, R. M.\n\n\n \n\n\n\n In Zhang, J.; Sherriff, M.; Heckman, S.; Cutter, P. A.; and Monge, A. E., editor(s), SIGCSE, pages 1352, 2020. ACM\n \n\n\n\n
\n\n\n\n \n \n \"Poster:Link\n  \n \n \n \"Poster:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/sigcse/Verma20,\n  added-at = {2021-09-23T00:00:00.000+0200},\n  author = {Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2fbf52793e893771434c09a947d3ee1f3/dblp},\n  booktitle = {SIGCSE},\n  crossref = {conf/sigcse/2020},\n  editor = {Zhang, Jian and Sherriff, Mark and Heckman, Sarah and Cutter, Pamela A. and Monge, Alvaro E.},\n  ee = {https://doi.org/10.1145/3328778.3372649},\n  interhash = {f2c3b54c5c4b316fa905ce0c36275e54},\n  intrahash = {fbf52793e893771434c09a947d3ee1f3},\n  isbn = {978-1-4503-6793-6},\n  keywords = {dblp},\n  pages = 1352,\n  publisher = {ACM},\n  timestamp = {2024-04-09T17:37:38.000+0200},\n  title = {Poster: A Modular and Innovative Security Analytics Course.},\n  url = {http://dblp.uni-trier.de/db/conf/sigcse/sigcse2020.html#Verma20},\n  year = 2020\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Can Machines Tell Stories? A Comparative Study of Deep Neural Language Models and Metrics.\n \n \n \n \n\n\n \n Das, A.; and Verma, R. M.\n\n\n \n\n\n\n IEEE Access, 8: 181258-181292. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"CanLink\n  \n \n \n \"CanPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/access/DasV20,\n  added-at = {2020-10-20T00:00:00.000+0200},\n  author = {Das, Avisha and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2d4f7dee5e2954928023c31f38705900f/dblp},\n  ee = {https://doi.org/10.1109/ACCESS.2020.3023421},\n  interhash = {de651e03bf18fb1c9066ca2cf608483a},\n  intrahash = {d4f7dee5e2954928023c31f38705900f},\n  journal = {IEEE Access},\n  keywords = {dblp},\n  pages = {181258-181292},\n  timestamp = {2020-10-21T11:35:52.000+0200},\n  title = {Can Machines Tell Stories? A Comparative Study of Deep Neural Language Models and Metrics.},\n  url = {http://dblp.uni-trier.de/db/journals/access/access8.html#DasV20},\n  volume = 8,\n  year = 2020\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Modeling Coherency in Generated Emails by Leveraging Deep Neural Learners.\n \n \n \n \n\n\n \n Das, A.; and Verma, R. M.\n\n\n \n\n\n\n CoRR, abs/2007.07403. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"ModelingLink\n  \n \n \n \"ModelingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/corr/abs-2007-07403,\n  added-at = {2020-07-21T00:00:00.000+0200},\n  author = {Das, Avisha and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/260cd84226170f30b5ed6fd6242c1e3e5/dblp},\n  ee = {https://arxiv.org/abs/2007.07403},\n  interhash = {18a68ce5325f0eb1b14fe772af45aae4},\n  intrahash = {60cd84226170f30b5ed6fd6242c1e3e5},\n  journal = {CoRR},\n  keywords = {dblp},\n  timestamp = {2020-07-24T00:28:06.000+0200},\n  title = {Modeling Coherency in Generated Emails by Leveraging Deep Neural Learners.},\n  url = {http://dblp.uni-trier.de/db/journals/corr/corr2007.html#abs-2007-07403},\n  volume = {abs/2007.07403},\n  year = 2020\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n SoK: A Comprehensive Reexamination of Phishing Research From the Security Perspective.\n \n \n \n \n\n\n \n Das, A.; Baki, S.; Aassal, A. E.; Verma, R. M.; and Dunbar, A.\n\n\n \n\n\n\n IEEE Commun. Surv. Tutorials, 22(1): 671-708. 2020.\n \n\n\n\n
\n\n\n\n \n \n \"SoK:Link\n  \n \n \n \"SoK:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/comsur/DasBAVD20,\n  added-at = {2020-04-09T00:00:00.000+0200},\n  author = {Das, Avisha and Baki, Shahryar and Aassal, Ayman El and Verma, Rakesh M. and Dunbar, Arthur},\n  biburl = {https://www.bibsonomy.org/bibtex/274797b96958af2fca30d6bf3dee85d9c/dblp},\n  ee = {https://doi.org/10.1109/COMST.2019.2957750},\n  interhash = {1562422c544d86733257e7f2017922b3},\n  intrahash = {74797b96958af2fca30d6bf3dee85d9c},\n  journal = {IEEE Commun. Surv. Tutorials},\n  keywords = {dblp},\n  number = 1,\n  pages = {671-708},\n  timestamp = {2020-04-10T11:48:15.000+0200},\n  title = {SoK: A Comprehensive Reexamination of Phishing Research From the Security Perspective.},\n  url = {http://dblp.uni-trier.de/db/journals/comsur/comsur22.html#DasBAVD20},\n  volume = 22,\n  year = 2020\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (8)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Data Quality for Security Challenges: Case Studies of Phishing, Malware and Intrusion Detection Datasets.\n \n \n \n \n\n\n \n Verma, R. M.; Zeng, V.; and Faridi, H.\n\n\n \n\n\n\n In Cavallaro, L.; Kinder, J.; Wang, X.; and Katz, J., editor(s), CCS, pages 2605-2607, 2019. ACM\n \n\n\n\n
\n\n\n\n \n \n \"DataLink\n  \n \n \n \"DataPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/ccs/VermaZF19,\n  added-at = {2022-10-02T00:00:00.000+0200},\n  author = {Verma, Rakesh M. and Zeng, Victor and Faridi, Houtan},\n  biburl = {https://www.bibsonomy.org/bibtex/2cdad70c6097f0212009f555d217b4797/dblp},\n  booktitle = {CCS},\n  crossref = {conf/ccs/2019},\n  editor = {Cavallaro, Lorenzo and Kinder, Johannes and Wang, XiaoFeng and Katz, Jonathan},\n  ee = {https://doi.org/10.1145/3319535.3363267},\n  interhash = {5ca691a01bbf02097ab63ca0375fb43a},\n  intrahash = {cdad70c6097f0212009f555d217b4797},\n  isbn = {978-1-4503-6747-9},\n  keywords = {dblp},\n  pages = {2605-2607},\n  publisher = {ACM},\n  timestamp = {2024-04-10T06:08:30.000+0200},\n  title = {Data Quality for Security Challenges: Case Studies of Phishing, Malware and Intrusion Detection Datasets.},\n  url = {http://dblp.uni-trier.de/db/conf/ccs/ccs2019.html#VermaZF19},\n  year = 2019\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The CATS Hackathon: Creating and Refining Test Items for Cybersecurity Concept Inventories.\n \n \n \n \n\n\n \n Sherman, A. T.; Dykstra, J.; Bard, G. V.; Chattopadhyay, A.; Sharevski, F.; Verma, R. M.; Vrecenar, R.; Oliva, L.; Golaszewski, E.; Phatak, D. S.; Scheponik, T.; Herman, G. L.; Choi, D. S.; Offenberger, S. E.; and Peterson, P.\n\n\n \n\n\n\n IEEE Secur. Priv., 17(6): 77-83. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"TheLink\n  \n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/ieeesp/ShermanDBCSVVOG19,\n  added-at = {2021-09-23T00:00:00.000+0200},\n  author = {Sherman, Alan T. and Dykstra, Josiah and Bard, Gregory V. and Chattopadhyay, Ankur and Sharevski, Filipo and Verma, Rakesh M. and Vrecenar, Ryan and Oliva, Linda and Golaszewski, Enis and Phatak, Dhananjay S. and Scheponik, Travis and Herman, Geoffrey L. and Choi, Dong San and Offenberger, Spencer E. and Peterson, Peter},\n  biburl = {https://www.bibsonomy.org/bibtex/2dbd80645d87441ea4a94cffeff653008/dblp},\n  ee = {https://doi.org/10.1109/MSEC.2019.2929812},\n  interhash = {c93ad53d0d0753a364ce2374035a907a},\n  intrahash = {dbd80645d87441ea4a94cffeff653008},\n  journal = {IEEE Secur. Priv.},\n  keywords = {dblp},\n  number = 6,\n  pages = {77-83},\n  timestamp = {2024-04-09T01:43:46.000+0200},\n  title = {The CATS Hackathon: Creating and Refining Test Items for Cybersecurity Concept Inventories.},\n  url = {http://dblp.uni-trier.de/db/journals/ieeesp/ieeesp17.html#ShermanDBCSVVOG19},\n  volume = 17,\n  year = 2019\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n SOK: A Comprehensive Reexamination of Phishing Research from the Security Perspective.\n \n \n \n \n\n\n \n Das, A.; Baki, S.; Aassal, A. E.; Verma, R. M.; and Dunbar, A.\n\n\n \n\n\n\n CoRR, abs/1911.00953. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"SOK:Link\n  \n \n \n \"SOK:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/corr/abs-1911-00953,\n  added-at = {2019-11-11T00:00:00.000+0100},\n  author = {Das, Avisha and Baki, Shahryar and Aassal, Ayman El and Verma, Rakesh M. and Dunbar, Arthur},\n  biburl = {https://www.bibsonomy.org/bibtex/27ffcc56a159344960f78fa1eea0154cf/dblp},\n  ee = {http://arxiv.org/abs/1911.00953},\n  interhash = {a1c08ac66dabdbd284943031b1260111},\n  intrahash = {7ffcc56a159344960f78fa1eea0154cf},\n  journal = {CoRR},\n  keywords = {dblp},\n  timestamp = {2019-11-12T11:38:19.000+0100},\n  title = {SOK: A Comprehensive Reexamination of Phishing Research from the Security Perspective.},\n  url = {http://dblp.uni-trier.de/db/journals/corr/corr1911.html#abs-1911-00953},\n  volume = {abs/1911.00953},\n  year = 2019\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Online News Media Website Ranking Using User Generated Content.\n \n \n \n \n\n\n \n Karimi, S.; Shakery, A.; and Verma, R. M.\n\n\n \n\n\n\n CoRR, abs/1910.12441. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"OnlineLink\n  \n \n \n \"OnlinePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/corr/abs-1910-12441,\n  added-at = {2019-10-31T00:00:00.000+0100},\n  author = {Karimi, Samaneh and Shakery, Azadeh and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2426959856c6208509c19ad3664cbf884/dblp},\n  ee = {http://arxiv.org/abs/1910.12441},\n  interhash = {fbde9990726c47b56b68e241f788d9e1},\n  intrahash = {426959856c6208509c19ad3664cbf884},\n  journal = {CoRR},\n  keywords = {dblp},\n  timestamp = {2019-11-01T11:40:28.000+0100},\n  title = {Online News Media Website Ranking Using User Generated Content.},\n  url = {http://dblp.uni-trier.de/db/journals/corr/corr1910.html#abs-1910-12441},\n  volume = {abs/1910.12441},\n  year = 2019\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Parameter Tuning and Confidence Limits of Malware Clustering.\n \n \n \n \n\n\n \n Faridi, H.; Srinivasagopalan, S.; and Verma, R. M.\n\n\n \n\n\n\n In Ahn, G.; Thuraisingham, B.; Kantarcioglu, M.; and Krishnan, R., editor(s), CODASPY, pages 169-171, 2019. ACM\n \n\n\n\n
\n\n\n\n \n \n \"ParameterLink\n  \n \n \n \"ParameterPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/codaspy/FaridiSV19,\n  added-at = {2019-09-26T00:00:00.000+0200},\n  author = {Faridi, Houtan and Srinivasagopalan, Srivathsan and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/29a19065904a604ee2d2fc2857dec5a72/dblp},\n  booktitle = {CODASPY},\n  crossref = {conf/codaspy/2019},\n  editor = {Ahn, Gail-Joon and Thuraisingham, Bhavani and Kantarcioglu, Murat and Krishnan, Ram},\n  ee = {https://doi.org/10.1145/3292006.3302385},\n  interhash = {7695c23e3ab1845340a593ccbb66fa00},\n  intrahash = {9a19065904a604ee2d2fc2857dec5a72},\n  isbn = {978-1-4503-6099-9},\n  keywords = {dblp},\n  pages = {169-171},\n  publisher = {ACM},\n  timestamp = {2024-04-09T11:17:01.000+0200},\n  title = {Parameter Tuning and Confidence Limits of Malware Clustering.},\n  url = {http://dblp.uni-trier.de/db/conf/codaspy/codaspy2019.html#FaridiSV19},\n  year = 2019\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Automated email Generation for Targeted Attacks using Natural Language.\n \n \n \n \n\n\n \n Das, A.; and Verma, R. M.\n\n\n \n\n\n\n CoRR, abs/1908.06893. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"AutomatedLink\n  \n \n \n \"AutomatedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/corr/abs-1908-06893,\n  added-at = {2019-08-26T00:00:00.000+0200},\n  author = {Das, Avisha and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/245e6b7983a4d4f315d85d45ac0bfda47/dblp},\n  ee = {http://arxiv.org/abs/1908.06893},\n  interhash = {8bf2a6961717be868aab6b6cba33bf1c},\n  intrahash = {45e6b7983a4d4f315d85d45ac0bfda47},\n  journal = {CoRR},\n  keywords = {dblp},\n  timestamp = {2019-08-27T11:37:18.000+0200},\n  title = {Automated email Generation for Targeted Attacks using Natural Language.},\n  url = {http://dblp.uni-trier.de/db/journals/corr/corr1908.html#abs-1908-06893},\n  volume = {abs/1908.06893},\n  year = 2019\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Newswire versus Social Media for Disaster Response and Recovery.\n \n \n \n \n\n\n \n Verma, R. M.; Karimi, S.; Lee, D.; Gnawali, O.; and Shakery, A.\n\n\n \n\n\n\n CoRR, abs/1906.10607. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"NewswireLink\n  \n \n \n \"NewswirePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/corr/abs-1906-10607,\n  added-at = {2019-06-27T00:00:00.000+0200},\n  author = {Verma, Rakesh M. and Karimi, Samaneh and Lee, Daniel and Gnawali, Omprakash and Shakery, Azadeh},\n  biburl = {https://www.bibsonomy.org/bibtex/2ba7f4d883b98a37d86c060b2f5d5397d/dblp},\n  ee = {http://arxiv.org/abs/1906.10607},\n  interhash = {56b0d603e0ef6abacdb4188858705c8d},\n  intrahash = {ba7f4d883b98a37d86c060b2f5d5397d},\n  journal = {CoRR},\n  keywords = {dblp},\n  timestamp = {2019-06-28T11:37:20.000+0200},\n  title = {Newswire versus Social Media for Disaster Response and Recovery.},\n  url = {http://dblp.uni-trier.de/db/journals/corr/corr1906.html#abs-1906-10607},\n  volume = {abs/1906.10607},\n  year = 2019\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The CATS Hackathon: Creating and Refining Test Items for Cybersecurity Concept Inventories.\n \n \n \n \n\n\n \n Sherman, A. T.; Oliva, L.; Golaszewski, E.; Phatak, D. S.; Scheponik, T.; Herman, G. L.; Choi, D. S.; Offenberger, S. E.; Peterson, P.; Dykstra, J.; Bard, G. V.; Chattopadhyay, A.; Sharevski, F.; Verma, R. M.; and Vrecenar, R.\n\n\n \n\n\n\n CoRR, abs/1901.09286. 2019.\n \n\n\n\n
\n\n\n\n \n \n \"TheLink\n  \n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/corr/abs-1901-09286,\n  added-at = {2019-02-02T00:00:00.000+0100},\n  author = {Sherman, Alan T. and Oliva, Linda and Golaszewski, Enis and Phatak, Dhananjay S. and Scheponik, Travis and Herman, Geoffrey L. and Choi, Dong San and Offenberger, Spencer E. and Peterson, Peter and Dykstra, Josiah and Bard, Gregory V. and Chattopadhyay, Ankur and Sharevski, Filipo and Verma, Rakesh M. and Vrecenar, Ryan},\n  biburl = {https://www.bibsonomy.org/bibtex/25fd8be1afef6dbae99ae2810bb4b53e8/dblp},\n  ee = {http://arxiv.org/abs/1901.09286},\n  interhash = {c93ad53d0d0753a364ce2374035a907a},\n  intrahash = {5fd8be1afef6dbae99ae2810bb4b53e8},\n  journal = {CoRR},\n  keywords = {dblp},\n  timestamp = {2019-02-05T11:37:46.000+0100},\n  title = {The CATS Hackathon: Creating and Refining Test Items for Cybersecurity Concept Inventories.},\n  url = {http://dblp.uni-trier.de/db/journals/corr/corr1901.html#abs-1901-09286},\n  volume = {abs/1901.09286},\n  year = 2019\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (7)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n University of Houston @ CL-SciSumm 2018.\n \n \n \n \n\n\n \n Moraes, L. F. T. D.; Das, A.; Karimi, S.; and Verma, R. M.\n\n\n \n\n\n\n In Mayr, P.; Chandrasekaran, M. K.; and Jaidka, K., editor(s), BIRNDL@SIGIR, volume 2132, of CEUR Workshop Proceedings, pages 142-149, 2018. CEUR-WS.org\n \n\n\n\n
\n\n\n\n \n \n \"UniversityLink\n  \n \n \n \"UniversityPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/sigir/MoraesDKV18,\n  added-at = {2023-03-10T00:00:00.000+0100},\n  author = {Moraes, Luis F. T. De and Das, Avisha and Karimi, Samaneh and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2cc90aa00a14ff5d9821e981e046fb7d0/dblp},\n  booktitle = {BIRNDL@SIGIR},\n  crossref = {conf/sigir/2018birndl},\n  editor = {Mayr, Philipp and Chandrasekaran, Muthu Kumar and Jaidka, Kokil},\n  ee = {https://ceur-ws.org/Vol-2132/paper14.pdf},\n  interhash = {de2bed79fa79059fc0557cbee7a1add6},\n  intrahash = {cc90aa00a14ff5d9821e981e046fb7d0},\n  keywords = {dblp},\n  pages = {142-149},\n  publisher = {CEUR-WS.org},\n  series = {CEUR Workshop Proceedings},\n  timestamp = {2024-04-09T23:04:40.000+0200},\n  title = {University of Houston @ CL-SciSumm 2018.},\n  url = {http://dblp.uni-trier.de/db/conf/sigir/birndl2018.html#MoraesDKV18},\n  volume = 2132,\n  year = 2018\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Citance-based retrieval and summarization using IR and machine learning.\n \n \n \n \n\n\n \n Karimi, S.; Moraes, L. F. T.; Das, A.; Shakery, A.; and Verma, R. M.\n\n\n \n\n\n\n Scientometrics, 116(2): 1331-1366. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"Citance-basedLink\n  \n \n \n \"Citance-basedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/scientometrics/KarimiMDSV18,\n  added-at = {2021-04-09T00:00:00.000+0200},\n  author = {Karimi, Samaneh and Moraes, Luis F. T. and Das, Avisha and Shakery, Azadeh and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2a7c8e847993d2f2778ffb3945cf61c87/dblp},\n  ee = {https://doi.org/10.1007/s11192-018-2785-8},\n  interhash = {f6f9085ab90fa9ee0d7631159d392068},\n  intrahash = {a7c8e847993d2f2778ffb3945cf61c87},\n  journal = {Scientometrics},\n  keywords = {dblp},\n  number = 2,\n  pages = {1331-1366},\n  timestamp = {2024-04-09T01:17:43.000+0200},\n  title = {Citance-based retrieval and summarization using IR and machine learning.},\n  url = {http://dblp.uni-trier.de/db/journals/scientometrics/scientometrics116.html#KarimiMDSV18},\n  volume = 116,\n  year = 2018\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Identifying reference spans: topic modeling and word embeddings help IR.\n \n \n \n \n\n\n \n Moraes, L. F. T.; Baki, S.; Verma, R. M.; and Lee, D.\n\n\n \n\n\n\n Int. J. Digit. Libr., 19(2-3): 191-202. 2018.\n \n\n\n\n
\n\n\n\n \n \n \"IdentifyingLink\n  \n \n \n \"IdentifyingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/jodl/MoraesBVL18,\n  added-at = {2020-09-11T00:00:00.000+0200},\n  author = {Moraes, Luis F. T. and Baki, Shahryar and Verma, Rakesh M. and Lee, Daniel},\n  biburl = {https://www.bibsonomy.org/bibtex/21a99212ebc766ba31df2a40bf32b8ce2/dblp},\n  ee = {https://doi.org/10.1007/s00799-017-0220-z},\n  interhash = {47be193accfa3fbbf2dee75c425fbdd8},\n  intrahash = {1a99212ebc766ba31df2a40bf32b8ce2},\n  journal = {Int. J. Digit. Libr.},\n  keywords = {dblp},\n  number = {2-3},\n  pages = {191-202},\n  timestamp = {2020-09-12T11:36:50.000+0200},\n  title = {Identifying reference spans: topic modeling and word embeddings help IR.},\n  url = {http://dblp.uni-trier.de/db/journals/jodl/jodl19.html#MoraesBVL18},\n  volume = 19,\n  year = 2018\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Phishing Email Detection Using Robust NLP Techniques.\n \n \n \n \n\n\n \n Egozi, G.; and Verma, R. M.\n\n\n \n\n\n\n In Tong, H.; Li, Z. J.; Zhu, F.; and Yu, J., editor(s), ICDM Workshops, pages 7-12, 2018. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"PhishingLink\n  \n \n \n \"PhishingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/icdm/EgoziV18,\n  added-at = {2019-10-19T00:00:00.000+0200},\n  author = {Egozi, Gal and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2e642a9719a5b93baba13dbf3a1f2df1d/dblp},\n  booktitle = {ICDM Workshops},\n  crossref = {conf/icdm/2018w},\n  editor = {Tong, Hanghang and Li, Zhenhui Jessie and Zhu, Feida and Yu, Jeffrey},\n  ee = {https://doi.org/10.1109/ICDMW.2018.00009},\n  interhash = {e846f2faeaae06098ddfe71697b379f8},\n  intrahash = {e642a9719a5b93baba13dbf3a1f2df1d},\n  isbn = {978-1-5386-9288-2},\n  keywords = {dblp},\n  pages = {7-12},\n  publisher = {IEEE},\n  timestamp = {2019-11-15T11:43:20.000+0100},\n  title = {Phishing Email Detection Using Robust NLP Techniques.},\n  url = {http://dblp.uni-trier.de/db/conf/icdm/icdm2018w.html#EgoziV18},\n  year = 2018\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Performance Evaluation of Features and Clustering Algorithms for Malware.\n \n \n \n \n\n\n \n Faridi, H.; Srinivasagopalan, S.; and Verma, R. M.\n\n\n \n\n\n\n In Tong, H.; Li, Z. J.; Zhu, F.; and Yu, J., editor(s), ICDM Workshops, pages 13-22, 2018. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"PerformanceLink\n  \n \n \n \"PerformancePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/icdm/FaridiSV18,\n  added-at = {2019-09-26T00:00:00.000+0200},\n  author = {Faridi, Houtan and Srinivasagopalan, Srivathsan and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2a798962c93a4df7e0de81b2cf27f75a6/dblp},\n  booktitle = {ICDM Workshops},\n  crossref = {conf/icdm/2018w},\n  editor = {Tong, Hanghang and Li, Zhenhui Jessie and Zhu, Feida and Yu, Jeffrey},\n  ee = {https://doi.org/10.1109/ICDMW.2018.00010},\n  interhash = {e8d8674ec88d0bb25c1b4ff2d603c700},\n  intrahash = {a798962c93a4df7e0de81b2cf27f75a6},\n  isbn = {978-1-5386-9288-2},\n  keywords = {dblp},\n  pages = {13-22},\n  publisher = {IEEE},\n  timestamp = {2019-11-15T11:43:20.000+0100},\n  title = {Performance Evaluation of Features and Clustering Algorithms for Malware.},\n  url = {http://dblp.uni-trier.de/db/conf/icdm/icdm2018w.html#FaridiSV18},\n  year = 2018\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Machine Learning Methods for Software Vulnerability Detection.\n \n \n \n \n\n\n \n Chernis, B.; and Verma, R. M.\n\n\n \n\n\n\n In Verma, R. M.; and Kantarcioglu, M., editor(s), IWSPA@CODASPY, pages 31-39, 2018. ACM\n \n\n\n\n
\n\n\n\n \n \n \"MachineLink\n  \n \n \n \"MachinePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/codaspy/ChernisV18,\n  added-at = {2019-09-17T00:00:00.000+0200},\n  author = {Chernis, Boris and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2fca72179e193e5737d7b25d5f8d690a8/dblp},\n  booktitle = {IWSPA@CODASPY},\n  crossref = {conf/codaspy/2018iwspa},\n  editor = {Verma, Rakesh M. and Kantarcioglu, Murat},\n  ee = {https://doi.org/10.1145/3180445.3180453},\n  interhash = {5d3f5180a0380259978cd254bd02c484},\n  intrahash = {fca72179e193e5737d7b25d5f8d690a8},\n  keywords = {dblp},\n  pages = {31-39},\n  publisher = {ACM},\n  timestamp = {2019-09-18T11:44:01.000+0200},\n  title = {Machine Learning Methods for Software Vulnerability Detection.},\n  url = {http://dblp.uni-trier.de/db/conf/codaspy/iwspa2018.html#ChernisV18},\n  year = 2018\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Security Analytics: Adapting Data Science for Security Challenges.\n \n \n \n \n\n\n \n Verma, R. M.\n\n\n \n\n\n\n In Verma, R. M.; and Kantarcioglu, M., editor(s), IWSPA@CODASPY, pages 40-41, 2018. ACM\n \n\n\n\n
\n\n\n\n \n \n \"SecurityLink\n  \n \n \n \"SecurityPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/codaspy/Verma18,\n  added-at = {2019-09-17T00:00:00.000+0200},\n  author = {Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2c2aac64ec896d065831269bed9b0dc84/dblp},\n  booktitle = {IWSPA@CODASPY},\n  crossref = {conf/codaspy/2018iwspa},\n  editor = {Verma, Rakesh M. and Kantarcioglu, Murat},\n  ee = {https://doi.org/10.1145/3180445.3180456},\n  interhash = {7b55aa30d7faf6cefc07a165e5e43089},\n  intrahash = {c2aac64ec896d065831269bed9b0dc84},\n  keywords = {dblp},\n  pages = {40-41},\n  publisher = {ACM},\n  timestamp = {2019-09-18T11:44:01.000+0200},\n  title = {Security Analytics: Adapting Data Science for Security Challenges.},\n  url = {http://dblp.uni-trier.de/db/conf/codaspy/iwspa2018.html#Verma18},\n  year = 2018\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (12)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n University of Houston @ CL-SciSumm 2017: Positional language Models, Structural Correspondence Learning and Textual Entailment.\n \n \n \n \n\n\n \n Karimi, S.; Moraes, L. F. T.; Das, A.; and Verma, R. M.\n\n\n \n\n\n\n In Jaidka, K.; Chandrasekaran, M. K.; and Kan, M., editor(s), BIRNDL@SIGIR (2), volume 2002, of CEUR Workshop Proceedings, pages 73-85, 2017. CEUR-WS.org\n \n\n\n\n
\n\n\n\n \n \n \"UniversityLink\n  \n \n \n \"UniversityPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/sigir/KarimiMDV17,\n  added-at = {2023-03-10T00:00:00.000+0100},\n  author = {Karimi, Samaneh and Moraes, Luis F. T. and Das, Avisha and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2c9c38dde55d6325151fc843d1f2a433d/dblp},\n  booktitle = {BIRNDL@SIGIR (2)},\n  crossref = {conf/sigir/2017birndl2},\n  editor = {Jaidka, Kokil and Chandrasekaran, Muthu Kumar and Kan, Min-Yen},\n  ee = {https://ceur-ws.org/Vol-2002/uhclscisumm2017.pdf},\n  interhash = {3289b3790aaa87f213315a47cd47fc8f},\n  intrahash = {c9c38dde55d6325151fc843d1f2a433d},\n  keywords = {dblp},\n  pages = {73-85},\n  publisher = {CEUR-WS.org},\n  series = {CEUR Workshop Proceedings},\n  timestamp = {2024-04-09T23:03:32.000+0200},\n  title = {University of Houston @ CL-SciSumm 2017: Positional language Models, Structural Correspondence Learning and Textual Entailment.},\n  url = {http://dblp.uni-trier.de/db/conf/sigir/birndl2017-2.html#KarimiMDV17},\n  volume = 2002,\n  year = 2017\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The INSuRE Project: CAE-Rs Collaborate to Engage Students in Cybersecurity Research.\n \n \n \n \n\n\n \n Sherman, A. T.; Dark, M.; Chan, A.; Chong, R.; Morris, T. H.; Oliva, L.; Springer, J. A.; Thuraisingham, B.; Vatcher, C.; Verma, R. M.; and Wetzel, S.\n\n\n \n\n\n\n CoRR, abs/1703.08859. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"TheLink\n  \n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/corr/ShermanDCCMOSTV17,\n  added-at = {2022-06-29T00:00:00.000+0200},\n  author = {Sherman, Alan T. and Dark, Melissa and Chan, Agnes and Chong, Rylan and Morris, Thomas H. and Oliva, Linda and Springer, John A. and Thuraisingham, Bhavani and Vatcher, Christopher and Verma, Rakesh M. and Wetzel, Susanne},\n  biburl = {https://www.bibsonomy.org/bibtex/29004f591b76ce0969ce11ac32e3c2fdd/dblp},\n  ee = {http://arxiv.org/abs/1703.08859},\n  interhash = {3ad9a1350aeaf844736c5531e2e13492},\n  intrahash = {9004f591b76ce0969ce11ac32e3c2fdd},\n  journal = {CoRR},\n  keywords = {dblp},\n  timestamp = {2024-04-08T22:50:29.000+0200},\n  title = {The INSuRE Project: CAE-Rs Collaborate to Engage Students in Cybersecurity Research.},\n  url = {http://dblp.uni-trier.de/db/journals/corr/corr1703.html#ShermanDCCMOSTV17},\n  volume = {abs/1703.08859},\n  year = 2017\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n INSuRE: Collaborating Centers of Academic Excellence Engage Students in Cybersecurity Research.\n \n \n \n \n\n\n \n Sherman, A. T.; Dark, M.; Chan, A.; Chong, R.; Morris, T. H.; Oliva, L.; Springer, J. A.; Thuraisingham, B.; Vatcher, C.; Verma, R. M.; and Wetzel, S.\n\n\n \n\n\n\n IEEE Secur. Priv., 15(4): 72-78. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"INSuRE:Link\n  \n \n \n \"INSuRE:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/ieeesp/ShermanDCCMOSTV17,\n  added-at = {2022-06-29T00:00:00.000+0200},\n  author = {Sherman, Alan T. and Dark, Melissa and Chan, Agnes and Chong, Rylan and Morris, Thomas H. and Oliva, Linda and Springer, John A. and Thuraisingham, Bhavani and Vatcher, Christopher and Verma, Rakesh M. and Wetzel, Susanne},\n  biburl = {https://www.bibsonomy.org/bibtex/2f694fea0e41c31ef8bd88ae5e824b7d3/dblp},\n  ee = {http://doi.ieeecomputersociety.org/10.1109/MSP.2017.3151327},\n  interhash = {2a7accad4c08f20fd9e7c02af641f27c},\n  intrahash = {f694fea0e41c31ef8bd88ae5e824b7d3},\n  journal = {IEEE Secur. Priv.},\n  keywords = {dblp},\n  number = 4,\n  pages = {72-78},\n  timestamp = {2024-04-09T01:43:57.000+0200},\n  title = {INSuRE: Collaborating Centers of Academic Excellence Engage Students in Cybersecurity Research.},\n  url = {http://dblp.uni-trier.de/db/journals/ieeesp/ieeesp15.html#ShermanDCCMOSTV17},\n  volume = 15,\n  year = 2017\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Extractive Summarization: Limits, Compression, Generalized Model and Heuristics.\n \n \n \n \n\n\n \n Verma, R. M.; and Lee, D.\n\n\n \n\n\n\n Computación y Sistemas, 21(4). 2017.\n \n\n\n\n
\n\n\n\n \n \n \"ExtractiveLink\n  \n \n \n \"ExtractivePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/cys/VermaL17,\n  added-at = {2022-06-23T00:00:00.000+0200},\n  author = {Verma, Rakesh M. and Lee, Daniel},\n  biburl = {https://www.bibsonomy.org/bibtex/2b3a8b9c52cf214bd62d1255c70cc6383/dblp},\n  ee = {https://doi.org/10.13053/cys-21-4-2855},\n  interhash = {fc7ed9f0948acee8831afb70503d2c3b},\n  intrahash = {b3a8b9c52cf214bd62d1255c70cc6383},\n  journal = {Computación y Sistemas},\n  keywords = {dblp},\n  number = 4,\n  timestamp = {2024-04-08T19:03:00.000+0200},\n  title = {Extractive Summarization: Limits, Compression, Generalized Model and Heuristics.},\n  url = {http://dblp.uni-trier.de/db/journals/cys/cys21.html#VermaL17},\n  volume = 21,\n  year = 2017\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n ICE: Idiom and Collocation Extractor for Research and Education.\n \n \n \n \n\n\n \n Vuppuluri, V.; Baki, S.; Nguyen, A.; and Verma, R. M.\n\n\n \n\n\n\n In Martins, A.; and Peñas, A., editor(s), EACL (Software Demonstrations), pages 108-111, 2017. Association for Computational Linguistics\n \n\n\n\n
\n\n\n\n \n \n \"ICE:Link\n  \n \n \n \"ICE:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/eacl/VuppuluriBNV17,\n  added-at = {2021-08-06T00:00:00.000+0200},\n  author = {Vuppuluri, Vasanthi and Baki, Shahryar and Nguyen, An and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/204cdb36ddb649607ca2da566374cde0a/dblp},\n  booktitle = {EACL (Software Demonstrations)},\n  crossref = {conf/eacl/2017-d},\n  editor = {Martins, Andre and Peñas, Anselmo},\n  ee = {https://aclanthology.org/E17-3027/},\n  interhash = {e8939014dcb573f8120d4074c31a05a2},\n  intrahash = {04cdb36ddb649607ca2da566374cde0a},\n  isbn = {978-1-945626-36-4},\n  keywords = {dblp},\n  pages = {108-111},\n  publisher = {Association for Computational Linguistics},\n  timestamp = {2024-04-09T19:02:27.000+0200},\n  title = {ICE: Idiom and Collocation Extractor for Research and Education.},\n  url = {http://dblp.uni-trier.de/db/conf/eacl/eacl2017-d.html#VuppuluriBNV17},\n  year = 2017\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n What's in a URL: Fast Feature Extraction and Malicious URL Detection.\n \n \n \n \n\n\n \n Verma, R. M.; and Das, A.\n\n\n \n\n\n\n In Verma, R. M.; and Thuraisingham, B., editor(s), IWSPA@CODASPY, pages 55-63, 2017. ACM\n \n\n\n\n
\n\n\n\n \n \n \"What'sLink\n  \n \n \n \"What'sPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/codaspy/VermaD17,\n  added-at = {2021-04-09T00:00:00.000+0200},\n  author = {Verma, Rakesh M. and Das, Avisha},\n  biburl = {https://www.bibsonomy.org/bibtex/24904254ccd7b1576782f5b893650f0b7/dblp},\n  booktitle = {IWSPA@CODASPY},\n  crossref = {conf/codaspy/2017iwspa},\n  editor = {Verma, Rakesh M. and Thuraisingham, Bhavani},\n  ee = {https://doi.org/10.1145/3041008.3041016},\n  interhash = {53cdc170addc54e070676688256eda52},\n  intrahash = {4904254ccd7b1576782f5b893650f0b7},\n  isbn = {978-1-4503-4909-3},\n  keywords = {dblp},\n  pages = {55-63},\n  publisher = {ACM},\n  timestamp = {2024-04-09T11:17:04.000+0200},\n  title = {What's in a URL: Fast Feature Extraction and Malicious URL Detection.},\n  url = {http://dblp.uni-trier.de/db/conf/codaspy/iwspa2017.html#VermaD17},\n  year = 2017\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Managing critical supply chain issues in Indian healthcare.\n \n \n \n \n\n\n \n Singh, S.; Verma, R.; and Koul, S.\n\n\n \n\n\n\n In Ahuja, V.; Shi, Y.; Khazanchi, D.; Abidi, N.; Tian, Y.; Berg, D.; and Tien, J. M., editor(s), ITQM, volume 122, of Procedia Computer Science, pages 315-322, 2017. Elsevier\n \n\n\n\n
\n\n\n\n \n \n \"ManagingLink\n  \n \n \n \"ManagingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/itqm/SinghVK17,\n  added-at = {2021-02-10T00:00:00.000+0100},\n  author = {Singh, Sudhanshu and Verma, Rakesh and Koul, Saroj},\n  biburl = {https://www.bibsonomy.org/bibtex/2da9db8f5b082ffec5fba58ed0016404f/dblp},\n  booktitle = {ITQM},\n  crossref = {conf/itqm/2017},\n  editor = {Ahuja, Vandana and Shi, Yong and Khazanchi, Deepak and Abidi, Naseem and Tian, Yingjie and Berg, Daniel and Tien, James M.},\n  ee = {https://doi.org/10.1016/j.procs.2017.11.375},\n  interhash = {ab970e56f14b680a9ac61b427d7b668b},\n  intrahash = {da9db8f5b082ffec5fba58ed0016404f},\n  keywords = {dblp},\n  pages = {315-322},\n  publisher = {Elsevier},\n  series = {Procedia Computer Science},\n  timestamp = {2024-04-09T17:07:22.000+0200},\n  title = {Managing critical supply chain issues in Indian healthcare.},\n  url = {http://dblp.uni-trier.de/db/conf/itqm/itqm2017.html#SinghVK17},\n  volume = 122,\n  year = 2017\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Uniqueness of Normal Forms for Shallow Term Rewrite Systems.\n \n \n \n \n\n\n \n Radcliffe, N. R.; Moraes, L. F. T.; and Verma, R. M.\n\n\n \n\n\n\n ACM Trans. Comput. Log., 18(2): 17:1-17:20. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"UniquenessLink\n  \n \n \n \"UniquenessPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/tocl/RadcliffeMV17,\n  added-at = {2018-11-06T00:00:00.000+0100},\n  author = {Radcliffe, Nicholas R. and Moraes, Luis F. T. and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2c2e5d7588befd65358e040919881bdf2/dblp},\n  ee = {https://doi.org/10.1145/3060144},\n  interhash = {df10a9516bf8ed1fd7673f7a5406bb5e},\n  intrahash = {c2e5d7588befd65358e040919881bdf2},\n  journal = {ACM Trans. Comput. Log.},\n  keywords = {dblp},\n  number = 2,\n  pages = {17:1-17:20},\n  timestamp = {2018-11-07T12:18:12.000+0100},\n  title = {Uniqueness of Normal Forms for Shallow Term Rewrite Systems.},\n  url = {http://dblp.uni-trier.de/db/journals/tocl/tocl18.html#RadcliffeMV17},\n  volume = 18,\n  year = 2017\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Scaling and Effectiveness of Email Masquerade Attacks: Exploiting Natural Language Generation.\n \n \n \n \n\n\n \n Baki, S.; Verma, R. M.; Mukherjee, A.; and Gnawali, O.\n\n\n \n\n\n\n In Karri, R.; Sinanoglu, O.; Sadeghi, A.; and Yi, X., editor(s), AsiaCCS, pages 469-482, 2017. ACM\n \n\n\n\n
\n\n\n\n \n \n \"ScalingLink\n  \n \n \n \"ScalingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/ccs/BakiVMG17,\n  added-at = {2018-11-06T00:00:00.000+0100},\n  author = {Baki, Shahryar and Verma, Rakesh M. and Mukherjee, Arjun and Gnawali, Omprakash},\n  biburl = {https://www.bibsonomy.org/bibtex/21543ff76fd3471721115a7c2ec15f046/dblp},\n  booktitle = {AsiaCCS},\n  crossref = {conf/ccs/2017asia},\n  editor = {Karri, Ramesh and Sinanoglu, Ozgur and Sadeghi, Ahmad-Reza and Yi, Xun},\n  ee = {https://doi.org/10.1145/3052973.3053037},\n  interhash = {a39672dbfdcd5d9c48164a6283173d36},\n  intrahash = {1543ff76fd3471721115a7c2ec15f046},\n  isbn = {978-1-4503-4944-4},\n  keywords = {dblp},\n  pages = {469-482},\n  publisher = {ACM},\n  timestamp = {2024-04-09T10:13:35.000+0200},\n  title = {Scaling and Effectiveness of Email Masquerade Attacks: Exploiting Natural Language Generation.},\n  url = {http://dblp.uni-trier.de/db/conf/ccs/asiaccs2017.html#BakiVMG17},\n  year = 2017\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Comprehensive Method for Detecting Phishing EmailsUsing Correlation-based Analysis and User Participation.\n \n \n \n \n\n\n \n Verma, R. M.; and Aassal, A. E.\n\n\n \n\n\n\n In Ahn, G.; Pretschner, A.; and Ghinita, G., editor(s), CODASPY, pages 155-157, 2017. ACM\n \n\n\n\n
\n\n\n\n \n \n \"ComprehensiveLink\n  \n \n \n \"ComprehensivePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/codaspy/VermaA17,\n  added-at = {2018-11-06T00:00:00.000+0100},\n  author = {Verma, Rakesh M. and Aassal, Ayman El},\n  biburl = {https://www.bibsonomy.org/bibtex/21ca59866c9f884b45e2883fc943271ba/dblp},\n  booktitle = {CODASPY},\n  crossref = {conf/codaspy/2017},\n  editor = {Ahn, Gail-Joon and Pretschner, Alexander and Ghinita, Gabriel},\n  ee = {https://doi.org/10.1145/3029806.3029842},\n  interhash = {76808b057acbc29d659d762487cf2d2f},\n  intrahash = {1ca59866c9f884b45e2883fc943271ba},\n  isbn = {978-1-4503-4523-1},\n  keywords = {dblp},\n  pages = {155-157},\n  publisher = {ACM},\n  timestamp = {2020-09-17T11:37:31.000+0200},\n  title = {Comprehensive Method for Detecting Phishing EmailsUsing Correlation-based Analysis and User Participation.},\n  url = {http://dblp.uni-trier.de/db/conf/codaspy/codaspy2017.html#VermaA17},\n  year = 2017\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Extractive Summarization: Limits, Compression, Generalized Model and Heuristics.\n \n \n \n \n\n\n \n Verma, R. M.; and Lee, D.\n\n\n \n\n\n\n CoRR, abs/1704.05550. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"ExtractiveLink\n  \n \n \n \"ExtractivePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/corr/VermaL17,\n  added-at = {2018-08-13T00:00:00.000+0200},\n  author = {Verma, Rakesh M. and Lee, Daniel},\n  biburl = {https://www.bibsonomy.org/bibtex/259b7a61ae0986c42e23240c5ec53a2fc/dblp},\n  ee = {http://arxiv.org/abs/1704.05550},\n  interhash = {fc7ed9f0948acee8831afb70503d2c3b},\n  intrahash = {59b7a61ae0986c42e23240c5ec53a2fc},\n  journal = {CoRR},\n  keywords = {dblp},\n  timestamp = {2018-08-14T14:49:21.000+0200},\n  title = {Extractive Summarization: Limits, Compression, Generalized Model and Heuristics.},\n  url = {http://dblp.uni-trier.de/db/journals/corr/corr1704.html#VermaL17},\n  volume = {abs/1704.05550},\n  year = 2017\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Identifying Reference Spans: Topic Modeling and Word Embeddings help IR.\n \n \n \n \n\n\n \n Moraes, L. F. T.; Baki, S.; Verma, R. M.; and Lee, D.\n\n\n \n\n\n\n CoRR, abs/1708.02989. 2017.\n \n\n\n\n
\n\n\n\n \n \n \"IdentifyingLink\n  \n \n \n \"IdentifyingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/corr/abs-1708-02989,\n  added-at = {2018-08-13T00:00:00.000+0200},\n  author = {Moraes, Luis F. T. and Baki, Shahryar and Verma, Rakesh M. and Lee, Daniel},\n  biburl = {https://www.bibsonomy.org/bibtex/2066b566c7d7f821d80361543601e1417/dblp},\n  ee = {http://arxiv.org/abs/1708.02989},\n  interhash = {08a44834a0860e79ec24bf1985d0720a},\n  intrahash = {066b566c7d7f821d80361543601e1417},\n  journal = {CoRR},\n  keywords = {dblp},\n  timestamp = {2018-08-14T12:43:01.000+0200},\n  title = {Identifying Reference Spans: Topic Modeling and Word Embeddings help IR.},\n  url = {http://dblp.uni-trier.de/db/journals/corr/corr1708.html#abs-1708-02989},\n  volume = {abs/1708.02989},\n  year = 2017\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n University of Houston at CL-SciSumm 2016: SVMs with tree kernels and Sentence Similarity.\n \n \n \n \n\n\n \n Moraes, L. F. T.; Baki, S.; Verma, R. M.; and Lee, D.\n\n\n \n\n\n\n In Cabanac, G.; Chandrasekaran, M. K.; Frommholz, I.; Jaidka, K.; Kan, M.; Mayr, P.; and Wolfram, D., editor(s), BIRNDL@JCDL, volume 1610, of CEUR Workshop Proceedings, pages 113-121, 2016. CEUR-WS.org\n \n\n\n\n
\n\n\n\n \n \n \"UniversityLink\n  \n \n \n \"UniversityPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/jcdl/MoraesBVL16,\n  added-at = {2023-03-10T00:00:00.000+0100},\n  author = {Moraes, Luis F. T. and Baki, Shahryar and Verma, Rakesh M. and Lee, Daniel},\n  biburl = {https://www.bibsonomy.org/bibtex/2c82625fdef48a8a670c2206d6bf4f276/dblp},\n  booktitle = {BIRNDL@JCDL},\n  crossref = {conf/jcdl/2016birndl},\n  editor = {Cabanac, Guillaume and Chandrasekaran, Muthu Kumar and Frommholz, Ingo and Jaidka, Kokil and Kan, Min-Yen and Mayr, Philipp and Wolfram, Dietmar},\n  ee = {https://ceur-ws.org/Vol-1610/paper13.pdf},\n  interhash = {bba442e80f4b65ac1042d9294a633c37},\n  intrahash = {c82625fdef48a8a670c2206d6bf4f276},\n  keywords = {dblp},\n  pages = {113-121},\n  publisher = {CEUR-WS.org},\n  series = {CEUR Workshop Proceedings},\n  timestamp = {2024-04-09T12:35:07.000+0200},\n  title = {University of Houston at CL-SciSumm 2016: SVMs with tree kernels and Sentence Similarity.},\n  url = {http://dblp.uni-trier.de/db/conf/jcdl/birndl2016.html#MoraesBVL16},\n  volume = 1610,\n  year = 2016\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Critical Success Factors for Supplier Development and Buyer Supplier Relationship: Exploratory Factor Analysis.\n \n \n \n \n\n\n \n Sarang, J. P.; Bhasin, H. V.; Verma, R.; and Kharat, M. G.\n\n\n \n\n\n\n Int. J. Strateg. Decis. Sci., 7(1): 18-38. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"CriticalLink\n  \n \n \n \"CriticalPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/ijsds/SarangBVK16,\n  added-at = {2020-08-12T00:00:00.000+0200},\n  author = {Sarang, Joshi P. and Bhasin, H. V. and Verma, Rakesh and Kharat, Manoj Govind},\n  biburl = {https://www.bibsonomy.org/bibtex/2cf8dd0e41dc7778593ed67ed0d7bb458/dblp},\n  ee = {https://doi.org/10.4018/IJSDS.2016010102},\n  interhash = {e77f566787c1e45445dad9518954926d},\n  intrahash = {cf8dd0e41dc7778593ed67ed0d7bb458},\n  journal = {Int. J. Strateg. Decis. Sci.},\n  keywords = {dblp},\n  number = 1,\n  pages = {18-38},\n  timestamp = {2020-08-13T11:53:53.000+0200},\n  title = {Critical Success Factors for Supplier Development and Buyer Supplier Relationship: Exploratory Factor Analysis.},\n  url = {http://dblp.uni-trier.de/db/journals/ijsds/ijsds7.html#SarangBVK16},\n  volume = 7,\n  year = 2016\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Mining the Web for Collocations: IR Models of Term Associations.\n \n \n \n \n\n\n \n Verma, R. M.; Vuppuluri, V.; Nguyen, A.; Mukherjee, A.; Mammar, G.; Baki, S.; and Armstrong, R.\n\n\n \n\n\n\n In Gelbukh, A. F., editor(s), CICLing (1), volume 9623, of Lecture Notes in Computer Science, pages 177-194, 2016. Springer\n \n\n\n\n
\n\n\n\n \n \n \"MiningLink\n  \n \n \n \"MiningPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/cicling/VermaVNMMBA16,\n  added-at = {2018-11-02T00:00:00.000+0100},\n  author = {Verma, Rakesh M. and Vuppuluri, Vasanthi and Nguyen, An and Mukherjee, Arjun and Mammar, Ghita and Baki, Shahryar and Armstrong, Reed},\n  biburl = {https://www.bibsonomy.org/bibtex/2f6276f81514a74c40ae098b9306b9b4d/dblp},\n  booktitle = {CICLing (1)},\n  crossref = {conf/cicling/2016-1},\n  editor = {Gelbukh, Alexander F.},\n  ee = {https://doi.org/10.1007/978-3-319-75477-2_11},\n  interhash = {adc88f6e7b2c450b48685cefdf9bc8ec},\n  intrahash = {f6276f81514a74c40ae098b9306b9b4d},\n  isbn = {978-3-319-75477-2},\n  keywords = {dblp},\n  pages = {177-194},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2019-05-15T17:20:34.000+0200},\n  title = {Mining the Web for Collocations: IR Models of Term Associations.},\n  url = {http://dblp.uni-trier.de/db/conf/cicling/cicling2016-1.html#VermaVNMMBA16},\n  volume = 9623,\n  year = 2016\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Uniqueness of Normal Forms for Shallow Term Rewrite Systems.\n \n \n \n \n\n\n \n Radcliffe, N. R.; Moraes, L. F. T.; and Verma, R. M.\n\n\n \n\n\n\n CoRR, abs/1607.00431. 2016.\n \n\n\n\n
\n\n\n\n \n \n \"UniquenessLink\n  \n \n \n \"UniquenessPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/corr/RadcliffeMV16,\n  added-at = {2017-06-29T00:00:00.000+0200},\n  author = {Radcliffe, Nicholas R. and Moraes, Luis F. T. and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/26f4758d1469267628746929df659727d/dblp},\n  ee = {http://arxiv.org/abs/1607.00431},\n  interhash = {9f20c0c40230d0cd5760bf80c0125a50},\n  intrahash = {6f4758d1469267628746929df659727d},\n  journal = {CoRR},\n  keywords = {dblp},\n  timestamp = {2017-06-30T11:36:27.000+0200},\n  title = {Uniqueness of Normal Forms for Shallow Term Rewrite Systems.},\n  url = {http://dblp.uni-trier.de/db/journals/corr/corr1607.html#RadcliffeMV16},\n  volume = {abs/1607.00431},\n  year = 2016\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (8)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Security Analytics: Essential Data Analytics Knowledge for Cybersecurity Professionals and Students.\n \n \n \n \n\n\n \n Verma, R. M.; Kantarcioglu, M.; Marchette, D. J.; Leiss, E. L.; and Solorio, T.\n\n\n \n\n\n\n IEEE Secur. Priv., 13(6): 60-65. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"SecurityLink\n  \n \n \n \"SecurityPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/ieeesp/VermaKMLS15,\n  added-at = {2023-08-28T00:00:00.000+0200},\n  author = {Verma, Rakesh M. and Kantarcioglu, Murat and Marchette, David J. and Leiss, Ernst L. and Solorio, Thamar},\n  biburl = {https://www.bibsonomy.org/bibtex/2a95f9855903fdeca9e8de5e4fcad318f/dblp},\n  ee = {https://www.wikidata.org/entity/Q114986185},\n  interhash = {5c74d92ff44cbb85b07a0e1e05af6210},\n  intrahash = {a95f9855903fdeca9e8de5e4fcad318f},\n  journal = {IEEE Secur. Priv.},\n  keywords = {dblp},\n  number = 6,\n  pages = {60-65},\n  timestamp = {2024-04-09T01:44:08.000+0200},\n  title = {Security Analytics: Essential Data Analytics Knowledge for Cybersecurity Professionals and Students.},\n  url = {http://dblp.uni-trier.de/db/journals/ieeesp/ieeesp13.html#VermaKMLS15},\n  volume = 13,\n  year = 2015\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Topic based segmentation of classroom videos.\n \n \n \n \n\n\n \n Tuna, T.; Joshi, M.; Varghese, V.; Deshpande, R.; Subhlok, J.; and Verma, R. M.\n\n\n \n\n\n\n In FIE, pages 1-9, 2015. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"TopicLink\n  \n \n \n \"TopicPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/fie/TunaJVDSV15,\n  added-at = {2023-03-24T00:00:00.000+0100},\n  author = {Tuna, Tayfun and Joshi, Mahima and Varghese, Varun and Deshpande, Rucha and Subhlok, Jaspal and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2a536db05165bc6eddebe3b0e07f8c18a/dblp},\n  booktitle = {FIE},\n  crossref = {conf/fie/2015},\n  ee = {https://doi.ieeecomputersociety.org/10.1109/FIE.2015.7344336},\n  interhash = {cb896ca4d00d4a8c8a3b79deaccd6ef2},\n  intrahash = {a536db05165bc6eddebe3b0e07f8c18a},\n  isbn = {978-1-4799-8454-1},\n  keywords = {dblp},\n  pages = {1-9},\n  publisher = {IEEE Computer Society},\n  timestamp = {2024-04-10T15:21:44.000+0200},\n  title = {Topic based segmentation of classroom videos.},\n  url = {http://dblp.uni-trier.de/db/conf/fie/fie2015.html#TunaJVDSV15},\n  year = 2015\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Integrity Protection for Big Data Processing with Dynamic Redundancy Computation.\n \n \n \n \n\n\n \n Gao, Z.; DeSalvo, N.; Khoa, P. D.; Kim, S.; Xu, L.; Ro, W. W.; Verma, R. M.; and Shi, W.\n\n\n \n\n\n\n In ICAC, pages 159-160, 2015. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"IntegrityLink\n  \n \n \n \"IntegrityPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/icac/GaoDKKXRVS15,\n  added-at = {2023-03-24T00:00:00.000+0100},\n  author = {Gao, Zhimin and DeSalvo, Nicholas and Khoa, Pham Dang and Kim, Seung-Hun and Xu, Lei and Ro, Won Woo and Verma, Rakesh M. and Shi, Weidong},\n  biburl = {https://www.bibsonomy.org/bibtex/2ffcd67d1546e219b9349649aa38b15ff/dblp},\n  booktitle = {ICAC},\n  crossref = {conf/icac/2015},\n  ee = {https://doi.ieeecomputersociety.org/10.1109/ICAC.2015.34},\n  interhash = {db4e995b55e3aa4d5ad0afdb71c5b492},\n  intrahash = {ffcd67d1546e219b9349649aa38b15ff},\n  isbn = {978-1-4673-6971-8},\n  keywords = {dblp},\n  pages = {159-160},\n  publisher = {IEEE Computer Society},\n  timestamp = {2024-04-10T05:46:22.000+0200},\n  title = {Integrity Protection for Big Data Processing with Dynamic Redundancy Computation.},\n  url = {http://dblp.uni-trier.de/db/conf/icac/icac2015.html#GaoDKKXRVS15},\n  year = 2015\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Efficacy of Epidemic Algorithms on Detecting Node Replicas in Wireless Sensor Networks.\n \n \n \n \n\n\n \n Shashidhar, N. K.; Kari, C.; and Verma, R. M.\n\n\n \n\n\n\n J. Sens. Actuator Networks, 4(4): 378-409. 2015.\n \n\n\n\n
\n\n\n\n \n \n \"TheLink\n  \n \n \n \"ThePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/jsan/ShashidharKV15,\n  added-at = {2023-02-25T00:00:00.000+0100},\n  author = {Shashidhar, Narasimha K. and Kari, Chadi and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2bbb649bb21fc01bb75aebe56da683a86/dblp},\n  ee = {https://doi.org/10.3390/jsan4040378},\n  interhash = {2143b1ac1b005f0b12a9c77cf64defcb},\n  intrahash = {bbb649bb21fc01bb75aebe56da683a86},\n  journal = {J. Sens. Actuator Networks},\n  keywords = {dblp},\n  number = 4,\n  pages = {378-409},\n  timestamp = {2024-04-08T19:02:16.000+0200},\n  title = {The Efficacy of Epidemic Algorithms on Detecting Node Replicas in Wireless Sensor Networks.},\n  url = {http://dblp.uni-trier.de/db/journals/jsan/jsan4.html#ShashidharKV15},\n  volume = 4,\n  year = 2015\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Panel: Essential Data Analytics Knowledge forCyber-security Professionals and Students.\n \n \n \n \n\n\n \n Chan, W.; Cybenko, G.; Kantarcioglu, M.; Leiss, E. L.; Solorio, T.; Thuraisingham, B.; and Verma, R. M.\n\n\n \n\n\n\n In Huang, S.; and Verma, R. M., editor(s), IWSPA@CODASPY, pages 55-57, 2015. ACM\n \n\n\n\n
\n\n\n\n \n \n \"Panel:Link\n  \n \n \n \"Panel:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/codaspy/ChanCKLSTV15,\n  added-at = {2022-06-29T00:00:00.000+0200},\n  author = {Chan, Wenyaw and Cybenko, George and Kantarcioglu, Murat and Leiss, Ernst L. and Solorio, Thamar and Thuraisingham, Bhavani and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2c5b0a5fd000f24ff7f7ed99aada56c53/dblp},\n  booktitle = {IWSPA@CODASPY},\n  crossref = {conf/codaspy/2015iwspa},\n  editor = {Huang, Stephen and Verma, Rakesh M.},\n  ee = {https://doi.org/10.1145/2713579.2713590},\n  interhash = {674b37416034396fb5b6507f607d571d},\n  intrahash = {c5b0a5fd000f24ff7f7ed99aada56c53},\n  isbn = {978-1-4503-3341-2},\n  keywords = {dblp},\n  pages = {55-57},\n  publisher = {ACM},\n  timestamp = {2024-04-10T04:17:32.000+0200},\n  title = {Panel: Essential Data Analytics Knowledge forCyber-security Professionals and Students.},\n  url = {http://dblp.uni-trier.de/db/conf/codaspy/iwspa2015.html#ChanCKLSTV15},\n  year = 2015\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A New Approach for Idiom Identification Using Meanings and the Web.\n \n \n \n \n\n\n \n Verma, R. M.; and Vuppuluri, V.\n\n\n \n\n\n\n In Angelova, G.; Bontcheva, K.; and Mitkov, R., editor(s), RANLP, pages 681-687, 2015. RANLP 2015 Organising Committee / ACL\n \n\n\n\n
\n\n\n\n \n \n \"ALink\n  \n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/ranlp/VermaV15,\n  added-at = {2021-08-06T00:00:00.000+0200},\n  author = {Verma, Rakesh M. and Vuppuluri, Vasanthi},\n  biburl = {https://www.bibsonomy.org/bibtex/20718b68c853a6985478ed758ef974bfa/dblp},\n  booktitle = {RANLP},\n  crossref = {conf/ranlp/2015},\n  editor = {Angelova, Galia and Bontcheva, Kalina and Mitkov, Ruslan},\n  ee = {https://aclanthology.org/R15-1087/},\n  interhash = {df7d253c90f8dcb78fb15b48f05b025f},\n  intrahash = {0718b68c853a6985478ed758ef974bfa},\n  keywords = {dblp},\n  pages = {681-687},\n  publisher = {RANLP 2015 Organising Committee / ACL},\n  timestamp = {2024-04-09T10:13:22.000+0200},\n  title = {A New Approach for Idiom Identification Using Meanings and the Web.},\n  url = {http://dblp.uni-trier.de/db/conf/ranlp/ranlp2015.html#VermaV15},\n  year = 2015\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On the Character of Phishing URLs: Accurate and Robust Statistical Learning Classifiers.\n \n \n \n \n\n\n \n Verma, R. M.; and Dyer, K.\n\n\n \n\n\n\n In Park, J.; and Squicciarini, A. C., editor(s), CODASPY, pages 111-122, 2015. ACM\n \n\n\n\n
\n\n\n\n \n \n \"OnLink\n  \n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/codaspy/VermaD15,\n  added-at = {2018-11-06T00:00:00.000+0100},\n  author = {Verma, Rakesh M. and Dyer, Keith},\n  biburl = {https://www.bibsonomy.org/bibtex/22b73ff57e19a535a898d2c3a22fd69f0/dblp},\n  booktitle = {CODASPY},\n  crossref = {conf/codaspy/2015},\n  editor = {Park, Jaehong and Squicciarini, Anna Cinzia},\n  ee = {https://doi.org/10.1145/2699026.2699115},\n  interhash = {80acd2aab50a1923f01a6a815d1d81ce},\n  intrahash = {2b73ff57e19a535a898d2c3a22fd69f0},\n  isbn = {978-1-4503-3191-3},\n  keywords = {dblp},\n  pages = {111-122},\n  publisher = {ACM},\n  timestamp = {2018-11-07T14:08:31.000+0100},\n  title = {On the Character of Phishing URLs: Accurate and Robust Statistical Learning Classifiers.},\n  url = {http://dblp.uni-trier.de/db/conf/codaspy/codaspy2015.html#VermaD15},\n  year = 2015\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Phish-IDetector: Message-Id Based Automatic Phishing Detection.\n \n \n \n \n\n\n \n Verma, R. M.; and Rai, N.\n\n\n \n\n\n\n In Obaidat, M. S.; Lorenz, P.; and Samarati, P., editor(s), SECRYPT, pages 427-434, 2015. SciTePress\n \n\n\n\n
\n\n\n\n \n \n \"Phish-IDetector:Link\n  \n \n \n \"Phish-IDetector:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/secrypt/VermaR15,\n  added-at = {2015-08-06T00:00:00.000+0200},\n  author = {Verma, Rakesh M. and Rai, Nirmala},\n  biburl = {https://www.bibsonomy.org/bibtex/22d9c38903f094ff8f4fc7ca86ffa41d4/dblp},\n  booktitle = {SECRYPT},\n  crossref = {conf/secrypt/2015},\n  editor = {Obaidat, Mohammad S. and Lorenz, Pascal and Samarati, Pierangela},\n  ee = {http://dx.doi.org/10.5220/0005574304270434},\n  interhash = {3ecf660646af626ca4b6d38f29c0aeba},\n  intrahash = {2d9c38903f094ff8f4fc7ca86ffa41d4},\n  isbn = {978-989-758-117-5},\n  keywords = {dblp},\n  pages = {427-434},\n  publisher = {SciTePress},\n  timestamp = {2015-08-07T11:40:04.000+0200},\n  title = {Phish-IDetector: Message-Id Based Automatic Phishing Detection.},\n  url = {http://dblp.uni-trier.de/db/conf/secrypt/secrypt2015.html#VermaR15},\n  year = 2015\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2014\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Catching Classical and Hijack-Based Phishing Attacks.\n \n \n \n \n\n\n \n Thakur, T.; and Verma, R. M.\n\n\n \n\n\n\n In Prakash, A.; and Shyamasundar, R. K., editor(s), ICISS, volume 8880, of Lecture Notes in Computer Science, pages 318-337, 2014. Springer\n \n\n\n\n
\n\n\n\n \n \n \"CatchingLink\n  \n \n \n \"CatchingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/iciss/ThakurV14,\n  added-at = {2017-05-24T00:00:00.000+0200},\n  author = {Thakur, Tanmay and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/26d81438fade04d04fc9dd0e761604727/dblp},\n  booktitle = {ICISS},\n  crossref = {conf/iciss/2014},\n  editor = {Prakash, Atul and Shyamasundar, Rudrapatna K.},\n  ee = {https://doi.org/10.1007/978-3-319-13841-1_18},\n  interhash = {a8b906e8385eb3ec41cdcc3632ed2300},\n  intrahash = {6d81438fade04d04fc9dd0e761604727},\n  isbn = {978-3-319-13840-4},\n  keywords = {dblp},\n  pages = {318-337},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2024-04-09T15:48:12.000+0200},\n  title = {Catching Classical and Hijack-Based Phishing Attacks.},\n  url = {http://dblp.uni-trier.de/db/conf/iciss/iciss2014.html#ThakurV14},\n  volume = 8880,\n  year = 2014\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2013\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Semantic Feature Selection for Text with Application to Phishing Email Detection.\n \n \n \n \n\n\n \n Verma, R. M.; and Hossain, N.\n\n\n \n\n\n\n In Lee, H.; and Han, D., editor(s), ICISC, volume 8565, of Lecture Notes in Computer Science, pages 455-468, 2013. Springer\n \n\n\n\n
\n\n\n\n \n \n \"SemanticLink\n  \n \n \n \"SemanticPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/icisc/VermaH13,\n  added-at = {2018-11-02T00:00:00.000+0100},\n  author = {Verma, Rakesh M. and Hossain, Nabil},\n  biburl = {https://www.bibsonomy.org/bibtex/254361170e1935576d3d00d1b97f062b7/dblp},\n  booktitle = {ICISC},\n  crossref = {conf/icisc/2013},\n  editor = {Lee, Hyang-Sook and Han, Dong-Guk},\n  ee = {https://doi.org/10.1007/978-3-319-12160-4_27},\n  interhash = {b618ce8abf15cca7be678d8ef0eee654},\n  intrahash = {54361170e1935576d3d00d1b97f062b7},\n  isbn = {978-3-319-12159-8},\n  keywords = {dblp},\n  pages = {455-468},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2019-05-15T19:10:10.000+0200},\n  title = {Semantic Feature Selection for Text with Application to Phishing Email Detection.},\n  url = {http://dblp.uni-trier.de/db/conf/icisc/icisc2013.html#VermaH13},\n  volume = 8565,\n  year = 2013\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Modeling and analysis of LEAP, a key management protocol for wireless sensor networks.\n \n \n \n \n\n\n \n Verma, R. M.; and Basile, B. E.\n\n\n \n\n\n\n In SECON, pages 65-67, 2013. IEEE\n \n\n\n\n
\n\n\n\n \n \n \"ModelingLink\n  \n \n \n \"ModelingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/secon/VermaB13,\n  added-at = {2018-11-02T00:00:00.000+0100},\n  author = {Verma, Rakesh M. and Basile, Bailey E.},\n  biburl = {https://www.bibsonomy.org/bibtex/2c641400bc3d895249b7553e481beb1a1/dblp},\n  booktitle = {SECON},\n  crossref = {conf/secon/2013},\n  ee = {https://doi.org/10.1109/SAHCN.2013.6644961},\n  interhash = {4054c55eb2421dcb861e267ce6448084},\n  intrahash = {c641400bc3d895249b7553e481beb1a1},\n  isbn = {978-1-4799-0230-9},\n  keywords = {dblp},\n  pages = {65-67},\n  publisher = {IEEE},\n  timestamp = {2024-04-09T15:36:24.000+0200},\n  title = {Modeling and analysis of LEAP, a key management protocol for wireless sensor networks.},\n  url = {http://dblp.uni-trier.de/db/conf/secon/secon2013.html#VermaB13},\n  year = 2013\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2012\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Two-Pronged Phish Snagging.\n \n \n \n \n\n\n \n Verma, R. M.; Shashidhar, N. K.; and Hossain, N.\n\n\n \n\n\n\n In ARES, pages 174-179, 2012. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"Two-ProngedLink\n  \n \n \n \"Two-ProngedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/IEEEares/VermaSH12,\n  added-at = {2023-03-24T00:00:00.000+0100},\n  author = {Verma, Rakesh M. and Shashidhar, Narasimha K. and Hossain, Nabil},\n  biburl = {https://www.bibsonomy.org/bibtex/28946f8c7c3ccf8e6e32de1dcfe0e0c21/dblp},\n  booktitle = {ARES},\n  crossref = {conf/IEEEares/2012},\n  ee = {https://doi.ieeecomputersociety.org/10.1109/ARES.2012.51},\n  interhash = {5dbf5936817f06e28cb25ee2fd87e282},\n  intrahash = {8946f8c7c3ccf8e6e32de1dcfe0e0c21},\n  isbn = {978-1-4673-2244-7},\n  keywords = {dblp},\n  pages = {174-179},\n  publisher = {IEEE Computer Society},\n  timestamp = {2024-04-10T19:36:44.000+0200},\n  title = {Two-Pronged Phish Snagging.},\n  url = {http://dblp.uni-trier.de/db/conf/IEEEares/ares2012.html#VermaSH12},\n  year = 2012\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Detecting Phishing Emails the Natural Language Way.\n \n \n \n \n\n\n \n Verma, R. M.; Shashidhar, N. K.; and Hossain, N.\n\n\n \n\n\n\n In Foresti, S.; Yung, M.; and Martinelli, F., editor(s), ESORICS, volume 7459, of Lecture Notes in Computer Science, pages 824-841, 2012. Springer\n \n\n\n\n
\n\n\n\n \n \n \"DetectingLink\n  \n \n \n \"DetectingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/esorics/VermaSH12,\n  added-at = {2023-02-25T00:00:00.000+0100},\n  author = {Verma, Rakesh M. and Shashidhar, Narasimha K. and Hossain, Nabil},\n  biburl = {https://www.bibsonomy.org/bibtex/2e65e40b1ce280ee9e3cd6364d77ec311/dblp},\n  booktitle = {ESORICS},\n  crossref = {conf/esorics/2012},\n  editor = {Foresti, Sara and Yung, Moti and Martinelli, Fabio},\n  ee = {https://doi.org/10.1007/978-3-642-33167-1_47},\n  interhash = {3157d070f767b9ac298819f56ed546a5},\n  intrahash = {e65e40b1ce280ee9e3cd6364d77ec311},\n  isbn = {978-3-642-33166-4},\n  keywords = {dblp},\n  pages = {824-841},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2024-04-10T20:04:01.000+0200},\n  title = {Detecting Phishing Emails the Natural Language Way.},\n  url = {http://dblp.uni-trier.de/db/conf/esorics/esorics2012.html#VermaSH12},\n  volume = 7459,\n  year = 2012\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Combining Syntax and Semantics for Automatic Extractive Single-Document Summarization.\n \n \n \n \n\n\n \n Barrera, A.; and Verma, R. M.\n\n\n \n\n\n\n In Gelbukh, A. F., editor(s), CICLing (2), volume 7182, of Lecture Notes in Computer Science, pages 366-377, 2012. Springer\n \n\n\n\n
\n\n\n\n \n \n \"CombiningLink\n  \n \n \n \"CombiningPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/cicling/BarreraV12,\n  added-at = {2018-11-02T00:00:00.000+0100},\n  author = {Barrera, Araly and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/251919de27b2aaa7c08e855558355530c/dblp},\n  booktitle = {CICLing (2)},\n  crossref = {conf/cicling/2012-2},\n  editor = {Gelbukh, Alexander F.},\n  ee = {https://doi.org/10.1007/978-3-642-28601-8_31},\n  interhash = {dd60cd17954a33d7f00d8ff8a6d0879d},\n  intrahash = {51919de27b2aaa7c08e855558355530c},\n  isbn = {978-3-642-28600-1},\n  keywords = {dblp},\n  pages = {366-377},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2019-05-15T17:19:45.000+0200},\n  title = {Combining Syntax and Semantics for Automatic Extractive Single-Document Summarization.},\n  url = {http://dblp.uni-trier.de/db/conf/cicling/cicling2012-2.html#BarreraV12},\n  volume = 7182,\n  year = 2012\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2011\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Does Unification Help in Normalization?.\n \n \n \n \n\n\n \n Verma, R. M.; and Guo, W.\n\n\n \n\n\n\n In Baader, F.; Morawska, B.; and Otop, J., editor(s), UNIF, pages 52-58, 2011. \n \n\n\n\n
\n\n\n\n \n \n \"DoesLink\n  \n \n \n \"DoesPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/unif/VermaG11,\n  added-at = {2023-09-19T00:00:00.000+0200},\n  author = {Verma, Rakesh M. and Guo, Wei},\n  biburl = {https://www.bibsonomy.org/bibtex/261cb05d66d08e4aa35c9bb3ce461a64e/dblp},\n  booktitle = {UNIF},\n  crossref = {conf/unif/2011},\n  editor = {Baader, Franz and Morawska, Barbara and Otop, Jan},\n  ee = {https://www.irif.fr/~treinen/unif/past/unif11/unif11-proceedings.pdf#page=58},\n  interhash = {9caf36041775d1bb554d83940d1441c0},\n  intrahash = {61cb05d66d08e4aa35c9bb3ce461a64e},\n  keywords = {dblp},\n  pages = {52-58},\n  timestamp = {2024-04-09T13:16:41.000+0200},\n  title = {Does Unification Help in Normalization?},\n  url = {http://dblp.uni-trier.de/db/conf/unif/unif2011.html#VermaG11},\n  year = 2011\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Automated extractive single-document summarization: beating the baselines with a new approach.\n \n \n \n \n\n\n \n Barrera, A.; and Verma, R. M.\n\n\n \n\n\n\n In Chu, W. C.; Wong, W. E.; Palakal, M. J.; and Hung, C., editor(s), SAC, pages 268-269, 2011. ACM\n \n\n\n\n
\n\n\n\n \n \n \"AutomatedLink\n  \n \n \n \"AutomatedPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/sac/BarreraV11,\n  added-at = {2018-11-06T00:00:00.000+0100},\n  author = {Barrera, Araly and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2d62825b8bd35ea806f26dcf6c4cd9a06/dblp},\n  booktitle = {SAC},\n  crossref = {conf/sac/2011},\n  editor = {Chu, William C. and Wong, W. Eric and Palakal, Mathew J. and Hung, Chih-Cheng},\n  ee = {https://doi.org/10.1145/1982185.1982247},\n  interhash = {3133315a874793e70062f2080a60cded},\n  intrahash = {d62825b8bd35ea806f26dcf6c4cd9a06},\n  isbn = {978-1-4503-0113-8},\n  keywords = {dblp},\n  pages = {268-269},\n  publisher = {ACM},\n  timestamp = {2018-11-07T13:12:22.000+0100},\n  title = {Automated extractive single-document summarization: beating the baselines with a new approach.},\n  url = {http://dblp.uni-trier.de/db/conf/sac/sac2011.html#BarreraV11},\n  year = 2011\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n SemQuest: University of Houston's Semantics-based Question Answering System.\n \n \n \n \n\n\n \n Barrera, A.; Verma, R. M.; and Vincent, R.\n\n\n \n\n\n\n In TAC, 2011. NIST\n \n\n\n\n
\n\n\n\n \n \n \"SemQuest:Link\n  \n \n \n \"SemQuest:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/tac/BarreraVV11,\n  added-at = {2017-05-17T00:00:00.000+0200},\n  author = {Barrera, Araly and Verma, Rakesh M. and Vincent, Ryan},\n  biburl = {https://www.bibsonomy.org/bibtex/24bb75f43d86410e40e63657962e94ddf/dblp},\n  booktitle = {TAC},\n  crossref = {conf/tac/2011},\n  ee = {http://www.nist.gov/tac/publications/2011/participant.papers/txsumm.proceedings.pdf},\n  interhash = {2b20a63ad0fadf78f4ab8b06dffbaf83},\n  intrahash = {4bb75f43d86410e40e63657962e94ddf},\n  keywords = {dblp},\n  publisher = {NIST},\n  timestamp = {2017-05-18T20:28:02.000+0200},\n  title = {SemQuest: University of Houston's Semantics-based Question Answering System.},\n  url = {http://dblp.uni-trier.de/db/conf/tac/tac2011.html#BarreraVV11},\n  year = 2011\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2010\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems.\n \n \n \n \n\n\n \n Radcliffe, N. R.; and Verma, R. M.\n\n\n \n\n\n\n In Lodaya, K.; and Mahajan, M., editor(s), FSTTCS, volume 8, of LIPIcs, pages 284-295, 2010. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n \"UniquenessLink\n  \n \n \n \"UniquenessPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/fsttcs/RadcliffeV10,\n  added-at = {2018-11-30T00:00:00.000+0100},\n  author = {Radcliffe, Nicholas R. and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2b260d67b7642dbf96f5fb8235fdd2be2/dblp},\n  booktitle = {FSTTCS},\n  crossref = {conf/fsttcs/2010},\n  editor = {Lodaya, Kamal and Mahajan, Meena},\n  ee = {https://doi.org/10.4230/LIPIcs.FSTTCS.2010.284},\n  interhash = {19b9d363731e5b19bfe29677edbcdffb},\n  intrahash = {b260d67b7642dbf96f5fb8235fdd2be2},\n  isbn = {978-3-939897-23-1},\n  keywords = {dblp},\n  pages = {284-295},\n  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},\n  series = {LIPIcs},\n  timestamp = {2020-02-12T11:52:21.000+0100},\n  title = {Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems.},\n  url = {http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2010.html#RadcliffeV10},\n  volume = 8,\n  year = 2010\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems.\n \n \n \n \n\n\n \n Zinn, J.; and Verma, R. M.\n\n\n \n\n\n\n Appl. Algebra Eng. Commun. Comput., 21(6): 459-485. 2010.\n \n\n\n\n
\n\n\n\n \n \n \"ALink\n  \n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/aaecc/ZinnV10,\n  added-at = {2018-11-30T00:00:00.000+0100},\n  author = {Zinn, Julian and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/29c66ab7c07160ce216d04402b4ab6939/dblp},\n  ee = {https://doi.org/10.1007/s00200-010-0133-1},\n  interhash = {ece5ab81b8df616512d31b1b264be8b3},\n  intrahash = {9c66ab7c07160ce216d04402b4ab6939},\n  journal = {Appl. Algebra Eng. Commun. Comput.},\n  keywords = {dblp},\n  number = 6,\n  pages = {459-485},\n  timestamp = {2018-12-01T11:41:47.000+0100},\n  title = {A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems.},\n  url = {http://dblp.uni-trier.de/db/journals/aaecc/aaecc21.html#ZinnV10},\n  volume = 21,\n  year = 2010\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n R-LEAP+: randomizing LEAP+ key distribution to resist replay and jamming attacks.\n \n \n \n \n\n\n \n Blackshear, S.; and Verma, R. M.\n\n\n \n\n\n\n In Shin, S. Y.; Ossowski, S.; Schumacher, M.; Palakal, M. J.; and Hung, C., editor(s), SAC, pages 1985-1992, 2010. ACM\n \n\n\n\n
\n\n\n\n \n \n \"R-LEAP+:Link\n  \n \n \n \"R-LEAP+:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/sac/BlackshearV10,\n  added-at = {2018-11-06T00:00:00.000+0100},\n  author = {Blackshear, Sam and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/22f68ae1b889e576de5237ff62a1f3bea/dblp},\n  booktitle = {SAC},\n  crossref = {conf/sac/2010},\n  editor = {Shin, Sung Y. and Ossowski, Sascha and Schumacher, Michael and Palakal, Mathew J. and Hung, Chih-Cheng},\n  ee = {https://doi.org/10.1145/1774088.1774507},\n  interhash = {e10b43a729808220dcae83052d033b7b},\n  intrahash = {2f68ae1b889e576de5237ff62a1f3bea},\n  isbn = {978-1-60558-639-7},\n  keywords = {dblp},\n  pages = {1985-1992},\n  publisher = {ACM},\n  timestamp = {2019-06-04T12:58:30.000+0200},\n  title = {R-LEAP+: randomizing LEAP+ key distribution to resist replay and jamming attacks.},\n  url = {http://dblp.uni-trier.de/db/conf/sac/sac2010.html#BlackshearV10},\n  year = 2010\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Ranking-based Approach for Multiple-document Information Extraction.\n \n \n \n \n\n\n \n Barrera, A.; and Verma, R. M.\n\n\n \n\n\n\n In TAC, 2010. NIST\n \n\n\n\n
\n\n\n\n \n \n \"ALink\n  \n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/tac/BarreraV10,\n  added-at = {2017-05-17T00:00:00.000+0200},\n  author = {Barrera, Araly and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2551b75cad90358c5a95a2512c7a83339/dblp},\n  booktitle = {TAC},\n  crossref = {conf/tac/2010},\n  ee = {http://www.nist.gov/tac/publications/2010/participant.papers/txsumm.proceedings.pdf},\n  interhash = {19d94d1aafad454e9f119961462b67bc},\n  intrahash = {551b75cad90358c5a95a2512c7a83339},\n  keywords = {dblp},\n  publisher = {NIST},\n  timestamp = {2017-05-18T20:28:02.000+0200},\n  title = {A Ranking-based Approach for Multiple-document Information Extraction.},\n  url = {http://dblp.uni-trier.de/db/conf/tac/tac2010.html#BarreraV10},\n  year = 2010\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2009\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems.\n \n \n \n \n\n\n \n Verma, R. M.\n\n\n \n\n\n\n Fundam. Informaticae, 92(1-2): 145-168. 2009.\n \n\n\n\n
\n\n\n\n \n \n \"ComplexityLink\n  \n \n \n \"ComplexityPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/fuin/Verma09,\n  added-at = {2020-09-18T00:00:00.000+0200},\n  author = {Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/21fe98c9983c170dba732ba431291e540/dblp},\n  ee = {https://doi.org/10.3233/FI-2009-0070},\n  interhash = {f6485b2d15eb26985d4a080c9cbd3ce0},\n  intrahash = {1fe98c9983c170dba732ba431291e540},\n  journal = {Fundam. Informaticae},\n  keywords = {dblp},\n  number = {1-2},\n  pages = {145-168},\n  timestamp = {2020-09-19T11:34:57.000+0200},\n  title = {Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems.},\n  url = {http://dblp.uni-trier.de/db/journals/fuin/fuin92.html#Verma09},\n  volume = 92,\n  year = 2009\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Vendor selection and uncertainty.\n \n \n \n \n\n\n \n Verma, R.; Koul, S.; and Govindan, K.\n\n\n \n\n\n\n Int. J. Bus. Perform. Supply Chain Model., 1(4): 333-345. 2009.\n \n\n\n\n
\n\n\n\n \n \n \"VendorLink\n  \n \n \n \"VendorPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/ijbpscm/VermaKG09,\n  added-at = {2020-05-21T00:00:00.000+0200},\n  author = {Verma, Rakesh and Koul, Saroj and Govindan, Kannan},\n  biburl = {https://www.bibsonomy.org/bibtex/2cbcac0bd004651698051d8cd791e8b41/dblp},\n  ee = {https://doi.org/10.1504/IJBPSCM.2009.033749},\n  interhash = {ae1f0d3ec9787e878582125b0d75e042},\n  intrahash = {cbcac0bd004651698051d8cd791e8b41},\n  journal = {Int. J. Bus. Perform. Supply Chain Model.},\n  keywords = {dblp},\n  number = 4,\n  pages = {333-345},\n  timestamp = {2020-05-23T12:26:46.000+0200},\n  title = {Vendor selection and uncertainty.},\n  url = {http://dblp.uni-trier.de/db/journals/ijbpscm/ijbpscm1.html#VermaKG09},\n  volume = 1,\n  year = 2009\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Correcting and Improving the NP Proof for Cryptographic Protocol Insecurity.\n \n \n \n \n\n\n \n Liang, Z.; and Verma, R. M.\n\n\n \n\n\n\n In Prakash, A.; and Gupta, I., editor(s), ICISS, volume 5905, of Lecture Notes in Computer Science, pages 101-116, 2009. Springer\n \n\n\n\n
\n\n\n\n \n \n \"CorrectingLink\n  \n \n \n \"CorrectingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/iciss/LiangV09,\n  added-at = {2018-11-02T00:00:00.000+0100},\n  author = {Liang, Zhiyao and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/221a056b2b1de4882a8cf6e9cf41d2582/dblp},\n  booktitle = {ICISS},\n  crossref = {conf/iciss/2009},\n  editor = {Prakash, Atul and Gupta, Indranil},\n  ee = {https://doi.org/10.1007/978-3-642-10772-6_9},\n  interhash = {0a5e2574ec58198ce97111335323d929},\n  intrahash = {21a056b2b1de4882a8cf6e9cf41d2582},\n  isbn = {978-3-642-10771-9},\n  keywords = {dblp},\n  pages = {101-116},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2024-04-09T15:48:12.000+0200},\n  title = {Correcting and Improving the NP Proof for Cryptographic Protocol Insecurity.},\n  url = {http://dblp.uni-trier.de/db/conf/iciss/iciss2009.html#LiangV09},\n  volume = 5905,\n  year = 2009\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2008\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Improving Techniques for Proving Undecidability of Checking Cryptographic Protocols.\n \n \n \n \n\n\n \n Liang, Z.; and Verma, R. M.\n\n\n \n\n\n\n In ARES, pages 1067-1074, 2008. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"ImprovingLink\n  \n \n \n \"ImprovingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/IEEEares/LiangV08,\n  added-at = {2023-03-24T00:00:00.000+0100},\n  author = {Liang, Zhiyao and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2921d44a814c2c72ec00af49d3be70598/dblp},\n  booktitle = {ARES},\n  crossref = {conf/IEEEares/2008},\n  ee = {https://doi.ieeecomputersociety.org/10.1109/ARES.2008.198},\n  interhash = {b76731d71982040fd475eb301d28d7c6},\n  intrahash = {921d44a814c2c72ec00af49d3be70598},\n  isbn = {978-0-7695-3102-1},\n  keywords = {dblp},\n  pages = {1067-1074},\n  publisher = {IEEE Computer Society},\n  timestamp = {2024-04-10T19:35:29.000+0200},\n  title = {Improving Techniques for Proving Undecidability of Checking Cryptographic Protocols.},\n  url = {http://dblp.uni-trier.de/db/conf/IEEEares/ares2008.html#LiangV08},\n  year = 2008\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n New Undecidability Results for Properties of Term Rewrite Systems.\n \n \n \n \n\n\n \n Verma, R. M.\n\n\n \n\n\n\n In Kniesel, G.; and Pinto, J. S., editor(s), RULE, volume 290, of Electronic Notes in Theoretical Computer Science, pages 69-85, 2008. Elsevier\n \n\n\n\n
\n\n\n\n \n \n \"NewLink\n  \n \n \n \"NewPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{journals/entcs/Verma12,\n  added-at = {2022-11-25T00:00:00.000+0100},\n  author = {Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2b5cfb9f569d52ee076bd636e6d7e8746/dblp},\n  booktitle = {RULE},\n  crossref = {conf/rule/2008},\n  editor = {Kniesel, Günter and Pinto, Jorge Sousa},\n  ee = {https://www.wikidata.org/entity/Q113318030},\n  interhash = {9827d8806b052d9a3240c1e3831670a2},\n  intrahash = {b5cfb9f569d52ee076bd636e6d7e8746},\n  keywords = {dblp},\n  pages = {69-85},\n  publisher = {Elsevier},\n  series = {Electronic Notes in Theoretical Computer Science},\n  timestamp = {2024-04-09T15:11:14.000+0200},\n  title = {New Undecidability Results for Properties of Term Rewrite Systems.},\n  url = {http://dblp.uni-trier.de/db/journals/entcs/entcs290.html#Verma12},\n  volume = 290,\n  year = 2008\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Semantic Analysis of Association Rules.\n \n \n \n \n\n\n \n Chen, P.; Verma, R. M.; Meininger, J. C.; and Chan, W.\n\n\n \n\n\n\n In Wilson, D.; and Lane, H. C., editor(s), FLAIRS, pages 270-275, 2008. AAAI Press\n \n\n\n\n
\n\n\n\n \n \n \"SemanticLink\n  \n \n \n \"SemanticPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/flairs/ChenVMC08,\n  added-at = {2022-10-26T00:00:00.000+0200},\n  author = {Chen, Ping and Verma, Rakesh M. and Meininger, Janet C. and Chan, Wenyaw},\n  biburl = {https://www.bibsonomy.org/bibtex/200c7a0180476fd78989a0f463eb1bf02/dblp},\n  booktitle = {FLAIRS},\n  crossref = {conf/flairs/2008},\n  editor = {Wilson, David and Lane, H. Chad},\n  ee = {http://www.aaai.org/Library/FLAIRS/2008/flairs08-068.php},\n  interhash = {c772cf7e3fe819276b8dcc8c114ae8e6},\n  intrahash = {00c7a0180476fd78989a0f463eb1bf02},\n  isbn = {978-1-57735-365-2},\n  keywords = {dblp},\n  pages = {270-275},\n  publisher = {AAAI Press},\n  timestamp = {2024-04-10T02:02:36.000+0200},\n  title = {Semantic Analysis of Association Rules.},\n  url = {http://dblp.uni-trier.de/db/conf/flairs/flairs2008.html#ChenVMC08},\n  year = 2008\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Semantic Multi-Document Update Summarization Techniques.\n \n \n \n \n\n\n \n Verma, R. M.; Kent, D.; and Chen, P.\n\n\n \n\n\n\n In TAC, 2008. NIST\n \n\n\n\n
\n\n\n\n \n \n \"SemanticLink\n  \n \n \n \"SemanticPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/tac/VermaKC08,\n  added-at = {2022-08-11T00:00:00.000+0200},\n  author = {Verma, Rakesh M. and Kent, David and Chen, Ping},\n  biburl = {https://www.bibsonomy.org/bibtex/24be9324162ff9990548ce3948c4ea4f2/dblp},\n  booktitle = {TAC},\n  crossref = {conf/tac/2008},\n  ee = {https://tac.nist.gov/publications/2008/participant.papers/txsumm.proceedings.pdf},\n  interhash = {b13290bc0b484853178ba651d6d59bcd},\n  intrahash = {4be9324162ff9990548ce3948c4ea4f2},\n  keywords = {dblp},\n  publisher = {NIST},\n  timestamp = {2024-04-10T05:01:42.000+0200},\n  title = {Semantic Multi-Document Update Summarization Techniques.},\n  url = {http://dblp.uni-trier.de/db/conf/tac/tac2008.html#VermaKC08},\n  year = 2008\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Visualization of rule-based programming.\n \n \n \n \n\n\n \n Yu, W.; and Verma, R. M.\n\n\n \n\n\n\n In Wainwright, R. L.; and Haddad, H., editor(s), SAC, pages 1258-1259, 2008. ACM\n \n\n\n\n
\n\n\n\n \n \n \"VisualizationLink\n  \n \n \n \"VisualizationPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/sac/YuV08,\n  added-at = {2018-11-06T00:00:00.000+0100},\n  author = {Yu, Wenshan and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2dea6197827d3acaa8d9ffef0902bee37/dblp},\n  booktitle = {SAC},\n  crossref = {conf/sac/2008},\n  editor = {Wainwright, Roger L. and Haddad, Hisham},\n  ee = {https://doi.org/10.1145/1363686.1363976},\n  interhash = {c1f0741ff204364dedf0c16ec69ebcd1},\n  intrahash = {dea6197827d3acaa8d9ffef0902bee37},\n  isbn = {978-1-59593-753-7},\n  keywords = {dblp},\n  pages = {1258-1259},\n  publisher = {ACM},\n  timestamp = {2018-11-07T13:12:50.000+0100},\n  title = {Visualization of rule-based programming.},\n  url = {http://dblp.uni-trier.de/db/conf/sac/sac2008.html#YuV08},\n  year = 2008\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Complexity of Checking Freshness of Cryptographic Protocols.\n \n \n \n \n\n\n \n Liang, Z.; and Verma, R. M.\n\n\n \n\n\n\n In Sekar, R.; and Pujari, A. K., editor(s), ICISS, volume 5352, of Lecture Notes in Computer Science, pages 86-101, 2008. Springer\n \n\n\n\n
\n\n\n\n \n \n \"ComplexityLink\n  \n \n \n \"ComplexityPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/iciss/LiangV08,\n  added-at = {2018-11-02T00:00:00.000+0100},\n  author = {Liang, Zhiyao and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2a51e4ba650f5b98ced87a3f018e2a821/dblp},\n  booktitle = {ICISS},\n  crossref = {conf/iciss/2008},\n  editor = {Sekar, R. and Pujari, Arun K.},\n  ee = {https://doi.org/10.1007/978-3-540-89862-7_6},\n  interhash = {1690b6fe53343740d1bdd6b8ac7bd96d},\n  intrahash = {a51e4ba650f5b98ced87a3f018e2a821},\n  isbn = {978-3-540-89861-0},\n  keywords = {dblp},\n  pages = {86-101},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2024-04-09T15:48:12.000+0200},\n  title = {Complexity of Checking Freshness of Cryptographic Protocols.},\n  url = {http://dblp.uni-trier.de/db/conf/iciss/iciss2008.html#LiangV08},\n  volume = 5352,\n  year = 2008\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2006\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A Query-Based Medical Information Summarization System Using Ontology Knowledge.\n \n \n \n \n\n\n \n Chen, P.; and Verma, R. M.\n\n\n \n\n\n\n In CBMS, pages 37-42, 2006. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"ALink\n  \n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/cbms/ChenV06,\n  added-at = {2023-03-24T00:00:00.000+0100},\n  author = {Chen, Ping and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/228fc6c19c204eb9c1402cad8f44832b1/dblp},\n  booktitle = {CBMS},\n  crossref = {conf/cbms/2006},\n  ee = {https://doi.ieeecomputersociety.org/10.1109/CBMS.2006.25},\n  interhash = {be69838e22c4e489476280abcce0787c},\n  intrahash = {28fc6c19c204eb9c1402cad8f44832b1},\n  isbn = {978-0-7695-2517-4},\n  keywords = {dblp},\n  pages = {37-42},\n  publisher = {IEEE Computer Society},\n  timestamp = {2024-04-10T21:53:25.000+0200},\n  title = {A Query-Based Medical Information Summarization System Using Ontology Knowledge.},\n  url = {http://dblp.uni-trier.de/db/conf/cbms/cbms2006.html#ChenV06},\n  year = 2006\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Automata theory: its relevance to computer science students and course contents.\n \n \n \n \n\n\n \n Armoni, M.; Rodger, S. H.; Vardi, M. Y.; and Verma, R. M.\n\n\n \n\n\n\n In Baldwin, D.; Tymann, P. T.; Haller, S. M.; and Russell, I., editor(s), SIGCSE, pages 197-198, 2006. ACM\n \n\n\n\n
\n\n\n\n \n \n \"AutomataLink\n  \n \n \n \"AutomataPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/sigcse/ArmoniRVV06,\n  added-at = {2021-03-09T00:00:00.000+0100},\n  author = {Armoni, Michal and Rodger, Susan H. and Vardi, Moshe Y. and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/21ddf91545a238ce862ee47974dbeb6d0/dblp},\n  booktitle = {SIGCSE},\n  crossref = {conf/sigcse/2006},\n  editor = {Baldwin, Doug and Tymann, Paul T. and Haller, Susan M. and Russell, Ingrid},\n  ee = {https://doi.org/10.1145/1124706.1121403},\n  interhash = {51ba2fe4811f3f906aee75fabd9ba5f8},\n  intrahash = {1ddf91545a238ce862ee47974dbeb6d0},\n  isbn = {1-59593-259-3},\n  keywords = {dblp},\n  pages = {197-198},\n  publisher = {ACM},\n  timestamp = {2024-04-09T17:40:50.000+0200},\n  title = {Automata theory: its relevance to computer science students and course contents.},\n  url = {http://dblp.uni-trier.de/db/conf/sigcse/sigcse2006.html#ArmoniRVV06},\n  year = 2006\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2005\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A visual and interactive automata theory course emphasizing breadth of automata.\n \n \n \n \n\n\n \n Verma, R. M.\n\n\n \n\n\n\n In Cunha, J. C.; Fleischman, W. M.; Proulx, V. K.; and Lourenço, J., editor(s), ITiCSE, pages 325-329, 2005. ACM\n \n\n\n\n
\n\n\n\n \n \n \"ALink\n  \n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/iticse/Verma05,\n  added-at = {2021-03-09T00:00:00.000+0100},\n  author = {Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2f21f8c74db3cc7df98f27e2739056e2a/dblp},\n  booktitle = {ITiCSE},\n  crossref = {conf/iticse/2005},\n  editor = {Cunha, José C. and Fleischman, William M. and Proulx, Viera K. and Lourenço, João},\n  ee = {https://doi.org/10.1145/1151954.1067535},\n  interhash = {b30d0d42240e666a022b74112057fe92},\n  intrahash = {f21f8c74db3cc7df98f27e2739056e2a},\n  isbn = {1-59593-024-8},\n  keywords = {dblp},\n  pages = {325-329},\n  publisher = {ACM},\n  timestamp = {2024-04-09T15:50:53.000+0200},\n  title = {A visual and interactive automata theory course emphasizing breadth of automata.},\n  url = {http://dblp.uni-trier.de/db/conf/iticse/iticse2005.html#Verma05},\n  year = 2005\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A new decidability technique for ground term rewriting systems with applications.\n \n \n \n \n\n\n \n Verma, R. M.; and Hayrapetyan, A.\n\n\n \n\n\n\n ACM Trans. Comput. Log., 6(1): 102-123. 2005.\n \n\n\n\n
\n\n\n\n \n \n \"ALink\n  \n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/tocl/VermaH05,\n  added-at = {2018-11-06T00:00:00.000+0100},\n  author = {Verma, Rakesh M. and Hayrapetyan, Ara},\n  biburl = {https://www.bibsonomy.org/bibtex/244d07de7a0e8778f58fc2d640c9960e8/dblp},\n  ee = {https://doi.org/10.1145/1042038.1042042},\n  interhash = {64e8460a14f09fdb05ea23e594a219f9},\n  intrahash = {44d07de7a0e8778f58fc2d640c9960e8},\n  journal = {ACM Trans. Comput. Log.},\n  keywords = {dblp},\n  number = 1,\n  pages = {102-123},\n  timestamp = {2018-11-07T12:18:18.000+0100},\n  title = {A new decidability technique for ground term rewriting systems with applications.},\n  url = {http://dblp.uni-trier.de/db/journals/tocl/tocl6.html#VermaH05},\n  volume = 6,\n  year = 2005\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2004\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Remarks on Thatte's transformation of term rewriting systems.\n \n \n \n \n\n\n \n Luttik, B.; Rodenburg, P.; and Verma, R. M.\n\n\n \n\n\n\n Inf. Comput., 195(1-2): 66-87. 2004.\n \n\n\n\n
\n\n\n\n \n \n \"RemarksLink\n  \n \n \n \"RemarksPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/iandc/LuttikRV04,\n  added-at = {2021-02-12T00:00:00.000+0100},\n  author = {Luttik, Bas and Rodenburg, Piet and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/28e98f9bf17b566df7f6fb49fe70f4cbd/dblp},\n  ee = {https://doi.org/10.1016/j.ic.2003.09.006},\n  interhash = {0c7dd8879a1dc34f6fabecfb7cc2f07a},\n  intrahash = {8e98f9bf17b566df7f6fb49fe70f4cbd},\n  journal = {Inf. Comput.},\n  keywords = {dblp},\n  number = {1-2},\n  pages = {66-87},\n  timestamp = {2024-04-09T06:09:32.000+0200},\n  title = {Remarks on Thatte's transformation of term rewriting systems.},\n  url = {http://dblp.uni-trier.de/db/journals/iandc/iandc195.html#LuttikRV04},\n  volume = 195,\n  year = 2004\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Deciding confluence of certain term rewriting systems in polynomial time.\n \n \n \n \n\n\n \n Godoy, G.; Tiwari, A.; and Verma, R. M.\n\n\n \n\n\n\n Ann. Pure Appl. Log., 130(1-3): 33-59. 2004.\n \n\n\n\n
\n\n\n\n \n \n \"DecidingLink\n  \n \n \n \"DecidingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/apal/GodoyTV04,\n  added-at = {2020-02-21T00:00:00.000+0100},\n  author = {Godoy, Guillem and Tiwari, Ashish and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2e71fc291eb349a807c308dbf5856b300/dblp},\n  ee = {https://doi.org/10.1016/j.apal.2004.04.005},\n  interhash = {1efd4b5b333a0710c08c2a1b47ce98a5},\n  intrahash = {e71fc291eb349a807c308dbf5856b300},\n  journal = {Ann. Pure Appl. Log.},\n  keywords = {dblp},\n  number = {1-3},\n  pages = {33-59},\n  timestamp = {2020-02-22T12:45:55.000+0100},\n  title = {Deciding confluence of certain term rewriting systems in polynomial time.},\n  url = {http://dblp.uni-trier.de/db/journals/apal/apal130.html#GodoyTV04},\n  volume = 130,\n  year = 2004\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Characterizing Confluence by Rewrite Closure and Right Ground Term Rewrite Systems.\n \n \n \n \n\n\n \n Godoy, G.; Tiwari, A.; and Verma, R. M.\n\n\n \n\n\n\n Appl. Algebra Eng. Commun. Comput., 15(1): 13-36. 2004.\n \n\n\n\n
\n\n\n\n \n \n \"CharacterizingLink\n  \n \n \n \"CharacterizingPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/aaecc/GodoyTV04,\n  added-at = {2019-11-06T00:00:00.000+0100},\n  author = {Godoy, Guillem and Tiwari, Ashish and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2ef3bc34df2714d7f76c79860131b0e29/dblp},\n  ee = {https://doi.org/10.1007/s00200-004-0148-6},\n  interhash = {f6e36f56d5bd5408467890f1948dfbfc},\n  intrahash = {ef3bc34df2714d7f76c79860131b0e29},\n  journal = {Appl. Algebra Eng. Commun. Comput.},\n  keywords = {dblp},\n  number = 1,\n  pages = {13-36},\n  timestamp = {2019-11-07T11:39:26.000+0100},\n  title = {Characterizing Confluence by Rewrite Closure and Right Ground Term Rewrite Systems.},\n  url = {http://dblp.uni-trier.de/db/journals/aaecc/aaecc15.html#GodoyTV04},\n  volume = 15,\n  year = 2004\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2003\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On the Confluence of Linear Shallow Term Rewrite Systems.\n \n \n \n \n\n\n \n Godoy, G.; Tiwari, A.; and Verma, R. M.\n\n\n \n\n\n\n In Alt, H.; and Habib, M., editor(s), STACS, volume 2607, of Lecture Notes in Computer Science, pages 85-96, 2003. Springer\n \n\n\n\n
\n\n\n\n \n \n \"OnLink\n  \n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/stacs/GodoyTV03,\n  added-at = {2019-11-06T00:00:00.000+0100},\n  author = {Godoy, Guillem and Tiwari, Ashish and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2306e499554557e423f49529b92fd8de0/dblp},\n  booktitle = {STACS},\n  crossref = {conf/stacs/2003},\n  editor = {Alt, Helmut and Habib, Michel},\n  ee = {https://doi.org/10.1007/3-540-36494-3_9},\n  interhash = {f000c825629f4eb35b32558ec661a00b},\n  intrahash = {306e499554557e423f49529b92fd8de0},\n  isbn = {3-540-00623-0},\n  keywords = {dblp},\n  pages = {85-96},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2024-04-09T20:44:31.000+0200},\n  title = {On the Confluence of Linear Shallow Term Rewrite Systems.},\n  url = {http://dblp.uni-trier.de/db/conf/stacs/stacs2003.html#GodoyTV03},\n  volume = 2607,\n  year = 2003\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2002\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On the Structure of Counterexamples to Symmetric Orderings for BDD's.\n \n \n \n \n\n\n \n Verma, R. M.; and Hwang, S.\n\n\n \n\n\n\n In Harland, J., editor(s), CATS, volume 61, of Electronic Notes in Theoretical Computer Science, pages 84-100, 2002. Elsevier\n \n\n\n\n
\n\n\n\n \n \n \"OnLink\n  \n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{journals/entcs/VermaH02,\n  added-at = {2022-11-11T00:00:00.000+0100},\n  author = {Verma, Rakesh M. and Hwang, Sarah},\n  biburl = {https://www.bibsonomy.org/bibtex/277555764eaccd8e923795a75e92f81b2/dblp},\n  booktitle = {CATS},\n  crossref = {conf/cats/2002},\n  editor = {Harland, James},\n  ee = {https://doi.org/10.1016/S1571-0661(04)00307-X},\n  interhash = {d337b006ee320e5c853f9cdd7fcd2bde},\n  intrahash = {77555764eaccd8e923795a75e92f81b2},\n  keywords = {dblp},\n  pages = {84-100},\n  publisher = {Elsevier},\n  series = {Electronic Notes in Theoretical Computer Science},\n  timestamp = {2024-04-10T00:25:06.000+0200},\n  title = {On the Structure of Counterexamples to Symmetric Orderings for BDD's.},\n  url = {http://dblp.uni-trier.de/db/journals/entcs/entcs61.html#VermaH02},\n  volume = 61,\n  year = 2002\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n K-tree/forest: efficient indexes for boolean queries.\n \n \n \n \n\n\n \n Verma, R. M.; and Behl, S.\n\n\n \n\n\n\n In Järvelin, K.; Beaulieu, M.; Baeza-Yates, R. A.; and Myaeng, S., editor(s), SIGIR, pages 433-434, 2002. ACM\n \n\n\n\n
\n\n\n\n \n \n \"K-tree/forest:Link\n  \n \n \n \"K-tree/forest:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/sigir/VermaB02,\n  added-at = {2018-11-06T00:00:00.000+0100},\n  author = {Verma, Rakesh M. and Behl, Sanjiv},\n  biburl = {https://www.bibsonomy.org/bibtex/2e6f0a31a5630df8f2ee3e162ed8155b1/dblp},\n  booktitle = {SIGIR},\n  crossref = {conf/sigir/2002},\n  editor = {Järvelin, Kalervo and Beaulieu, Micheline and Baeza-Yates, Ricardo A. and Myaeng, Sung-Hyon},\n  ee = {https://doi.org/10.1145/564376.564480},\n  interhash = {916825d1f36951d8149a21868e08dc48},\n  intrahash = {e6f0a31a5630df8f2ee3e162ed8155b1},\n  isbn = {1-58113-561-0},\n  keywords = {dblp},\n  pages = {433-434},\n  publisher = {ACM},\n  timestamp = {2018-11-08T11:37:23.000+0100},\n  title = {K-tree/forest: efficient indexes for boolean queries.},\n  url = {http://dblp.uni-trier.de/db/conf/sigir/sigir2002.html#VermaB02},\n  year = 2002\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Algorithms and reductions for rewriting problems II.\n \n \n \n \n\n\n \n Verma, R. M.\n\n\n \n\n\n\n Inf. Process. Lett., 84(4): 227-233. 2002.\n \n\n\n\n
\n\n\n\n \n \n \"AlgorithmsLink\n  \n \n \n \"AlgorithmsPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/ipl/Verma02,\n  added-at = {2018-11-02T00:00:00.000+0100},\n  author = {Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2bc11fdc944b5c65a7d487b9a99cd8174/dblp},\n  ee = {https://doi.org/10.1016/S0020-0190(02)00395-2},\n  interhash = {6736557af1468400e0265d1a4ae91497},\n  intrahash = {bc11fdc944b5c65a7d487b9a99cd8174},\n  journal = {Inf. Process. Lett.},\n  keywords = {dblp},\n  number = 4,\n  pages = {227-233},\n  timestamp = {2018-11-03T11:57:42.000+0100},\n  title = {Algorithms and reductions for rewriting problems II.},\n  url = {http://dblp.uni-trier.de/db/journals/ipl/ipl84.html#Verma02},\n  volume = 84,\n  year = 2002\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2001\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming.\n \n \n \n \n\n\n \n Basu, S.; Mukund, M.; Ramakrishnan, C. R.; Ramakrishnan, I. V.; and Verma, R. M.\n\n\n \n\n\n\n In Codognet, P., editor(s), ICLP, volume 2237, of Lecture Notes in Computer Science, pages 166-180, 2001. Springer\n \n\n\n\n
\n\n\n\n \n \n \"LocalLink\n  \n \n \n \"LocalPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/iclp/BasuMRRV01,\n  added-at = {2023-04-03T00:00:00.000+0200},\n  author = {Basu, Samik and Mukund, Madhavan and Ramakrishnan, C. R. and Ramakrishnan, I. V. and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2f7b2a0aa4365b1ccb1657442d08a1a8d/dblp},\n  booktitle = {ICLP},\n  crossref = {conf/iclp/2001},\n  editor = {Codognet, Philippe},\n  ee = {https://doi.org/10.1007/3-540-45635-X_19},\n  interhash = {6627a2569a7989163221527692e2ca9c},\n  intrahash = {f7b2a0aa4365b1ccb1657442d08a1a8d},\n  isbn = {3-540-42935-2},\n  keywords = {dblp},\n  pages = {166-180},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2024-04-10T03:50:47.000+0200},\n  title = {Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming.},\n  url = {http://dblp.uni-trier.de/db/conf/iclp/iclp2001.html#BasuMRRV01},\n  volume = 2237,\n  year = 2001\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Efficient declustering techniques for temporal access structures.\n \n \n \n \n\n\n \n Behl, S.; and Verma, R. M.\n\n\n \n\n\n\n In Orlowska, M. E.; and Roddick, J. F., editor(s), ADC, pages 91-98, 2001. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"EfficientLink\n  \n \n \n \"EfficientPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/adc/BehlV01,\n  added-at = {2023-03-24T00:00:00.000+0100},\n  author = {Behl, Sanjiv and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2d5689d6909390460522de86b00deeddf/dblp},\n  booktitle = {ADC},\n  crossref = {conf/adc/2001},\n  editor = {Orlowska, Maria E. and Roddick, John F.},\n  ee = {https://dl.acm.org/citation.cfm?id=545549},\n  interhash = {7660572d9a64e84ea32eb6921cfa3fb8},\n  intrahash = {d5689d6909390460522de86b00deeddf},\n  isbn = {0-7695-0966-5},\n  keywords = {dblp},\n  pages = {91-98},\n  publisher = {IEEE Computer Society},\n  timestamp = {2024-04-10T21:57:13.000+0200},\n  title = {Efficient declustering techniques for temporal access structures.},\n  url = {http://dblp.uni-trier.de/db/conf/adc/adc2001.html#BehlV01},\n  year = 2001\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n RULE2001 - Foreword.\n \n \n \n \n\n\n \n van den Brand, M.; and Verma, R. M.\n\n\n \n\n\n\n In van den Brand, M.; and Verma, R. M., editor(s), RULE@PLI, volume 59, of Electronic Notes in Theoretical Computer Science, pages 425-426, 2001. Elsevier\n \n\n\n\n
\n\n\n\n \n \n \"RULE2001Link\n  \n \n \n \"RULE2001Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{journals/tcs/BrandV01,\n  added-at = {2022-12-15T00:00:00.000+0100},\n  author = {van den Brand, Mark and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/268808344ab0f9a9360ade006944faf5f/dblp},\n  booktitle = {RULE@PLI},\n  crossref = {conf/rule/2001},\n  editor = {van den Brand, Mark and Verma, Rakesh M.},\n  ee = {https://doi.org/10.1016/S1571-0661(05)80559-6},\n  interhash = {2669d976b66c483fe035b94465e1d750},\n  intrahash = {68808344ab0f9a9360ade006944faf5f},\n  keywords = {dblp},\n  number = 4,\n  pages = {425-426},\n  publisher = {Elsevier},\n  series = {Electronic Notes in Theoretical Computer Science},\n  timestamp = {2024-04-09T15:11:14.000+0200},\n  title = {RULE2001 - Foreword.},\n  url = {http://dblp.uni-trier.de/db/conf/rule/rule2001.html#BrandV01},\n  volume = 59,\n  year = 2001\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Algorithms and Reductions for Rewriting Problems.\n \n \n \n \n\n\n \n Verma, R. M.; Rusinowitch, M.; and Lugiez, D.\n\n\n \n\n\n\n Fundam. Informaticae, 46(3): 257-276. 2001.\n \n\n\n\n
\n\n\n\n \n \n \"AlgorithmsLink\n  \n \n \n \"AlgorithmsPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/fuin/VermaRL01,\n  added-at = {2020-09-18T00:00:00.000+0200},\n  author = {Verma, Rakesh M. and Rusinowitch, Michaël and Lugiez, Denis},\n  biburl = {https://www.bibsonomy.org/bibtex/2e893c6e878dc5ee523c4c462e87d4e44/dblp},\n  ee = {http://content.iospress.com/articles/fundamenta-informaticae/fi46-3-05},\n  interhash = {f92d36775da694dc208ef92a7f4bb5a7},\n  intrahash = {e893c6e878dc5ee523c4c462e87d4e44},\n  journal = {Fundam. Informaticae},\n  keywords = {dblp},\n  number = 3,\n  pages = {257-276},\n  timestamp = {2020-09-19T11:37:24.000+0200},\n  title = {Algorithms and Reductions for Rewriting Problems.},\n  url = {http://dblp.uni-trier.de/db/journals/fuin/fuin46.html#VermaRL01},\n  volume = 46,\n  year = 2001\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2000\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Static Analysis Techniques for Equational Logic Programming.\n \n \n \n \n\n\n \n Verma, R. M.\n\n\n \n\n\n\n CoRR, cs.LO/0010034. 2000.\n \n\n\n\n
\n\n\n\n \n \n \"StaticLink\n  \n \n \n \"StaticPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/corr/cs-LO-0010034,\n  added-at = {2020-01-10T00:00:00.000+0100},\n  author = {Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2235acf35f375af6856974a4bae9546b6/dblp},\n  ee = {https://arxiv.org/abs/cs/0010034},\n  interhash = {0276a201f8406de2d1a71e01e08b6279},\n  intrahash = {235acf35f375af6856974a4bae9546b6},\n  journal = {CoRR},\n  keywords = {dblp},\n  timestamp = {2020-01-11T11:42:45.000+0100},\n  title = {Static Analysis Techniques for Equational Logic Programming},\n  url = {http://dblp.uni-trier.de/db/journals/corr/corr0010.html#cs-LO-0010034},\n  volume = {cs.LO/0010034},\n  year = 2000\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1999\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems.\n \n \n \n \n\n\n \n Varman, P. J.; and Verma, R. M.\n\n\n \n\n\n\n IEEE Trans. Parallel Distributed Syst., 10(12): 1262-1275. 1999.\n \n\n\n\n
\n\n\n\n \n \n \"TightLink\n  \n \n \n \"TightPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/tpds/VarmanV99,\n  added-at = {2020-10-02T00:00:00.000+0200},\n  author = {Varman, Peter J. and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2f95737e91f5d0266a7a4fff48c530dc9/dblp},\n  ee = {http://doi.ieeecomputersociety.org/10.1109/71.819948},\n  interhash = {0cad645978d138597dbc48c7b28c22ca},\n  intrahash = {f95737e91f5d0266a7a4fff48c530dc9},\n  journal = {IEEE Trans. Parallel Distributed Syst.},\n  keywords = {dblp},\n  number = 12,\n  pages = {1262-1275},\n  timestamp = {2020-10-03T11:37:28.000+0200},\n  title = {Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems.},\n  url = {http://dblp.uni-trier.de/db/journals/tpds/tpds10.html#VarmanV99},\n  volume = 10,\n  year = 1999\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n LarrowR2: A Laboratory fro Rapid Term Graph Rewriting.\n \n \n \n \n\n\n \n Verma, R. M.; and Senanayake, S.\n\n\n \n\n\n\n In Narendran, P.; and Rusinowitch, M., editor(s), RTA, volume 1631, of Lecture Notes in Computer Science, pages 252-255, 1999. Springer\n \n\n\n\n
\n\n\n\n \n \n \"LarrowR2:Link\n  \n \n \n \"LarrowR2:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/rta/VermaS99,\n  added-at = {2018-11-02T00:00:00.000+0100},\n  author = {Verma, Rakesh M. and Senanayake, Shalitha},\n  biburl = {https://www.bibsonomy.org/bibtex/2dfc5c8b9e3ebf971c366394965f4ee7d/dblp},\n  booktitle = {RTA},\n  crossref = {conf/rta/1999},\n  editor = {Narendran, Paliath and Rusinowitch, Michaël},\n  ee = {https://doi.org/10.1007/3-540-48685-2_21},\n  interhash = {396147f6684387b9144f5c5642ddc308},\n  intrahash = {dfc5c8b9e3ebf971c366394965f4ee7d},\n  isbn = {3-540-66201-4},\n  keywords = {dblp},\n  pages = {252-255},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2019-05-15T12:18:28.000+0200},\n  title = {LarrowR2: A Laboratory fro Rapid Term Graph Rewriting.},\n  url = {http://dblp.uni-trier.de/db/conf/rta/rta99.html#VermaS99},\n  volume = 1631,\n  year = 1999\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1998\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Algorithms and Reductions for Rewriting Problems.\n \n \n \n \n\n\n \n Verma, R. M.; Rusinowitch, M.; and Lugiez, D.\n\n\n \n\n\n\n In Nipkow, T., editor(s), RTA, volume 1379, of Lecture Notes in Computer Science, pages 166-180, 1998. Springer\n \n\n\n\n
\n\n\n\n \n \n \"AlgorithmsLink\n  \n \n \n \"AlgorithmsPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/rta/VermaRL98,\n  added-at = {2018-11-30T00:00:00.000+0100},\n  author = {Verma, Rakesh M. and Rusinowitch, Michaël and Lugiez, Denis},\n  biburl = {https://www.bibsonomy.org/bibtex/226d4213da1f4dee1f4364218c0810e69/dblp},\n  booktitle = {RTA},\n  crossref = {conf/rta/1998},\n  editor = {Nipkow, Tobias},\n  ee = {https://doi.org/10.1007/BFb0052369},\n  interhash = {3afd0e4183c9157b7f7174371f4e6910},\n  intrahash = {26d4213da1f4dee1f4364218c0810e69},\n  isbn = {3-540-64301-X},\n  keywords = {dblp},\n  pages = {166-180},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2020-09-09T13:52:19.000+0200},\n  title = {Algorithms and Reductions for Rewriting Problems.},\n  url = {http://dblp.uni-trier.de/db/conf/rta/rta98.html#VermaRL98},\n  volume = 1379,\n  year = 1998\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n RPO Constraint Solving Is in NP.\n \n \n \n \n\n\n \n Narendran, P.; Rusinowitch, M.; and Verma, R. M.\n\n\n \n\n\n\n In Gottlob, G.; Grandjean, E.; and Seyr, K., editor(s), CSL, volume 1584, of Lecture Notes in Computer Science, pages 385-398, 1998. Springer\n \n\n\n\n
\n\n\n\n \n \n \"RPOLink\n  \n \n \n \"RPOPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/csl/NarendranRV98,\n  added-at = {2017-05-23T00:00:00.000+0200},\n  author = {Narendran, Paliath and Rusinowitch, Michaël and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/23f72abaa9b716369f1e104a73120d8a1/dblp},\n  booktitle = {CSL},\n  crossref = {conf/csl/1998},\n  editor = {Gottlob, Georg and Grandjean, Etienne and Seyr, Katrin},\n  ee = {https://doi.org/10.1007/10703163_26},\n  interhash = {a33dd089ebb01ce8f7ba6fdd40ba55ce},\n  intrahash = {3f72abaa9b716369f1e104a73120d8a1},\n  isbn = {3-540-65922-6},\n  keywords = {dblp},\n  pages = {385-398},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2019-05-15T19:34:27.000+0200},\n  title = {RPO Constraint Solving Is in NP.},\n  url = {http://dblp.uni-trier.de/db/conf/csl/csl98.html#NarendranRV98},\n  volume = 1584,\n  year = 1998\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1997\n \n \n (5)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Fuzzy programming technique to solve multi-objective transportation problems with some non-linear membership functions.\n \n \n \n \n\n\n \n Verma, R.; Biswal, M. P.; and Biswas, A.\n\n\n \n\n\n\n Fuzzy Sets Syst., 91(1): 37-43. 1997.\n \n\n\n\n
\n\n\n\n \n \n \"FuzzyLink\n  \n \n \n \"FuzzyPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/fss/VermaBB97,\n  added-at = {2020-02-19T00:00:00.000+0100},\n  author = {Verma, Rakesh and Biswal, M. P. and Biswas, A.},\n  biburl = {https://www.bibsonomy.org/bibtex/25afc7d98eefff9d22b087ed260babc12/dblp},\n  ee = {https://doi.org/10.1016/S0165-0114(96)00148-0},\n  interhash = {09a21ade6ebf3d4ad0dcb05a94ea8a33},\n  intrahash = {5afc7d98eefff9d22b087ed260babc12},\n  journal = {Fuzzy Sets Syst.},\n  keywords = {dblp},\n  number = 1,\n  pages = {37-43},\n  timestamp = {2020-02-20T12:15:34.000+0100},\n  title = {Fuzzy programming technique to solve multi-objective transportation problems with some non-linear membership functions.},\n  url = {http://dblp.uni-trier.de/db/journals/fss/fss91.html#VermaBB97},\n  volume = 91,\n  year = 1997\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Unique Normal Forms for Nonlinear Term Rewriting Systems: Root Overlaps.\n \n \n \n \n\n\n \n Verma, R. M.\n\n\n \n\n\n\n In Chlebus, B. S.; and Czaja, L., editor(s), FCT, volume 1279, of Lecture Notes in Computer Science, pages 452-462, 1997. Springer\n \n\n\n\n
\n\n\n\n \n \n \"UniqueLink\n  \n \n \n \"UniquePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/fct/Verma97,\n  added-at = {2018-11-30T00:00:00.000+0100},\n  author = {Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/27cb0c3b87a93cddb8369207af6e59d30/dblp},\n  booktitle = {FCT},\n  crossref = {conf/fct/1997},\n  editor = {Chlebus, Bogdan S. and Czaja, Ludwik},\n  ee = {https://doi.org/10.1007/BFb0036206},\n  interhash = {bf5515dee304d3c81ab5ae1b55725a23},\n  intrahash = {7cb0c3b87a93cddb8369207af6e59d30},\n  isbn = {3-540-63386-3},\n  keywords = {dblp},\n  pages = {452-462},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2019-05-15T20:30:43.000+0200},\n  title = {Unique Normal Forms for Nonlinear Term Rewriting Systems: Root Overlaps.},\n  url = {http://dblp.uni-trier.de/db/conf/fct/fct97.html#Verma97},\n  volume = 1279,\n  year = 1997\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n General Techniques for Analyzing Recursive Algorithms with Applications.\n \n \n \n \n\n\n \n Verma, R. M.\n\n\n \n\n\n\n SIAM J. Comput., 26(2): 568-581. 1997.\n \n\n\n\n
\n\n\n\n \n \n \"GeneralLink\n  \n \n \n \"GeneralPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/siamcomp/Verma97,\n  added-at = {2018-11-02T00:00:00.000+0100},\n  author = {Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/277e8cf902f075e987bec753ab75c3db3/dblp},\n  ee = {https://doi.org/10.1137/S0097539792240583},\n  interhash = {9a5e28299138ee8958a62e1443b541e0},\n  intrahash = {77e8cf902f075e987bec753ab75c3db3},\n  journal = {SIAM J. Comput.},\n  keywords = {dblp},\n  number = 2,\n  pages = {568-581},\n  timestamp = {2018-11-03T12:42:51.000+0100},\n  title = {General Techniques for Analyzing Recursive Algorithms with Applications.},\n  url = {http://dblp.uni-trier.de/db/journals/siamcomp/siamcomp26.html#Verma97},\n  volume = 26,\n  year = 1997\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Efficient Multiversion Access STructure.\n \n \n \n \n\n\n \n Varman, P. J.; and Verma, R. M.\n\n\n \n\n\n\n IEEE Trans. Knowl. Data Eng., 9(3): 391-409. 1997.\n \n\n\n\n
\n\n\n\n \n \n \"AnLink\n  \n \n \n \"AnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/tkde/VarmanV97,\n  added-at = {2018-11-02T00:00:00.000+0100},\n  author = {Varman, Peter J. and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/28054691e3078df0ec75d8ed83d3249fc/dblp},\n  cite = {journals/tods/Vitter85},\n  ee = {http://doi.ieeecomputersociety.org/10.1109/69.599929},\n  interhash = {999b1498fdc27d1230d587b4590aab9a},\n  intrahash = {8054691e3078df0ec75d8ed83d3249fc},\n  journal = {IEEE Trans. Knowl. Data Eng.},\n  keywords = {dblp},\n  number = 3,\n  pages = {391-409},\n  timestamp = {2018-11-03T11:36:30.000+0100},\n  title = {An Efficient Multiversion Access STructure.},\n  url = {http://dblp.uni-trier.de/db/journals/tkde/tkde9.html#VarmanV97},\n  volume = 9,\n  year = 1997\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n On Embedding Rectangular Meshes into Rectangular Meshes of Smaller Aspect Ratio.\n \n \n \n \n\n\n \n Huang, S. S.; Liu, H.; and Verma, R. M.\n\n\n \n\n\n\n Inf. Process. Lett., 63(3): 123-129. 1997.\n \n\n\n\n
\n\n\n\n \n \n \"OnLink\n  \n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/ipl/HuangLV97,\n  added-at = {2003-11-20T00:00:00.000+0100},\n  author = {Huang, Shou-Hsuan Stephen and Liu, Hongfei and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/21929e5da5cfe819cd3df68bd6ca9b969/dblp},\n  date = {2003-11-20},\n  description = {dblp},\n  ee = {http://dx.doi.org/10.1016/S0020-0190(97)00114-2},\n  interhash = {2aadcd502c27af25dbbf6754ea90ae17},\n  intrahash = {1929e5da5cfe819cd3df68bd6ca9b969},\n  journal = {Inf. Process. Lett.},\n  keywords = {dblp},\n  number = 3,\n  pages = {123-129},\n  timestamp = {2003-11-20T00:00:00.000+0100},\n  title = {On Embedding Rectangular Meshes into Rectangular Meshes of Smaller Aspect Ratio.},\n  url = {http://dblp.uni-trier.de/db/journals/ipl/ipl63.html#HuangLV97},\n  volume = 63,\n  year = 1997\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1996\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A New Combinatorial Approach to Optimal Embeddings of Rectangles.\n \n \n \n \n\n\n \n Huang, S. S.; Liu, H.; and Verma, R. M.\n\n\n \n\n\n\n Algorithmica, 16(2): 161-180. 1996.\n \n\n\n\n
\n\n\n\n \n \n \"ALink\n  \n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/algorithmica/HuangLV96,\n  added-at = {2018-11-02T00:00:00.000+0100},\n  author = {Huang, Shou-Hsuan Stephen and Liu, Hongfei and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/21c512b261ef9e9a8a5d0994b18018c69/dblp},\n  ee = {https://doi.org/10.1007/BF01940645},\n  interhash = {596bdf1dd9635b30f6042f4acfffe323},\n  intrahash = {1c512b261ef9e9a8a5d0994b18018c69},\n  journal = {Algorithmica},\n  keywords = {dblp},\n  number = 2,\n  pages = {161-180},\n  timestamp = {2018-11-03T11:40:11.000+0100},\n  title = {A New Combinatorial Approach to Optimal Embeddings of Rectangles.},\n  url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica16.html#HuangLV96},\n  volume = 16,\n  year = 1996\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems.\n \n \n \n \n\n\n \n Varman, P. J.; and Verma, R. M.\n\n\n \n\n\n\n In Chandru, V.; and Vinay, V., editor(s), FSTTCS, volume 1180, of Lecture Notes in Computer Science, pages 200-211, 1996. Springer\n \n\n\n\n
\n\n\n\n \n \n \"TightLink\n  \n \n \n \"TightPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/fsttcs/VarmanV96,\n  added-at = {2017-05-22T00:00:00.000+0200},\n  author = {Varman, Peter J. and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/21af46ee8276a136c9c6a921f072b313d/dblp},\n  booktitle = {FSTTCS},\n  crossref = {conf/fsttcs/1996},\n  editor = {Chandru, Vijay and Vinay, V.},\n  ee = {https://doi.org/10.1007/3-540-62034-6_50},\n  interhash = {7a4c0abce6ccc06894c56356dd96ab9c},\n  intrahash = {1af46ee8276a136c9c6a921f072b313d},\n  isbn = {3-540-62034-6},\n  keywords = {dblp},\n  pages = {200-211},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2019-05-15T19:09:34.000+0200},\n  title = {Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems.},\n  url = {http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs96.html#VarmanV96},\n  volume = 1180,\n  year = 1996\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1995\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A Theory of Using History for Equational Systems with Applications.\n \n \n \n \n\n\n \n Verma, R. M.\n\n\n \n\n\n\n J. ACM, 42(5): 984-1020. 1995.\n \n\n\n\n
\n\n\n\n \n \n \"ALink\n  \n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/jacm/Verma95,\n  added-at = {2021-09-23T00:00:00.000+0200},\n  author = {Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/26ccbd6542cfa70dbf2b7e648d71ecf67/dblp},\n  ee = {https://doi.org/10.1145/210118.210130},\n  interhash = {f4da2d71179e70fe7767f1eeea671ece},\n  intrahash = {6ccbd6542cfa70dbf2b7e648d71ecf67},\n  journal = {J. ACM},\n  keywords = {dblp},\n  number = 5,\n  pages = {984-1020},\n  timestamp = {2024-04-08T20:01:57.000+0200},\n  title = {A Theory of Using History for Equational Systems with Applications.},\n  url = {http://dblp.uni-trier.de/db/journals/jacm/jacm42.html#Verma95},\n  volume = 42,\n  year = 1995\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Transformations and Confluence for Rewrite Systems.\n \n \n \n \n\n\n \n Verma, R. M.\n\n\n \n\n\n\n Theor. Comput. Sci., 152(2): 269-283. 1995.\n \n\n\n\n
\n\n\n\n \n \n \"TransformationsLink\n  \n \n \n \"TransformationsPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/tcs/Verma95,\n  added-at = {2021-02-17T00:00:00.000+0100},\n  author = {Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2f3706dcdad15f86fce0226714863af55/dblp},\n  ee = {https://doi.org/10.1016/0304-3975(94)00255-0},\n  interhash = {bdae04f611942ea76411a2638eb56162},\n  intrahash = {f3706dcdad15f86fce0226714863af55},\n  journal = {Theor. Comput. Sci.},\n  keywords = {dblp},\n  number = 2,\n  pages = {269-283},\n  timestamp = {2024-04-08T18:43:58.000+0200},\n  title = {Transformations and Confluence for Rewrite Systems.},\n  url = {http://dblp.uni-trier.de/db/journals/tcs/tcs152.html#Verma95},\n  volume = 152,\n  year = 1995\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Unique Normal Forms and Confluence of Rewrite Systems: Persistence.\n \n \n \n \n\n\n \n Verma, R. M.\n\n\n \n\n\n\n In IJCAI, pages 362-370, 1995. Morgan Kaufmann\n \n\n\n\n
\n\n\n\n \n \n \"UniqueLink\n  \n \n \n \"UniquePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/ijcai/Verma95,\n  added-at = {2019-08-20T00:00:00.000+0200},\n  author = {Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/29b463605df9de9d8954998b3c6ce9b4c/dblp},\n  booktitle = {IJCAI},\n  crossref = {conf/ijcai/1995},\n  ee = {http://ijcai.org/Proceedings/95-1/Papers/048.pdf},\n  interhash = {474d61e56e3df0471844bb7fd72340d9},\n  intrahash = {9b463605df9de9d8954998b3c6ce9b4c},\n  keywords = {dblp},\n  pages = {362-370},\n  publisher = {Morgan Kaufmann},\n  timestamp = {2019-08-21T11:48:23.000+0200},\n  title = {Unique Normal Forms and Confluence of Rewrite Systems: Persistence.},\n  url = {http://dblp.uni-trier.de/db/conf/ijcai/ijcai95.html#Verma95},\n  year = 1995\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1994\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A New Combinatorial Approach to Optimal Embeddings of Rectangles.\n \n \n \n \n\n\n \n Huang, S. S.; Liu, H.; and Verma, R. M.\n\n\n \n\n\n\n In Siegel, H. J., editor(s), IPPS, pages 715-722, 1994. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"ALink\n  \n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/ipps/HuangLV94,\n  added-at = {2023-03-24T00:00:00.000+0100},\n  author = {Huang, Shou-Hsuan Stephen and Liu, Hongfei and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2906e7b1efdb8059c3410101d651251b4/dblp},\n  booktitle = {IPPS},\n  crossref = {conf/ipps/1994},\n  editor = {Siegel, Howard Jay},\n  ee = {https://doi.ieeecomputersociety.org/10.1109/IPPS.1994.288225},\n  interhash = {c943f613c5c745fcc64b876866fc495a},\n  intrahash = {906e7b1efdb8059c3410101d651251b4},\n  isbn = {0-8186-5602-6},\n  keywords = {dblp},\n  pages = {715-722},\n  publisher = {IEEE Computer Society},\n  timestamp = {2024-04-10T10:26:32.000+0200},\n  title = {A New Combinatorial Approach to Optimal Embeddings of Rectangles.},\n  url = {http://dblp.uni-trier.de/db/conf/ipps/ipps1994.html#HuangLV94},\n  year = 1994\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications.\n \n \n \n \n\n\n \n Verma, R. M.\n\n\n \n\n\n\n J. Algorithms, 16(1): 67-79. 1994.\n \n\n\n\n
\n\n\n\n \n \n \"ALink\n  \n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/jal/Verma94,\n  added-at = {2018-11-30T00:00:00.000+0100},\n  author = {Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/22acb15306315cf8539d19c5ea3ed580e/dblp},\n  ee = {https://doi.org/10.1006/jagm.1994.1004},\n  interhash = {052d20c0751bd22fbd8fe4ef20b8a593},\n  intrahash = {2acb15306315cf8539d19c5ea3ed580e},\n  journal = {J. Algorithms},\n  keywords = {dblp},\n  number = 1,\n  pages = {67-79},\n  timestamp = {2018-12-01T12:03:03.000+0100},\n  title = {A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications.},\n  url = {http://dblp.uni-trier.de/db/journals/jal/jal16.html#Verma94},\n  volume = 16,\n  year = 1994\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1993\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n On Embeddings of Rectangles into Optimal Squares.\n \n \n \n \n\n\n \n Huang, S. S.; Liu, H.; and Verma, R. M.\n\n\n \n\n\n\n In Hariri, S.; and Berra, P. B., editor(s), ICPP (3), pages 73-76, 1993. CRC Press\n \n\n\n\n
\n\n\n\n \n \n \"OnLink\n  \n \n \n \"OnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/icpp/HuangLV93,\n  added-at = {2023-03-24T00:00:00.000+0100},\n  author = {Huang, Shou-Hsuan Stephen and Liu, Hongfei and Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/25ca1d2967145572a95c99e4805ed4e00/dblp},\n  booktitle = {ICPP (3)},\n  crossref = {conf/icpp/1993-3},\n  editor = {Hariri, Salim and Berra, P. Bruce},\n  ee = {https://doi.ieeecomputersociety.org/10.1109/ICPP.1993.123},\n  interhash = {c8acb3c012e567ed4f9981b405e1fa06},\n  intrahash = {5ca1d2967145572a95c99e4805ed4e00},\n  isbn = {0-8493-8986-0},\n  keywords = {dblp},\n  pages = {73-76},\n  publisher = {CRC Press},\n  timestamp = {2024-04-10T00:16:37.000+0200},\n  title = {On Embeddings of Rectangles into Optimal Squares.},\n  url = {http://dblp.uni-trier.de/db/conf/icpp/icpp1993-3.html#HuangLV93},\n  year = 1993\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Smaran: A Congruence-Closure Based System for Equational Computations.\n \n \n \n \n\n\n \n Verma, R. M.\n\n\n \n\n\n\n In Kirchner, C., editor(s), RTA, volume 690, of Lecture Notes in Computer Science, pages 457-461, 1993. Springer\n \n\n\n\n
\n\n\n\n \n \n \"Smaran:Link\n  \n \n \n \"Smaran:Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/rta/Verma93,\n  added-at = {2017-05-22T00:00:00.000+0200},\n  author = {Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2ad664d39ed5fddd3b9878faa5e6e51da/dblp},\n  booktitle = {RTA},\n  crossref = {conf/rta/1993},\n  editor = {Kirchner, Claude},\n  ee = {https://doi.org/10.1007/978-3-662-21551-7_37},\n  interhash = {7031f9133b033a9b22fb3d2d14036015},\n  intrahash = {ad664d39ed5fddd3b9878faa5e6e51da},\n  isbn = {3-540-56868-9},\n  keywords = {dblp},\n  pages = {457-461},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2019-05-15T12:18:37.000+0200},\n  title = {Smaran: A Congruence-Closure Based System for Equational Computations.},\n  url = {http://dblp.uni-trier.de/db/conf/rta/rta93.html#Verma93},\n  volume = 690,\n  year = 1993\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1992\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Tight Complexity Bounds for Term Matching Problems.\n \n \n \n \n\n\n \n Verma, R. M.; and Ramakrishnan, I. V.\n\n\n \n\n\n\n Inf. Comput., 101(1): 33-69. 11 1992.\n \n\n\n\n
\n\n\n\n \n \n \"TightLink\n  \n \n \n \"TightPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/iandc/VermaR92,\n  added-at = {2021-02-12T00:00:00.000+0100},\n  author = {Verma, Rakesh M. and Ramakrishnan, I. V.},\n  biburl = {https://www.bibsonomy.org/bibtex/2b13c53f13ed87b67fe977e77dab49659/dblp},\n  ee = {https://doi.org/10.1016/0890-5401(92)90075-Q},\n  interhash = {ed3082c02d3c49fb1937fb7125b07513},\n  intrahash = {b13c53f13ed87b67fe977e77dab49659},\n  journal = {Inf. Comput.},\n  keywords = {dblp},\n  month = {11},\n  number = 1,\n  pages = {33-69},\n  timestamp = {2024-04-09T06:10:29.000+0200},\n  title = {Tight Complexity Bounds for Term Matching Problems},\n  url = {http://dblp.uni-trier.de/db/journals/iandc/iandc101.html#VermaR92},\n  volume = 101,\n  year = 1992\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Strings, Trees, and Patterns.\n \n \n \n \n\n\n \n Verma, R. M.\n\n\n \n\n\n\n Inf. Process. Lett., 41(3): 157-161. 1992.\n \n\n\n\n
\n\n\n\n \n \n \"Strings,Link\n  \n \n \n \"Strings,Paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/ipl/Verma92,\n  added-at = {2018-11-02T00:00:00.000+0100},\n  author = {Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/2290254bb2664313f28f7c6f9e1f92f9d/dblp},\n  ee = {https://doi.org/10.1016/0020-0190(92)90046-X},\n  interhash = {6e9494792a237037e0a166f5d427a54f},\n  intrahash = {290254bb2664313f28f7c6f9e1f92f9d},\n  journal = {Inf. Process. Lett.},\n  keywords = {dblp},\n  number = 3,\n  pages = {157-161},\n  timestamp = {2018-11-03T11:57:30.000+0100},\n  title = {Strings, Trees, and Patterns.},\n  url = {http://dblp.uni-trier.de/db/journals/ipl/ipl41.html#Verma92},\n  volume = 41,\n  year = 1992\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1991\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A Theory of Using History for Equational Systems with Applications (Extended Abstract).\n \n \n \n \n\n\n \n Verma, R. M.\n\n\n \n\n\n\n In FOCS, pages 348-357, 1991. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n \"ALink\n  \n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/focs/Verma91,\n  added-at = {2023-03-23T00:00:00.000+0100},\n  author = {Verma, Rakesh M.},\n  biburl = {https://www.bibsonomy.org/bibtex/283b21a74902c423767d3fd24a1789069/dblp},\n  booktitle = {FOCS},\n  crossref = {conf/focs/FOCS32},\n  ee = {https://doi.ieeecomputersociety.org/10.1109/SFCS.1991.185390},\n  interhash = {b79d5153df8a3e09f2b9944639824605},\n  intrahash = {83b21a74902c423767d3fd24a1789069},\n  isbn = {0-8186-2445-0},\n  keywords = {dblp},\n  pages = {348-357},\n  publisher = {IEEE Computer Society},\n  timestamp = {2024-04-10T10:25:00.000+0200},\n  title = {A Theory of Using History for Equational Systems with Applications (Extended Abstract)},\n  url = {http://dblp.uni-trier.de/db/conf/focs/focs91.html#Verma91},\n  year = 1991\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1990\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems.\n \n \n \n \n\n\n \n Verma, R. M.; and Ramakrishnan, I. V.\n\n\n \n\n\n\n In Paterson, M., editor(s), ICALP, volume 443, of Lecture Notes in Computer Science, pages 370-385, 1990. Springer\n \n\n\n\n
\n\n\n\n \n \n \"NonobliviousLink\n  \n \n \n \"NonobliviousPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/icalp/VermaR90,\n  added-at = {2019-09-25T00:00:00.000+0200},\n  author = {Verma, Rakesh M. and Ramakrishnan, I. V.},\n  biburl = {https://www.bibsonomy.org/bibtex/2b0883624011b69cca03ee64700b2d505/dblp},\n  booktitle = {ICALP},\n  crossref = {conf/icalp/1990},\n  editor = {Paterson, Mike},\n  ee = {https://doi.org/10.1007/BFb0032045},\n  interhash = {d0d3a791eab1e5b49c68b22507f1b792},\n  intrahash = {b0883624011b69cca03ee64700b2d505},\n  isbn = {3-540-52826-1},\n  keywords = {dblp},\n  pages = {370-385},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2019-09-26T12:54:59.000+0200},\n  title = {Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems.},\n  url = {http://dblp.uni-trier.de/db/conf/icalp/icalp90.html#VermaR90},\n  volume = 443,\n  year = 1990\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1989\n \n \n (3)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Term Matching on Parallel Computers.\n \n \n \n \n\n\n \n Ramesh, R.; Verma, R. M.; Thirunarayan, K.; and Ramakrishnan, I. V.\n\n\n \n\n\n\n J. Log. Program., 6(3): 213-228. 1989.\n \n\n\n\n
\n\n\n\n \n \n \"TermLink\n  \n \n \n \"TermPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/jlp/RameschVKR89,\n  added-at = {2021-02-17T00:00:00.000+0100},\n  author = {Ramesh, R. and Verma, Rakesh M. and Thirunarayan, Krishnaprasad and Ramakrishnan, I. V.},\n  biburl = {https://www.bibsonomy.org/bibtex/2bc87f8a5d03845ce718083ef04c8a0df/dblp},\n  ee = {https://doi.org/10.1016/0743-1066(89)90014-9},\n  interhash = {89dfd57c56e1df1a55d52952d58f54d8},\n  intrahash = {bc87f8a5d03845ce718083ef04c8a0df},\n  journal = {J. Log. Program.},\n  keywords = {dblp},\n  number = 3,\n  pages = {213-228},\n  timestamp = {2024-04-08T10:50:37.000+0200},\n  title = {Term Matching on Parallel Computers.},\n  url = {http://dblp.uni-trier.de/db/journals/jlp/jlp6.html#RameschVKR89},\n  volume = 6,\n  year = 1989\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Some Complexity Theoretic Aspects of AC Rewriting.\n \n \n \n \n\n\n \n Verma, R. M.; and Ramakrishnan, I. V.\n\n\n \n\n\n\n In Monien, B.; and Cori, R., editor(s), STACS, volume 349, of Lecture Notes in Computer Science, pages 407-420, 1989. Springer\n \n\n\n\n
\n\n\n\n \n \n \"SomeLink\n  \n \n \n \"SomePaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/stacs/VermaR89,\n  added-at = {2019-09-25T00:00:00.000+0200},\n  author = {Verma, Rakesh M. and Ramakrishnan, I. V.},\n  biburl = {https://www.bibsonomy.org/bibtex/22f03f6b5a8d0cbda96a52cd6ec57f405/dblp},\n  booktitle = {STACS},\n  crossref = {conf/stacs/1989},\n  editor = {Monien, Burkhard and Cori, Robert},\n  ee = {https://doi.org/10.1007/BFb0029003},\n  interhash = {2fdca4b81e274ff13bedb427e8420854},\n  intrahash = {2f03f6b5a8d0cbda96a52cd6ec57f405},\n  isbn = {3-540-50840-6},\n  keywords = {dblp},\n  pages = {407-420},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2019-09-26T14:06:56.000+0200},\n  title = {Some Complexity Theoretic Aspects of AC Rewriting.},\n  url = {http://dblp.uni-trier.de/db/conf/stacs/stacs89.html#VermaR89},\n  volume = 349,\n  year = 1989\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n An Analysis of a Good Algorithm for the Subtree Problem, Corrected.\n \n \n \n \n\n\n \n Verma, R. M.; and Reyner, S. W.\n\n\n \n\n\n\n SIAM J. Comput., 18(5): 906-908. 1989.\n see: SIAM J. Comput. 6(4): 730-732 (1977)\n\n\n\n
\n\n\n\n \n \n \"AnLink\n  \n \n \n \"AnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/siamcomp/VermaR89,\n  added-at = {2018-11-02T00:00:00.000+0100},\n  author = {Verma, Rakesh M. and Reyner, Steven W.},\n  biburl = {https://www.bibsonomy.org/bibtex/23d7a38e7859128a7d81ccb6a5e9cb1d7/dblp},\n  ee = {https://doi.org/10.1137/0218062},\n  interhash = {361d90be517348ca491ef72e3dcb7f13},\n  intrahash = {3d7a38e7859128a7d81ccb6a5e9cb1d7},\n  journal = {SIAM J. Comput.},\n  keywords = {dblp},\n  note = {see: SIAM J. Comput. 6(4): 730-732 (1977)},\n  number = 5,\n  pages = {906-908},\n  timestamp = {2018-11-03T12:42:51.000+0100},\n  title = {An Analysis of a Good Algorithm for the Subtree Problem, Corrected.},\n  url = {http://dblp.uni-trier.de/db/journals/siamcomp/siamcomp18.html#VermaR89},\n  volume = 18,\n  year = 1989\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1988\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Optimal Time Bounds for Parallel Term Matching.\n \n \n \n \n\n\n \n Verma, R. M.; and Ramakrishnan, I. V.\n\n\n \n\n\n\n In Lusk, E. L.; and Overbeek, R. A., editor(s), CADE, volume 310, of Lecture Notes in Computer Science, pages 694-703, 1988. Springer\n \n\n\n\n
\n\n\n\n \n \n \"OptimalLink\n  \n \n \n \"OptimalPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/cade/VermaR88,\n  added-at = {2018-11-30T00:00:00.000+0100},\n  author = {Verma, Rakesh M. and Ramakrishnan, I. V.},\n  biburl = {https://www.bibsonomy.org/bibtex/2ed0ef01ebf3b664f0fbd66008a2d9f95/dblp},\n  booktitle = {CADE},\n  crossref = {conf/cade/1988},\n  editor = {Lusk, Ewing L. and Overbeek, Ross A.},\n  ee = {https://doi.org/10.1007/BFb0012867},\n  interhash = {48eb7f408ba355f9f7a068c6bb588a03},\n  intrahash = {ed0ef01ebf3b664f0fbd66008a2d9f95},\n  isbn = {3-540-19343-X},\n  keywords = {dblp},\n  pages = {694-703},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2019-05-15T18:55:05.000+0200},\n  title = {Optimal Time Bounds for Parallel Term Matching.},\n  url = {http://dblp.uni-trier.de/db/conf/cade/cade88.html#VermaR88},\n  volume = 310,\n  year = 1988\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1987\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Term Matching on Parallel Computers.\n \n \n \n \n\n\n \n Ramesh, R.; Verma, R. M.; Thirunarayan, K.; and Ramakrishnan, I. V.\n\n\n \n\n\n\n In Ottmann, T., editor(s), ICALP, volume 267, of Lecture Notes in Computer Science, pages 336-346, 1987. Springer\n \n\n\n\n
\n\n\n\n \n \n \"TermLink\n  \n \n \n \"TermPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/icalp/RameshVKR87,\n  added-at = {2019-07-26T00:00:00.000+0200},\n  author = {Ramesh, R. and Verma, Rakesh M. and Thirunarayan, Krishnaprasad and Ramakrishnan, I. V.},\n  biburl = {https://www.bibsonomy.org/bibtex/286ad4f35a47cf804e1e475b06df4a1b4/dblp},\n  booktitle = {ICALP},\n  crossref = {conf/icalp/1987},\n  editor = {Ottmann, Thomas},\n  ee = {https://doi.org/10.1007/3-540-18088-5_28},\n  interhash = {76b0f47b6a94f5fb44edc9fea12ae906},\n  intrahash = {86ad4f35a47cf804e1e475b06df4a1b4},\n  isbn = {0-387-18088-5},\n  keywords = {dblp},\n  pages = {336-346},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2019-07-27T11:39:35.000+0200},\n  title = {Term Matching on Parallel Computers.},\n  url = {http://dblp.uni-trier.de/db/conf/icalp/icalp87.html#RameshVKR87},\n  volume = 267,\n  year = 1987\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1986\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n An Efficient Parallel Algorithm for Term Matching.\n \n \n \n \n\n\n \n Verma, R. M.; Thirunarayan, K.; and Ramakrishnan, I. V.\n\n\n \n\n\n\n In Nori, K. V., editor(s), FSTTCS, volume 241, of Lecture Notes in Computer Science, pages 504-518, 1986. Springer\n \n\n\n\n
\n\n\n\n \n \n \"AnLink\n  \n \n \n \"AnPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@inproceedings{conf/fsttcs/VermaKR86,\n  added-at = {2018-11-02T00:00:00.000+0100},\n  author = {Verma, Rakesh M. and Thirunarayan, Krishnaprasad and Ramakrishnan, I. V.},\n  biburl = {https://www.bibsonomy.org/bibtex/2afaeffe10453fcd902d5996f3959d780/dblp},\n  booktitle = {FSTTCS},\n  crossref = {conf/fsttcs/1986},\n  editor = {Nori, Kesav V.},\n  ee = {https://doi.org/10.1007/3-540-17179-7_31},\n  interhash = {e08ffbe48c436dae53374d68937b0bad},\n  intrahash = {afaeffe10453fcd902d5996f3959d780},\n  isbn = {3-540-17179-7},\n  keywords = {dblp},\n  pages = {504-518},\n  publisher = {Springer},\n  series = {Lecture Notes in Computer Science},\n  timestamp = {2019-05-15T19:09:34.000+0200},\n  title = {An Efficient Parallel Algorithm for Term Matching.},\n  url = {http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs86.html#VermaKR86},\n  volume = 241,\n  year = 1986\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1982\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Optimal and analytical results of M/Ek/1: ∞(FC\\ FS) queueing model.\n \n \n \n \n\n\n \n Verma, R. K.\n\n\n \n\n\n\n Kybernetika, 18(4): 269-277. 1982.\n \n\n\n\n
\n\n\n\n \n \n \"OptimalLink\n  \n \n \n \"OptimalPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/kybernetika/Verma82,\n  added-at = {2021-02-17T00:00:00.000+0100},\n  author = {Verma, Rakesh Kumar},\n  biburl = {https://www.bibsonomy.org/bibtex/240cf41ee546eddbb9427da9b397c5dff/dblp},\n  ee = {http://www.kybernetika.cz/content/1982/4/269},\n  interhash = {4ff5e41d73c7d76a2e233a02ae8ae7a7},\n  intrahash = {40cf41ee546eddbb9427da9b397c5dff},\n  journal = {Kybernetika},\n  keywords = {dblp},\n  number = 4,\n  pages = {269-277},\n  timestamp = {2024-04-08T11:35:54.000+0200},\n  title = {Optimal and analytical results of M/Ek/1: ∞(FC\\ FS) queueing model.},\n  url = {http://dblp.uni-trier.de/db/journals/kybernetika/kybernetika18.html#Verma82},\n  volume = 18,\n  year = 1982\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 1981\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A short note on optimal repair rates of multiple circuit transmission lines.\n \n \n \n \n\n\n \n Verma, R. K.\n\n\n \n\n\n\n Kybernetika, 17(4): 329-337. 1981.\n \n\n\n\n
\n\n\n\n \n \n \"ALink\n  \n \n \n \"APaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n \n \n\n\n\n
\n 
@article{journals/kybernetika/Verma81,\n  added-at = {2021-02-17T00:00:00.000+0100},\n  author = {Verma, Rakesh Kumar},\n  biburl = {https://www.bibsonomy.org/bibtex/241481c24a6886c87d8e7a8041288675b/dblp},\n  ee = {http://www.kybernetika.cz/content/1981/4/329},\n  interhash = {9b9fd36a8c4e7d6094d8c4d368c3a610},\n  intrahash = {41481c24a6886c87d8e7a8041288675b},\n  journal = {Kybernetika},\n  keywords = {dblp},\n  number = 4,\n  pages = {329-337},\n  timestamp = {2024-04-08T11:36:42.000+0200},\n  title = {A short note on optimal repair rates of multiple circuit transmission lines.},\n  url = {http://dblp.uni-trier.de/db/journals/kybernetika/kybernetika17.html#Verma81},\n  volume = 17,\n  year = 1981\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);