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