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=55
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Faster shortest-path algorithms for planar graphs
Monika R. Henzinger
,
Philip Klein
,
Satish Rao
,
Sairam Subramanian
Journal of Computer and System Sciences
55
(1), 1997, pp. 3-23
Natural proofs
Alexander A. Razborov
,
Steven Rudich
Journal of Computer and System Sciences
55
(1), 1997, pp. 24-35
Decision tree complexity and Betti numbers
Andrew Chi-Chih Yao
Journal of Computer and System Sciences
55
(1), 1997, pp. 36-43
Optimal parallel suffix tree construction
Ramesh Hariharan
Journal of Computer and System Sciences
55
(1), 1997, pp. 44-69
The discovery of algorithmic probability
Ray J. Solomonoff
Journal of Computer and System Sciences
55
(1), 1997, pp. 73-88
Stochastic complexity in learning
J. Rissanen
Journal of Computer and System Sciences
55
(1), 1997, pp. 89-95
Learning about the parameter of the Bernoulli model
V.G. Vovk
Journal of Computer and System Sciences
55
(1), 1997, pp. 96-104
On-line maximum likelihood prediction with respect to generel loss functions
Kenji Yamanishi
Journal of Computer and System Sciences
55
(1), 1997, pp. 105-118
A decision-theoretic generalization of on-line learning and an application to boosting
Yoav Freund
,
Robert E. Schapire
Journal of Computer and System Sciences
55
(1), 1997, pp. 119-139
Characterizing rational versus exponential learning curves
Dale Schuurmans
Journal of Computer and System Sciences
55
(1), 1997, pp. 140-160
Approximation and learning of convex superpositions
Leonid Gurvits
,
Pascal Koiran
Journal of Computer and System Sciences
55
(1), 1997, pp. 161-170
Learning distributions by their density levels: A paradigm for learning without a teacher
Shai Ben-David
,
Michael Lindenbaum
Journal of Computer and System Sciences
55
(1), 1997, pp. 171-182
Learning recursive functions from approximations
John Case
,
Susanne Kaufmann
,
Efim Kinber
,
Martin Kummer
Journal of Computer and System Sciences
55
(1), 1997, pp. 183-196
Dyn-FO: A parallel, dynamic complexity class
Sushant Patnaik
,
Neil Immerman
Journal of Computer and System Sciences
55
(2), 1997, pp. 199-209
Bounded arity Datalog
(\neq)
queries on graphs
Foto N. Afrati
Journal of Computer and System Sciences
55
(2), 1997, pp. 210-228
Relaxing the uniformity and independence assumptions using the concept of fractal dimension
Christos Faloutsos
,
Ibrahim Kamel
Journal of Computer and System Sciences
55
(2), 1997, pp. 229-240
Query languages for bags and aggregate functions
Leonid Libkin
,
Limsoon Wong
Journal of Computer and System Sciences
55
(2), 1997, pp. 241-272
Finitely representable databases
Stéphane Grumbach
,
Jianwen Su
Journal of Computer and System Sciences
55
(2), 1997, pp. 273-298
A query language for
NC
Dan Suciu
,
Val Tannen
Journal of Computer and System Sciences
55
(2), 1997, pp. 299-321
The complexity of the evaluation of complex algebra expressions
Dan Suciu
,
Jan Paredaens
Journal of Computer and System Sciences
55
(2), 1997, pp. 322-343
Relative serializability: An approach for relaxing the atomicity of transactions
V. Krishnaswamy
,
D. Agrawal
,
J.L. Bruno
,
A. El Abbadi
Journal of Computer and System Sciences
55
(2), 1997, pp. 344-354
Can Datalog be approximated?
Surajit Chaudhuri
,
Phokion G. Kolaitis
Journal of Computer and System Sciences
55
(2), 1997, pp. 355-369
Efficient oblivious branching programs for threshold and mod functions
Rakesh Kumar Sinha
,
Jayram S. Thathachar
Journal of Computer and System Sciences
55
(3), 1997, pp. 373-384
On the design of reliable Boolean circuits that contain partially unreliable gates
Dan Kleitman
,
Tom Leighton
,
Yuan Ma
Journal of Computer and System Sciences
55
(3), 1997, pp. 385-401
(De)randomized construction of small sample spaces in
NC
David R. Karger
,
Daphne Koller
Journal of Computer and System Sciences
55
(3), 1997, pp. 402-413
Seiten 1
2
>