Search

Your search keyword '"Narendran, Paliath"' showing total 331 results
Start Over Author "Narendran, Paliath"
331 results on '"Narendran, Paliath"'

1. Existence and Construction of a Gr\'obner Basis for a Polynomial Ideal

Author

Kapur, Deepak and Narendran, Paliath

Subjects
Mathematics - Commutative Algebra, Computer Science - Symbolic Computation, Mathematics - Algebraic Geometry
Abstract

This extended abstract gives a construction for lifting a Gr\"obner basis algorithm for an ideal in a polynomial ring over a commutative ring R under the condition that R also admits a Gr\"obner basis for every ideal in R.

Published
2023

2. Deciding Knowledge Problems Modulo Classes of Permutative Theories

Author

Erbatur, Serdar, Marshall, Andrew M., Narendran, Paliath, Ringeissen, Christophe, Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Bowles, Juliana, editor, and Søndergaard, Harald, editor

Published
2024
Full Text
View/download PDF

3. CryptoSolve: Towards a Tool for the Symbolic Analysis of Cryptographic Algorithms

Author

Chichester, Dalton, Du, Wei, Kauffman, Raymond, Lin, Hai, Lynch, Christopher, Marshall, Andrew M., Meadows, Catherine A., Narendran, Paliath, Ravishankar, Veena, Rovira, Luis, and Rozek, Brandon

Subjects
Computer Science - Logic in Computer Science, Computer Science - Cryptography and Security, Computer Science - Symbolic Computation
Abstract

Recently, interest has been emerging in the application of symbolic techniques to the specification and analysis of cryptosystems. These techniques, when accompanied by suitable proofs of soundness/completeness, can be used both to identify insecure cryptosystems and prove sound ones secure. But although a number of such symbolic algorithms have been developed and implemented, they remain scattered throughout the literature. In this paper, we present a tool, CryptoSolve, which provides a common basis for specification and implementation of these algorithms, CryptoSolve includes libraries that provide the term algebras used to express symbolic cryptographic systems, as well as implementations of useful algorithms, such as unification and variant generation. In its current initial iteration, it features several algorithms for the generation and analysis of cryptographic modes of operation, which allow one to use block ciphers to encrypt messages more than one block long. The goal of our work is to continue expanding the tool in order to consider additional cryptosystems and security questions, as well as extend the symbolic libraries to increase their applicability., Comment: In Proceedings GandALF 2022, arXiv:2209.09333

Published
2022
Full Text
View/download PDF

4. On Problems Dual to Unification: The String-Rewriting Case

Author

Akçam, Zümrüt, Cornell, Kimberly A., Hono II, Daniel S., Narendran, Paliath, and Pulver, Andrew

Subjects
Computer Science - Logic in Computer Science
Abstract

In this paper, we investigate problems which are dual to the unification problem, namely the Fixed Point (FP) problem, Common Term (CT) problem and the Common Equation (CE) problem for string rewriting systems. Our main motivation is computing fixed points in systems, such as loop invariants in programming languages. We show that the fixed point (FP) problem is reducible to the common term problem. Our new results are: (i) the fixed point problem is undecidable for finite convergent string rewriting systems whereas it is decidable in polynomial time for finite, convergent and dwindling string rewriting systems, (ii) the common term problem is undecidable for the class of dwindling string rewriting systems, and (iii) for the class of finite, monadic and convergent systems, the common equation problem is decidable in polynomial time but for the class of dwindling string rewriting systems, common equation problem is undecidable., Comment: 28 pages, 6 figures, will be submitted for LMCS journal. arXiv admin note: substantial text overlap with arXiv:1706.05607

Published
2021

5. On Asymmetric Unification for the Theory of XOR with a Homomorphism

Author

Lynch, Christopher, Marshall, Andrew M., Meadows, Catherine, Narendran, Paliath, and Ravishankar, Veena

Subjects
Computer Science - Computational Complexity, Computer Science - Cryptography and Security
Abstract

Asymmetric unification, or unification with irreducibility constraints, is a newly developed paradigm that arose out of the automated analysis of cryptographic protocols. However, there are still relatively few asymmetric unification algorithms. In this paper we address this lack by exploring the application of automata-based unification methods. We examine the theory of xor with a homomorphism, ACUNh, from the point of view of asymmetric unification, and develop a new automata-based decision procedure. Then, we adapt a recently developed asymmetric combination procedure to produce a general asymmetric- ACUNh decision procedure. Finally, we present a new approach for obtaining a solution-generating asymmetric-ACUNh unification automaton. We also compare our approach to the most commonly used form of asymmetric unification available today, variant unification.

Published
2019

7. On Problems Dual to Unification

Author

Akçam, Zümrüt, Hono II, Daniel S., and Narendran, Paliath

Subjects
Computer Science - Logic in Computer Science
Abstract

In this paper, we investigate a problem dual to the unification problem, namely the Common Term (CT) problem for string rewriting systems. Our main motivation was in computing fixed points in systems, such as loop invariants in programming languages. We show that the fixed point problem is reducible to the common term problem. We also prove that the common term problem is undecidable for dwindling string rewriting systems.

Published
2017

8. Asymmetric Unification and Disunification

Author

Ravishankar, Veena, Gero, Kimberly A., and Narendran, Paliath

Subjects
Computer Science - Logic in Computer Science
Abstract

We compare two kinds of unification problems: Asymmetric Unification and Disunification, which are variants of Equational Unification. Asymmetric Unification is a type of Equational Unification where the right-hand sides of the equations are in normal form with respect to the given term rewriting system. In Disunification we solve equations and disequations with respect to an equational theory for the case with free constants. We contrast the time complexities of both and show that the two problems are incomparable: there are theories where one can be solved in Polynomial time while the other is NP-hard. This goes both ways. The time complexity also varies based on the termination ordering used in the term rewriting system.

Published
2017

9. Algorithmic Problems in the Symbolic Approach to the Verification of Automatically Synthesized Cryptosystems

Author

Lin, Hai, Lynch, Christopher, Marshall, Andrew M., Meadows, Catherine A., Narendran, Paliath, Ravishankar, Veena, Rozek, Brandon, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Konev, Boris, editor, and Reger, Giles, editor

Published
2021
Full Text
View/download PDF

10. Lynch-Morawska Systems on Strings

Author

Hono II, Daniel S., Narendran, Paliath, and Veras, Rafael

Subjects
Computer Science - Logic in Computer Science
Abstract

We investigate properties of convergent and forward-closed string rewriting systems in the context of the syntactic criteria introduced in \cite{LynchMorawska} by Christopher Lynch and Barbara Morawska (we call these $LM$-Systems). Since a string rewriting system can be viewed as a term-rewriting system over a signature of purely monadic function symbols, we adapt their definition to the string rewriting case. We prove that the subterm-collapse problem for convergent and forward-closed string rewriting systems is effectively solvable. Therefore, there exists a decision procedure that verifies if such a system is an $LM$-System. We use the same construction to prove that the \emph{cap problem} from the field of cryptographic protocol analysis, which is undecidable for general $LM$-systems, is decidable when restricted to the string rewriting case., Comment: Revised based on reviewers' feedback

Published
2016

11. Notes on Lynch-Morawska Systems

Author

Hono II, Daniel S., Galatage, Namrata, Gero, Kimberly A., Narendran, Paliath, and Subburathinam, Ananya

Subjects
Computer Science - Logic in Computer Science
Abstract

In this paper we investigate convergent term rewriting systems that conform to the criteria set out by Christopher Lynch and Barbara Morawska in their seminal paper "Basic Syntactic Mutation." The equational unification problem modulo such a rewrite system is solvable in polynomial-time. In this paper, we derive properties of such a system which we call an $LM$-system. We show, in particular, that the rewrite rules in an $LM$-system have no left- or right-overlaps. We also show that despite the restricted nature of an $LM$-system, there are important undecidable problems, such as the deduction problem in cryptographic protocol analysis (also called the the cap problem) that remain undecidable for $LM$-systems.

Published
2016

12. On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry

Author

Marshall, Andrew M, Meadows, Catherine, and Narendran, Paliath

Subjects
Computer Science - Logic in Computer Science
Abstract

An algorithm for unification modulo one-sided distributivity is an early result by Tid\'en and Arnborg. More recently this theory has been of interest in cryptographic protocol analysis due to the fact that many cryptographic operators satisfy this property. Unfortunately the algorithm presented in the paper, although correct, has recently been shown not to be polynomial time bounded as claimed. In addition, for some instances, there exist most general unifiers that are exponentially large with respect to the input size. In this paper we first present a new polynomial time algorithm that solves the decision problem for a non-trivial subcase, based on a typed theory, of unification modulo one-sided distributivity. Next we present a new polynomial algorithm that solves the decision problem for unification modulo one-sided distributivity. A construction, employing string compression, is used to achieve the polynomial bound. Lastly, we examine the one-sided distributivity problem in the new asymmetric unification paradigm. We give the first asymmetric unification algorithm for one-sided distributivity.

Published
2015
Full Text
View/download PDF

13. Unification Modulo Lists with Reverse Relation with Certain Word Equations

Author

Anantharaman, Siva, Hibbs, Peter, Narendran, Paliath, Rusinowitch, Michael, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, and Fontaine, Pascal, editor

Published
2019
Full Text
View/download PDF

14. Reviving Basic Narrowing Modulo

Author

Kim, Dohan, Lynch, Christopher, Narendran, Paliath, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Herzig, Andreas, editor, and Popescu, Andrei, editor

Published
2019
Full Text
View/download PDF

15. Asymmetric Unification and Disunification

Author

Ravishankar, Veena, Cornell, Kimberly A., Narendran, Paliath, Hutchison, David, Editorial Board Member, Kanade, Takeo, Editorial Board Member, Kittler, Josef, Editorial Board Member, Kleinberg, Jon M., Editorial Board Member, Mattern, Friedemann, Editorial Board Member, Mitchell, John C., Editorial Board Member, Naor, Moni, Editorial Board Member, Pandu Rangan, C., Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Terzopoulos, Demetri, Editorial Board Member, Tygar, Doug, Editorial Board Member, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Lutz, Carsten, editor, Sattler, Uli, editor, Tinelli, Cesare, editor, Turhan, Anni-Yasmin, editor, and Wolter, Frank, editor

Published
2019
Full Text
View/download PDF

16. Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining

Author

Anantharaman, Siva, Bouchard, Christopher, Narendran, Paliath, and Rusinowitch, Michaël

Subjects
Computer Science - Logic in Computer Science
Abstract

We investigate unification problems related to the Cipher Block Chaining (CBC) mode of encryption. We first model chaining in terms of a simple, convergent, rewrite system over a signature with two disjoint sorts: list and element. By interpreting a particular symbol of this signature suitably, the rewrite system can model several practical situations of interest. An inference procedure is presented for deciding the unification problem modulo this rewrite system. The procedure is modular in the following sense: any given problem is handled by a system of `list-inferences', and the set of equations thus derived between the element-terms of the problem is then handed over to any (`black-box') procedure which is complete for solving these element-equations. An example of application of this unification procedure is given, as attack detection on a Needham-Schroeder like protocol, employing the CBC encryption mode based on the associative-commutative (AC) operator XOR. The 2-sorted convergent rewrite system is then extended into one that fully captures a block chaining encryption-decryption mode at an abstract level, using no AC-symbols; and unification modulo this extended system is also shown to be decidable., Comment: 26 pages

Published
2014
Full Text
View/download PDF

18. On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity

Author

Narendran, Paliath, Marshall, Andrew, and Mahapatra, Bibhu

Subjects
Computer Science - Symbolic Computation, Computer Science - Logic in Computer Science
Abstract

We prove that the Tiden and Arnborg algorithm for equational unification modulo one-sided distributivity is not polynomial time bounded as previously thought. A set of counterexamples is developed that demonstrates that the algorithm goes through exponentially many steps., Comment: In Proceedings UNIF 2010, arXiv:1012.4554

Published
2010
Full Text
View/download PDF

19. Unification modulo a partial theory of exponentiation

Author

Kapur, Deepak, Marshall, Andrew, and Narendran, Paliath

Subjects
Computer Science - Symbolic Computation, Computer Science - Logic in Computer Science
Abstract

Modular exponentiation is a common mathematical operation in modern cryptography. This, along with modular multiplication at the base and exponent levels (to different moduli) plays an important role in a large number of key agreement protocols. In our earlier work, we gave many decidability as well as undecidability results for multiple equational theories, involving various properties of modular exponentiation. Here, we consider a partial subtheory focussing only on exponentiation and multiplication operators. Two main results are proved. The first result is positive, namely, that the unification problem for the above theory (in which no additional property is assumed of the multiplication operators) is decidable. The second result is negative: if we assume that the two multiplication operators belong to two different abelian groups, then the unification problem becomes undecidable., Comment: In Proceedings UNIF 2010, arXiv:1012.4554

Published
2010
Full Text
View/download PDF

22. Inferring RPO Symbol Ordering

Author

Du, Wei, Narendran, Paliath, Rusinowitch, Michael, University at Albany [SUNY], State University of New York (SUNY), Proof techniques for security protocols (PESTO), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Veena Ravishankar, and Christophe Ringeissen

Subjects
[INFO]Computer Science [cs]
Abstract

International audience; We study the recursive path ordering (RPO) in the context of string-rewriting systems. We are interested in finding a symbol ordering in RPO such that for every rule in the rewriting system, the left hand side is higher than the right hand side. We show that this SYMBOL-ORDER problem is NP-complete by a reduction from the 2-3-SAT problem. We also work on the one-rule case and show a polynomial time algorithm for such systems.

Published
2023

23. Unification and Matching in Hierarchical Combinations of Syntactic Theories

Author

Erbatur, Serdar, Kapur, Deepak, Marshall, Andrew M., Narendran, Paliath, Ringeissen, Christophe, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Lutz, Carsten, editor, and Ranise, Silvio, editor

Published
2015
Full Text
View/download PDF

25. On Asymmetric Unification and the Combination Problem in Disjoint Theories

Author

Erbatur, Serdar, Kapur, Deepak, Marshall, Andrew M., Meadows, Catherine, Narendran, Paliath, Ringeissen, Christophe, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Muscholl, Anca, editor

Published
2014
Full Text
View/download PDF

26. On Forward Closure and the Finite Variant Property

Author

Bouchard, Christopher, Gero, Kimberly A., Lynch, Christopher, Narendran, Paliath, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Fontaine, Pascal, editor, Ringeissen, Christophe, editor, and Schmidt, Renate A., editor

Published
2013
Full Text
View/download PDF

27. Hierarchical Combination

Author

Erbatur, Serdar, Kapur, Deepak, Marshall, Andrew M., Narendran, Paliath, Ringeissen, Christophe, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, and Bonacina, Maria Paola, editor

Published
2013
Full Text
View/download PDF

28. Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis

Author

Erbatur, Serdar, Escobar, Santiago, Kapur, Deepak, Liu, Zhiqiang, Lynch, Christopher A., Meadows, Catherine, Meseguer, José, Narendran, Paliath, Santiago, Sonia, Sasse, Ralf, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, and Bonacina, Maria Paola, editor

Published
2013
Full Text
View/download PDF

29. Effective Symbolic Protocol Analysis via Equational Irreducibility Conditions

Author

Erbatur, Serdar, Escobar, Santiago, Kapur, Deepak, Liu, Zhiqiang, Lynch, Christopher, Meadows, Catherine, Meseguer, José, Narendran, Paliath, Santiago, Sonia, Sasse, Ralf, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Foresti, Sara, editor, Yung, Moti, editor, and Martinelli, Fabio, editor

Published
2012
Full Text
View/download PDF

30. Unification Modulo Synchronous Distributivity

Author

Anantharaman, Siva, Erbatur, Serdar, Lynch, Christopher, Narendran, Paliath, Rusinowitch, Michael, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Gramlich, Bernhard, editor, Miller, Dale, editor, and Sattler, Uli, editor

Published
2012
Full Text
View/download PDF

31. New Algorithms for Unification Modulo One-Sided Distributivity and Its Variants

Author

Marshall, Andrew M., Narendran, Paliath, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Gramlich, Bernhard, editor, Miller, Dale, editor, and Sattler, Uli, editor

Published
2012
Full Text
View/download PDF

32. Unification Modulo Chaining

Author

Anantharaman, Siva, Bouchard, Christopher, Narendran, Paliath, Rusinowitch, Michael, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Dediu, Adrian-Horia, editor, and Martín-Vide, Carlos, editor

Published
2012
Full Text
View/download PDF

33. Unification Modulo Homomorphic Encryption

Author

Anantharaman, Siva, Lin, Hai, Lynch, Christopher, Narendran, Paliath, Rusinowitch, Michaël, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Ghilardi, Silvio, editor, and Sebastiani, Roberto, editor

Published
2009
Full Text
View/download PDF

34. On Extended Regular Expressions

Author

Carle, Benjamin, Narendran, Paliath, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Dediu, Adrian Horia, editor, Ionescu, Armand Mihai, editor, and Martín-Vide, Carlos, editor

Published
2009
Full Text
View/download PDF

36. Intruders with Caps

Author

Anantharaman, Siva, Narendran, Paliath, Rusinowitch, Michael, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Baader, Franz, editor

Published
2007
Full Text
View/download PDF

39. ACID-Unification Is NEXPTIME-Decidable

Author

Anantharaman, Siva, Narendran, Paliath, Rusinowitch, Michael, Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Rovan, Branislav, editor, and Vojtáš, Peter, editor

Published
2003
Full Text
View/download PDF

42. The Theory of Total Unary RPO Is Decidable

Author

Narendran, Paliath, Rusinowitch, Michael, Goos, G., editor, Hartmanis, J., editor, van Leeuwen, J., editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Lloyd, John, editor, Dahl, Veronica, editor, Furbach, Ulrich, editor, Kerber, Manfred, editor, Lau, Kung-Kiu, editor, Palamidessi, Catuscia, editor, Pereira, Luís Moniz, editor, Sagiv, Yehoshua, editor, and Stuckey, Peter J., editor

Published
2000
Full Text
View/download PDF

43. RPO Constraint Solving Is in NP

Author

Narendran, Paliath, Rusinowitch, Michael, Verma, Rakesh, Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Gottlob, Georg, editor, Grandjean, Etienne, editor, and Seyr, Katrin, editor

Published
1999
Full Text
View/download PDF

47. Unification and matching modulo nilpotence

Author

Guo, Qing, Narendran, Paliath, Wolfram, D. A., Goos, G., editor, Hartmanis, J., editor, van Leeuwen, J., editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, McRobbie, M. A., editor, and Slaney, J. K., editor

Published
1996
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results