Search the dblp DataBase
Zhigen Jiang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
The Join Can Lower Complexity. [Citation Graph (0, 0)][DBLP]
COCOON, 1996, pp:260-267 [Conf] - Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
Polynomial-Time Multi-Selectivity [Citation Graph (0, 0)][DBLP]
CoRR, 1999, v:0, n:, pp:- [Journal] - Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
Boolean Operations, Joins, and the Extended Low Hierarchy [Citation Graph (0, 0)][DBLP]
CoRR, 1999, v:0, n:, pp:- [Journal] - Dany Breslauer, Tao Jiang, Zhigen Jiang
Rotations of Periodic Strings and Short Superstrings. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1997, v:24, n:2, pp:340-353 [Journal] - Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
Polynomial-Time Multi-Selectivity. [Citation Graph (0, 0)][DBLP]
J. UCS, 1997, v:3, n:3, pp:197-229 [Journal] - Lane A. Hemaspaandra, Zhigen Jiang
P-Selectivity: Intersections and Indices. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1995, v:145, n:1&2, pp:371-380 [Journal] - Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
Boolean Operations, Joins, and the Extended Low Hierarchy. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1998, v:205, n:1-2, pp:317-327 [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