Search the dblp DataBase
Edith Spaan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Harry Buhrman, Luc Longpré, Edith Spaan
SPARSE reduces conjunctively to TALLY. [Citation Graph (0, 0)][DBLP]
Structure in Complexity Theory Conference, 1993, pp:208-214 [Conf] - Harry Buhrman, Edith Spaan, Leen Torenvliet
Bounded Reductions. [Citation Graph (0, 0)][DBLP]
Complexity Theory: Current Research, 1992, pp:83-99 [Conf] - Sieger van Denneheuvel, Karen L. Kwast, Gerard R. Renardel de Lavalette, Edith Spaan
Query Optimization Using Rewrite Rules. [Citation Graph (0, 0)][DBLP]
RTA, 1991, pp:252-263 [Conf] - Harry Buhrman, Edith Spaan, Leen Torenvliet
Bounded Reductions. [Citation Graph (0, 0)][DBLP]
STACS, 1991, pp:410-421 [Conf] - Edith Spaan
Nexttime is not Necessary. [Citation Graph (0, 0)][DBLP]
TARK, 1990, pp:241-256 [Conf] - Harry Buhrman, Edith Spaan, Leen Torenvliet
The Relative Power of Logspace and Polynomial Time Reductions. [Citation Graph (0, 0)][DBLP]
Computational Complexity, 1993, v:3, n:, pp:231-244 [Journal] - Edith Spaan, Leen Torenvliet, Peter van Emde Boas
Nondeterminism fairness and a fundamental analogy. [Citation Graph (0, 0)][DBLP]
Bulletin of the EATCS, 1989, v:37, n:, pp:186-193 [Journal]
Search in 0.001secs, Finished in 0.001secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002