Richard Krogman

dblp:297/3432 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
3since 2021 · last 2025
—ORCID · none

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

Theory of computation · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
YearPublicationVenuePosition
2025 Density2R: Efficient Document Re-Ranking via Embedding Density Over Parametric Knowledge of Large Language Models
Md Shahir Zaoad, Niamat Zawad, Latifur Khan, Priyanka Ranade, Richard Krogman
IEEE Big Data5
2022 Complexity of injection structures induced by finite state transducers
abstract
Abstract An injection structure ${{\mathcal {A}}} = (A,f)$ is a set $A$ together with a one-place one-to-one function $f$. ${{\mathcal {A}}}$ is a Finite State Transducer (abbreviated FST) injection structure if $A$ is a regular set, i.e. the set of words accepted by some finite automaton, and $f$ is realized by a deterministic FST. We study the complexity of the character of an FST injection structure. We examine the effective categoricity of such structures. We show that the isomorphism problem for unary FST structures is decidable in quadratic time.
Richard Krogman, Douglas A. Cenzer
J. Log. Comput.1
2021 Complexity and Categoricity of Injection Structures Induced by Finite State Transducers
Richard Krogman, Douglas A. Cenzer
CiE1