5 citations · 19 across the 20 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DS2024
Beating Bellman's Algorithm for Subset Sum
Karl Bringmann, Nick Fischer, Vasileios Nakos
Bellman's algorithm for Subset Sum is one of the earliest and simplest examples of dynamic programming, dating back to 1957. For a given set of integers and a target , i…
cs.DB2024
Targeted Least Cardinality Candidate Key for Relational Databases
Vasileios Nakos, Hung Q. Ngo, Charalampos E. Tsourakakis
Functional dependencies (FDs) are a central theme in databases, playing a major role in the design of database schemas and the optimization of queries. In this work, we introduce t…