Result 1 to 20 of 68 total
The Stanford GraphBase: A platform for combinatorial algorithms. (English)
Ramachandran, Vijaya (ed.), Discrete algorithms. Proceedings of the 4th annual ACM-SIAM symposium, held at Austin, TX, USA, January 25-27, 1993. Philadelphia, PA: SIAM. 41-43 (1993).
1
Nested satisfiability. (English)
Acta Inf. 28, No.1, 1-6 (1990).
2
Two applications of model-theoretic forcing to Lipski’s data bases with incomplete information. (English)
Ann. Soc. Math. Pol., Ser. IV, Fundam. Inf. 12, No.3, 269-287 (1989).
3
Logic of multicomponent systems and a combinatorial model of causal relationships. (English)
Inf. Sci. 47, No.3, 187-242 (1989).
4
The power of a prime that divides a generalized binomial coefficient. (English)
J. Reine Angew. Math. 396, 212-219 (1989).
5
Information retrieval based on information structures. (English)
Informatik-Dissertationen ETH Zürich, 15. Zürich (CH): Verlag der Fachvereine. XI, 135 p. (1989).
6
The structure of the relational database model. (English)
EATCS Monographs on Theoretical Computer Science, 17. Berlin etc.: Springer-Verlag. X, 231 p (1989).
7
Introduction to the theory of nested transactions. (English)
Theor. Comput. Sci. 62, No.1-2, 123-185 (1988).
8
Basic results in information processing. (English)
Bull. Soc. Math. Belg., Sér. A 40, No.1, 47-66 (1988).
9
Fixpoint strategies for deductive data bases. (English)
Bull. EATCS 35, 128-136 (1988).
10
Properties and updata semantics of consistent views. (English)
ACM Trans. Database Syst. 13, No.4, 486-524 (1988).
11
Testing unboundedness of database schemes and functional dependencies. (English)
Inf. Process. Lett. 28, No.6, 317-326 (1988).
12
Information aspects: A tool for redundancy control of data. (English)
Kybernetika 24, No.4, 293-306 (1988).
13
A theory of atomic transactions. (English)
Database theory, Proc. 2nd Int. Conf., Bruges/Belgium 1988, Lect. Notes Comput. Sci. 326, 41-71 (1988).
14
Galois theory of databases. (English)
Algebra: some current trends, Proc. 5th Natl. Sch. Algebra, Varna/Bulg. 1986, Lect. Notes Math. 1352, 147-161 (1988).
15
Design, proof and analysis of new efficient algorithms for incremental attribute evaluation. (English)
Mathematical foundations of computer science, Proc. 13th Symp., Carlsbad/Czech. 1988, Lect. Notes Comput. Sci. 324, 483-491 (1988).
16
Proof system for weakest prespecification and its applications. (English)
Mathematical foundations of computer science 1988, Proc. 13th Symp., Carlsbad/Czech. 1988, Lect. Notes Comput. Sci. 324, 463-471 (1988).
17
A natural semantics for modal logic over databases. (English)
Theor. Comput. Sci. 56, No.2, 187-209 (1988).
18
Positive Boolean dependencies. (English)
Inf. Process. Lett. 27, No.3, 147-150 (1988).
19
Equivalence and optimization of relational transactions. (English)
J. Assoc. Comput. Mach. 35, No.1, 70-120 (1988).
20
Result 1 to 20 of 68 total
Start
Contact
Print
General Help
