ProfessorsProfessors of Uniwersytet WarszawskiDamian Niwinski

Damian Niwinski

Uniwersytet Warszawski

H-index: 22

Europe-Poland

About Damian Niwinski

Damian Niwinski, With an exceptional h-index of 22 and a recent h-index of 9 (since 2020), a distinguished researcher at Uniwersytet Warszawski, specializes in the field of automata theory, logic, complexity.

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

The Probabilistic Rabin Tree Theorem*

200 Problems on Languages, Automata, and Computation

On guidable index of tree automata

A quasi-polynomial black-box algorithm for fixed point evaluation

29th EACSL Annual Conference on Computer Science Logic (CSL 2021)

EATCS Distinguished Dissertation Award 2020-Call for Nominations

Computing measures of weak-MSO definable sets of trees

Damian Niwinski Information

University	Uniwersytet Warszawski
Position	Professor of Computer Science
Citations(all)	2188
Citations(since 2020)	354
Cited By	2060
hIndex(all)	22
hIndex(since 2020)	9
i10Index(all)	34
i10Index(since 2020)	9
Email	Access Email
University Profile Page	Uniwersytet Warszawski
Google Scholar	View Google Scholar Profile

Damian Niwinski Skills & Research Interests

automata theory

logic

complexity

Top articles of Damian Niwinski

Title	Journal	Author(s)	Publication Date
The Probabilistic Rabin Tree Theorem*		Damian Niwiński Paweł Parys Michał Skrzypczak	2023/6/26
200 Problems on Languages, Automata, and Computation		Filip Murlak Damian Niwiński Wojciech Rytter	2023/3/31
On guidable index of tree automata		Damian Niwiński Michał Skrzypczak	2021
A quasi-polynomial black-box algorithm for fixed point evaluation		André Arnold Damian Niwiński Paweł Parys	2021
29th EACSL Annual Conference on Computer Science Logic (CSL 2021)		Bartek Klin Assia Mahboubi Sylvain Schmitz Linda Westrick Samson Abramsky ...	2021/1
EATCS Distinguished Dissertation Award 2020-Call for Nominations	Bulletin of EATCS	Susanne Albers Nikhil Bansal Elvira Mayordomo Dale Miller Jaroslav Nesetril ...	2020/10/20
Computing measures of weak-MSO definable sets of trees		Damian Niwiński Marcin Przybyłko Michał Skrzypczak	2020