JCSS 39()
* Guest Ed., Special Issue On Computational Geometry
JCSS(31)
* Matching Problem In The Plane, A
* Structural Properties Of The String Statistics Problem
JCSS(32)
* Domino-Tiling Games
* Reporting And Counting Segment Intersections
JCSS(33)
* Analysis Of Bounded Linear Cellular Automata Based On A Method Of Image Charges
* Polymorphic Arrays: A Novel Vlsi Layout For Systolic Computers
JCSS(36)
* Simple Three-Dimensional Real-Time Reliable Cellular Array, A
JCSS(37)
* Complexity Of Recognizing Polyhedral Scenes, The
* Fast String Matching With K Differences
* Graph Isomorphism Is In The Low Hierarchy
JCSS(38)
* Lower Bounds For Language Recognition On Two-Dimensional Alternating Multihead Machines
* On Iterative And Cellular Tree Arrays
JCSS(39)
* On Finite-Precision Representations Of Geometric Objects
JCSS(40)
* Applied Computational Geometry: Towards Robust Solutions Of Basic Problems
* Guest Ed., Papers From The Fourth Annual Symposium On Computational Geometry (Urbana, Il, June 6-8, 1988)
* Hidden Surface Removal For Rectangles
* Picture Iteration And Picture Ambiguity
JCSS(48)
* Parallel Solutions To Geometric Problems In The Scan Model Of Computation
JCSS(49)
* Complexity Of Connectivity Problems On Context-Free Graph Languages, The
* Surjectivity Problem For 2d Cellular Automata, The
JCSS(50)
* Decision Problems For Patterns
* On The Computational Complexity Of Finite Cellular Automata
JCSS(541)
* Guest Ed., Special Section On Neural Computing
* Guest Ed., Special Section On Neural Computing First Dagstuhl Seminar On Neural Computing, Wadern, Germany, November 7-11, 1994