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=48
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Three one-way heads cannot do string matching
Mihály Geréb-Graus
,
Ming Li
Journal of Computer and System Sciences
48
(1), 1994, pp. 1-8
Unique complements and decompositions of database schemata
Stephen J. Hegner
Journal of Computer and System Sciences
48
(1), 1994, pp. 9-57
Hypergraph languages of bounded degree
Joost Engelfriet
,
Linda Heyker
Journal of Computer and System Sciences
48
(1), 1994, pp. 58-89
Parallel solutions to geometric problems in the scan model of computation
Guy E. Blelloch
,
James J. Little
Journal of Computer and System Sciences
48
(1), 1994, pp. 90-115
Gap-definable counting classes
Stephen A. Fenner
,
Lance J. Fortnow
,
Stuart A. Kurtz
Journal of Computer and System Sciences
48
(1), 1994, pp. 116-148
Reversibility and surjectivity problems of cellular automata
Jarkko Kari
Journal of Computer and System Sciences
48
(1), 1994, pp. 149-182
PSPACE is provable by two provers in one round
Jin-Yi Cai
,
Anne Condon
,
Richard J. Lipton
Journal of Computer and System Sciences
48
(1), 1994, pp. 183-193
Superconcentrators of depths 2 and 3; odd levels help (rarely)
Noga Alon
,
Pavel Pudlak
Journal of Computer and System Sciences
48
(1), 1994, pp. 194-202
Learning fixed point patterns by recurrent networks
Leong Kwan Li
Journal of Computer and System Sciences
48
(2), 1994, pp. 203-213
Finding level-ancestors in trees
Omer Berkman
,
Uzi Vishkin
Journal of Computer and System Sciences
48
(2), 1994, pp. 214-230
Exact lower time bounds for computing Boolean functions on CREW PRAMs
Martin Dietzfelbinger
,
Mirosƚaw Kutyƚowski
,
Rüdiger Reischuk
Journal of Computer and System Sciences
48
(2), 1994, pp. 231-254
The complexity of propositional closed world reasoning and circumscription
Marco Cadoli
,
Maurizio Lenzerini
Journal of Computer and System Sciences
48
(2), 1994, pp. 255-310
Nonuniform learnability
Gyora M. Benedek
,
Alon Itai
Journal of Computer and System Sciences
48
(2), 1994, pp. 311-323
On reductions of NP sets to sparse sets
Steven Homer
,
Luc Longpré
Journal of Computer and System Sciences
48
(2), 1994, pp. 324-336
Combinatorial techniques for universal hashing
D.R. Stinson
Journal of Computer and System Sciences
48
(2), 1994, pp. 337-346
On the perceptron learning algorithm on data with high precision
Kai-Yeung Siu
,
Amir Dembo
,
Thomas Kailath
Journal of Computer and System Sciences
48
(2), 1994, pp. 347-356
A taxonomy of complexity classes of functions
Alan L. Selman
Journal of Computer and System Sciences
48
(2), 1994, pp. 357-381
Provably good mesh generation
Marshall Bern
,
David Eppstein
,
John Gilbert
Journal of Computer and System Sciences
48
(3), 1994, pp. 384-409
Competitive
k
-server algorithms
Amos Fiat
,
Yuval Rabani
,
Yiftach Ravid
Journal of Computer and System Sciences
48
(3), 1994, pp. 410-428
Specified precision polynomial root isolation is in NC
C. Andrew Neff
Journal of Computer and System Sciences
48
(3), 1994, pp. 429-463
Efficient distribution-free learning of probabilistic concepts
Michael J. Kearns
,
Robert E. Schapire
Journal of Computer and System Sciences
48
(3), 1994, pp. 464-497
On the complexity of the parity argument and other inefficient proofs of existence
Christos H. Papadimitriou
Journal of Computer and System Sciences
48
(3), 1994, pp. 498-532
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Michael L. Fredman
,
Dan E. Willard
Journal of Computer and System Sciences
48
(3), 1994, pp. 533-551