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