The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Distributed Infimum Approximation (DIA) is defined as an abstraction of several interesting problems in the field of distributed computing. Global Virtual Time approximation as well as Distributed Termination Detection are special cases of DIA, as will be argued. Three solutions to the DIA problem are given for synchronous, for bidirectional and for FIFO communication.
The combinatorial results about the maximal number of minimal keys are summarized. It is shown that the result of J. Demetrovics about the maximal number of minimal keys on unbounded domains does not hold for finite domains. Using this result lower bounds on the size of minimal-sized Armstrong relations are derived. Finally also shown is that the maximal number of minimal keys in databases on nonuniform...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.