default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmitry Berdinsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j7]Dmitry Berdinsky, Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan
:
String compression in FA-presentable structures. Theor. Comput. Sci. 947: 113705 (2023)- [i9]Dmitry Berdinsky, Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan:
String Compression in FA-Presentable Structures. CoRR abs/2302.01009 (2023) - 2022
- [j6]Dmitry Berdinsky, Murray Elder, Prohrak Kruengthomya:
Cayley polynomial-time computable groups. Inf. Comput. 288: 104768 (2022) - [j5]Dmitry Berdinsky, Murray Elder, Jennifer Taback:
On the geometry of Cayley automatic groups. Int. J. Algebra Comput. 32(3): 383-409 (2022) - 2021
- [i8]Dmitry Berdinsky, Prohrak Kruengthomya:
Representing Polynomial Splines over Infinite Hierarchical Meshes by Finite Automata. CoRR abs/2104.02876 (2021) - 2020
- [c4]Dmitry Berdinsky, Prohrak Kruengthomya:
Nonstandard Cayley Automatic Representations for Fundamental Groups of Torus Bundles over the Circle. LATA 2020: 115-127 - [i7]Dmitry Berdinsky, Prohrak Kruengthomya:
Nonstandard Cayley automatic representations of fundamental groups. CoRR abs/2001.04743 (2020) - [i6]Dmitry Berdinsky, Murray Elder, Prohrak Kruengthomya:
Cayley Polynomial-Time Computable Groups. CoRR abs/2008.02511 (2020)
2010 – 2019
- 2019
- [i5]Dmitry Berdinsky, Phongpitak Trakuldit:
Towards quantitative classification of Cayley automatic groups. CoRR abs/1902.00652 (2019) - 2018
- [c3]Dmitry Berdinsky, Phongpitak Trakuldit:
Measuring Closeness Between Cayley Automatic Groups and Automatic Groups. LATA 2018: 245-257 - [i4]Dmitry Berdinsky, Phongpitak Trakuldit:
Measuring closeness between Cayley automatic groups and automatic groups. CoRR abs/1804.02548 (2018) - 2016
- [j4]Dmitry Berdinsky, Bakhadyr Khoussainov:
Cayley Automatic Representations of Wreath Products. Int. J. Found. Comput. Sci. 27(2): 147-160 (2016) - [c2]Dmitry Berdinsky:
Cayley Automatic Groups and Numerical Characteristics of Turing Transducers. DLT 2016: 26-37 - [i3]Dmitry Berdinsky:
Cayley Automatic Groups and Numerical Characteristics of Turing Transducers. CoRR abs/1606.08357 (2016) - 2015
- [i2]Dmitry Berdinsky, Bakhadyr Khoussainov:
Cayley automatic representations of wreath products. CoRR abs/1511.01630 (2015) - 2014
- [j3]Dmitry Berdinsky, Tae-wan Kim, Cesare Bracco, Durkbin Cho, Min-jae Oh, Yeong-Hwa Seo, Sutipong Kiatpanichgij:
Iterative refinement of hierarchical T-meshes for bases of spline spaces with highest order smoothness. Comput. Aided Des. 47: 96-107 (2014) - [j2]Dmitry Berdinsky, Tae-wan Kim, Cesare Bracco, Durkbin Cho, Bernard Mourrain, Min-jae Oh, Sutipong Kiatpanichgij:
Dimensions and bases of hierarchical tensor-product splines. J. Comput. Appl. Math. 257: 86-104 (2014) - [c1]Dmitry Berdinsky, Bakhadyr Khoussainov:
On Automatic Transitive Graphs. Developments in Language Theory 2014: 1-12 - [i1]Dmitry Berdinsky, Tae-wan Kim, Durkbin Cho, Cesare Bracco, Sutipong Kiatpanichgij:
Bases of T-meshes and the refinement of hierarchical B-splines. CoRR abs/1401.7076 (2014) - 2012
- [j1]Dmitry Berdinsky, Min-jae Oh, Tae-wan Kim, Bernard Mourrain:
On the problem of instability in the dimension of a spline space over a T-mesh. Comput. Graph. 36(5): 507-513 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
