Journal Article (3187)
2821.
Journal Article
22 (4), pp. 379 - 396 (1999)
Decidability by Resolution for Propositional Modal Logics. Journal of Automated Reasoning 2822.
Journal Article
3 (4), pp. 399 - 416 (1999)
Randomized online scheduling with delivery times. Journal of Combinatorial Optimization 2823.
Journal Article
28 (3), pp. 847 - 863 (1999)
Row-Major Sorting on Meshes. SIAM Journal on Computing 2824.
Journal Article
56 (2), pp. 156 - 180 (1999)
Practical Parallel List Ranking. Journal of Parallel and Distributed Computing 2825.
Journal Article
33, pp. 112 - 123 (1999)
Minimum Coloring k-Colorable Graphs in Polynomial Average Time. Journal of Algorithms 2826.
Journal Article
27, pp. 49 - 78 (1999)
Contrary-to-duty reasoning with preference-based dyadic obligations. Annals of Mathematics and Artificial Intelligence 2827.
Journal Article
7, pp. 51 - 67 (1999)
Diagnosis and Decision Making in Normative Reasoning. Journal of Artificial Intelligence and Law 2828.
Journal Article
64 (3), pp. 984 - 990 (1999)
The ground-negative fragment of first-order logics is $\pi^p_2$-complete. The Journal of Symbolic Logic 2829.
Journal Article
32, pp. 517 - 529 (1999)
Randomness, Stochasticity, and Approximation. Theory of Computing Systems 2830.
Journal Article
23 (1), p. 21 - 21 (1999)
SPASS V0.95TPTP. Journal of Automated Reasoning 2831.
Journal Article
1 (1999)
Review - Atomicity versus Anonymity: Distributed Transactions for Electronic Commerce. ACM SIGMOD Digital Review 2832.
Journal Article
22 (2), pp. 3 - 11 (1999)
Towards Self-Tuning Memory Management for Data Servers. IEEE Data(Base) Engineering Bulletin 2833.
Journal Article
15 (2), pp. 100 - 111 (1999)
Real-time Exploration of Regular Volume Data by Adaptive Reconstruction of Iso-Surfaces. The Visual Computer 2834.
Journal Article
99 (2), pp. 1 - 29 (1999)
Strong unicity of best uniform approximation from periodic spline spaces. Journal of Approximation Theory 2835.
Journal Article
197 (1/2), pp. 95 - 109 (1998)
A competitive analysis of the list update problem with lookahead. Theoretical Computer Science 2836.
Journal Article
27 (3), pp. 682 - 693 (1998)
Improved randomized on-line algorithms for the list update problem. SIAM Journal on Computing 2837.
Journal Article
27, pp. 75 - 96 (1998)
New on-line algorithms for the page replication problem. Journal of Algorithms 2838.
Journal Article
21 (3), pp. 312 - 329 (1998)
Average case analyses of list update algorithms, with applications to data compression. Algorithmica 2839.
Journal Article
66 (3), pp. 109 - 113 (1998)
Maximum Network Flow with Floating Point Arithmetic. Information Processing Letters 2840.
Journal Article
29, pp. 82 - 110 (1998)
All-Pairs Min-Cut in Sparse Networks. Journal of Algorithms