Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Comput.~Syst.~Sci. AND Volume=49
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Simple characterizations of
P(\#P)
and complete problems
Seinosuke Toda
Journal of Computer and System Sciences
49
(1), 1994, pp. 1-17
Group structured linear cellular automata over
Z_m
Tadakazu Sato
Journal of Computer and System Sciences
49
(1), 1994, pp. 18-23
The random oracle hypothesis is false
Richard Chang
,
Benny Chor
,
Oded Goldreich
,
Juris Hartmanis
,
Johan Håstad
,
Desh Ranjan
,
Pankaj Rohatgi
Journal of Computer and System Sciences
49
(1), 1994, pp. 24-39
Time-extraction for temporal logic - logic programming and local process time
Takashi Hattori
Journal of Computer and System Sciences
49
(1), 1994, pp. 40-56
The complexity of connectivity problems on context-free graph languages
Egon Wanke
Journal of Computer and System Sciences
49
(1), 1994, pp. 57-82
Symmetry in self-correcting cellular automata
Nicholas Pippenger
Journal of Computer and System Sciences
49
(1), 1994, pp. 83-95
Characterizing language identification by standardizing operations
Sanjay Jain
,
Arun Sharma
Journal of Computer and System Sciences
49
(1), 1994, pp. 96-107
Bounded degree graph inference from walks
Vijay Raghavan
Journal of Computer and System Sciences
49
(1), 1994, pp. 108-132
A Kleene-like characterization of languages accepted by systolic tree automata
E. Fachini
,
A. Monti
Journal of Computer and System Sciences
49
(1), 1994, pp. 133-147
Hardness vs randomness
Noam Nisan
,
Avi Wigderson
Journal of Computer and System Sciences
49
(2), 1994, pp. 149-167
Invariant sets for substitution
Taishin Nishida
,
Youichi Kobuchi
Journal of Computer and System Sciences
49
(2), 1994, pp. 168-174
On computing serial dependency relations
Narayanan Krishnakumar
Journal of Computer and System Sciences
49
(2), 1994, pp. 175-188
Vacillatory learning of nearly minimal size grammars
John Case
,
Sanjay Jain
,
Arun Sharma
Journal of Computer and System Sciences
49
(2), 1994, pp. 189-207
Dynamic dictionary matching
Amihood Amir
,
Martin Farach
,
Zvi Galil
,
Raffaele Giancarlo
,
Kunsoo Park
Journal of Computer and System Sciences
49
(2), 1994, pp. 208-222
A branching time logic with past operators
Michael Kaminski
Journal of Computer and System Sciences
49
(2), 1994, pp. 223-246
Non-deterministic communication complexity with few witnesses
Mauricio Karchmer
,
Ilan Newman
,
Mike Saks
,
Avi Wigderson
Journal of Computer and System Sciences
49
(2), 1994, pp. 247-257
The translation power of top-down tree-to-graph transducers
Joost Engelfriet
,
Heiko Vogler
Journal of Computer and System Sciences
49
(2), 1994, pp. 258-305
Efficient inference of partial types
Dexter Kozen
,
Jens Palsberg
,
Michael I. Schwartzbach
Journal of Computer and System Sciences
49
(2), 1994, pp. 306-324
A linear-time near-optimum-length triangulation algorithm for convex polygons
Vitit Kantabutra
Journal of Computer and System Sciences
49
(2), 1994, pp. 325-333
A three-valued semantics for deductive databases and logic programs
Jia-Huai You
,
Li Yan Yuan
Journal of Computer and System Sciences
49
(2), 1994, pp. 334-361
Measures of nondeterminism for pushdown automata
Kai Salomaa
,
Sheng Yu
Journal of Computer and System Sciences
49
(2), 1994, pp. 362-374
Learning with discrete multivalued neurons
Zoran Obradović
,
Ian Parberry
Journal of Computer and System Sciences
49
(2), 1994, pp. 375-390
Robust gift wrapping for the three-dimensional convex hull
Kokichi Sugihara
Journal of Computer and System Sciences
49
(2), 1994, pp. 391-407
Listing graphs that satisfy first-order sentences
Leslie Ann Goldberg
Journal of Computer and System Sciences
49
(2), 1994, pp. 408-424
An efficient algorithm for hidden surface removal, II
Ketan Mulmuley
Journal of Computer and System Sciences
49
(3), 1994, pp. 427-453
Seiten 1
2
>