×

zbMATH — the first resource for mathematics

Demri, Stéphane P.

Compute Distance To:
Author ID: demri.stephane-p Recent zbMATH articles by "Demri, Stéphane P."
Published as: Demri, S.; Demri, Stephane; Demri, Stéphane; Demri, Stéphane P.
Documents Indexed: 114 Publications since 1992, including 5 Books

Publications by Year

Citations contained in zbMATH

82 Publications have been cited 380 times in 233 Documents Cited by Year
LTL with the freeze quantifier and register automata. Zbl 1351.68158
Demri, Stéphane; Lazić, Ranko
37
2009
The complexity of propositional linear temporal logics in simple cases. Zbl 1009.68072
Demri, Stéphane; Schnoebelen, Philippe
24
2002
Incomplete information: Structure, inference, complexity. Zbl 1016.68163
Demri, Stéphane P.; Orłowska, Ewa S.
22
2002
An automata-theoretic approach to constraint LTL. Zbl 1113.03015
Demri, Stéphane; D’Souza, Deepak
17
2007
On the almighty wand. Zbl 1262.03051
Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne
11
2012
On the freeze quantifier in Constraint LTL: Decidability and complexity. Zbl 1116.03014
Demri, Stéphane; Lazić, Ranko; Nowak, David
11
2007
The effects of bounding syntactic resources on Presburger LTL. Zbl 1193.03033
Demri, Stéphane; Gascon, Régis
10
2009
Deciding regular grammar logics with converse through first-order logic. Zbl 1083.03023
Demri, Stéphane; de Nivelle, Hans
10
2005
A modal perspective on path constraints. Zbl 1093.68032
Alechina, Natasha; Demri, Stéphane; de Rijke, Maarten
10
2003
Model-checking \(\mathrm{CTL}^*\) over flat Presburger counter systems. Zbl 1242.68157
Demri, Stéphane; Finkel, Alain; Goranko, Valentin; van Drimmelen, Govert
9
2010
Towards a model-checker for counter systems. Zbl 1161.68563
Demri, S.; Finkel, A.; Goranko, V.; van Drimmelen, G.
8
2006
The covering and boundedness problems for branching vector addition systems. Zbl 1260.68264
Demri, Stéphane; Jurdziński, Marcin; Lachish, Oded; Lazić, Ranko
7
2013
On the almighty wand. Zbl 1157.03010
Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne
7
2008
LTL over integer periodicity constraints. Zbl 1097.68073
Demri, Stéphane
7
2006
The complexity of regularity in grammar logics and related modal logics. Zbl 1002.03018
Demri, Stéphane
7
2001
Temporal logics in computer science. Finite-state systems. Zbl 1380.68003
Demri, Stéphane; Goranko, Valentin; Lange, Martin
6
2016
Separation logic with one quantified variable. Zbl 1408.68036
Demri, Stéphane; Galmiche, Didier; Larchey-Wendling, Dominique; Méry, Daniel
6
2014
On selective unboundedness of VASS. Zbl 1285.68094
Demri, Stéphane
6
2013
When model-checking freeze LTL over counter machines becomes decidable. Zbl 1284.68394
Demri, Stéphane; Sangnier, Arnaud
6
2010
Presburger modal logic is PSPACE-complete. Zbl 1222.03024
Demri, Stéphane; Lugiez, Denis
6
2006
Verification of qualitative \(\mathbb Z\) constraints. Zbl 1134.68405
Demri, Stéphane; Gascon, Régis
6
2005
Expressive completeness of separation logic with two variables and no separating conjunction. Zbl 1367.03053
Demri, Stephane; Deters, Morgan
5
2016
Reasoning about data repetitions with counter systems. Zbl 1366.68202
Demri, Stéphane; Figueira, Diego; Praveen, M.
5
2013
Reasoning about sequences of memory states. Zbl 1225.68068
Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne
5
2009
A reduction from DLP to PDL. Zbl 1092.03016
Demri, Stéphane
5
2005
An automata-theoretic approach to constraint LTL. Zbl 1027.03027
Demri, Stéphane; D’Souza, Deepak
5
2002
A completeness proof for a logic with an alternative necessity operator. Zbl 0864.03012
Demri, Stéphane
5
1997
Two-variable separation logic and its inner circle. Zbl 1354.03036
Demri, Stéphane; Deters, Morgan
4
2015
Taming past LTL and flat counter systems. Zbl 1378.68112
Demri, Stéphane; Dhar, Amit Kumar; Sangnier, Arnaud
4
2015
Verification of qualitative \(\mathbb Z\) constraints. Zbl 1157.68048
Demri, Stéphane; Gascon, Régis
4
2008
Model checking freeze LTL over one-counter automata. Zbl 1139.68038
Demri, Stéphane; Lazić, Ranko; Sangnier, Arnaud
4
2008
The complexity of propositional linear temporal logics in simple cases. (Extended abstract). Zbl 0919.03012
Demri, S.; Schnoebelen, Ph.
4
1998
Uniform and non uniform strategies for tableaux calculi for modal logics. Zbl 0826.03006
Demri, Stéphane
4
1995
Separation logics and modalities: a survey. Zbl 1398.03151
Demri, Stéphane; Deters, Morgan
3
2015
Equivalence between model-checking flat counter systems and Presburger arithmetic. Zbl 1393.68101
Demri, Stéphane; Dhar, Amit; Sangnier, Arnaud
3
2014
On the complexity of verifying regular properties on flat counter systems. Zbl 1334.68130
Demri, Stéphane; Dhar, Amit Kumar; Sangnier, Arnaud
3
2013
Automata-based computation of temporal equilibrium models. Zbl 1377.68060
Cabalar, Pedro; Demri, Stéphane
3
2012
Temporal logics of repeating values. Zbl 1279.68203
Demri, Stéphane; D’Souza, Deepak; Gascon, Régis
3
2012
Taming past LTL and flat counter systems. Zbl 1358.68186
Demri, Stéphane; Dhar, Amit Kumar; Sangnier, Arnaud
3
2012
Model checking memoryful linear-time logics over one-counter automata. Zbl 1334.68131
Demri, Stéphane; Lazić, Ranko; Sangnier, Arnaud
3
2010
Linear-time temporal logics with Presburger constraints: an overview. Zbl 1186.03036
Demri, Stéphane
3
2006
LTL over integer periodicity constraints (extended abstract). Zbl 1126.68471
Demri, Stéphane
3
2004
A parametric analysis of the state explosion problem in model checking. Zbl 1054.68557
Demri, S.; Laroussinie, F.; Schnoebelen, P.
3
2002
Display calculi for nomial tense logics. Zbl 1016.03018
Demri, Stéphane; Goré, Rajeev
3
2002
Theoremhood-preserving maps characterizing cut elimination for modal provability logics. Zbl 1006.03036
Demri, Stéphane; Goré, Rajeev
3
2002
The validity problem for the logic DALLA is decidable. Zbl 0847.03012
Demri, Stéphane
3
1996
On the complexity of resource-bounded logics. Zbl 1403.68137
Alechina, Natasha; Bulling, Nils; Demri, Stephane; Logan, Brian
2
2016
Temporal logics on strings with prefix relation. Zbl 1353.68176
Demri, Stéphane; Deters, Morgan
2
2016
Reasoning about data repetitions with counter systems. Zbl 1448.68339
Demri, Stéphane; Figueira, Diego; Praveen, M.
2
2016
Expressive completeness of separation logic with two variables and no separating conjunction. Zbl 1394.03054
Demri, Stéphane; Deters, Morgan
2
2014
Witness runs for counter machines. Zbl 1397.68122
Barrett, Clark; Demri, Stéphane; Deters, Morgan
2
2013
Model-checking bounded multi-pushdown systems. Zbl 1381.68145
Bansal, Kshitij; Demri, Stéphane
2
2013
The complexity of reversal-bounded model-checking. Zbl 1348.68121
Bersani, Marcello M.; Demri, Stéphane
2
2011
Complexity of modal logics with Presburger constraints. Zbl 1220.03008
Demri, Stéphane; Lugiez, Denis
2
2010
The complexity of temporal logic with until and since over ordinals. Zbl 1137.03308
Demri, Stéphane; Rabinovich, Alexander
2
2007
A decidable temporal logic of repeating values. Zbl 1132.03337
Demri, Stéphane; D’Souza, Deepak; Gascon, Régis
2
2007
Reasoning about sequences of memory states. Zbl 1132.68335
Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne
2
2007
A parametric analysis of the state-explosion problem in model checking. Zbl 1094.68056
Demri, S.; Laroussinie, F.; Schnoebelen, Ph.
2
2006
Modal logics with weak forms of recursion: PSPACE specimens. Zbl 1031.03031
Demri, Stéphane
2
2002
Complexity of simple dependent bimodal logics. Zbl 0963.03076
Demri, Stéphane
2
2000
Computational complexity of multimodal logics based on rough sets. Zbl 0971.03023
Demri, Stéphane; Stepaniuk, Jarosław
2
2000
The nondeterministic information logic NIL is PSPACE-complete. Zbl 0953.03036
Demri, Stéphane
2
2000
A logic with relative knowledge operators. Zbl 0928.68107
Demri, Stéphane
2
1999
Logical analysis of demonic nondeterministic programs. Zbl 0872.03018
Demri, Stéphane; Orłowska, Ewa
2
1996
Specification and verification using temporal logics. Zbl 1256.68101
Demri, Stéphane; Gastin, Paul
1
2012
Petri net reachability graphs: decidability status of first order properties. Zbl 1248.68324
Darondeau, Philippe; Demri, Stéphane; Meyer, Roland; Morvan, Christophe
1
2012
The covering and boundedness problems for branching vector addition systems. Zbl 1248.68202
Demri, Stéphane; Jurdziński, Marcin; Lachish, Oded; Lazić, Ranko
1
2009
Reasoning about transfinite sequences. Zbl 1109.68065
Demri, Stéphane; Nowak, David
1
2007
Reasoning about transfinite sequences. (Extended abstract). Zbl 1170.68513
Demri, Stéphane; Nowak, David
1
2005
A polynomial space construction of tree-like models for logics with local chains of modal connectives. Zbl 1028.68064
Demri, Stéphane
1
2003
Automata-theoretic decision procedures for information logics. Zbl 1025.03021
Demri, Stéphane; Sattler, Ulrike
1
2002
A simple modal encoding of propositional finite many-valued logics. Zbl 0992.03031
Demri, Stéphane
1
2000
On modal logics characterized by models with relative accessibility relations. II. Zbl 0981.03031
Demri, Stéphane; Gabbay, Dov
1
2000
An \({\mathcal O}((n\log n)^3)\)-time transformation from Grz into decidable fragments of classical first-order logic. Zbl 0956.03026
Demri, Stéphane; Goré, Rajeev
1
2000
Display calculi for logics with relative accessibility relations. Zbl 0988.03030
Demri, Stéphane; Goré, Rajeev
1
2000
Cut-free display calculi for nominal tense logics. Zbl 0931.03032
Demri, Stéphane; Goré, Rajeev
1
1999
Sequent calculi for nominal tense logics: A step towards mechanization? Zbl 0931.03031
Demri, Stéphane
1
1999
Informational representability of models for information logics. Zbl 0923.03039
Demri, Stéphane; Orłowska, Ewa
1
1999
A class of decidable information logics. Zbl 0902.68062
Demri, Stéphane
1
1998
A simple tableau system for the logic of elsewhere. Zbl 1415.03021
Demri, Stéphane
1
1996
A class of information logics with a decidable validity problem. Zbl 0886.03014
Demri, Stéphane
1
1996
Towards reasoning about Hoare relations. Zbl 0858.68057
Demri, Stéphane; Orlowska, Ewa; Rewitzky, Ingrid
1
1994
Temporal logics in computer science. Finite-state systems. Zbl 1380.68003
Demri, Stéphane; Goranko, Valentin; Lange, Martin
6
2016
Expressive completeness of separation logic with two variables and no separating conjunction. Zbl 1367.03053
Demri, Stephane; Deters, Morgan
5
2016
On the complexity of resource-bounded logics. Zbl 1403.68137
Alechina, Natasha; Bulling, Nils; Demri, Stephane; Logan, Brian
2
2016
Temporal logics on strings with prefix relation. Zbl 1353.68176
Demri, Stéphane; Deters, Morgan
2
2016
Reasoning about data repetitions with counter systems. Zbl 1448.68339
Demri, Stéphane; Figueira, Diego; Praveen, M.
2
2016
Two-variable separation logic and its inner circle. Zbl 1354.03036
Demri, Stéphane; Deters, Morgan
4
2015
Taming past LTL and flat counter systems. Zbl 1378.68112
Demri, Stéphane; Dhar, Amit Kumar; Sangnier, Arnaud
4
2015
Separation logics and modalities: a survey. Zbl 1398.03151
Demri, Stéphane; Deters, Morgan
3
2015
Separation logic with one quantified variable. Zbl 1408.68036
Demri, Stéphane; Galmiche, Didier; Larchey-Wendling, Dominique; Méry, Daniel
6
2014
Equivalence between model-checking flat counter systems and Presburger arithmetic. Zbl 1393.68101
Demri, Stéphane; Dhar, Amit; Sangnier, Arnaud
3
2014
Expressive completeness of separation logic with two variables and no separating conjunction. Zbl 1394.03054
Demri, Stéphane; Deters, Morgan
2
2014
The covering and boundedness problems for branching vector addition systems. Zbl 1260.68264
Demri, Stéphane; Jurdziński, Marcin; Lachish, Oded; Lazić, Ranko
7
2013
On selective unboundedness of VASS. Zbl 1285.68094
Demri, Stéphane
6
2013
Reasoning about data repetitions with counter systems. Zbl 1366.68202
Demri, Stéphane; Figueira, Diego; Praveen, M.
5
2013
On the complexity of verifying regular properties on flat counter systems. Zbl 1334.68130
Demri, Stéphane; Dhar, Amit Kumar; Sangnier, Arnaud
3
2013
Witness runs for counter machines. Zbl 1397.68122
Barrett, Clark; Demri, Stéphane; Deters, Morgan
2
2013
Model-checking bounded multi-pushdown systems. Zbl 1381.68145
Bansal, Kshitij; Demri, Stéphane
2
2013
On the almighty wand. Zbl 1262.03051
Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne
11
2012
Automata-based computation of temporal equilibrium models. Zbl 1377.68060
Cabalar, Pedro; Demri, Stéphane
3
2012
Temporal logics of repeating values. Zbl 1279.68203
Demri, Stéphane; D’Souza, Deepak; Gascon, Régis
3
2012
Taming past LTL and flat counter systems. Zbl 1358.68186
Demri, Stéphane; Dhar, Amit Kumar; Sangnier, Arnaud
3
2012
Specification and verification using temporal logics. Zbl 1256.68101
Demri, Stéphane; Gastin, Paul
1
2012
Petri net reachability graphs: decidability status of first order properties. Zbl 1248.68324
Darondeau, Philippe; Demri, Stéphane; Meyer, Roland; Morvan, Christophe
1
2012
The complexity of reversal-bounded model-checking. Zbl 1348.68121
Bersani, Marcello M.; Demri, Stéphane
2
2011
Model-checking \(\mathrm{CTL}^*\) over flat Presburger counter systems. Zbl 1242.68157
Demri, Stéphane; Finkel, Alain; Goranko, Valentin; van Drimmelen, Govert
9
2010
When model-checking freeze LTL over counter machines becomes decidable. Zbl 1284.68394
Demri, Stéphane; Sangnier, Arnaud
6
2010
Model checking memoryful linear-time logics over one-counter automata. Zbl 1334.68131
Demri, Stéphane; Lazić, Ranko; Sangnier, Arnaud
3
2010
Complexity of modal logics with Presburger constraints. Zbl 1220.03008
Demri, Stéphane; Lugiez, Denis
2
2010
LTL with the freeze quantifier and register automata. Zbl 1351.68158
Demri, Stéphane; Lazić, Ranko
37
2009
The effects of bounding syntactic resources on Presburger LTL. Zbl 1193.03033
Demri, Stéphane; Gascon, Régis
10
2009
Reasoning about sequences of memory states. Zbl 1225.68068
Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne
5
2009
The covering and boundedness problems for branching vector addition systems. Zbl 1248.68202
Demri, Stéphane; Jurdziński, Marcin; Lachish, Oded; Lazić, Ranko
1
2009
On the almighty wand. Zbl 1157.03010
Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne
7
2008
Verification of qualitative \(\mathbb Z\) constraints. Zbl 1157.68048
Demri, Stéphane; Gascon, Régis
4
2008
Model checking freeze LTL over one-counter automata. Zbl 1139.68038
Demri, Stéphane; Lazić, Ranko; Sangnier, Arnaud
4
2008
An automata-theoretic approach to constraint LTL. Zbl 1113.03015
Demri, Stéphane; D’Souza, Deepak
17
2007
On the freeze quantifier in Constraint LTL: Decidability and complexity. Zbl 1116.03014
Demri, Stéphane; Lazić, Ranko; Nowak, David
11
2007
The complexity of temporal logic with until and since over ordinals. Zbl 1137.03308
Demri, Stéphane; Rabinovich, Alexander
2
2007
A decidable temporal logic of repeating values. Zbl 1132.03337
Demri, Stéphane; D’Souza, Deepak; Gascon, Régis
2
2007
Reasoning about sequences of memory states. Zbl 1132.68335
Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne
2
2007
Reasoning about transfinite sequences. Zbl 1109.68065
Demri, Stéphane; Nowak, David
1
2007
Towards a model-checker for counter systems. Zbl 1161.68563
Demri, S.; Finkel, A.; Goranko, V.; van Drimmelen, G.
8
2006
LTL over integer periodicity constraints. Zbl 1097.68073
Demri, Stéphane
7
2006
Presburger modal logic is PSPACE-complete. Zbl 1222.03024
Demri, Stéphane; Lugiez, Denis
6
2006
Linear-time temporal logics with Presburger constraints: an overview. Zbl 1186.03036
Demri, Stéphane
3
2006
A parametric analysis of the state-explosion problem in model checking. Zbl 1094.68056
Demri, S.; Laroussinie, F.; Schnoebelen, Ph.
2
2006
Deciding regular grammar logics with converse through first-order logic. Zbl 1083.03023
Demri, Stéphane; de Nivelle, Hans
10
2005
Verification of qualitative \(\mathbb Z\) constraints. Zbl 1134.68405
Demri, Stéphane; Gascon, Régis
6
2005
A reduction from DLP to PDL. Zbl 1092.03016
Demri, Stéphane
5
2005
Reasoning about transfinite sequences. (Extended abstract). Zbl 1170.68513
Demri, Stéphane; Nowak, David
1
2005
LTL over integer periodicity constraints (extended abstract). Zbl 1126.68471
Demri, Stéphane
3
2004
A modal perspective on path constraints. Zbl 1093.68032
Alechina, Natasha; Demri, Stéphane; de Rijke, Maarten
10
2003
A polynomial space construction of tree-like models for logics with local chains of modal connectives. Zbl 1028.68064
Demri, Stéphane
1
2003
The complexity of propositional linear temporal logics in simple cases. Zbl 1009.68072
Demri, Stéphane; Schnoebelen, Philippe
24
2002
Incomplete information: Structure, inference, complexity. Zbl 1016.68163
Demri, Stéphane P.; Orłowska, Ewa S.
22
2002
An automata-theoretic approach to constraint LTL. Zbl 1027.03027
Demri, Stéphane; D’Souza, Deepak
5
2002
A parametric analysis of the state explosion problem in model checking. Zbl 1054.68557
Demri, S.; Laroussinie, F.; Schnoebelen, P.
3
2002
Display calculi for nomial tense logics. Zbl 1016.03018
Demri, Stéphane; Goré, Rajeev
3
2002
Theoremhood-preserving maps characterizing cut elimination for modal provability logics. Zbl 1006.03036
Demri, Stéphane; Goré, Rajeev
3
2002
Modal logics with weak forms of recursion: PSPACE specimens. Zbl 1031.03031
Demri, Stéphane
2
2002
Automata-theoretic decision procedures for information logics. Zbl 1025.03021
Demri, Stéphane; Sattler, Ulrike
1
2002
The complexity of regularity in grammar logics and related modal logics. Zbl 1002.03018
Demri, Stéphane
7
2001
Complexity of simple dependent bimodal logics. Zbl 0963.03076
Demri, Stéphane
2
2000
Computational complexity of multimodal logics based on rough sets. Zbl 0971.03023
Demri, Stéphane; Stepaniuk, Jarosław
2
2000
The nondeterministic information logic NIL is PSPACE-complete. Zbl 0953.03036
Demri, Stéphane
2
2000
A simple modal encoding of propositional finite many-valued logics. Zbl 0992.03031
Demri, Stéphane
1
2000
On modal logics characterized by models with relative accessibility relations. II. Zbl 0981.03031
Demri, Stéphane; Gabbay, Dov
1
2000
An \({\mathcal O}((n\log n)^3)\)-time transformation from Grz into decidable fragments of classical first-order logic. Zbl 0956.03026
Demri, Stéphane; Goré, Rajeev
1
2000
Display calculi for logics with relative accessibility relations. Zbl 0988.03030
Demri, Stéphane; Goré, Rajeev
1
2000
A logic with relative knowledge operators. Zbl 0928.68107
Demri, Stéphane
2
1999
Cut-free display calculi for nominal tense logics. Zbl 0931.03032
Demri, Stéphane; Goré, Rajeev
1
1999
Sequent calculi for nominal tense logics: A step towards mechanization? Zbl 0931.03031
Demri, Stéphane
1
1999
Informational representability of models for information logics. Zbl 0923.03039
Demri, Stéphane; Orłowska, Ewa
1
1999
The complexity of propositional linear temporal logics in simple cases. (Extended abstract). Zbl 0919.03012
Demri, S.; Schnoebelen, Ph.
4
1998
A class of decidable information logics. Zbl 0902.68062
Demri, Stéphane
1
1998
A completeness proof for a logic with an alternative necessity operator. Zbl 0864.03012
Demri, Stéphane
5
1997
The validity problem for the logic DALLA is decidable. Zbl 0847.03012
Demri, Stéphane
3
1996
Logical analysis of demonic nondeterministic programs. Zbl 0872.03018
Demri, Stéphane; Orłowska, Ewa
2
1996
A simple tableau system for the logic of elsewhere. Zbl 1415.03021
Demri, Stéphane
1
1996
A class of information logics with a decidable validity problem. Zbl 0886.03014
Demri, Stéphane
1
1996
Uniform and non uniform strategies for tableaux calculi for modal logics. Zbl 0826.03006
Demri, Stéphane
4
1995
Towards reasoning about Hoare relations. Zbl 0858.68057
Demri, Stéphane; Orlowska, Ewa; Rewitzky, Ingrid
1
1994
all top 5

Cited by 371 Authors

25 Demri, Stéphane P.
7 Bersani, Marcello M.
7 Finkel, Alain
6 Bozzelli, Laura
6 Praveen, M.
6 Rossi, Matteo A. C.
6 Sangnier, Arnaud
6 Schmitz, Sylvain
5 Lazić, Ranko
5 Nguyen, Linh Anh
5 Pietro, Pierluigi San
5 Schnoebelen, Philippe
4 Balbiani, Philippe
4 Bollig, Benedikt
4 Hofman, Piotr
4 Khan, Md. Aquil
4 Laroussinie, François
4 Montanari, Angelo
4 Orłowska, Ewa S.
4 Szałas, Andrzej
3 Alechina, Natasha
3 Banerjee, Mohua
3 Brochenin, Rémi
3 Deters, Morgan
3 Figueira, Diego
3 Goranko, Valentin F.
3 Goré, Rajeev Prabhakar
3 Horrocks, Ian
3 Järvinen, Jouni
3 Kamide, Norihiro
3 Lange, Martin
3 Larchey-Wendling, Dominique
3 Leroux, Jérôme
3 Leucker, Martin
3 Lohrey, Markus
3 Lozes, Etienne
3 Lück, Martin
3 Lutz, Carsten
3 Meyer, Roland
3 Quaas, Karin
3 Ramanayake, Revantha
3 Saivasan, Prakash
3 Schnoebelen, Ph
3 Schröder, Lutz
3 Tan, Tony
3 Totzke, Patrick
3 Wu, Zhilin
2 Alur, Rajeev
2 Babari, Parvaneh
2 Boker, Udi
2 Boudou, Joseph
2 Bulling, Nils
2 Carapelle, Claudia
2 Chambart, Pierre
2 Chen, Taolue
2 Chini, Peter
2 Chistikov, Dmitry V.
2 Choffrut, Christian
2 Ciabattoni, Agata
2 Czerwiński, Wojciech
2 de Rijke, Maarten
2 Decker, Normann
2 Dhar, Amit Kumar
2 Droste, Manfred
2 Dubois, Didier
2 Dunin-Kȩplicz, Barbara
2 Galmiche, Didier
2 Gascon, Régis
2 Göller, Stefan
2 Grigorieff, Serge
2 Gutierrez, Julian
2 Habermehl, Peter
2 Harrenstein, Paul
2 Herzig, Andreas
2 Hou, Zhe
2 Iosif, Radu
2 Kartzow, Alexander
2 Klaedtke, Felix
2 Krebs, Andreas
2 Kuusisto, Antti
2 Lodaya, Kamal
2 Logan, Brian
2 Markey, Nicolas
2 Meier, Arne
2 Motik, Boris
2 Ouaknine, Joel O.
2 Pattinson, Dirk
2 Pazzaglia, Marco
2 Perevoshchikov, Vitaly
2 Pilipczuk, Michał
2 Pinchinat, Sophie
2 Rabinovich, Alexander
2 Radeleczki, Sándor
2 Radmacher, Frank G.
2 Roveri, Marco
2 Sala, Pietro
2 Sattler, Ulrike
2 Schallhart, Christian
2 Schindler, Irena
2 Schwentick, Thomas
...and 271 more Authors

Citations by Year