Sciweavers

9 search results - page 2 / 2
» fct 2001
Sort
View
FCT
2001
Springer
13 years 9 months ago
Dense Families and Key Functions of Database Relation Instances
In this paper dense families of database relations are introduced. We characterize dependencies and keys of relation instances in terms of dense families. Key functions are also in...
Jouni Järvinen
FCT
2001
Springer
13 years 9 months ago
Divisibility Monoids: Presentation, Word Problem, and Rational Languages
Abstract. We present three results on divisibility monoids. These divisibility monoids were introduced in [11] as an algebraic generalization of Mazurkiewicz trace monoids. (1) We ...
Dietrich Kuske
FCT
2001
Springer
13 years 9 months ago
Best Increments for the Average Case of Shellsort
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
Marcin Ciura
FCT
2001
Springer
13 years 9 months ago
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miya...