Zhigen Jiang Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys1999
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe: Polynomial-Time Multi-Selectivity CoRR cs.CC/9907034: (1999)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe: Boolean Operations, Joins, and the Extended Low Hierarchy CoRR cs.CC/9907037: (1999)
1998
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe: Boolean Operations, Joins, and the Extended Low Hierarchy. Theor. Comput. Sci. 205(1-2): 317-327 (1998)
1997
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDany Breslauer, Tao Jiang, Zhigen Jiang: Rotations of Periodic Strings and Short Superstrings. J. Algorithms 24(2): 340-353 (1997)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe: Polynomial-Time Multi-Selectivity. J. UCS 3(3): 197-229 (1997)
1996
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe: The Join Can Lower Complexity. COCOON 1996: 260-267
1995
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLane A. Hemaspaandra, Zhigen Jiang: P-Selectivity: Intersections and Indices. Theor. Comput. Sci. 145(1&2): 371-380 (1995)

Coauthor Index

1Dany Breslauer [4]
2Lane A. Hemaspaandra (Lane A. Hemachandra) [1] [2] [3] [5] [6] [7]
3Tao Jiang [4]
4Jörg Rothe [2] [3] [5] [6] [7]
5Osamu Watanabe [2] [3] [5] [6] [7]

Colors in the list of coauthors

Copyright © Fri Dec 4 16:04:45 2009 by Michael Ley (ley@uni-trier.de)