J. Computer & Systems Sciences
- DNA models and algorithms for NP-complete problems, BacConGla-JCSS-98
- Provably good mesh generation, BerEppGil-JCSS-94
- Computing the maximum bichromatic discrepancy with applications to computer graphics and machine learning, DobGunMaa-JCSS-96
- Pointers versus arithmetic in PRAMs, DymFicNis-JCSS-96
- Guest editor's forward to special issue of papers from the 34th Annual Symposium on Foundations of Computer Science, Epp-JCSS-97
- Separator based sparsification I: planarity testing and minimum spanning trees, EppGalIta-JCSS-96
- Limits on the power of parallel random-access machines with weak forms of write conflict resolution, FicImpKap-JCSS-96
- Planar separators and parallel polygon triangulation, Goo-JCSS-95
- On the complexity of $k$-SAT, ImpPat-JCSS-01
- Which problems have strongly exponential complexity?, ImpPatZan-JCSS-01
- Dyn-FO: a parallel, dynamic complexity class, PatImm-JCSS-97
