Edward L. Robertson

According to our database1, Edward L. Robertson
  • authored at least 52 papers between 1970 and 2011.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2011
Transforming Enterprise Architecture Models: An Artificial Ontology View.
Proceedings of the Advanced Information Systems Engineering, 2011

2009
Structural Recursion as a Query Language on Lists and Ordered Trees.
Theory Comput. Syst., 2009

Depth first algorithms and inferencing for AFD mining.
Proceedings of the International Database Engineering and Applications Symposium (IDEAS 2009), 2009

2008
The View-Constraint Duality in Database Systems, Software Engineering, and Systems Engineering.
Proceedings of the On the Move to Meaningful Internet Systems: OTM 2008 Workshops, 2008

HLS: Tunable Mining of Approximate Functional Dependencies.
Proceedings of the Sharing Data, 2008

2007
Structural Recursion on Ordered Trees and List-Based Complex Objects.
Proceedings of the Database Theory, 2007

2006
A Calculus for Data Mapping.
Electr. Notes Theor. Comput. Sci., 2006

2005
Relational languages for metadata integration.
ACM Trans. Database Syst., 2005

A formal characterization of PIVOT/UNPIVOT.
Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management, Bremen, Germany, October 31, 2005

2004
On approximation measures for functional dependencies.
Inf. Syst., 2004

Triadic Relations: An Algebra for the Semantic Web.
Proceedings of the Semantic Web and Databases, Second International Workshop, 2004

Architectural Principles for Enterprise Frameworks: Guidance for Interoperability.
Proceedings of the Knowledge Sharing in the Integrated Enterprise, 2004

Architectural Principles for Enterprise Frameworks.
Proceedings of the CAiSE'04 Workshops in connection with The 16th Conference on Advanced Information Systems Engineering, 2004

2003
A note on approximation measures for multi-valued dependencies in relational databases.
Inf. Process. Lett., 2003

A Comparison of Frameworks for Enterprise Architecture Modeling.
Proceedings of the Conceptual Modeling, 2003

2002
An Entropy-based Approach to Visualizing Database Structure.
Proceedings of the Visual and Multimedia Information Management, 2002

An Integrated System for Database Visualization.
Proceedings of the International Conference on Information Visualisation, 2002

Improving Query Evaluation with Approximate Functional Dependency Based Decompositions.
Proceedings of the Advances in Databases, 19th British National Conference on Databases, 2002

An integrated approach to database visualization.
Proceedings of the Working Conference on Advanced Visual Interfaces, 2002

2001
Model curricula for IT schools: report of a curriculum committee.
Proceedings of the 32rd SIGCSE Technical Symposium on Computer Science Education, 2001

Discovering Frequent Itemsets in the Presence of Highly Frequent Items.
Proceedings of the Web Knowledge Management and Decision Support, 2001

Discoverying Frequent Itemsets in the Presence of Highly Frequent Items.
Proceedings of the 14th International Conference on Applications of Prolog, 2001

FastFDs: A Heuristic-Driven, Depth-First Algorithm for Mining Functional Dependencies from Relation Instances - Extended Abstract.
Proceedings of the Data Warehousing and Knowledge Discovery, 2001

It's All about Process: Project Oriented Teaching of Software Engineering.
Proceedings of the 14th Conference on Software Engineering Education and Training, 2001

2000
Information Dependencies.
Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2000

1998
Architectural support for database visualization.
Proceedings of the CIKM 1998 Workshop on New Paradigms in Information Visualization and Manipulation (NPIV 1998), 1998

1997
Nonlinear Magnification Fields.
Proceedings of the 1997 IEEE Symposium on Information Visualization (InfoVis '97), 1997

CE: the Classifier-Estimator Framework for Data Mining.
DS-7, 1997

1996
Techniques for non-linear magnification transformations.
Proceedings of the IEEE Symposium on Information Visualization 1996, 1996

1995
Modeling and Querying Primitives for Digital Media.
IW-MMDBMS, 1995

1994
A Query Language for List-Based Complex Objects.
Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1994

Levelled Entity Relationship Model.
Proceedings of the Entity-Relationship Approach, 1994

A Data Model for Audio-Video Data .
COMAD, 1994

1987
Two Complementary Course Sequences on the Design and Implementation of Software Products.
IEEE Trans. Software Eng., 1987

1985
The Nearest Neighbor Problem on Bounded Domains.
Proceedings of the Automata, 1985

1984
On the Complexity of Partitioning Sparse Matrix Representations.
BIT, 1984

1981
Continual Pattern Replication
Information and Control, March, 1981

On the Structure of Sets in NP and Other Complexity Classes.
Theor. Comput. Sci., 1981

Backtracking with Multi-Level Dynamic Search Rearrangement.
Acta Inf., 1981

That really is a hard problem you've spent six months working on: A tutorial on NP-complete problems.
Proceedings of the ACM 1981 Annual Conference, Los Angeles, CA, USA, November 9-11, 1981., 1981

1979
Code Generation and Storage Allocation for Machines with Span-Dependent Instructions.
ACM Trans. Program. Lang. Syst., 1979

Microcode Bit Optimizations is N P-Complete.
IEEE Trans. Computers, 1979

1978
Properties of Conflict-Free and Persistent Petri Nets.
J. ACM, 1978

Storage Allocation for Access Path Minimization in Network Structured Data Bases.
JCDKB, 1978

1976
Computers in developing nations.
SIGCAS Computers and Society, 1976

On the Sequential Nature of Functions.
J. Comput. Syst. Sci., 1976

SIGCAS (Panel Session).
Proceedings of the 1976 Annual Conference, Houston, Texas, USA, October 20-22, 1976, 1976

1974
Complexity Classes of Partial Recursive Functions.
J. Comput. Syst. Sci., 1974

Structure of Complexity in the Weak Monadic Second-Order Theories of the Natural Numbers
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

1972
Recursive Properties of Abstract Complexity Classes.
J. ACM, 1972

1971
Complexity Classes of Partial Recursive Functions (Preliminary Version)
Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971

1970
Recursive Properties of Abstract Complexity Classes (Preliminary Version)
Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, 1970


  Loading...