Jiřı́ Velebil

673 total citations
43 papers, 326 citations indexed

About

Jiřı́ Velebil is a scholar working on Artificial Intelligence, Mathematical Physics and Computational Theory and Mathematics. According to data from OpenAlex, Jiřı́ Velebil has authored 43 papers receiving a total of 326 indexed citations (citations by other indexed papers that have themselves been cited), including 37 papers in Artificial Intelligence, 28 papers in Mathematical Physics and 16 papers in Computational Theory and Mathematics. Recurrent topics in Jiřı́ Velebil's work include Logic, programming, and type systems (37 papers), Homotopy and Cohomology in Algebraic Topology (28 papers) and Logic, Reasoning, and Knowledge (25 papers). Jiřı́ Velebil is often cited by papers focused on Logic, programming, and type systems (37 papers), Homotopy and Cohomology in Algebraic Topology (28 papers) and Logic, Reasoning, and Knowledge (25 papers). Jiřı́ Velebil collaborates with scholars based in Czechia, Germany and United Kingdom. Jiřı́ Velebil's co-authors include Jiřı́ Adámek, Stefan Milius, Alexander Kurz, Peter Aczel, Robert El Bashir, Jir̆ı́ Rosický, Věra Trnková and Yde Venema and has published in prestigious journals such as Theoretical Computer Science, Information and Computation and Journal of Pure and Applied Algebra.

In The Last Decade

Jiřı́ Velebil

41 papers receiving 303 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Jiřı́ Velebil Czechia	10	283	171	137	54	39	43	326
Claudio Hermida Canada	10	217 0.8×	163 1.0×	179 1.3×	129 2.4×	95 2.4×	21	365
Nicola Gambino United Kingdom	10	135 0.5×	91 0.5×	167 1.2×	135 2.5×	80 2.1×	26	267
Maria Emilia Maietti Italy	10	204 0.7×	141 0.8×	76 0.6×	53 1.0×	36 0.9×	28	254
Péter P. Pálfy Hungary	11	273 1.0×	134 0.8×	50 0.4×	111 2.1×	56 1.4×	32	474
Masahito Hasegawa Japan	9	219 0.8×	122 0.7×	45 0.3×	29 0.5×	12 0.3×	23	240
Jean Bénabou France	5	83 0.3×	69 0.4×	120 0.9×	98 1.8×	59 1.5×	7	206
Marek Zawadowski Poland	6	102 0.4×	86 0.5×	36 0.3×	32 0.6×	20 0.5×	18	144
Isar Stubbe France	7	60 0.2×	112 0.7×	50 0.4×	37 0.7×	30 0.8×	19	153
Sarah Rees United Kingdom	10	143 0.5×	143 0.8×	78 0.6×	200 3.7×	33 0.8×	52	357
László Pyber Hungary	13	125 0.4×	91 0.5×	87 0.6×	169 3.1×	48 1.2×	28	368

Countries citing papers authored by Jiřı́ Velebil

Since Specialization

Citations

This map shows the geographic impact of Jiřı́ Velebil'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 Jiřı́ Velebil with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jiřı́ Velebil more than expected).

Fields of papers citing papers by Jiřı́ Velebil

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jiřı́ Velebil. 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 Jiřı́ Velebil. The network helps show where Jiřı́ Velebil may publish in the future.

Co-authorship network of co-authors of Jiřı́ Velebil

This figure shows the co-authorship network connecting the top 25 collaborators of Jiřı́ Velebil. A scholar is included among the top collaborators of Jiřı́ Velebil 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 Jiřı́ Velebil. Jiřı́ Velebil 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

Kurz, Alexander, et al.. (2019). Extending set functors to generalised metric spaces. Logical Methods in Computer Science. Volume 15, Issue 1. 1 indexed citations

Kurz, Alexander, et al.. (2015). Positive fragments of coalgebraic logics. Logical Methods in Computer Science. Volume 11, Issue 3. 7 indexed citations

Kurz, Alexander & Jiřı́ Velebil. (2015). Relation lifting, a survey. Journal of Logical and Algebraic Methods in Programming. 85(4). 475–499. 10 indexed citations

Kurz, Alexander, et al.. (2013). Relation lifting, with an application to the many-valued cover modality. Logical Methods in Computer Science. Volume 9, Issue 4. 5 indexed citations

Adámek, Jiřı́, Stefan Milius, & Jiřı́ Velebil. (2013). Base modules for parametrized iterativity. Theoretical Computer Science. 523. 56–85.

Velebil, Jiřı́, et al.. (2012). Distributive Substructural Logics as Coalgebraic Logics over Posets.. ASEP. 119–142. 3 indexed citations

Kurz, Alexander, et al.. (2012). Expressiveness of Positive Coalgebraic Logic. 368–385. 7 indexed citations

Adámek, Jiřı́, Stefan Milius, & Jiřı́ Velebil. (2011). Semantics of Higher-Order Recursion Schemes. Logical Methods in Computer Science. Volume 7, Issue 1. 4 indexed citations

Adámek, Jiřı́, Stefan Milius, & Jiřı́ Velebil. (2011). On second-order iterative monads. Theoretical Computer Science. 412(38). 4969–4988. 2 indexed citations

10.

Velebil, Jiřı́, et al.. (2011). On monotone modalities and adjointness. Mathematical Structures in Computer Science. 21(2). 383–416. 1 indexed citations

11.

Velebil, Jiřı́ & Alexander Kurz. (2011). Equational presentations of functors and monads. Mathematical Structures in Computer Science. 21(2). 363–381. 10 indexed citations

12.

Kurz, Alexander & Jiřı́ Velebil. (2011). Enriched Logical Connections. Applied Categorical Structures. 21(4). 349–377. 7 indexed citations

13.

Velebil, Jiřı́, et al.. (2009). REPRESENTABILITY RELATIVE TO A DOCTRINE. French digital mathematics library (Numdam). 50(1). 3–22. 2 indexed citations

14.

Adámek, Jiřı́, Stefan Milius, & Jiřı́ Velebil. (2008). Bases for parametrized iterativity. Information and Computation. 206(8). 966–1002. 2 indexed citations

15.

Adámek, Jiřı́, Stefan Milius, & Jiřı́ Velebil. (2006). How Iterative are Iterative Algebras?. Electronic Notes in Theoretical Computer Science. 164(1). 157–175. 1 indexed citations

16.

Adámek, Jiřı́, Stefan Milius, & Jiřı́ Velebil. (2005). Iterative Algebras for a Base. Electronic Notes in Theoretical Computer Science. 122. 147–170. 2 indexed citations

17.

Adámek, Jiřı́, Stefan Milius, & Jiřı́ Velebil. (2004). On coalgebra based on classes. Theoretical Computer Science. 316(1-3). 3–23. 12 indexed citations

18.

Aczel, Peter, Jiřı́ Adámek, Stefan Milius, & Jiřı́ Velebil. (2003). Infinite trees and completely iterative theories: a coalgebraic view. Theoretical Computer Science. 300(1-3). 1–45. 69 indexed citations

19.

Adámek, Jiřı́, Stefan Milius, & Jiřı́ Velebil. (2003). On Rational Monads and Free Iterative Theories. Electronic Notes in Theoretical Computer Science. 69. 23–46. 12 indexed citations

20.

Trnková, Věra & Jiřı́ Velebil. (1999). On categories generalizing universal domains. Mathematical Structures in Computer Science. 9(2). 159–175. 2 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