|
Journals in DBLP
Preface. [Citation Graph (, )][DBLP]
Lower bounds for recognizing small cliques on CRCW PRAM's. [Citation Graph (, )][DBLP]
The complexity of short two-person games. [Citation Graph (, )][DBLP]
Subtree isomorphism is in random NC. [Citation Graph (, )][DBLP]
Incomparability in parallel computation. [Citation Graph (, )][DBLP]
Parallel recognition of complement reducible graphs and cotree construction. [Citation Graph (, )][DBLP]
Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm. [Citation Graph (, )][DBLP]
Optimal parallel construction of prescribed tournaments. [Citation Graph (, )][DBLP]
|