Pascal Weil - RankMe

86 papers A* 3A 6B 9C 1Misc 1Journal 56Unranked 8

Year	Rank	Type	Title / Venue / Authors
2024	A*	`conf`	An expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications. LICS Bharat Adsul, Paul Gastin, Shantanu Kulkarni, Pascal Weil
2024	J	`jnl`	Propositional dynamic logic and asynchronous cascade decompositions for regular trace languages. CoRR Bharat Adsul, Paul Gastin, Shantanu Kulkarni, Pascal Weil
2024	J	`jnl`	Random Generation of Subgroups of the Modular Group with a Fixed Isomorphism Type. Electron. J. Comb. Frédérique Bassino, Cyril Nicaud, Pascal Weil
2023	J	`jnl`	The central tree property and algorithmic problems on subgroups of free groups. CoRR Mallika Roy, Enric Ventura, Pascal Weil
2022	J	`jnl`	Asynchronous wreath product and cascade decompositions for concurrent behaviours. Log. Methods Comput. Sci. Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil
2022	B	`conf`	Propositional Dynamic Logic and Asynchronous Cascade Decompositions for Regular Trace Languages. CONCUR Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil
2021	J	`jnl`	Asynchronous wreath product and cascade decompositions for concurrent behaviours. CoRR Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil
2021	J	`jnl`	Statistics of subgroups of the modular group. Int. J. Algebra Comput. Frédérique Bassino, Cyril Nicaud, Pascal Weil
2021	—	`ch.`	Varieties. Handbook of Automata Theory (I.) Howard Straubing, Pascal Weil
2020	—	`conf`	On the Generalized Membership Problem in Relatively Hyperbolic Groups. Fields of Logic and Computation III Olga Kharlampovich, Pascal Weil
2020	B	`conf`	Wreath/Cascade Products and Related Decomposition Results for the Concurrent Setting of Mazurkiewicz Traces. CONCUR Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil
2020	J	`jnl`	Wreath/cascade products and related decomposition results for the concurrent setting of Mazurkiewicz traces (extended version). CoRR Bharat Adsul, Paul Gastin, Saptarshi Sarkar, Pascal Weil
2019	J	`jnl`	Covering and separation for logical fragments with modular predicates. Log. Methods Comput. Sci. Thomas Place, Varun Ramanathan, Pascal Weil
2019	J	`jnl`	Foreword. Theory Comput. Syst. Pascal Weil
2019	B	`conf`	The Quantifier Alternation Hierarchy of Synchronous Relations. MFCS Diego Figueira, Varun Ramanathan, Pascal Weil
2018	J	`jnl`	Covering and separation for logical fragments with modular predicates. CoRR Thomas Place, Varun Ramanathan, Pascal Weil
2017	Misc	`ed.`	Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings CSR Pascal Weil
2016	—	`conf`	Generic properties of subgroups of free groups and finite presentations. AMS-EMS-SPM Joint Meeting Frédérique Bassino, Cyril Nicaud, Pascal Weil
2015	J	`jnl`	Generic properties of subgroups of free groups and finite presentations. CoRR Frédérique Bassino, Cyril Nicaud, Pascal Weil
2015	J	`jnl`	Varieties. CoRR Howard Straubing, Pascal Weil
2014	C	`conf`	From Algebra to Logic: There and Back Again The Story of a Hierarchy - (Invited Paper). Developments in Language Theory Pascal Weil
2014	J	`jnl`	From algebra to logic: there and back again - the story of a hierarchy. CoRR Pascal Weil
2013	J	`jnl`	Branching Processes of General Petri Nets. Fundam. Informaticae Jean-Michel Couvreur, Denis Poitrenaud, Pascal Weil
2013	J	`jnl`	On the genericity of Whitehead minimality. CoRR Frédérique Bassino, Cyril Nicaud, Pascal Weil
2013	J	`jnl`	Statistical properties of subgroups of free groups. Random Struct. Algorithms Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil
2012	—	`ch.`	An Introduction to Finite Automata and their Connection to Logic. Modern Applications of Automata Theory Howard Straubing, Pascal Weil
2012	J	`jnl`	On logical hierarchies within FO Log. Methods Comput. Sci. Manfred Kufleitner, Pascal Weil
2012	J	`jnl`	Star-free languages are Church-Rosser congruential. Theor. Comput. Sci. Volker Diekert, Manfred Kufleitner, Pascal Weil
2012	B	`conf`	The FO2 alternation hierarchy is decidable. CSL Manfred Kufleitner, Pascal Weil
2012	J	`jnl`	The FO^2 alternation hierarchy is decidable CoRR Manfred Kufleitner, Pascal Weil
2011	B	`conf`	Branching Processes of General Petri Nets. Petri Nets Jean-Michel Couvreur, Denis Poitrenaud, Pascal Weil
2011	J	`jnl`	Star-Free Languages are Church-Rosser Congruential CoRR Volker Diekert, Manfred Kufleitner, Pascal Weil
2010	J	`jnl`	Algebraic Characterization of Logically Defined Tree Languages. Int. J. Algebra Comput. Zoltán Ésik, Pascal Weil
2010	J	`jnl`	An introduction to finite automata and their connection to logic CoRR Howard Straubing, Pascal Weil
2010	J	`jnl`	Automorphic orbits in Free Groups: Words versus Subgroups. Int. J. Algebra Comput. Pedro V. Silva, Pascal Weil
2010	—	`conf`	On Two Distributions of Subgroups of Free Groups. ANALCO Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil
2010	J	`jnl`	Preface of STACS 2007 Special Issue. Theory Comput. Syst. Wolfgang Thomas, Pascal Weil
2010	J	`jnl`	STACS 2008 Foreword. Theory Comput. Syst. Susanne Albers, Pascal Weil
2010	J	`jnl`	Statistical properties of subgroups of free groups CoRR Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil
2009	B	`conf`	On FO2 Quantifier Alternation over Words. MFCS Manfred Kufleitner, Pascal Weil
2009	J	`jnl`	On FO2 quantifier alternation over words CoRR Manfred Kufleitner, Pascal Weil
2008	A	`conf`	Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science. STACS Susanne Albers, Pascal Weil
2008	J	`jnl`	On an algorithm to decide whether a free group is a free factor of another. RAIRO Theor. Informatics Appl. Pedro V. Silva, Pascal Weil
2008	A	`conf`	Preface - 25th International Symposium on Theoretical Aspects of Computer Science. STACS Susanne Albers, Pascal Weil
2008	A	`ed.`	Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2008, Bordeaux, France, February 21-23, 2008 STACS Susanne Albers, Pascal Weil
2008	J	`jnl`	Random Generation of Finitely Generated Subgroups of a Free Group. Int. J. Algebra Comput. Frédérique Bassino, Cyril Nicaud, Pascal Weil
2007	J	`jnl`	Algebraic characterization of logically defined tree languages CoRR Zoltán Ésik, Pascal Weil
2007	J	`jnl`	On the Complexity of the Whitehead Minimization Problem. Int. J. Algebra Comput. Abdó Roig, Enric Ventura, Pascal Weil
2007	A	`ed.`	STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings STACS Wolfgang Thomas, Pascal Weil
2006	J	`jnl`	Algebraic recognizability of languages CoRR Pascal Weil
2006	J	`jnl`	Algebraic recognizability of regular tree languages CoRR Zoltán Ésik, Pascal Weil
2006	J	`jnl`	On the logical definability of certain graph and poset languages CoRR Pascal Weil
2006	J	`jnl`	The recognizability of sets of graphs is a robust property CoRR Bruno Courcelle, Pascal Weil
2005	J	`jnl`	Algebraic recognizability of regular tree languages. Theor. Comput. Sci. Zoltán Ésik, Pascal Weil
2005	J	`jnl`	The recognizability of sets of graphs is a robust property. Theor. Comput. Sci. Bruno Courcelle, Pascal Weil
2004	B	`conf`	Algebraic Recognizability of Languages. MFCS Pascal Weil
2004	J	`jnl`	On the Logical Definability of Certain Graph and Poset Languages. J. Autom. Lang. Comb. Pascal Weil
2003	—	`conf`	On Logically Defined Recognizable Tree Languages. FSTTCS Zoltán Ésik, Pascal Weil
2002	J	`jnl`	Profinite Methods in Semigroup Theory. Int. J. Algebra Comput. Pascal Weil
2002	B	`conf`	Workshop on Logic, Graph Transformations and Discrete Structures. ICGT Bruno Courcelle, Pascal Weil
2001	J	`jnl`	A conjecture on the concatenation product. RAIRO Theor. Informatics Appl. Jean-Eric Pin, Pascal Weil
2001	J	`jnl`	Closed Subgroups in Pro-V Topologies and the Extension Problem for Inverse Automata. Int. J. Algebra Comput. Stuart W. Margolis, Mark V. Sapir, Pascal Weil
2001	J	`jnl`	Graphs, intersections of subgroups of free groups and corank. Electron. Notes Discret. Math. Pascal Weil
2001	J	`jnl`	Rationality in Algebras with a Series Operation. Inf. Comput. Kamal Lodaya, Pascal Weil
2000	J	`jnl`	PSPACE-complete problems for subgroups of free groups and inverse finite automata. Theor. Comput. Sci. Jean-Camille Birget, Stuart W. Margolis, John C. Meakin, Pascal Weil
2000	J	`jnl`	Series-parallel languages and the bounded-width property. Theor. Comput. Sci. Kamal Lodaya, Pascal Weil
1999	J	`jnl`	Uniformities on Free Semigroups. Int. J. Algebra Comput. Jean-Eric Pin, Pascal Weil
1998	—	`conf`	A Kleene Iteration for Parallelism. FSTTCS Kamal Lodaya, Pascal Weil
1998	J	`jnl`	An Extension of the Wreath Product Principle for Finite Mazurkiewicz Traces. Inf. Process. Lett. Giovanna Guaiana, Raphaël Meyer, Antoine Petit, Pascal Weil
1998	A	`conf`	Series-Parallel Posets: Algebra, Automata and Languages. STACS Kamal Lodaya, Pascal Weil
1997	J	`jnl`	Free Profinite ℛ-Trivial Monoids. Int. J. Algebra Comput. Jorge Almeida, Pascal Weil
1997	J	`jnl`	Ponynominal Closure and Unambiguous Product. Theory Comput. Syst. Jean-Eric Pin, Pascal Weil
1996	—	`conf`	On the Indecomposibility of Certain Language Classes. ISTCS Stuart W. Margolis, Mark V. Sapir, Pascal Weil
1995	J	`jnl`	Algebraic and Topological Theory of Languages. RAIRO Theor. Informatics Appl. John Rhodes, Pascal Weil
1995	A*	`conf`	Polynomial Closure and Unambiguous Product. ICALP Jean-Eric Pin, Pascal Weil
1994	A*	`conf`	PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups. ICALP Jean-Camille Birget, Stuart W. Margolis, John C. Meakin, Pascal Weil
1994	J	`jnl`	Reduced Factorizations in Free Profinite Groups and Join Decompositions of Pseudovarieties. Int. J. Algebra Comput. Jorge Almeida, Pascal Weil
1992	J	`jnl`	Closure of Varieties of Languages under Products with Counter. J. Comput. Syst. Sci. Pascal Weil
1992	J	`jnl`	On a Conjecture Concerning Dot-Depth Two Languages. Theor. Comput. Sci. Howard Straubing, Pascal Weil
1991	—	`conf`	A Purely Algebraic Proof of McNaughton's Theorem on Infinite Words. FSTTCS Bertrand Le Saëc, Jean-Eric Pin, Pascal Weil
1991	J	`jnl`	Semigroups with Idempotent stabilizers and Applications to Automata Theory. Int. J. Algebra Comput. Bertrand Le Saëc, Jean-Eric Pin, Pascal Weil
1990	J	`jnl`	Products of Languages with Counter. Theor. Comput. Sci. Pascal Weil
1989	J	`jnl`	Inverse Monoids of Dot-Depth Two. Theor. Comput. Sci. Pascal Weil
1989	B	`conf`	On Varieties of Languages Closed Under Products with Counter. MFCS Pascal Weil
1988	—	`conf`	Concatenation product: a survey. Formal Properties of Finite Automata and Applications Pascal Weil
1985	A	`conf`	Groups, Codes and Unambiguous Automata. STACS Pascal Weil