Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Dmitry Berdinsky

dblp:72/11472 · DBLP profile ↗
← Back
8ranked-venue papers
8as first author
2since 2021 · last 2023
0000-0002-9965-7672ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 6 · 6 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Computational complexity · 77% Combinatorics and discrete mathematics · 23%
Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational complexity › complexity classes
polynomial-time computability
0.612022
Cayley polynomial-time computable groups · Inf. Comput. 2022
Geometric modeling and processing
spline spaces
0.212014
Iterative refinement of hierarchical T-meshes for bases of spline spaces with highest order smoothness · Comput. Aided Des. 2014
Combinatorics and discrete mathematics
group theory
0.212022
Cayley polynomial-time computable groups · Inf. Comput. 2022
YearPublicationVenuePosition
2023 String compression in FA-presentable structures
Dmitry Berdinsky, Sanjay Jain 0001, Bakhadyr Khoussainov, Frank Stephan 0001
Theor. Comput. Sci.1
2022 Cayley polynomial-time computable groups
Dmitry Berdinsky, Murray Elder, Prohrak Kruengthomya
Inf. Comput.1
2020 Nonstandard Cayley Automatic Representations for Fundamental Groups of Torus Bundles over the Circle
Dmitry Berdinsky, Prohrak Kruengthomya
LATA1
2018 Measuring Closeness Between Cayley Automatic Groups and Automatic Groups
Dmitry Berdinsky, Phongpitak Trakuldit
LATA1
2016 Cayley Automatic Groups and Numerical Characteristics of Turing Transducers
Dmitry Berdinsky
DLT1
2014 On Automatic Transitive Graphs
Dmitry Berdinsky, Bakhadyr Khoussainov
Developments in Language Theory1
2014 Iterative refinement of hierarchical T-meshes for bases of spline spaces with highest order smoothness
Dmitry Berdinsky, Tae-wan Kim 0001, Cesare Bracco, Durkbin Cho, Min-jae Oh, Yeong-Hwa Seo, Sutipong Kiatpanichgij
Comput. Aided Des.1
2012 On the problem of instability in the dimension of a spline space over a T-mesh
Dmitry Berdinsky, Min-jae Oh, Tae-wan Kim 0001, Bernard Mourrain
Comput. Graph.1