| |
      |
                                          |
Note: Links lead to the DBLP on the Web. George Loizou Rajaa Najjar , Steve Counsell , George Loizou, Youssef Hassoun : The quality of automated and manual data collection processes in Java software: an empirical comparison. CAiSE Workshops (2) 2004 : 101-112 Kevin Keenoy , Alexandra Poulovassilis , Vassilis Christophides , George Loizou, Giorgos Kokkinidis , George Samaras , Nicolas Spyratos : Report on the Workshop on Metadata Management in Grid and Peer-to-Peer Systems, London, December 16, 2003. SIGMOD Record 33 (3): 96-100 (2004) Rajaa Najjar , Steve Counsell , George Loizou, K. Mannock : The Role of Constructors in the Context of Refactoring Object-Oriented System. CSMR 2003 : 111- Jason Crampton , George Loizou: Administrative scope: A foundation for role-based administrative models. ACM Trans. Inf. Syst. Secur. 6 (2): 201-231 (2003) Mark Levene , George Loizou: Why is the snowflake schema a good data warehouse design? Inf. Syst. 28 (3): 225-240 (2003) Mark Levene , George Loizou: Computing the Entropy of User Navigation in the Web. International Journal of Information Technology and Decision Making 2 (3): 459-476 (2003) Mark Levene , Trevor I. Fenner , George Loizou, Richard Wheeldon : A stochastic model for the evolution of the Web. Computer Networks 39 (3): 277-287 (2002) Jason Crampton , George Loizou, Greg O'Shea : A Logic of Access Control. Comput. J. 44 (1): 54-66 (2001) Jason Crampton , George Loizou, Greg O'Shea : A Logic of Access Control. Comput. J. 44 (2): 137-149 (2001) Mark Levene , George Loizou: A Generalisation of Entity and Referential Integrity in Relational Databases. ITA 35 (2): 113-127 (2001) Mark Levene , José Borges , George Loizou: Zipf's Law for Web Surfers. Knowl. Inf. Syst. 3 (1): 120-129 (2001) Jason Crampton , George Loizou: Authorisation and antichains. Operating Systems Review 35 (3): 6-15 (2001) Mark Levene , George Loizou: Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies. Theor. Comput. Sci. 254 (1-2): 683-690 (2001) E. C. Cheng , George Loizou: A Publish/Subscribe Framework: Push Technology in E-Commerce. BNCOD 2000 : 153-170 Gongxian Cheng , Kwawen Cho , Xiaohui Liu , George Loizou, John Xingwang Wu : Evaluating an Eye Screening Test. IDA 1999 : 461-472 Mark Levene , George Loizou: Database Design for Incomplete Relations. ACM Trans. Database Syst. 24 (1): 80-125 (1999) Mark Levene , George Loizou: How to Prevent Interaction of Functional and Inclusion Dependencies. Inf. Process. Lett. 71 (3-4): 115-125 (1999) Mark Levene , George Loizou: A Probabilistic Approach to Navigation in Hypertext. Inf. Sci. 114 (1-4): 165-186 (1999) Mark Levene , George Loizou: Navigation in Hypertext Is Easy Only Sometimes. SIAM J. Comput. 29 (3): 728-760 (1999) Mark Levene , George Loizou: Axiomatisation of Functional Dependencies in Incomplete Relations. Theor. Comput. Sci. 206 (1-2): 283-300 (1998) Mark Levene , George Loizou: The Additivity Problem for Functional Dependencies in Incomplete Relations. Acta Inf. 34 (2): 135-149 (1997) Mark Levene , George Loizou: Null Inclusion Dependencies in Relational Databases. Inf. Comput. 136 (2): 67-108 (1997) Mark Levene , George Loizou: Categorisation of Computable Data-Base Queries. Fundam. Inform. 27 (4): 319-348 (1996) Mark Levene , George Loizou: The additivity Problem for Data Dependencies in Incomplete Relational Databases. Semantics in Databases 1995 : 136-169 Mark Levene , George Loizou: A Graph-Based Data Model and its Ramifications. IEEE Trans. Knowl. Data Eng. 7 (5): 809-823 (1995) Swarup Reddi , George Loizou: Analysis of Camera Behavior During Tracking. IEEE Trans. Pattern Anal. Mach. Intell. 17 (8): 765-778 (1995) Eran Tuv , George Loizou: HyperStore: A Persistent Object Store for Next-Generation Applications. Australasian Database Conference 1994 : 213-226 Peter Thanisch , George Loizou, Jyrki Nummenmaa : Finding Compact Scheme Forests in Nested Normal Form is NP-Hard Inf. Comput. 110 (1): 19-41 (1994) Mark Levene , George Loizou: The Nested Universal Relation Data Model. J. Comput. Syst. Sci. 49 (3): 683-717 (1994) Eran Tuv , George Loizou: Self Organizing Feature Map for Clustering in Persistent Object Stores. NGITS 1993 : 0- Mark Levene , George Loizou: Semantics for Null Extended Nested Relations. ACM Trans. Database Syst. 18 (3): 414-459 (1993) Mark Levene , George Loizou: A Fully Precise Null Extended Nested Relational Algebra. Fundam. Inform. 19 (3/4): 303-342 (1993) Mark Levene , George Loizou: Inferring Null Join Dependencies in Relational Databases. BIT 32 (3): 413-429 (1992) George Loizou, Philippos Pouyioutas : A Query Algebra for an Extended Object-Oriented Database Model. DASFAA 1991 : 89-98 Mark Levene , George Loizou: Correction to Null Values in Nested Relational Databases by Mark A. Roth, H. F. Korth, and A. Silberschatz. Acta Inf. 28 (6): 603-605 (1991) Mark Levene , George Loizou: The Nested Relation Type Model: An Application of Domain Theory to Databases. Comput. J. 33 (1): 19-30 (1990) Mark Levene , George Loizou: A Domain Theoretic Approach to Incomplete Information in Nested Relational Databases. FODO 1989 : 439-456 Mark Levene , George Loizou: NURQL: a nested universal relation query language. Inf. Syst. 14 (4): 307-316 (1989) Mark Levene , George Loizou: A Universal Relation Model for Nested Relations. EDBT 1988 : 294-308 Mark Levene , George Loizou: Project join constructibility for NF2 relational databases. BDA 1987 : 143-164 Mark Levene , George Loizou: Gamma-Acyclic Database Schemes and Nested Relations. NF² 1987 : 313-323 George Loizou, Peter Thanisch : Losslessness and Project-Join Constructibility in Relational Databases. Acta Inf. 24 (2): 131-144 (1987) George Loizou, Peter Thanisch : On Finding a Worst-Case Optimal Fourth Normal Form Database Decomposition. BIT 27 (2): 157-162 (1987) Peter Thanisch , George Loizou: A Polynomial-Time Join Dependency Implication Algorithm for Multi-Valued Dependencies. ICDT 1986 : 397-408 George Loizou, Peter Thanisch : Do Embedded Dependencies Always Lead to a Wild Goose Chase? BNCOD 1984 : 41-56 George Loizou, El-S. N. O. El-Shebini : New IDMS Design and Documentation Tools Produced for the FEDOS Database. BNCOD 1984 : 91-101 Trevor I. Fenner , George Loizou: Loop-Free Algorithms for Traversing Binary Trees. BIT 24 (1): 33-44 (1984) George Loizou: Certain NP-complete matching problems. Inf. Sci. 32 (2): 117-121 (1984) George Loizou, Peter Thanisch : Testing a dependency-preserving decomposition for losslessness. Inf. Syst. 8 (1): 25-27 (1983) Trevor I. Fenner , George Loizou: Tree Traversal Related Algorithms for Generating Integer Partitions. SIAM J. Comput. 12 (3): 551-564 (1983) George Loizou, Peter Thanisch : Enumerating the cycles of a digraph: A new preprocessing strategy. Inf. Sci. 27 (3): 163-182 (1982) Trevor I. Fenner , George Loizou: An Analysis of two Related Loop-free Algorithms for Generating Integer Partitions. Acta Inf. 16 : 237-252 (1981) Trevor I. Fenner , George Loizou: A Note on Traversal Algorithms for Triply Linked Binary Trees. BIT 21 (2): 153-156 (1981) Trevor I. Fenner , George Loizou: A Binary Tree Representation and Related Algorithms for Generating Partitions. Comput. J. 23 (4): 332-337 (1980) George Loizou: On a Cycle Finding Algorithm. Inf. Process. Lett. 11 (1): 33-36 (1980) George Loizou: Mathematical Solution for a Data Processing System. Inf. Process. Lett. 8 (5): 252-256 (1979) George Loizou: Graph models of complex information sources. Inf. Process. Manage. 15 (3): 127-131 (1979) Andreas Karayiannis , George Loizou: Cycle Detection in Critical Path Networks. Inf. Process. Lett. 7 (1): 15-19 (1978) Trevor I. Fenner , George Loizou: Some New Bounds on the Condition Numbers of Optimally Scaled Matrices. J. ACM 21 (3): 514-524 (1974) George Loizou: On the quadratic convergence of the Jacobi method for normal matrices. Comput. J. 15 (3): 274-276 (1972) Trevor I. Fenner , George Loizou: On Fully Indecomposable Matrices. J. Comput. Syst. Sci. 5 (6): 607-622 (1971) George Loizou: Nonnormality and Jordan Condition Numbers of Matrices. J. ACM 16 (1): 580-584 (1969) 1 [ 52 ] 2 [ 49 ] 3 [ 48 ] 4 [ 48 ] 5 [ 61 ] 6 [ 60 ] [ 62 ] 7 [ 51 ] [ 54 ] [ 55 ] [ 59 ] 8 [ 17 ] 9 [ 2 ] [ 4 ] [ 9 ] [ 10 ] [ 11 ] [ 13 ] [ 16 ] [ 56 ] 10 [ 62 ] 11 [ 5 ] 12 [ 61 ] 13 [ 61 ] 14 [ 22 ] [ 23 ] [ 24 ] [ 25 ] [ 26 ] [ 27 ] [ 28 ] [ 30 ] [ 31 ] [ 32 ] [ 34 ] [ 38 ] [ 39 ] [ 40 ] [ 41 ] [ 42 ] [ 43 ] [ 44 ] [ 45 ] [ 46 ] [ 47 ] [ 50 ] [ 52 ] [ 53 ] [ 56 ] [ 57 ] [ 58 ] 15 [ 48 ] 16 [ 60 ] 17 [ 60 ] [ 62 ] 18 [ 35 ] 19 [ 54 ] [ 55 ] 20 [ 61 ] 21 [ 29 ] 22 [ 37 ] 23 [ 61 ] 24 [ 61 ] 25 [ 12 ] [ 14 ] [ 18 ] [ 19 ] [ 20 ] [ 21 ] [ 35 ] 26 [ 33 ] [ 36 ] 27 [ 56 ] 28 [ 48 ]  ©2005 Association for Computing Machinery |
