default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDenis Lugiez
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c33]Stéphane Demri, Étienne Lozes, Denis Lugiez:
On Symbolic Heaps Modulo Permission Theories. FSTTCS 2017: 25:1-25:14- 2011
- [j14]Denis Lugiez:
Forward Analysis of Dynamic Network of Pushdown Systems is Easier without Order. Int. J. Found. Comput. Sci. 22(4): 843-862 (2011) - 2010
- [j13]Stéphane Demri, Denis Lugiez:
Complexity of modal logics with Presburger constraints. J. Appl. Log. 8(3): 233-252 (2010) - [c32]Stéphane Martin, Denis Lugiez:
Fixing Collaborative Edition on Typed Documents. CDVE 2010: 19-26
2000 – 2009
- 2009
- [c31]Stéphane Martin, Denis Lugiez:
Collaborative peer to peer edition: Avoiding conflicts is better than solving conflicts. IADIS AC (2) 2009: 124-128 - [c30]Denis Lugiez:
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order. RP 2009: 127-140 - [i2]Denis Lugiez, Stéphane Martin:
Peer to Peer Optimistic Collaborative Editing on XML-like trees. CoRR abs/0901.4201 (2009) - [i1]Stéphane Martin, Denis Lugiez:
Research report : Collaborative Peer 2 Peer Edition: Avoiding Conflicts is Better than Solving Conflicts. CoRR abs/0911.0838 (2009) - 2008
- [j12]Stéphanie Delaune, Pascal Lafourcade
, Denis Lugiez, Ralf Treinen:
Symbolic protocol analysis for monoidal equational theories. Inf. Comput. 206(2-4): 312-351 (2008) - 2007
- [j11]Pascal Lafourcade, Denis Lugiez, Ralf Treinen:
Intruder deduction for the equational theory of Abelian groups with distributive encryption. Inf. Comput. 205(4): 581-623 (2007) - [c29]Yannick Chevalier, Denis Lugiez, Michaël Rusinowitch:
Towards an Automatic Analysis of Web Service Security. FroCoS 2007: 133-147 - [c28]Yannick Chevalier, Denis Lugiez, Michaël Rusinowitch:
Verifying Cryptographic Protocols with Subterms Constraints. LPAR 2007: 181-195 - 2006
- [c27]Stéphane Demri, Denis Lugiez:
Presburger Modal Logic Is PSPACE-Complete. IJCAR 2006: 541-556 - [c26]Stéphanie Delaune, Pascal Lafourcade, Denis Lugiez, Ralf Treinen:
Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or. ICALP (2) 2006: 132-143 - 2005
- [j10]Denis Lugiez, Philippe Schnoebelen:
Decidable first-order transition logics for PA-processes. Inf. Comput. 203(1): 75-113 (2005) - [j9]Denis Lugiez:
Multitree automata that count. Theor. Comput. Sci. 333(1-2): 225-263 (2005) - [j8]Denis Lugiez, Peter Niebert, Sarah Zennou:
A partial order semantics approach to the clock explosion problem of timed automata. Theor. Comput. Sci. 345(1): 27-59 (2005) - [c25]Pascal Lafourcade, Denis Lugiez, Ralf Treinen:
Intruder Deduction for AC-Like Equational Theories with Homomorphisms. RTA 2005: 308-322 - 2004
- [c24]Silvano Dal-Zilio, Denis Lugiez, Charles Meyssonnier:
A logic you can count on. POPL 2004: 135-146 - [c23]Denis Lugiez, Peter Niebert, Sarah Zennou:
A Partial Order Semantics Approach to the Clock Explosion Problem of Timed Automata. TACAS 2004: 296-311 - [c22]Denis Lugiez:
From Automata to Semilinear Sets: A Logical Solution for Sets L(C, P). CIAA 2004: 321-322 - 2003
- [j7]Roberto M. Amadio, Denis Lugiez, Vincent Vanackère:
On the symbolic reduction of processes with cryptographic functions. Theor. Comput. Sci. 290(1): 695-740 (2003) - [c21]Denis Lugiez:
Counting and Equality Constraints for Multitree Automata. FoSSaCS 2003: 328-342 - [c20]Silvano Dal-Zilio, Denis Lugiez:
XML Schema, Tree Logic and Sheaves Automata. RTA 2003: 246-263 - [e1]Roberto M. Amadio, Denis Lugiez:
CONCUR 2003 - Concurrency Theory, 14th International Conference, Marseille, France, September 3-5, 2003, Proceedings. Lecture Notes in Computer Science 2761, Springer 2003, ISBN 3-540-40753-7 [contents] - 2002
- [j6]Denis Lugiez, Philippe Schnoebelen:
The regular viewpoint on PA-processes. Theor. Comput. Sci. 274(1-2): 89-115 (2002) - [c19]Denis Lugiez, Peter Niebert, Sarah Zennou:
Dynamic Bounds and Transition Merging for Local First Search. SPIN 2002: 221-229 - 2001
- [j5]Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez:
Algorithms and Reductions for Rewriting Problems. Fundam. Informaticae 46(3): 257-276 (2001) - [c18]Peter Niebert, Michaela Huhn, Sarah Zennou, Denis Lugiez:
Local First Search - A New Paradigm for Partial Order Reductions. CONCUR 2001: 396-410 - 2000
- [c17]Roberto M. Amadio, Denis Lugiez:
On the Reachability Problem in Cryptographic Protocols. CONCUR 2000: 380-394 - [c16]Denis Lugiez, Philippe Schnoebelen:
Decidable First-Order Transition Logics for PA-Processes. ICALP 2000: 342-353
1990 – 1999
- 1998
- [c15]Denis Lugiez, Philippe Schnoebelen:
The Regular Viewpoint on PA-Processes. CONCUR 1998: 50-66 - [c14]Denis Lugiez:
A Good Class of Tree Automata and Application to Inductive Theorem Proving. ICALP 1998: 409-420 - [c13]Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez:
Algorithms and Reductions for Rewriting Problems. RTA 1998: 166-180 - 1997
- [c12]Ali Amaniss, Miki Hermann, Denis Lugiez:
Set Operations for Recurrent Term Schematizations. TAPSOFT 1997: 333-344 - 1995
- [j4]Denis Lugiez:
Positive and Negative Results for Higher-Order Disunification. J. Symb. Comput. 20(4): 431-470 (1995) - [c11]Denis Lugiez:
Undecidability of second-order complement problems. UNIF 1995: 38 - 1994
- [j3]Denis Lugiez, J. L. Moysset:
Tree Automata Help One To Solve Equational Formulae In AC-Theories. J. Symb. Comput. 18(4): 297-318 (1994) - [c10]Denis Lugiez:
Higher Order Disunification: Some decidable cases. CCL 1994: 121-135 - 1993
- [c9]Denis Lugiez, J. L. Moysset:
Complement Problems and Tree Automata in AC-like Theories (Extended Abstract). STACS 1993: 515-524 - 1991
- [j2]Hubert Comon, Denis Lugiez, Philippe Schnoebelen:
A Rewrite-Based Type Discipline for a Subset of Computer Algebra. J. Symb. Comput. 11(4): 349-368 (1991) - [c8]Emmanuel Kounalis, Denis Lugiez, Loic Pottier:
A Solution of the Complement Problem in Associative-Commutative Theories. IWWERT 1991: 197-214 - [c7]Emmanuel Kounalis, Denis Lugiez, Loic Pottier:
A Solution of the Complement Problem in Associative-Commutative Theories. MFCS 1991: 287-297 - [c6]Emmanuel Kounalis, Denis Lugiez:
Compilation of Pattern Matching with Associative-Commutative Functions. TAPSOFT, Vol.1 1991: 57-73
1980 – 1989
- 1989
- [c5]Denis Lugiez:
A Deduction Procedure for First Order Programs. ICLP 1989: 585-599 - 1987
- [j1]Jacques Calmet, Denis Lugiez:
A knowledge-based system for computer algebra. SIGSAM Bull. 21(1): 7-13 (1987) - 1986
- [c4]Jacques Calmet, Hubert Comon, Denis Lugiez:
Type Inference Using Unification in Computer Algebra. AAECC 1986: 25-28 - 1985
- [c3]Denis Lugiez:
Heuristic Bivariate Lifting. AAECC 1985: 385-391 - 1984
- [b1]Denis Lugiez:
Algorithmes de factorisation de polynômes. (Algorithms for factoring polynomials). Grenoble Institute of Technology, France, 1984 - [c2]Denis Lugiez:
Multivariate polynomial factoring and detection of true factors. AAECC 1984: 169-177 - [c1]Denis Lugiez:
A New Lifting Process for the Multivariate Polynomial Factorization. EUROSAM 1984: 297-309
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
