default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDohan Kim 0001
Person information
- affiliation: University of Innsbruck, Innsbruck, Austria
- affiliation (former): A. I. Research Lab, Seongnam, South Korea
- affiliation (former): Clarkson University, Potsdam, NY, USA
Other persons with the same name
- Dohan Kim 0002 — Seoul National University, Seoul, South Korea
- Dohan Kim 0003 — Kyungpook National University, Daegu, South Korea
- Dohan Kim 0004 — Samsung Electronics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j6]Dohan Kim
:
Finding k Shortest Paths in Cayley Graphs of Finite Groups. Graphs Comb. 40(6): 120 (2024)- 2016
- [j5]Dohan Kim:
Sorting on graphs by adjacent swaps using permutation groups. Comput. Sci. Rev. 22: 89-105 (2016) - [j4]Dohan Kim:
Representations of task assignments in distributed systems using Young tableaux and symmetric groups. Int. J. Parallel Emergent Distributed Syst. 31(2): 152-175 (2016) - 2015
- [j3]Dohan Kim:
Group-theoretical vector space model. Int. J. Comput. Math. 92(8): 1536-1550 (2015) - 2014
- [j2]Dohan Kim:
Priority-Based Task reassignments in Hierarchical 2D Mesh-Connected Systems using Tableaux. Discret. Math. Algorithms Appl. 6(2) (2014) - 2013
- [j1]Dohan Kim:
Task swapping networks in distributed systems. Int. J. Comput. Math. 90(11): 2221-2243 (2013)
Conference and Workshop Papers
- 2024
- [c7]Nao Hirokawa, Dohan Kim, Kiraku Shintani, René Thiemann:
Certification of Confluence- and Commutation-Proofs via Parallel Critical Pairs. CPP 2024: 147-161 - [c6]Dohan Kim:
An Isabelle/HOL Formalization of Narrowing and Multiset Narrowing for E-Unifiability, Reachability and Infeasibility. ITP 2024: 24:1-24:19 - 2022
- [c5]Dohan Kim:
Equational Theorem Proving for Clauses over Strings. LSFA 2022: 49-66 - 2021
- [c4]Dohan Kim, Christopher Lynch:
Equational Theorem Proving Modulo. CADE 2021: 166-182 - [c3]Dohan Kim, Christopher Lynch:
An RPO-Based Ordering Modulo Permutation Equations and Its Applications to Rewrite Systems. FSCD 2021: 19:1-19:17 - [c2]Dohan Kim, Christopher Lynch:
Congruence Closure Modulo Permutation Equations. SCSS 2021: 86-98 - 2019
- [c1]Dohan Kim, Christopher Lynch, Paliath Narendran:
Reviving Basic Narrowing Modulo. FroCos 2019: 313-329
Informal and Other Publications
- 2023
- [i6]Dohan Kim:
Congruence Closure Modulo Groups. CoRR abs/2310.05014 (2023) - 2016
- [i5]Dohan Kim:
Distributed agent-based automated theorem proving in order-sorted first-order logic. CoRR abs/1609.02320 (2016) - 2015
- [i4]Dohan Kim:
Group-theoretical vector space model. CoRR abs/1509.05977 (2015) - 2011
- [i3]Dohan Kim:
Task swapping networks in distributed systems. CoRR abs/1107.1851 (2011) - [i2]Dohan Kim:
Priority-based task reassignments in hierarchical 2D mesh-connected systems using tableaux. CoRR abs/1107.1866 (2011) - 2010
- [i1]Dohan Kim:
Representations of task assignments in distributed systems using Young tableaux and symmetric groups. CoRR abs/1012.1288 (2010)
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 2025-01-04 03:37 CET 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:
