![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Edward L. Robertson Catharine M. Wyss , Edward L. Robertson: A formal characterization of PIVOT/UNPIVOT. CIKM 2005 : 602-608 Catharine M. Wyss , Edward L. Robertson: Relational languages for metadata integration. ACM Trans. Database Syst. 30 (2): 624-660 (2005) Richard A. Martin , Edward L. Robertson, John A. Springer : Architectural Principles for Enterprise Frameworks. CAiSE Workshops (1) 2004 : 151-162 Edward L. Robertson: Triadic Relations: An Algebra for the Semantic Web. SWDB 2004 : 91-108 Chris Giannella , Edward L. Robertson: On approximation measures for functional dependencies. Inf. Syst. 29 (6): 483-507 (2004) Richard Martin , Edward L. Robertson: A Comparison of Frameworks for Enterprise Architecture Modeling. ER 2003 : 562-564 Chris Giannella , Edward L. Robertson: A note on approximation measures for multi-valued dependencies in relational databases. Inf. Process. Lett. 85 (3): 153-158 (2003) Chris Giannella , Mehmet M. Dalkilic , Dennis P. Groth , Edward L. Robertson: Improving Query Evaluation with Approximate Functional Dependency Based Decompositions. BNCOD 2002 : 26-41 Dennis P. Groth , Edward L. Robertson: An Integrated System for Database Visualization. IV 2002 : 462-467 Dennis P. Groth , Edward L. Robertson: An Entropy-based Approach to Visualizing Database Structure. VDB 2002 : 157-170 Dennis P. Groth , Edward L. Robertson: It's All about Process: Project Oriented Teaching of Software Engineering. CSEE&T 2001 : 7-17 Catharine M. Wyss , Chris Giannella , Edward L. Robertson: FastFDs: A Heuristic-Driven, Depth-First Algorithm for Mining Functional Dependencies from Relation Instances - Extended Abstract. DaWaK 2001 : 101-110 Dennis P. Groth , Edward L. Robertson: Discoverying Frequent Itemsets in the Presence of Highly Frequent Items. INAP 2001 : 237-245 Dennis P. Groth , Edward L. Robertson: Discovering Frequent Itemsets in the Presence of Highly Frequent Items. INAP (LNCS Volume) 2001 : 251-264 Peter J. Denning , Wayne R. Dyksen , Richard J. LeBlanc , Edward L. Robertson: Model curricula for IT schools: report of a curriculum committee. SIGCSE 2001 : 431-432 Mehmet M. Dalkilic , Edward L. Robertson: Information Dependencies. PODS 2000 : 245-253 Dennis P. Groth , Edward L. Robertson: Architectural support for database visualization. Workshop on New Paradigms in Information Visualization and Manipulation 1998 : 53-55 Mehmet M. Dalkilic , Edward L. Robertson, Dirk Van Gucht : CE: the Classifier-Estimator Framework for Data Mining. DS-7 1997 : 89-104 Alan Keahey , Edward L. Robertson: Nonlinear Magnification Fields. INFOVIS 1997 : 51-58 Munish Gandhi , Edward L. Robertson, Dirk Van Gucht : Modeling and Querying Primitives for Digital Media. IW-MMDBMS 1995 : 82-89 Munish Gandhi , Edward L. Robertson: A Data Model for Audio-Video Data . COMAD 1994 : 0- Munish Gandhi , Edward L. Robertson, Dirk Van Gucht : Levelled Entity Relationship Model. ER 1994 : 420-436 Latha S. Colby , Edward L. Robertson, Lawrence V. Saxton , Dirk Van Gucht : A Query Language for List-Based Complex Objects. PODS 1994 : 179-189 James E. Burns , Edward L. Robertson: Two Complementary Course Sequences on the Design and Implementation of Software Products. IEEE Trans. Software Eng. 13 (11): 1170-1175 (1987) Rolf G. Karlsson , J. Ian Munro , Edward L. Robertson: The Nearest Neighbor Problem on Bounded Domains. ICALP 1985 : 318-327 Johann P. Malmquist , Edward L. Robertson: On the Complexity of Partitioning Sparse Matrix Representations. BIT 24 (1): 60-68 (1984) Paul Walton Purdom Jr. , Cynthia A. Brown , Edward L. Robertson: Backtracking with Multi-Level Dynamic Search Rearrangement. Acta Inf. 15 : 99-113 (1981) J. Ian Munro , Edward L. Robertson: Continual Pattern Replication Information and Control 48 (3): 211-220 (1981) Lawrence H. Landweber , Richard J. Lipton , Edward L. Robertson: On the Structure of Sets in NP and Other Complexity Classes. Theor. Comput. Sci. 15 : 181-200 (1981) Edward L. Robertson: Code Generation and Storage Allocation for Machines with Span-Dependent Instructions. ACM Trans. Program. Lang. Syst. 1 (1): 71-83 (1979) Edward L. Robertson: Microcode Bit Optimizations is N P -Complete. IEEE Trans. Computers 28 (4): 316-319 (1979) Johann P. Malmquist , Ehud Gudes , Edward L. Robertson: Storage Allocation for Access Path Minimization in Network Structured Data Bases. JCDKB 1978 : 319- Lawrence H. Landweber , Edward L. Robertson: Properties of Conflict-Free and Persistent Petri Nets. J. ACM 25 (3): 352-364 (1978) Patrick C. Fischer , Edward L. Robertson, Lawrence V. Saxton : On the Sequential Nature of Functions. J. Comput. Syst. Sci. 13 (1): 51-68 (1976) Edward L. Robertson: Structure of Complexity in the Weak Monadic Second-Order Theories of the Natural Numbers STOC 1974 : 161-171 Edward L. Robertson: Complexity Classes of Partial Recursive Functions. J. Comput. Syst. Sci. 9 (1): 69-87 (1974) Lawrence H. Landweber , Edward L. Robertson: Recursive Properties of Abstract Complexity Classes. J. ACM 19 (2): 296-308 (1972) Edward L. Robertson: Complexity Classes of Partial Recursive Functions (Preliminary Version) STOC 1971 : 258-266 Lawrence H. Landweber , Edward L. Robertson: Recursive Properties of Abstract Complexity Classes (Preliminary Version) STOC 1970 : 31-36 1 [ 13 ] 2 [ 16 ] 3 [ 17 ] 4 [ 22 ] [ 24 ] [ 32 ] 5 [ 25 ] 6 [ 25 ] 7 [ 6 ] 8 [ 18 ] [ 19 ] [ 20 ] 9 [ 28 ] [ 32 ] [ 33 ] [ 35 ] 10 [ 23 ] [ 26 ] [ 27 ] [ 29 ] [ 30 ] [ 31 ] [ 32 ] 11 [ 17 ] [ 18 ] [ 20 ] [ 22 ] 12 [ 8 ] 13 [ 15 ] 14 [ 21 ] 15 [ 1 ] [ 3 ] [ 7 ] [ 11 ] 16 [ 25 ] 17 [ 11 ] 18 [ 8 ] [ 14 ] 19 [ 34 ] 20 [ 37 ] 21 [ 12 ] [ 15 ] 22 [ 13 ] 23 [ 6 ] [ 17 ] 24 [ 37 ] 25 [ 28 ] [ 38 ] [ 39 ] ![]() ©2006 Association for Computing Machinery |