George Loizou

According to our database1, George Loizou
  • authored at least 89 papers between 1969 and 2017.
  • has a "Dijkstra number"2 of four.



In proceedings 
PhD thesis 





Iteration Functions re-visited.
J. Computational Applied Mathematics, 2017

A stochastic evolutionary model generating a mixture of exponential distributions.
CoRR, 2015

Int. J. Comput. Math., 2014

A Discrete Evolutionary Model for Chess Players' Ratings.
IEEE Trans. Comput. Intellig. and AI in Games, 2012

Realization of a Functional Domain within a Cloud.
Proceedings of the Cloud Computing and Services Science - Second International Conference, 2012

A Practical Implementation of a Functional Domain within a Cloud.
Proceedings of the CLOSER 2012 - Proceedings of the 2nd International Conference on Cloud Computing and Services Science, Porto, Portugal, 18, 2012

A Discrete Evolutionary Model for Chess Players' Ratings
CoRR, 2011

Functional Domain Concepts in the Modelling of Cloud Structures and the Behaviour of Integrated Policy-based Systems through the Use of Abstraction Classes.
Proceedings of the CLOSER 2011, 2011

Evaluation of the 'replace constructors with creation methods' refactoring in Java systems.
IET Software, 2010

A Multi-Domain Design and Graphics Modeling System.
Proceedings of the 2010 International Conference on Computer Graphics & Virtual Reality, 2010

Modelling the navigation potential of a web page.
Theor. Comput. Sci., 2008

Is Manual Data Collection Hampered by the Presence of Inner Classes or Class Size?
Proceedings of the Advanced Techniques in Computing Sciences and Software Engineering, 2008

A model for collaboration networks giving rise to a power-law distribution with an exponential cutoff.
Social Networks, 2007

Computer vision and pattern recognition.
Int. J. Comput. Math., 2007

Quality of manual data collection in Java software: an empirical investigation.
Empirical Software Engineering, 2007

A stochastic evolutionary growth model for social networks.
Computer Networks, 2007

A Meta-analysis Approach to Refactoring and XP.
Proceedings of the 2007 IEEE/ACS International Conference on Computer Systems and Applications (AICCSA 2007), 2007

A stochastic model for the evolution of the Web allowing link deletion.
ACM Trans. Internet Techn., 2006

The Effectiveness of Refactoring, Based on a Compatibility Testing Taxonomy and a Dependency Graph.
Proceedings of the Testing: Academia and Industry Conference, 2006

Common refactorings, a dependency graph and some code smells: an empirical study of Java OSS.
Proceedings of the 2006 International Symposium on Empirical Software Engineering (ISESE 2006), 2006

Aggregating Homologous Protein Families in Evolutionary Reconstructions of Herpesviruses.
Proceedings of the 2006 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, 2006

Report on the Workshop on Metadata Management in Grid and Peer-to-Peer Systems, London, December 16, 2003.
SIGMOD Record, 2004

The quality of automated and manual data collection processes in Java software: an empirical comparison.
Proceedings of the CAiSE'04 Workshops in connection with The 16th Conference on Advanced Information Systems Engineering, 2004

Administrative scope: A foundation for role-based administrative models.
ACM Trans. Inf. Syst. Secur., 2003

Why is the snowflake schema a good data warehouse design?
Inf. Syst., 2003

Computing the Entropy of User Navigation in the Web.
International Journal of Information Technology and Decision Making, 2003

The Role of Constructors in the Context of Refactoring Object-Oriented System.
Proceedings of the 7th European Conference on Software Maintenance and Reengineering (CSMR 2003), 2003

Kemeny's Constant and the Random Surfer.
The American Mathematical Monthly, 2002

A stochastic model for the evolution of the Web.
Computer Networks, 2002

Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies.
Theor. Comput. Sci., 2001

Authorisation and antichains.
Operating Systems Review, 2001

Zipf's Law for Web Surfers.
Knowl. Inf. Syst., 2001

A Generalisation of Entity and Referential Integrity in Relational Databases.
ITA, 2001

A Logic of Access Control.
Comput. J., 2001

A Logic of Access Control.
Comput. J., 2001

A Publish/Subscribe Framework: Push Technology in E-Commerce.
Proceedings of the Advances in Databases, 17th British National Conferenc on Databases, 2000

Database Design for Incomplete Relations.
ACM Trans. Database Syst., 1999

Navigation in Hypertext Is Easy Only Sometimes.
SIAM J. Comput., 1999

A Probabilistic Approach to Navigation in Hypertext.
Inf. Sci., 1999

How to Prevent Interaction of Functional and Inclusion Dependencies.
Inf. Process. Lett., 1999

Evaluating an Eye Screening Test.
Proceedings of the Advances in Intelligent Data Analysis, Third International Symposium, 1999

A guided tour of relational databases and beyond.
Springer, ISBN: 978-1-85233-008-8, 1999

Axiomatisation of Functional Dependencies in Incomplete Relations.
Theor. Comput. Sci., 1998

Null Inclusion Dependencies in Relational Databases.
Inf. Comput., 1997

The Additivity Problem for Functional Dependencies in Incomplete Relations.
Acta Inf., 1997

First-order algorithm with three clusters of optical flow vectors.
Int. J. Imaging Systems and Technology, 1996

Categorisation of Computable Data-Base Queries.
Fundam. Inform., 1996

A Graph-Based Data Model and its Ramifications.
IEEE Trans. Knowl. Data Eng., 1995

Analysis of Camera Behavior During Tracking.
IEEE Trans. Pattern Anal. Mach. Intell., 1995

The additivity Problem for Data Dependencies in Incomplete Relational Databases.
Proceedings of the Semantics in Databases, 1995

Finding Compact Scheme Forests in Nested Normal Form is NP-Hard
Inf. Comput., April, 1994

The Nested Universal Relation Data Model.
J. Comput. Syst. Sci., 1994

HyperStore: A Persistent Object Store for Next-Generation Applications.
Proceedings of the 5th Australasian Database Conference, 1994

Semantics for Null Extended Nested Relations.
ACM Trans. Database Syst., 1993

New perspectives on optical flow.
Pattern Recognition, 1993

A Modal Logic Formalism for Distributed and Parallel Knowledge Bases.
Parallel Algorithms Appl., 1993

A Fully Precise Null Extended Nested Relational Algebra.
Fundam. Inform., 1993

Self Organizing Feature Map for Clustering in Persistent Object Stores.
Proceedings of the NGITS' 93, 1993

Inferring Null Join Dependencies in Relational Databases.
BIT, 1992

Correction to Null Values in Nested Relational Databases by Mark A. Roth, H. F. Korth, and A. Silberschatz.
Acta Inf., 1991

A Query Algebra for an Extended Object-Oriented Database Model.
Proceedings of the Database Systems for Advanced Applications '91, 1991

The Nested Relation Type Model: An Application of Domain Theory to Databases.
Comput. J., 1990

NURQL: a nested universal relation query language.
Inf. Syst., 1989

A Domain Theoretic Approach to Incomplete Information in Nested Relational Databases.
Proceedings of the Foundations of Data Organization and Algorithms, 1989

A Universal Relation Model for Nested Relations.
Proceedings of the Advances in Database Technology, 1988

The Nearest Neighbor and the Bayes Error Rates.
IEEE Trans. Pattern Anal. Mach. Intell., 1987

On Finding a Worst-Case Optimal Fourth Normal Form Database Decomposition.
BIT, 1987

Losslessness and Project-Join Constructibility in Relational Databases.
Acta Inf., 1987

Gamma-Acyclic Database Schemes and Nested Relations.
Proceedings of the Nested Relations and Complex Objects, 1987

Project join constructibility for NF2 relational databases.
Proceedings of the Troisièmes Journées Bases de Données Avancées, 1987

A Polynomial-Time Join Dependency Implication Algorithm for Multi-Valued Dependencies.
Proceedings of the ICDT'86, 1986

Certain NP-complete matching problems.
Inf. Sci., 1984

Loop-Free Algorithms for Traversing Binary Trees.
BIT, 1984

Do Embedded Dependencies Always Lead to a Wild Goose Chase?
Proceedings of the Third British National Conference on Databases (BNCOD 3), 1984

New IDMS Design and Documentation Tools Produced for the FEDOS Database.
Proceedings of the Third British National Conference on Databases (BNCOD 3), 1984

Tree Traversal Related Algorithms for Generating Integer Partitions.
SIAM J. Comput., 1983

Testing a dependency-preserving decomposition for losslessness.
Inf. Syst., 1983

Enumerating the cycles of a digraph: A new preprocessing strategy.
Inf. Sci., 1982

A Note on Traversal Algorithms for Triply Linked Binary Trees.
BIT, 1981

An Analysis of two Related Loop-free Algorithms for Generating Integer Partitions.
Acta Inf., 1981

On a Cycle Finding Algorithm.
Inf. Process. Lett., 1980

A Binary Tree Representation and Related Algorithms for Generating Partitions.
Comput. J., 1980

Graph models of complex information sources.
Inf. Process. Manage., 1979

Mathematical Solution for a Data Processing System.
Inf. Process. Lett., 1979

Cycle Detection in Critical Path Networks.
Inf. Process. Lett., 1978

Some New Bounds on the Condition Numbers of Optimally Scaled Matrices.
J. ACM, 1974

On the quadratic convergence of the Jacobi method for normal matrices.
Comput. J., 1972

On Fully Indecomposable Matrices.
J. Comput. Syst. Sci., 1971

Nonnormality and Jordan Condition Numbers of Matrices.
J. ACM, 1969