Jirí Adámek - RankMe

157 papers A* 3B 33C 2Journal 89Unranked 25

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	Varieties of Quantitative Algebras Presented by 1-Basic Monads. FoSSaCS Jirí Adámek
2025	B	`conf`	Terminal Coalgebras for Finitary Functors. CALCO Jirí Adámek, Stefan Milius, Lawrence S. Moss
2023	B	`conf`	On Kripke, Vietoris and Hausdorff Polynomial Functors ((Co)algebraic pearls). CALCO Jirí Adámek, Stefan Milius, Lawrence S. Moss
2023	J	`jnl`	On Kripke, Vietoris and Hausdorff Polynomial Functors. CoRR Jirí Adámek, Stefan Milius, Lawrence S. Moss
2023	B	`conf`	Strongly Finitary Monads for Varieties of Quantitative Algebras. CALCO Jirí Adámek, Matej Dostál, Jirí Velebil
2022	J	`jnl`	A categorical view of varieties of ordered algebras. Math. Struct. Comput. Sci. Jirí Adámek, Matej Dostál, Jirí Velebil
2022	A*	`conf`	Varieties of Quantitative Algebras and Their Monads. LICS Jirí Adámek
2021	J	`jnl`	Algebraic cocompleteness and finitary functors. Log. Methods Comput. Sci. Jirí Adámek
2021	J	`jnl`	An Initial Algebra Theorem Without Iteration. CoRR Jirí Adámek, Stefan Milius, Lawrence S. Moss
2021	J	`jnl`	Finitary monads on the category of posets. Math. Struct. Comput. Sci. Jirí Adámek, Chase Ford, Stefan Milius, Lutz Schröder
2021	B	`conf`	Initial Algebras Without Iteration ((Co)algebraic pearls). CALCO Jirí Adámek, Stefan Milius, Lawrence S. Moss
2021	J	`jnl`	On the behaviour of coalgebras with side effects and algebras with effectful iteration. J. Log. Comput. Jirí Adámek, Stefan Milius, Henning Urbat
2021	J	`jnl`	Reiterman's Theorem on Finite Algebras for a Monad. CoRR Jirí Adámek, Liang-Ting Chen, Stefan Milius, Henning Urbat
2021	J	`jnl`	Reiterman's Theorem on Finite Algebras for a Monad. ACM Trans. Comput. Log. Jirí Adámek, Liang-Ting Chen, Stefan Milius, Henning Urbat
2021	B	`conf`	Which Categories Are Varieties? ((Co)algebraic pearls). CALCO Jirí Adámek, Jirí Rosický
2020	—	`conf`	Approximate Coalgebra Homomorphisms and Approximate Solutions. CMCS Jirí Adámek
2020	B	`conf`	On Free Completely Iterative Algebras. CSL Jirí Adámek
2020	B	`conf`	On Well-Founded and Recursive Coalgebras. FoSSaCS Jirí Adámek, Stefan Milius, Lawrence S. Moss
2019	J	`jnl`	Generalized Eilenberg Theorem: Varieties of Languages in a Category. ACM Trans. Comput. Log. Jirí Adámek, Stefan Milius, Robert S. R. Myers, Henning Urbat
2019	B	`conf`	On Terminal Coalgebras Derived from Initial Algebras. CALCO Jirí Adámek
2019	J	`jnl`	On Well-Founded and Recursive Coalgebras. CoRR Jirí Adámek, Stefan Milius, Lawrence S. Moss
2019	J	`jnl`	On free completely iterative algebras. CoRR Jirí Adámek
2019	J	`jnl`	On free completely iterative algebras. CoRR Jirí Adámek
2019	J	`jnl`	On functors preserving coproducts and algebras with iterativity. Theor. Comput. Sci. Jirí Adámek, Stefan Milius
2019	J	`jnl`	On the Behaviour of Coalgebras with Side Effects and Algebras with Effectful Iteration. CoRR Stefan Milius, Jirí Adámek, Henning Urbat
2018	J	`jnl`	A Categorical Approach to Syntactic Monoids. CoRR Jirí Adámek, Stefan Milius, Henning Urbat
2018	J	`jnl`	A Categorical Approach to Syntactic Monoids. Log. Methods Comput. Sci. Jirí Adámek, Stefan Milius, Henning Urbat
2018	J	`jnl`	A Formula for Codensity Monads and Density Comonads. Appl. Categorical Struct. Jirí Adámek, Lurdes Sousa
2018	J	`jnl`	Fixed points of functors. J. Log. Algebraic Methods Program. Jirí Adámek, Stefan Milius, Lawrence S. Moss
2018	—	`conf`	On Algebras with Effectful Iteration. CMCS Stefan Milius, Jirí Adámek, Henning Urbat
2017	B	`conf`	Eilenberg Theorems for Free. MFCS Henning Urbat, Jirí Adámek, Liang-Ting Chen, Stefan Milius
2017	B	`conf`	On Corecursive Algebras for Functors Preserving Coproducts. CALCO Jirí Adámek, Stefan Milius
2017	J	`jnl`	On Corecursive Algebras for Functors Preserving Coproducts. CoRR Jirí Adámek, Stefan Milius
2016	—	`conf`	Fixed Points of Functors - A Short Abstract. CMCS Jirí Adámek
2016	J	`jnl`	Fixed Points of Set Functors: How Many Iterations are Needed? Appl. Categorical Struct. Jirí Adámek, Václav Koubek, Thorsten Palm
2016	J	`jnl`	One Eilenberg Theorem to Rule Them All. CoRR Henning Urbat, Jirí Adámek, Liang-Ting Chen, Stefan Milius
2016	B	`conf`	Profinite Monads, Profinite Equations, and Reiterman's Theorem. FoSSaCS Liang-Ting Chen, Jirí Adámek, Stefan Milius, Henning Urbat
2015	J	`jnl`	Coalgebraic constructions of canonical nondeterministic automata. Theor. Comput. Sci. Robert S. R. Myers, Jirí Adámek, Stefan Milius, Henning Urbat
2015	J	`jnl`	Generalized Eilenberg Theorem I: Local Varieties of Languages. CoRR Jirí Adámek, Stefan Milius, Robert S. R. Myers, Henning Urbat
2015	J	`jnl`	Kan injectivity in order-enriched categories. Math. Struct. Comput. Sci. Jirí Adámek, Lurdes Sousa, Jirí Velebil
2015	J	`jnl`	On Final Coalgebras of Power-Set Functors and Saturated Trees - To George Janelidze on the Occasion of His Sixtieth Birthday. Appl. Categorical Struct. Jirí Adámek, Paul Blain Levy, Stefan Milius, Lawrence S. Moss, Lurdes Sousa
2015	J	`jnl`	On finitary functors and their presentations. J. Comput. Syst. Sci. Jirí Adámek, Stefan Milius, Lawrence S. Moss, Henning Urbat
2015	J	`jnl`	Profinite Monads, Profinite Equations and Reiterman's Theorem. CoRR Liang-Ting Chen, Jirí Adámek, Stefan Milius, Henning Urbat
2015	B	`conf`	Syntactic Monoids in a Category. CALCO Jirí Adámek, Stefan Milius, Henning Urbat
2015	J	`jnl`	Syntactic Monoids in a Category. CoRR Jirí Adámek, Stefan Milius, Henning Urbat
2015	A*	`conf`	Varieties of Languages in a Category. LICS Jirí Adámek, Robert S. R. Myers, Henning Urbat, Stefan Milius
2015	J	`jnl`	Varieties of Languages in a Category. CoRR Jirí Adámek, Stefan Milius, Robert S. R. Myers, Henning Urbat
2014	J	`jnl`	Base modules for parametrized iterativity. Theor. Comput. Sci. Jirí Adámek, Stefan Milius, Jirí Velebil
2014	—	`conf`	Canonical Nondeterministic Automata. CMCS Robert S. R. Myers, Jirí Adámek, Stefan Milius, Henning Urbat
2014	J	`jnl`	Colimits of Monads. CoRR Jirí Adámek
2014	J	`jnl`	Coproducts of Monads on Set. CoRR Jirí Adámek, Nathan J. Bowler, Paul Blain Levy, Stefan Milius
2014	J	`jnl`	Corecursive Algebras, Corecursive Monads and Bloom Monads. Log. Methods Comput. Sci. Jirí Adámek, Mahdieh Haddadi, Stefan Milius
2014	B	`conf`	Generalized Eilenberg Theorem I: Local Varieties of Languages. FoSSaCS Jirí Adámek, Stefan Milius, Robert S. R. Myers, Henning Urbat
2014	B	`conf`	On Continuous Nondeterminism and State Minimality. MFPS Jirí Adámek, Robert S. R. Myers, Henning Urbat, Stefan Milius
2013	J	`jnl`	How iterative reflections of monads are constructed. Inf. Comput. Jirí Adámek, Stefan Milius, Jirí Velebil
2013	J	`jnl`	Kan injectivity in order-enriched categories. CoRR Jirí Adámek, Lurdes Sousa, Jirí Velebil
2013	J	`jnl`	Well-Pointed Coalgebras Log. Methods Comput. Sci. Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa
2012	B	`conf`	A Coalgebraic Perspective on Minimization and Determinization. FoSSaCS Jirí Adámek, Filippo Bonchi, Mathias Hülsbusch, Barbara König, Stefan Milius, Alexandra Silva
2012	A*	`conf`	Coproducts of Monads on Set. LICS Jirí Adámek, Stefan Milius, Nathan J. Bowler, Paul Blain Levy
2012	—	`conf`	On Finitary Functors and Their Presentations. CMCS Jirí Adámek, Stefan Milius, Lawrence S. Moss
2012	—	`conf`	Theoretische Informatik. 40 Jahre Informatik @ Braunschweig Jirí Adámek, Roland Vollmar, Dietmar Wätjen
2012	B	`conf`	Well-Pointed Coalgebras (Extended Abstract). FoSSaCS Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa
2011	J	`jnl`	Elgot theories: a new perspective on the equational properties of iteration. Math. Struct. Comput. Sci. Jirí Adámek, Stefan Milius, Jirí Velebil
2011	B	`conf`	From Corecursive Algebras to Corecursive Monads. CALCO Jirí Adámek, Mahdieh Haddadi, Stefan Milius
2011	J	`jnl`	Initial algebras and terminal coalgebras in many-sorted sets. Math. Struct. Comput. Sci. Jirí Adámek, Vera Trnková
2011	J	`jnl`	On second-order iterative monads. Theor. Comput. Sci. Jirí Adámek, Stefan Milius, Jirí Velebil
2011	B	`conf`	Power-Set Functors and Saturated Trees. CSL Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa
2011	J	`jnl`	Semantics of Higher-Order Recursion Schemes Log. Methods Comput. Sci. Jirí Adámek, Stefan Milius, Jirí Velebil
2010	J	`jnl`	Equational properties of iterative monads. Inf. Comput. Jirí Adámek, Stefan Milius, Jirí Velebil
2010	J	`jnl`	Iterative reflections of monads. Math. Struct. Comput. Sci. Jirí Adámek, Stefan Milius, Jirí Velebil
2010	J	`jnl`	Preface. Inf. Comput. Jirí Adámek, Clemens Kupke
2010	J	`jnl`	Presentation of Set Functors: A Coalgebraic Perspective. J. Log. Comput. Jirí Adámek, H. Peter Gumm, Vera Trnková
2010	—	`conf`	Recursive Program Schemes and Context-Free Monads. CMCS@ETAPS Jirí Adámek, Stefan Milius, Jirí Velebil
2009	B	`conf`	A Description of Iterative Reflections of Monads (Extended Abstract). FoSSaCS Jirí Adámek, Stefan Milius, Jirí Velebil
2009	—	`book`	Abstract and Concrete Categories - The Joy of Cats. Jirí Adámek, Horst Herrlich, George E. Strecker
2009	—	`conf`	Automated Construction of Reasonable Environment for Java Components. FESCA@ETAPS Pavel Parízek, Jirí Adámek, Tomas Kalibera
2009	B	`conf`	Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract). MFPS Jirí Adámek, Stefan Milius, Jirí Velebil
2009	B	`conf`	Semantics of Higher-Order Recursion Schemes. CALCO Jirí Adámek, Stefan Milius, Jirí Velebil
2009	J	`jnl`	The Orthogonal Subcategory Problem and the Small Object Argument. Appl. Categorical Struct. Jirí Adámek, Michel Hébert, Lurdes Sousa
2008	J	`jnl`	Bases for parametrized iterativity. Inf. Comput. Jirí Adámek, Stefan Milius, Jirí Velebil
2008	—	`conf`	Carmen: Software Component Model Checker. QoSA Ales Plsek, Jirí Adámek
2008	—	`conf`	Checking Session-Oriented Interactions between Web Services. EUROMICRO-SEAA Pavel Parízek, Jirí Adámek
2008	J	`jnl`	On Algebras with Iteration. J. Log. Comput. Jirí Adámek, Stephen L. Bloom, Stefan Milius
2008	—	`conf`	Perspectives in component-based software engineering. SEESE@ICSE Jirí Adámek, Petr Hnetynka
2008	—	`conf`	Preface. CMCS Jirí Adámek, Clemens Kupke
2008	—	`ed.`	Proceedings of the Ninth Workshop on Coalgebraic Methods in Computer Science, CMCS 2008, Budapest, Hungary, April 4-6, 2008 CMCS Jirí Adámek, Clemens Kupke
2007	J	`jnl`	Algebras with parametrized iterativity. Theor. Comput. Sci. Jirí Adámek, Stefan Milius, Jirí Velebil
2007	J	`jnl`	Recursive coalgebras of finitary functors. RAIRO Theor. Informatics Appl. Jirí Adámek, Dominik Lücke, Stefan Milius
2007	B	`conf`	What Are Iteration Theories? MFCS Jirí Adámek, Stefan Milius, Jirí Velebil
2006	C	`conf`	Addressing Unbounded Parallelism in Verification of Software Components. SNPD Jirí Adámek
2006	J	`jnl`	Elgot Algebras CoRR Jirí Adámek, Stefan Milius, Jirí Velebil
2006	J	`jnl`	Elgot Algebras. Log. Methods Comput. Sci. Jirí Adámek, Stefan Milius, Jirí Velebil
2006	—	`conf`	How Iterative are Iterative Algebras? CMCS Jirí Adámek, Stefan Milius, Jirí Velebil
2006	J	`jnl`	Iterative algebras at work. Math. Struct. Comput. Sci. Jirí Adámek, Stefan Milius, Jirí Velebil
2006	J	`jnl`	Special Issue: Seventh Workshop on Coalgebraic Methods in Computer Science 2004. Inf. Comput. Jirí Adámek, Stefan Milius
2006	J	`jnl`	Terminal coalgebras and free iterative theories. Inf. Comput. Jirí Adámek, Stefan Milius
2006	J	`jnl`	The intersection of algebra and coalgebra. Theor. Comput. Sci. Jirí Adámek
2005	B	`conf`	A Logic of Coequations. CSL Jirí Adámek
2005	J	`jnl`	A general final coalgebra theorem. Math. Struct. Comput. Sci. Jirí Adámek, Stefan Milius, Jirí Velebil
2005	B	`conf`	Algebra 'cap' Coalgebra = Presheaves. CALCO Jirí Adámek
2005	—	`conf`	Behavior Assembly and Composition of Use Cases - UML 2.0 Perspective. IASTED Conf. on Software Engineering Vladimir Mencl, Frantisek Plásil, Jirí Adámek
2005	J	`jnl`	Component composition errors and update atomicity: static analysis. J. Softw. Maintenance Res. Pract. Jirí Adámek, Frantisek Plásil
2005	B	`conf`	Elgot Algebras: (Extended Abstract). MFPS Jirí Adámek, Stefan Milius, Jirí Velebil
2004	—	`conf`	Erroneous architecture is a relative concept. IASTED Conf. on Software Engineering and Applications Jirí Adámek, Frantisek Plásil
2004	—	`conf`	From Iterative Algebras to Iterative Theories (Extended Abstract). CMCS Jirí Adámek, Stefan Milius, Jirí Velebil
2004	—	`conf`	Iterative Algebras for a Base. CTCS Jirí Adámek, Stefan Milius, Jirí Velebil
2004	J	`jnl`	On coalgebra based on classes. Theor. Comput. Sci. Jirí Adámek, Stefan Milius, Jirí Velebil
2004	J	`jnl`	On quasivarieties and varieties as categories. Stud Logica Jirí Adámek
2004	J	`jnl`	On tree coalgebras and coalgebra presentations. Theor. Comput. Sci. Jirí Adámek, Hans-E. Porst
2004	C	`conf`	Partial Bindings of Components - Any Harm?. APSEC Jirí Adámek, Frantisek Plásil
2004	—	`conf`	Preface. CMCS Jirí Adámek, Stefan Milius
2004	—	`ed.`	Proceedings of the Workshop on Coalgebraic Methods in Computer Science, CMCS 2004, Barcelona, Spain, March 27-29, 2004 CMCS Jirí Adámek, Stefan Milius
2003	J	`jnl`	Free Iterative Theories: A Coalgebraic View. Math. Struct. Comput. Sci. Jirí Adámek, Stefan Milius, Jirí Velebil
2003	J	`jnl`	Infinite trees and completely iterative theories: a coalgebraic view. Theor. Comput. Sci. Peter Aczel, Jirí Adámek, Stefan Milius, Jirí Velebil
2003	J	`jnl`	On Varieties and Covarieties in a Category. Math. Struct. Comput. Sci. Jirí Adámek, Hans-E. Porst
2003	—	`conf`	On a Description of Terminal Coalgebras and Iterative Theories. CMCS Jirí Adámek
2003	J	`jnl`	On coalgebra based on classes CoRR Jirí Adámek, Stefan Milius, Jirí Velebil
2003	J	`jnl`	On final coalgebras of continuous functors. Theor. Comput. Sci. Jirí Adámek
2003	J	`jnl`	Preface. Theor. Comput. Sci. Jirí Adámek, Martín Hötzel Escardó, Martin Hofmann
2003	J	`jnl`	Some Remarks on Finitary and Iterative Monads. Appl. Categorical Struct. Jirí Adámek, Stefan Milius, Jirí Velebil
2003	—	`conf`	Static analysis of component systems using behavior protocols. OOPSLA Companion Jirí Adámek
2002	—	`conf`	Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors. CMCS Jirí Adámek, Stefan Milius, Jirí Velebil
2002	J	`jnl`	Final Coalgebras are Ideal Completions of Initial Algebras. J. Log. Comput. Jirí Adámek
2002	—	`conf`	On Rational Monads and Free Iterative Theories. CTCS Jirí Adámek, Stefan Milius, Jirí Velebil
2002	J	`jnl`	On abstract data types presented by multiequations. Theor. Comput. Sci. Jirí Adámek, Michel Hébert, Jirí Rosický
2002	—	`conf`	Parametric corecursion and completely iterative monads. FICS Jirí Adámek, Stefan Milius, Jirí Velebil
2002	J	`jnl`	Weak Factorization Systems and Topological Functors. Appl. Categorical Struct. Jirí Adámek, Horst Herrlich, Jirí Rosický, Walter Tholen
2001	—	`conf`	A Coalgebraic View of Infinite Trees and Iteration. CMCS Peter Aczel, Jirí Adámek, Jirí Velebil
2001	J	`jnl`	Constructions of Solid Hulls. Appl. Categorical Struct. Jirí Adámek, Lurdes Sousa
2001	—	`conf`	From Varieties of Algebras to Covarieties of Coalgebras. CMCS Jirí Adámek, Hans-E. Porst
2000	J	`jnl`	Morita Equivalence of Sketches. Appl. Categorical Struct. Jirí Adámek, Francis Borceux
1997	J	`jnl`	A Categorical Generalization of Scott Domains. Math. Struct. Comput. Sci. Jirí Adámek
1997	J	`jnl`	Finitary Sketches. J. Symb. Log. Jirí Adámek, Peter T. Johnstone, Johann A. Makowsky, Jirí Rosický
1996	J	`jnl`	A remark on fixed points of functors in topological categories. Appl. Categorical Struct. Jirí Adámek
1996	J	`jnl`	On geometric and finitary sketches. Appl. Categorical Struct. Jirí Adámek, Jirí Rosický
1995	J	`jnl`	Continuous Algebras Revisited. J. Comput. Syst. Sci. Jirí Adámek, Evelyn Nelson, Jan Reiterman
1995	J	`jnl`	Finitary Sketches and Finitely Accessible Categories. Math. Struct. Comput. Sci. Jirí Adámek, Jirí Rosický
1995	J	`jnl`	On the Greatest Fixed Point of a Set Functor. Theor. Comput. Sci. Jirí Adámek, Václav Koubek
1995	J	`jnl`	Recursive Data Types in Algebraically omega-Complete Categories Inf. Comput. Jirí Adámek
1994	J	`jnl`	Banach's Fixed-Point Theorem as a base for data-type equations. Appl. Categorical Struct. Jirí Adámek, Jan Reiterman
1992	J	`jnl`	On orthogonal subcategories of locally presentable categories. Discret. Math. Jirí Adámek, Jirí Rosický
1991	—	`book`	Foundations of coding - theory and applications of error-correcting codes with an introduction to cryptography and information theory. Jirí Adámek
1988	J	`jnl`	On the logic of continuous algebras. Notre Dame J. Formal Log. Jirí Adámek, Alan H. Mekler, Evelyn Nelson, Jan Reiterman
1986	J	`jnl`	Continuous Semilattices. Theor. Comput. Sci. Jirí Adámek, Jan Reiterman, Evelyn Nelson
1985	B	`conf`	Cartesian Closed Categories, Quasitopoi and Topological Universes. Mathematical Foundations of Programming Semantics Jirí Adámek, Horst Herrlich
1983	J	`jnl`	Separately Continuous Algebras. Theor. Comput. Sci. Jirí Adámek, Evelyn Nelson
1983	—	`book`	Theory of Mathematical Structures. Jirí Adámek
1982	J	`jnl`	Tree Constructions of Free Continuous Algebras. J. Comput. Syst. Sci. Jirí Adámek, Evelyn Nelson, Jan Reiterman
1981	B	`conf`	Observability and Nerode Equivalence in Concrete C5ategories. FCT Jirí Adámek
1980	J	`jnl`	On an equivalence of system-theoretical and categorical concepts. Kybernetika Jirí Adámek, Hartmut Ehrig, Vera Trnková
1979	J	`jnl`	Least Fixed Point of a Functor. J. Comput. Syst. Sci. Jirí Adámek, Václav Koubek
1979	B	`conf`	Tree-group automata. FCT Vera Trnková, Jirí Adámek
1977	J	`jnl`	Functorial algebras and automata. Kybernetika Jirí Adámek, Václav Koubek
1977	B	`conf`	On Languages, Accepted by Machines in the Category of Sets. MFCS Vera Trnková, Jirí Adámek
1977	B	`conf`	Recognizable and Regular Languages in a Category. FCT Jirí Adámek, Vera Trnková
1977	B	`conf`	Remarks on Fixed Points of Functors. FCT Jirí Adámek, Václav Koubek
1975	B	`conf`	Automata and Categories: Finiteness Contra Minimality. MFCS Jirí Adámek