Edward L. Robertson

Available identifiers

Publication	Date of Publication	Type
Structural recursion as a query language on lists and ordered trees	2009-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4420285	2003-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q4804932	2003-05-01	Paper
A note on approximation measures for multi-valued dependencies in relational databases	2003-01-22	Paper
https://portal.mardi4nfdi.de/entity/Q4535566	2002-06-16	Paper
https://portal.mardi4nfdi.de/entity/Q3694707	1985-01-01	Paper
On the complexity of partitioning sparse matrix representations	1984-01-01	Paper
On the structure of sets in NP and other complexity classes	1981-01-01	Paper
Backtracking with multi-level dynamic search rearrangement	1981-01-01	Paper
Continual pattern replication	1981-01-01	Paper
Code Generation and Storage Allocation for Machines with Span-Dependent Instructions	1979-01-01	Paper
Microcode Bit Optimization is NP-Complete	1979-01-01	Paper
Properties of Conflict-Free and Persistent Petri Nets	1978-01-01	Paper
On the sequential nature of functions	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4134970	1974-01-01	Paper
Complexity classes of partial recursive functions	1974-01-01	Paper
Recursive Properties of Abstract Complexity Classes	1972-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4083407	1971-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5679706	1971-01-01	Paper

This page was built for person: Edward L. Robertson