Pascal Weil

1.8k total citations
55 papers, 646 citations indexed

About

Pascal Weil is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, Pascal Weil has authored 55 papers receiving a total of 646 indexed citations (citations by other indexed papers that have themselves been cited), including 53 papers in Computational Theory and Mathematics, 24 papers in Artificial Intelligence and 21 papers in Geometry and Topology. Recurrent topics in Pascal Weil's work include semigroups and automata theory (48 papers), Advanced Algebra and Logic (28 papers) and Geometric and Algebraic Topology (19 papers). Pascal Weil is often cited by papers focused on semigroups and automata theory (48 papers), Advanced Algebra and Logic (28 papers) and Geometric and Algebraic Topology (19 papers). Pascal Weil collaborates with scholars based in France, United States and Portugal. Pascal Weil's co-authors include Jean-Éric Pin, Jorge Almeida, Kamal Lodaya, Samuel Margolis, John Rhodes, Mark Sapir, John Meakin, Howard Straubing, Peter Trotter and Pedro V. Silva and has published in prestigious journals such as Theoretical Computer Science, Journal of Computer and System Sciences and Journal of Algebra.

In The Last Decade

Pascal Weil

54 papers receiving 594 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Pascal Weil France	16	607	338	166	86	49	55	646
Jean-Éric Pin France	18	968 1.6×	579 1.7×	215 1.3×	166 1.9×	59 1.2×	73	1.0k
Jacques Sakarovitch France	12	473 0.8×	334 1.0×	77 0.5×	110 1.3×	54 1.1×	45	528
Denis Thérien Canada	18	879 1.4×	653 1.9×	63 0.4×	88 1.0×	13 0.3×	64	934
Stuart Margolis United States	13	451 0.7×	128 0.4×	289 1.7×	58 0.7×	80 1.6×	44	508
Mikhail V. Volkov Russia	15	607 1.0×	193 0.6×	131 0.8×	176 2.0×	36 0.7×	80	633
Jorge Almeida Portugal	18	1.1k 1.8×	455 1.3×	333 2.0×	157 1.8×	96 2.0×	98	1.2k
Dietrich Kuske Germany	10	241 0.4×	135 0.4×	71 0.4×	30 0.3×	18 0.4×	59	275
Stefano Varricchio Italy	10	334 0.6×	259 0.8×	35 0.2×	73 0.8×	19 0.4×	46	387
John Meakin United States	14	501 0.8×	105 0.3×	291 1.8×	52 0.6×	91 1.9×	61	548
Victor Selivanov Russia	11	397 0.7×	128 0.4×	176 1.1×	12 0.1×	41 0.8×	79	441

Countries citing papers authored by Pascal Weil

Since Specialization

Citations

This map shows the geographic impact of Pascal Weil's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Pascal Weil with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pascal Weil more than expected).

Fields of papers citing papers by Pascal Weil

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Pascal Weil. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Pascal Weil. The network helps show where Pascal Weil may publish in the future.

Co-authorship network of co-authors of Pascal Weil

This figure shows the co-authorship network connecting the top 25 collaborators of Pascal Weil. A scholar is included among the top collaborators of Pascal Weil based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Pascal Weil. Pascal Weil is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Ventura, Enric, et al.. (2024). The central tree property and algorithmic problems on subgroups of free groups. Journal of Group Theory. 1 indexed citations

Bassino, Frédérique, Ilya Kapovich, Markus Lohrey, et al.. (2020). Complexity and Randomness in Group Theory. HAL (Le Centre pour la Communication Scientifique Directe). 6 indexed citations

Diekert, Volker, Manfred Kufleitner, & Pascal Weil. (2012). Star-free languages are Church–Rosser congruential. Theoretical Computer Science. 454. 129–135. 4 indexed citations

Bassino, Frédérique, Cyril Nicaud, & Pascal Weil. (2012). Generic properties of random subgroups of a free group for general distributions. Discrete Mathematics & Theoretical Computer Science. DMTCS Proceedings vol. AQ,...(Proceedings). 1 indexed citations

Weil, Pascal, et al.. (2007). STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007 : proceedings. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 1 indexed citations

Courcelle, Bruno & Pascal Weil. (2005). The recognizability of sets of graphs is a robust property. Theoretical Computer Science. 342(2-3). 173–228. 11 indexed citations

Weil, Pascal. (2004). On the logical definability of centrain graph and poset languages. Journal of automata, languages and combinatorics. 9(1). 147–147. 1 indexed citations

Couvreur, Jean‐Michel, Denis Poitrenaud, & Pascal Weil. (2004). Unfoldings for general Petri Nets. 2 indexed citations

Fountain, John, Jean-Éric Pin, & Pascal Weil. (2003). Covers for monoids. Journal of Algebra. 271(2). 529–586. 3 indexed citations

10.

Lodaya, Kamal & Pascal Weil. (2001). Rationality in Algebras with a Series Operation. Information and Computation. 171(2). 269–293. 17 indexed citations

11.

Birget, Jean-Camille, Samuel Margolis, John Meakin, & Pascal Weil. (2000). PSPACE-complete problems for subgroups of free groups and inverse finite automata. Theoretical Computer Science. 242(1-2). 247–281. 16 indexed citations

12.

Almeida, Jorge & Pascal Weil. (1998). Profinite categories and semidirect products. Journal of Pure and Applied Algebra. 123(1-3). 1–50. 34 indexed citations

13.

Pin, Jean-Éric & Pascal Weil. (1997). Polynomial Closure and Unambiguous Product. Theory of Computing Systems. 30(4). 383–422. 6 indexed citations

14.

Weil, Pascal, et al.. (1996). Profinite Semigroups, Mal'cev Products, and Identities. Journal of Algebra. 182(3). 604–626. 33 indexed citations

15.

Pin, Jean-Éric & Pascal Weil. (1996). A Reiterman theorem for pseudovarieties of finite first-order structures. Algebra Universalis. 35(4). 577–595. 23 indexed citations

16.

Weil, Pascal. (1992). Closure of varieties of languages under products with counter. Journal of Computer and System Sciences. 45(3). 316–339. 28 indexed citations

17.

Straubing, Howard & Pascal Weil. (1992). On a conjecture concerning dot-depth two languages. Theoretical Computer Science. 104(2). 161–183. 14 indexed citations

18.

Rhodes, John & Pascal Weil. (1989). Decomposition techniques for finite semigroups, using categories I. Journal of Pure and Applied Algebra. 62(3). 269–284. 20 indexed citations

19.

Weil, Pascal. (1988). Inverse monoids and the dot -depth hierarchy. Insecta mundi. 7 indexed citations

20.

Weil, Pascal. (1986). Groups in the syntactic monoid of a composed code. Journal of Pure and Applied Algebra. 42(3). 297–319. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact