# Rakesh M. Verma

According to our database

^{1}, Rakesh M. Verma## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2017

Uniqueness of Normal Forms for Shallow Term Rewrite Systems.

ACM Trans. Comput. Log., 2017

INSuRE: Collaborating Centers of Academic Excellence Engage Students in Cybersecurity Research.

IEEE Security & Privacy, 2017

Extractive Summarization: Limits, Compression, Generalized Model and Heuristics.

Computación y Sistemas, 2017

Identifying Reference Spans: Topic Modeling and Word Embeddings help IR.

CoRR, 2017

Extractive Summarization: Limits, Compression, Generalized Model and Heuristics.

CoRR, 2017

The INSuRE Project: CAE-Rs Collaborate to Engage Students in Cybersecurity Research.

CoRR, 2017

University of Houston @ CL-SciSumm 2017: Positional language Models, Structural Correspondence Learning and Textual Entailment.

Proceedings of the Computational Linguistics Scientific Summarization Shared Task (CL-SciSumm 2017) organized as a part of the 2nd Joint Workshop on Bibliometric-enhanced Information Retrieval and Natural Language Processing for Digital Libraries (BIRNDL 2017) and co-located with the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2017), 2017

ICE: Idiom and Collocation Extractor for Research and Education.

Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics, 2017

What's in a URL: Fast Feature Extraction and Malicious URL Detection.

Proceedings of the 3rd ACM on International Workshop on Security And Privacy Analytics, 2017

Comprehensive Method for Detecting Phishing EmailsUsing Correlation-based Analysis and User Participation.

Proceedings of the Seventh ACM on Conference on Data and Application Security and Privacy, 2017

Scaling and Effectiveness of Email Masquerade Attacks: Exploiting Natural Language Generation.

Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security, 2017

2016

Uniqueness of Normal Forms for Shallow Term Rewrite Systems.

CoRR, 2016

University of Houston at CL-SciSumm 2016: SVMs with tree kernels and Sentence Similarity.

Proceedings of the Joint Workshop on Bibliometric-enhanced Information Retrieval and Natural Language Processing for Digital Libraries (BIRNDL) co-located with the Joint Conference on Digital Libraries 2016 (JCDL 2016), 2016

2015

The Efficacy of Epidemic Algorithms on Detecting Node Replicas in Wireless Sensor Networks.

J. Sensor and Actuator Networks, 2015

Security Analytics: Essential Data Analytics Knowledge for Cybersecurity Professionals and Students.

IEEE Security & Privacy, 2015

Phish-IDetector: Message-Id Based Automatic Phishing Detection.

Proceedings of the SECRYPT 2015, 2015

A New Approach for Idiom Identification Using Meanings and the Web.

Proceedings of the Recent Advances in Natural Language Processing, 2015

Integrity Protection for Big Data Processing with Dynamic Redundancy Computation.

Proceedings of the 2015 IEEE International Conference on Autonomic Computing, 2015

Topic based segmentation of classroom videos.

Proceedings of the 2015 IEEE Frontiers in Education Conference, 2015

On the Character of Phishing URLs: Accurate and Robust Statistical Learning Classifiers.

Proceedings of the 5th ACM Conference on Data and Application Security and Privacy, 2015

Panel: Essential Data Analytics Knowledge forCyber-security Professionals and Students.

Proceedings of the 2015 ACM International Workshop on International Workshop on Security and Privacy Analytics, 2015

2014

Catching Classical and Hijack-Based Phishing Attacks.

Proceedings of the Information Systems Security - 10th International Conference, 2014

2013

Modeling and analysis of LEAP, a key management protocol for wireless sensor networks.

Proceedings of the 10th Annual IEEE Communications Society Conference on Sensor, 2013

Semantic Feature Selection for Text with Application to Phishing Email Detection.

Proceedings of the Information Security and Cryptology - ICISC 2013, 2013

2012

New Undecidability Results for Properties of Term Rewrite Systems.

Electr. Notes Theor. Comput. Sci., 2012

Detecting Phishing Emails the Natural Language Way.

Proceedings of the Computer Security - ESORICS 2012, 2012

Combining Syntax and Semantics for Automatic Extractive Single-Document Summarization.

Proceedings of the Computational Linguistics and Intelligent Text Processing, 2012

Two-Pronged Phish Snagging.

Proceedings of the Seventh International Conference on Availability, 2012

2011

SemQuest: University of Houston's Semantics-based Question Answering System.

Proceedings of the Fourth Text Analysis Conference, 2011

Automated extractive single-document summarization: beating the baselines with a new approach.

Proceedings of the 2011 ACM Symposium on Applied Computing (SAC), TaiChung, Taiwan, March 21, 2011

2010

A polynomial algorithm for uniqueness of normal forms of linear shallow term rewrite systems.

Appl. Algebra Eng. Commun. Comput., 2010

A Ranking-based Approach for Multiple-document Information Extraction.

Proceedings of the Third Text Analysis Conference, 2010

R-LEAP+: randomizing LEAP+ key distribution to resist replay and jamming attacks.

Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems.

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009

Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems.

Fundam. Inform., 2009

Correcting and Improving the NP Proof for Cryptographic Protocol Insecurity.

Proceedings of the Information Systems Security, 5th International Conference, 2009

2008

Semantic Multi-Document Update Summarization Techniques.

Proceedings of the First Text Analysis Conference, 2008

Visualization of rule-based programming.

Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008

Complexity of Checking Freshness of Cryptographic Protocols.

Proceedings of the Information Systems Security, 4th International Conference, 2008

Semantic Analysis of Association Rules.

Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, 2008

Improving Techniques for Proving Undecidability of Checking Cryptographic Protocols.

Proceedings of the The Third International Conference on Availability, 2008

2006

A Query-Based Medical Information Summarization System Using Ontology Knowledge.

Proceedings of the 19th IEEE International Symposium on Computer-Based Medical Systems (CBMS 2006), 2006

2005

A new decidability technique for ground term rewriting systems with applications.

ACM Trans. Comput. Log., 2005

A visual and interactive automata theory course emphasizing breadth of automata.

Proceedings of the 10th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2005

2004

Remarks on Thatte's transformation of term rewriting systems.

Inf. Comput., 2004

Deciding confluence of certain term rewriting systems in polynomial time.

Ann. Pure Appl. Logic, 2004

Characterizing Confluence by Rewrite Closure and Right Ground Term Rewrite Systems.

Appl. Algebra Eng. Commun. Comput., 2004

2003

On the Confluence of Linear Shallow Term Rewrite Systems.

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

2002

Algorithms and reductions for rewriting problems II.

Inf. Process. Lett., 2002

On the Structure of Counterexamples to Symmetric Orderings for BDD's.

Electr. Notes Theor. Comput. Sci., 2002

K-tree/forest: efficient indexes for boolean queries.

Proceedings of the SIGIR 2002: Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2002

2001

RULE2001 - Foreword.

Electr. Notes Theor. Comput. Sci., 2001

Algorithms and Reductions for Rewriting Problems.

Fundam. Inform., 2001

Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming.

Proceedings of the Logic Programming, 17th International Conference, 2001

Efficient declustering techniques for temporal access structures.

Proceedings of the Twelfth Australasian Database Conference, 2001

2000

Static Analysis Techniques for Equational Logic Programming

CoRR, 2000

1999

Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems.

IEEE Trans. Parallel Distrib. Syst., 1999

Proceedings of the Rewriting Techniques and Applications, 10th International Conference, 1999

1998

Algorithms and Reductions for Rewriting Problems.

Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

RPO Constraint Solving Is in NP.

Proceedings of the Computer Science Logic, 12th International Workshop, 1998

1997

An Efficient Multiversion Access STructure.

IEEE Trans. Knowl. Data Eng., 1997

General Techniques for Analyzing Recursive Algorithms with Applications.

SIAM J. Comput., 1997

On Embedding Rectangular Meshes into Rectangular Meshes of Smaller Aspect Ratio.

Inf. Process. Lett., 1997

Unique Normal Forms for Nonlinear Term Rewriting Systems: Root Overlaps.

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

1996

A New Combinatorial Approach to Optimal Embeddings of Rectangles.

Algorithmica, 1996

Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O Systems.

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996

1995

Transformations and Confluence for Rewrite Systems.

Theor. Comput. Sci., 1995

A Theory of Using History for Equational Systems with Applications.

J. ACM, 1995

Unique Normal Forms and Confluence of Rewrite Systems: Persistence.

Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

1994

A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications.

J. Algorithms, 1994

A New Combinatorial Approach to Optimal Embeddings of Rectangles.

Proceedings of the 8th International Symposium on Parallel Processing, 1994

1993

Smaran: A Congruence-Closure Based System for Equational Computations.

Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993

On Embeddings of Rectangles into Optimal Squares.

Proceedings of the 1993 International Conference on Parallel Processing, 1993

1992

Tight Complexity Bounds for Term Matching Problems

Inf. Comput., November, 1992

Strings, Trees, and Patterns.

Inf. Process. Lett., 1992

1991

A Theory of Using History for Equational Systems with Applications (Extended Abstract)

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

Nonoblivious Normalization Algorithms for Nonlinear Rewrite Systems.

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989

An Analysis of a Good Algorithm for the Subtree Problem, Corrected.

SIAM J. Comput., 1989

Term Matching on Parallel Computers.

J. Log. Program., 1989

Some Complexity Theoretic Aspects of AC Rewriting.

Proceedings of the STACS 89, 1989

1988

Optimal Time Bounds for Parallel Term Matching.

Proceedings of the 9th International Conference on Automated Deduction, 1988

1987

Term Matching on Parallel Computers.

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986

An Efficient Parallel Algorithm for Term Matching.

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986