ProfessorsProfessors of Universität UlmThom Frühwirth

Thom Frühwirth

Universität Ulm

H-index: 37

Europe-Germany

About Thom Frühwirth

Thom Frühwirth, With an exceptional h-index of 37 and a recent h-index of 8 (since 2020), a distinguished researcher at Universität Ulm, specializes in the field of Computational Logic, Programming Languages, Constraint Programming, Logic Programming.

His recent articles reflect a diverse array of research interests and contributions to the field:

FreeCHR: An Algebraic Framework for CHR-Embeddings

Runtime Repeated Recursion Unfolding: A Just-In-Time Online Program Optimization That Can Achieve Super-Linear Speedup

Security Policies in Constraint Handling Rules

Justifications in constraint handling rules for logical retraction in dynamic algorithms: Theory, implementations, and complexity

Repeated Recursion Unfolding for Super-Linear Speedup within Bounds

Thom Frühwirth Information

University	Universität Ulm
Position	Professor of Computer Science
Citations(all)	5418
Citations(since 2020)	409
Cited By	4748
hIndex(all)	37
hIndex(since 2020)	8
i10Index(all)	95
i10Index(since 2020)	7
Email	Access Email
University Profile Page	Universität Ulm
Google Scholar	View Google Scholar Profile

Thom Frühwirth Skills & Research Interests

Computational Logic

Programming Languages

Constraint Programming

Logic Programming

Top articles of Thom Frühwirth

Title	Journal	Author(s)	Publication Date
FreeCHR: An Algebraic Framework for CHR-Embeddings		Sascha Rechenberger Thom Frühwirth	2023/9/18
Runtime Repeated Recursion Unfolding: A Just-In-Time Online Program Optimization That Can Achieve Super-Linear Speedup	arXiv preprint arXiv:2307.02180	Thom Fruehwirth	2023/7/5
Security Policies in Constraint Handling Rules	LPOP: Challenges and Advances in Logic and Practice of Programming	Thom Frühwirth	2020/8
Justifications in constraint handling rules for logical retraction in dynamic algorithms: Theory, implementations, and complexity	Fundamenta Informaticae	Thom Frühwirth	2020/1/1
Repeated Recursion Unfolding for Super-Linear Speedup within Bounds	arXiv preprint arXiv:2009.05314	Thom Fruehwirth	2020/9/11