Acta Informatica
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
An analysis and implementation of an efficient in-place bucket sort
Acta Informatica - Tập 34 - Trang 687-700 - 1997
Various methods, such as address-calculation sorts, distribution counting sorts, radix sorts, and bucket sorts, use the values of the numbers being sorted to increase efficiency but do so at the expense of requiring additional storage space. In this paper, a specific implementation of bucket sort is presented whose primary advantanges are that (i) linear average-time performance is achieved with ...... hiện toàn bộ
Some properties of the disjunctive languages contained in Q
Acta Informatica - Tập 48 - Trang 1-18 - 2010
The set of all primitive words Q over an alphabet X was first defined and studied by Shyr and Thierrin (Proceedings of the 1977 Inter. FCT-Conference, Poznan, Poland, Lecture Notes in Computer Science 56. pp. 171–176 (1977)). It showed that for the case |X| ≥ 2, the set along with
$${Q^{(i)} = \{f^i\,|\,f \in Q\}, i\geq ...... hiện toàn bộ
Optimum checkpoints with age dependent failures
Acta Informatica - Tập 27 - Trang 519-531 - 1990
This paper presents a method for obtaining the optimum checkpoint interval of a transaction processing computer system subject to time dependent failures. The system uses checkpointing to create a valid system state, and roll-back in order to recover from failures. Maximizing system availability we derive the optimum checkpoint interval as a function of the load of the system and of the time depen...... hiện toàn bộ
Die Zeitkomplexität des Normalisierungsproblems bei kontextsensitiven Grammatiken
Acta Informatica - Tập 9 - Trang 309-329 - 1978
Sei G eine kontextsensitive Grammatik. Gc∫ bezeichne den kontextfreien Kern von G. In dieser Arbeit wird die Zeitkomplexität des folgenden Problems untersucht. Das Normalisierungsproblem Sei τ ein Ableitungsbaum bezüglich Gc∫; ist τ auch ein Ableitungsbaum bezüglich G? Es wird gezeigt, daß im allgemeinen das Normalisierungs-problem NP-vollständig ist. Andererseits gibt es zu jeder kontextsensitive...... hiện toàn bộ
Space efficient algorithms for some graph theoretical problems
Acta Informatica - Tập 17 - Trang 411-423 - 1982
We present space-efficient-O(log2
n)-deterministic algorithms for some graph theoretical problems such as planarity testing, producing a plane embedding, finding minimum cost spanning trees, obtaining the connected, biconnected and triconnected components of a graph. Previous planarity algorithms used Ω(n) space. Several algorithms are based on a space-efficient matrix inversion method. The same b...... hiện toàn bộ
On-line multiversion database concurrency control
Acta Informatica - Tập 29 Số 2 - Trang 121-160 - 1992
Tổng số: 1,156
- 1
- 2
- 3
- 4
- 5
- 6
- 10