Witold Lipski Jr.

Math. Syst. Theory, 1987

1986

Nonapplicable Nulls.

[BibT_eX]

[DOI]

Nadine Lerat

Theor. Comput. Sci., 1986

1985

Une approche formelle aux valeurs nulles non-applicables.

[BibT_eX]

Nadine Lerat

Proceedings of the Journées Bases de Données Avancés, 1985

1984

Optimal Three-Layer Channel Routing.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1984

The Relational Model of Data and Cylindric Algebras.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1984

Incomplete Information in Relational Databases.

[BibT_eX]

[DOI]

J. ACM, 1984

An O(n log n) Manhattan Path Algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1984

On Relational Algebra with Marked Nulls.

[BibT_eX]

[DOI]

Proceedings of the Third ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1984

1983

Finding a manhattan path and related problems.

[BibT_eX]

[DOI]

Networks, 1983

Incomplete Information and Dependencies in Relational Databases.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD'83, 1983

Inverting Relational Expressions - A Uniform and Natural Technique for Various Database Problems.

[BibT_eX]

[DOI]

Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1983

1982

Corrigendum: Finding the Contour of a Union of Iso-Oriented Rectangles.

[BibT_eX]

J. Algorithms, 1982

A Technique for Translating States Between Database Schemata.

[BibT_eX]

[DOI]

Proceedings of the 1982 ACM SIGMOD International Conference on Management of Data, 1982

A Systematic Approach to Relational Database Theory.

[BibT_eX]

[DOI]

Proceedings of the 1982 ACM SIGMOD International Conference on Management of Data, 1982

The Relational Model of Data and Cylindrial Algebras.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Database Systems, 1982

Three Layers Are Enough

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

On th Undecidability of Equivalence Problems for Relational Expressions.

[BibT_eX]

Proceedings of the Advances in Data Base Theory, 1982

1981

A Fast Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

J. Algorithms, 1981

Erratum: Finding the Contour of a Union of Iso-Oriented Rectangles.

[BibT_eX]

J. Algorithms, 1981

Segments, Rectangles, Contours.

[BibT_eX]

[DOI]

J. Algorithms, 1981

On Databases with Incomplete Information.

[BibT_eX]

[DOI]

J. ACM, 1981

Efficient Algorithms for Finding Maximum Matchings in Convex Bipartite Graphs and Related Problems.

[BibT_eX]

[DOI]

Acta Informatica, 1981

On Representing Incomplete Information in a Relational Data Base

[BibT_eX]

Proceedings of the Very Large Data Bases, 1981

A Note on Decomposing a Query Set into Subsets Having the Consecutive Retrieval Property.

[BibT_eX]

Proceedings of the Data Base File Organization, 1981

The Concecutive Retrieval Property, Interval Graphs and Retrieval Topics - A Survey.

[BibT_eX]

Proceedings of the Data Base File Organization, 1981

1980

Finding the Contour of a Union of Iso-Oriented Rectangles.

[BibT_eX]

[DOI]

J. Algorithms, 1980

1979

On Semantic Issues Connected with Incomplete Information Databases.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 1979

Information systems: on queries involving cardinalities.

[BibT_eX]

[DOI]