Stefan Milius

Cited by

	All	Since 2016
Citations	1600	733
h-index	21	16
i10-index	43	24

180

135

200320042005200620072008200920102011201220132014201520162017201820192020202129 20 46 73 34 50 43 70 65 38 105 125 147 129 155 167 132 146 3

Co-authors

Lawrence S. MossProfessor of Mathematics, Indiana University, Bloomington. Also, Adjunct Professor: ComputerVerified email at indiana.edu
Lutz SchröderProfessor of Computer Science, Friedrich-Alexander-Universität Erlangen-NürnbergVerified email at cs.fau.de
Alexandra SilvaProfessor at University College LondonVerified email at ucl.ac.uk
Dirk PattinsonAustralian National UniversityVerified email at anu.edu.au
Filippo BonchiCNRS ENS-LyonVerified email at ens-lyon.fr
Marcello BonsangueProfessor of Computer Science, Leiden UniversityVerified email at liacs.leidenuniv.nl
Barbara KönigUniversität Duisburg-Essen, Theoretische InformatikVerified email at uni-due.de
Sergey GoncharovAkademischer Oberrat, Friedrich-Alexander-Universität Erlangen-NürnbergVerified email at fau.de
Michaela HuhnOstfalia, University of Applied Science, Computer Science FacultyVerified email at ostfalia.de
Paul Blain LevySenior Lecturer, University of BirminghamVerified email at cs.bham.ac.uk
Fabio ZanasiAssociate Professor at University College LondonVerified email at ucl.ac.uk
Jurriaan RotUniversity College London & Radboud UniversityVerified email at cs.ru.nl
Alexander KurzChapman UniversityVerified email at chapman.edu
Reiko HeckelProfessor of Software Engineering, Dept. of Computer Science, University of LeicesterVerified email at mcs.le.ac.uk
Martin SulzmannProfessor of Computer Science, Karlsruhe University of Applied SciencesVerified email at hs-karlsruhe.de

Stefan Milius

FAU Erlangen-Nürnberg

Verified email at stefan-milius.eu


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Infinite trees and completely iterative theories: a coalgebraic view P Aczel, J Adámek, S Milius, J Velebil Theoretical Computer Science 300 (1-3), 1-45, 2003	126	2003
Completely iterative algebras and completely iterative monads S Milius Information and Computation 196 (1), 1-41, 2005	92	2005
Iterative algebras at work J Adámek, S Milius, J Velebil Mathematical Structures in Computer Science 16 (6), 1085, 2006	83	2006
A sound and complete calculus for finite stream circuits S Milius 2010 25th Annual IEEE Symposium on Logic in Computer Science, 421-430, 2010	65	2010
Elgot algebras J Adámek, S Milius, J Velebil Electronic Notes in Theoretical Computer Science 155, 87-109, 2006	63	2006
A coalgebraic perspective on minimization and determinization J Adámek, F Bonchi, M Hülsbusch, B König, S Milius, A Silva International Conference on Foundations of Software Science and …, 2012	58	2012
Sound and complete axiomatizations of coalgebraic language equivalence MM Bonsangue, S Milius, A Silva ACM Transactions on Computational Logic (TOCL) 14 (1), 1-52, 2013	55	2013
Free iterative theories: a coalgebraic view JIRÍ ADÁMEK, S Milius, JIRÍ VELEBIL Mathematical Structures in Computer Science 13 (2), 259, 2003	53	2003
On coalgebra based on classes J Adámek, S Milius, J Velebil Theoretical Computer Science 316 (1-3), 3-23, 2004	41	2004
The category-theoretic solution of recursive program schemes S Milius, LS Moss Theoretical Computer Science 366 (1-2), 3-59, 2006	38	2006
Recursive coalgebras of finitary functors J Adámek, D Lücke, S Milius RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 2007	36	2007
Generalized Eilenberg theorem I: local varieties of languages J Adámek, S Milius, RSR Myers, H Urbat International Conference on Foundations of Software Science and Computation …, 2014	33	2014
Terminal coalgebras and free iterative theories S Milius Information and Computation 204 (7), 1139-1172, 2006	30	2006
Generic trace semantics and graded monads S Milius, D Pattinson, L Schröder 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015), 2015	29	2015
Semantics of higher-order recursion schemes J Adámek, S Milius, J Velebil International Conference on Algebra and Coalgebra in Computer Science, 49-63, 2009	27	2009
Varieties of languages in a category J Adámek, RSR Myers, H Urbat, S Milius 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 414-425, 2015	26	2015
Abstract GSOS rules and a modular treatment of recursive definitions S Milius, LS Moss, D Schwencke arXiv preprint arXiv:1307.2538, 2013	26	2013
Well-pointed coalgebras J Adámek, S Milius, LS Moss, L Sousa International Conference on Foundations of Software Science and …, 2012	23	2012
Elgot theories: a new perspective on the equational properties of iteration S Milius Mathematical Structures in Computer Science 21 (2), 417, 2011	23	2011
Eilenberg Theorems for Free H Urbat, J Adámek, LT Chen, S Milius Mathematical Foundations of Computer Science 2017, 2016	22*	2016

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors