SbReve2: A Term Rewriting Laboratory with (AC-) Unfailing Completion. - Siva Anantharaman; Jieh Hsiang; Jalel Mzali (RTA, 1989)

An Application of Automated Equational Reasoning to Many-valued Logic. - Siva Anantharaman; Maria Paola Bonacina (CTRS, 1990)

Heuristical Criteria in Refutational Theorem Proving. - Siva Anantharaman; Nirina Andrianarivelo (DISCO, 1990)

Automated Proofs of the Moufang Identities in Alternative Rings. - Siva Anantharaman; Jieh Hsiang (J. Autom. Reason., 1990)

Experiments with Associative-Commutative Discrimination Nets. - Leo Bachmair; Ta Chen; I. V. Ramakrishnan; Siva Anantharaman; Jacques Chabin (IJCAI, 1995)

STORM: A MAny-to-One Associative-Commutative Matcher. - Ta Chen; Siva Anantharaman (RTA, 1995)

A Rewrite Mechanism for Logic Programs with Negation. - Siva Anantharaman; Gilles Richard (Theor. Comput. Sci., 1998)

Unification Modulo ACU I Plus Homomorphisms/Distributivity. - Siva Anantharaman; Paliath Narendran; Michaël Rusinowitch (CADE, 2003)

ACID-Unification Is NEXPTIME-Decidable. - Siva Anantharaman; Paliath Narendran; Michaël Rusinowitch (MFCS, 2003)

Unification Modulo ACUI Plus Distributivity Axioms. - Siva Anantharaman; Paliath Narendran; Michaël Rusinowitch (J. Autom. Reason., 2004)

A Synchronous Process Calculus for Service Costs. - Siva Anantharaman; Jing Chen; Gaétan Hains (SEFM, 2005)

Closure properties and decision problems of dag automata. - Siva Anantharaman; Paliath Narendran; Michaël Rusinowitch (Inf. Process. Lett., 2005)

Automata for Positive Core XPath Queries on Compressed Documents. - Barbara Fila; Siva Anantharaman (LPAR, 2006)

Editorial. - Siva Anantharaman; Paul Gastin; Gaétan Hains; John Mullins; Michaël Rusinowitch (J. Autom. Lang. Comb., 2006)

Intruders with Caps. - Siva Anantharaman; Paliath Narendran; Michaël Rusinowitch (RTA, 2007)

Compression vs Queryability - A Case Study. - Siva Anantharaman (Structure-Based Compression of Complex Massive Data, 2008)

Unification modulo Homomorphic Encryption is Decidable. - Siva Anantharaman; Hai Lin 005; Christopher Lynch; Paliath Narendran; Michaël Rusinowitch (UNIF, 2008)

Cap unification: application to protocol security modulo homomorphic encryption. - Siva Anantharaman; Hai Lin 005; Christopher Lynch; Paliath Narendran; Michaël Rusinowitch (AsiaCCS, 2010)

String Rewriting and Security Analysis: An Extension of a Result of Book and Otto. - Siva Anantharaman; Paliath Narendran; Michaël Rusinowitch (J. Autom. Lang. Comb., 2011)

Unification Modulo Synchronous Distributivity. - Siva Anantharaman; Serdar Erbatur; Christopher Lynch; Paliath Narendran; Michaël Rusinowitch (IJCAR, 2012)

Unification Modulo Chaining. - Siva Anantharaman; Christopher Bouchard; Paliath Narendran; Michaël Rusinowitch (LATA, 2012)

Unification Modulo Homomorphic Encryption. - Siva Anantharaman; Hai Lin 005; Christopher Lynch; Paliath Narendran; Michaël Rusinowitch (J. Autom. Reason., 2012)

Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining. - Siva Anantharaman; Christopher Bouchard; Paliath Narendran; Michaël Rusinowitch (Log. Methods Comput. Sci., 2014)

Unification Modulo Lists with Reverse Relation with Certain Word Equations. - Siva Anantharaman; Peter Hibbs; Paliath Narendran; Michaël Rusinowitch (CADE, 2019)

Privacy Analysis with a Distributed Transition System and a Data-Wise Metric. - Siva Anantharaman; Sabine Frittella; Benjamin Nguyen (PSD, 2022)

Distributed Transition Systems with Tags for Privacy Analysis. - Siva Anantharaman; Sabine Frittella; Benjamin Nguyen (CoRR, 2022)

Distributed Transition System with Tags and Value-wise Metric, for Privacy Analysis. - Siva Anantharaman; Sabine Frittella; Benjamin Nguyen (CoRR, 2025)