149 | -- | 167 | Noam Nisan, Avi Wigderson. Hardness vs Randomness |
168 | -- | 174 | Taishin Y. Nishida, Youichi Kobuchi. Invariant Sets for Substitution |
175 | -- | 188 | Narayanan Krishnakumar. On Computing Serial Dependency Relations |
189 | -- | 207 | John Case, Sanjay Jain, Arun Sharma. Vacillatory Learning of Nearly Minimal Size Grammars |
208 | -- | 222 | Amihood Amir, Martin Farach, Zvi Galil, Raffaele Giancarlo, Kunsoo Park. Dynamic Dictionary Matching |
223 | -- | 246 | Michael Kaminski. A Branching Time Logic with Past Operators |
247 | -- | 257 | Mauricio Karchmer, Ilan Newman, Michael E. Saks, Avi Wigderson. Non-Deterministic Communication Complexity with Few Witnesses |
258 | -- | 305 | Joost Engelfriet, Heiko Vogler. The Translation Power of Top-Down Tree-to-Graph Transducers |
306 | -- | 324 | Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach. Efficient Inference of Partial Types |
325 | -- | 333 | Vitit Kantabutra. A Linear-Time Near-Optimum-Length Triangulation Algorithm for Convex Polygons |
334 | -- | 361 | Jia-Huai You, Li-Yan Yuan. A Three-Valued Semantics for Deductive Databases and Logic Programs |
362 | -- | 374 | Kai Salomaa, Sheng Yu. Measures of Nondeterminism for Pushdown Automata |
375 | -- | 390 | Zoran Obradovic, Ian Parberry. Learning with Discrete Multi-valued Neurons |
391 | -- | 407 | Kokichi Sugihara. Robust Gift Wrapping for the Three-Dimensional Convex Hull |
408 | -- | 424 | Leslie Ann Goldberg. Listing Graphs That Satisfy First-Order Sentences |