Witold Lipski Jr.
According to our database^{1},
Witold Lipski Jr.
authored at least 39 papers
between 1974 and 1987.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at id.loc.gov
On csauthors.net:
Bibliography
1987
A Unified Approach to Layout Wirability.
Mathematical Systems Theory, 1987
1986
Nonapplicable Nulls.
Theor. Comput. Sci., 1986
1985
Une approche formelle aux valeurs nulles nonapplicables.
Proceedings of the Journées Bases de Données Avancés, 1985
1984
Optimal ThreeLayer Channel Routing.
IEEE Trans. Computers, 1984
The Relational Model of Data and Cylindric Algebras.
J. Comput. Syst. Sci., 1984
Incomplete Information in Relational Databases.
J. ACM, 1984
An O(n log n) Manhattan Path Algorithm.
Inf. Process. Lett., 1984
On Relational Algebra with Marked Nulls.
Proceedings of the Third ACM SIGACTSIGMOD Symposium on Principles of Database Systems, 1984
1983
Finding a manhattan path and related problems.
Networks, 1983
Incomplete Information and Dependencies in Relational Databases.
Proceedings of the SIGMOD'83, 1983
Inverting Relational Expressions  A Uniform and Natural Technique for Various Database Problems.
Proceedings of the Second ACM SIGACTSIGMOD Symposium on Principles of Database Systems, 1983
1982
Corrigendum: Finding the Contour of a Union of IsoOriented Rectangles.
J. Algorithms, 1982
A Technique for Translating States Between Database Schemata.
Proceedings of the 1982 ACM SIGMOD International Conference on Management of Data, 1982
A Systematic Approach to Relational Database Theory.
Proceedings of the 1982 ACM SIGMOD International Conference on Management of Data, 1982
The Relational Model of Data and Cylindrial Algebras.
Proceedings of the ACM Symposium on Principles of Database Systems, 1982
Three Layers Are Enough
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982
On th Undecidability of Equivalence Problems for Relational Expressions.
Proceedings of the Advances in Data Base Theory, 1982
1981
A Fast Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems.
J. Algorithms, 1981
Erratum: Finding the Contour of a Union of IsoOriented Rectangles.
J. Algorithms, 1981
Segments, Rectangles, Contours.
J. Algorithms, 1981
On Databases with Incomplete Information.
J. ACM, 1981
Efficient Algorithms for Finding Maximum Matchings in Convex Bipartite Graphs and Related Problems.
Acta Inf., 1981
On Representing Incomplete Information in a Relational Data Base
Proceedings of the Very Large Data Bases, 1981
A Note on Decomposing a Query Set into Subsets Having the Consecutive Retrieval Property.
FODO, 1981
The Concecutive Retrieval Property, Interval Graphs and Retrieval Topics  A Survey.
FODO, 1981
1980
Finding the Contour of a Union of IsoOriented Rectangles.
J. Algorithms, 1980
1979
On Semantic Issues Connected with Incomplete Information Databases.
ACM Trans. Database Syst., 1979
Information systems: on queries involving cardinalities.
Inf. Syst., 1979
More on permutation generation methods.
Computing, 1979
1978
On strings containing all subsets as substrings.
Discrete Mathematics, 1978
1977
One More Polynomial Complete Consecutive Retrieval Problem.
Inf. Process. Lett., 1977
On Semantic Issues Connected with Incomplete Information Data Bases (Abstract).
Proceedings of the Third International Conference on Very Large Data Bases, 1977
On the Logic of Incomplete Transformation.
Proceedings of the Mathematical Foundations of Computer Science 1977, 1977
Two NPComplete Problems Related to Information Retrieval.
FCT, 1977
1976
Information Storage and Retrieval  Mathematical Foundations II (Combinatorial Problems).
Theor. Comput. Sci., 1976
On the Storage Space Requirement of Consecutive Retrieval with Redundancy.
Inf. Process. Lett., 1976
Informational Systems with Incomplete Information.
ICALP, 1976
1974
Combinatorial Aspects of Information Storage and Retrieval.
Proceedings of the Mathematical Foundations of Computer Science, 1974
File Organization, An Application of Graph Theory.
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974